Papers › Learning by Analogy: Reliable Supervision from Transformations for Unsupervised...

Learning by Analogy: Reliable Supervision from Transformations for Unsupervised Optical Flow Estimation

29 Mar 2020CVPR 2020 6arXiv:2003.13045archive 2025-07-28

Liang Liu, Jiangning Zhang, Ruifei He, Yong liu, Yabiao Wang, Ying Tai, Donghao Luo, Chengjie Wang, Jilin Li, Feiyue Huang

Unsupervised learning of optical flow, which leverages the supervision from view synthesis, has emerged as a promising alternative to supervised methods. However, the objective of unsupervised learning is likely to be unreliable in challenging scenes. In this work, we present a framework to use more reliable supervision from transformations. It simply twists the general unsupervised learning pipeline by running another forward pass with transformed data from augmentation, along with using transformed predictions of original data as the self-supervision signal. Besides, we further introduce a lightweight network with multiple frames by a highly-shared flow decoder. Our method consistently gets a leap of performance on several benchmarks with the best accuracy among deep unsupervised methods. Also, our method achieves competitive results to recent fully supervised methods while with much fewer parameters.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2003.13045")

Code

Syntology Ran 1 of 5 code samples harvested from 1 repository linked to this paper; 4 have no recorded run. Of those that ran: 1 ran with no contract checked.

By repository: official repository: 5 samples from 1 repository, 1 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

lliuz/ARFlow officialmentioned in papermentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

5 samples harvested; 1 ran; 0 honoured the contract we drafted; 4 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran
4unverified

Licence: 0 of the 5 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from lliuz/ARFlow. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

TernaryLoss lliuz/ARFlow/losses/loss_blocks.py official repository ran MIT (permissive) · c2e12a1d35bc95f1 · report
SSIM lliuz/ARFlow/losses/loss_blocks.py official repository unverified MIT (permissive) · 78ed5eb745e54bee · report
conv lliuz/ARFlow/models/pwclite.py official repository unverified MIT (permissive) · 9db5fbaedd8ed8b4 · report
get_trainer lliuz/ARFlow/trainer/get_trainer.py official repository unverified MIT (permissive) · 5c99e97f4d4cb84e · report
gradient lliuz/ARFlow/losses/loss_blocks.py official repository unverified MIT (permissive) · a9713a1e43f97a70 · report

Tasks

DecoderOptical Flow EstimationSelf-Supervised Learning

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Optical Flow Estimation KITTI 2012 unsupervised ARFlow-MV Average End-Point Error 1.5 #2 of 2 Archive leaderboard report
Optical Flow Estimation KITTI 2015 unsupervised ARFlow-MV Fl-all 11.79 #4 of 4 Archive leaderboard report
Optical Flow Estimation Sintel Clean unsupervised ARFlow-MV Average End-Point Error 4.49 #2 of 5 Archive leaderboard report
Optical Flow Estimation Sintel Final unsupervised ARFlow-MV Average End-Point Error 5.67 #3 of 5 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections