AI Paper Atlas

Research map / Learning theory and algorithms / Prediction and decision losses

On the Convergence of PatchMatch and Its Variants

Thibaud Ehret, Pablo Arias

CVPR 2018 · Learning theory and algorithms › Prediction and decision losses · approach: Approximate nearest neighbor indexing · 2 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use centered random search instead of uniform random search (ablation)PatchMatch · Random noise imagesconvergence rateImproved
Replace centered random search with uniform search over the database image (ablation)PatchMatch · Random noise imagesconvergence rateHurt
Use the worst-case transition probability rather than the empirical transition behaviorPatchMatch convergence bound · PatchMatch convergence, ε = 1iterations to reach probability 0.2: 178 iterations; 60 were neededMixed

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy