Hierarchical Resolution Refinement for Non Convex Optimization

91 concepts80 papers1 proposal

When optimizing high-dimensional systems—whether reconstructing a 3D scene, deblurring an image, or aligning stereo images—we face a fundamental challenge: the optimization landscape is treacherous. If we attempt to solve the problem directly at full resolution, the loss surface is typically riddled with sharp, jagged local minima. Optimizers easily get trapped in these noisy pockets, resulting in distorted reconstructions or completely failed convergence.

Hierarchical resolution refinement solves this by changing the scale of the problem dynamically. By structuring the optimization from coarse to fine scales, this approach fundamentally alters the optimization landscape, clearing a path toward the global optimum.

Why It Works: Landscape Smoothing

The core intuition behind hierarchical refinement is that downsampling data or filtering for low frequencies acts as a low-pass filter not just on the data itself, but on the optimization landscape.

When an image is downsampled or a signal is truncated, high-frequency noise and fine-grained local minima are washed away. What remains is a smooth, broad basin of attraction that represents the global structure of the solution.

Full Resolution Landscape (Treacherous Local Minima)
  /\    /\    /\    /\    /\
 /  \  /  \  /  \  /  \  /  \   <-- Optimizer gets stuck here
/    \/    \/    \/    \/    \

Coarse Resolution Landscape (Smooth Global Basin)
\                              /
 \                            /   <-- Optimizer easily finds the bottom
  \__________/\______________/

Once the optimizer finds the bottom of this smooth basin at a coarse scale, that solution is used to initialize the optimization at the next, finer scale. Because the initialization is already remarkably close to the global optimum, the search space at the higher resolution is drastically restricted. The optimizer can then resolve fine-grained details without risk of jumping into a distant, incorrect local minimum.

This mechanism is vital across a wide range of inverse problems:

  • Blind Deconvolution: In Total Variation Blind Deconvolution: The Devil Is in the Details, Daniele Perrone et al. demonstrated that solving for blur kernels across a multi-resolution pyramid prevents the algorithm from collapsing into trivial "no-blur" solutions. The lower resolutions capture large-scale blur patterns first, providing a stable initialization for higher resolutions.
  • Signal Parameter Estimation: For highly overlapping, noisy signals, Debottam Dutta et al. showed in Estimating Multi-chirp Parameters using Curvature-guided Langevin Monte Carlo that optimizing over shorter, truncated segments creates broader, more easily detectable minima. This initial step provides a reliable starting point before transitioning to the full-length signal for fine-grained refinement.
  • Wave-Based Imaging: In High-Contrast Reflection Tomography With Total-Variation Constraints, Ajinkya Kadu et al. leveraged a progression from low to high frequencies. Smoother, low-frequency cost functions allow the system to map out global underground or object structures before introducing high frequencies to sharpen the boundaries.

Accelerating Information Propagation

Beyond avoiding local minima, optimization at a coarse scale fundamentally accelerates how quickly information travels across a computational grid.

In purely local optimization algorithms, information moves like a wave of diffusion—one pixel or node at a time. For high-resolution inputs, propagating a global context (such as a background illumination gradient or a continuous foreground color) across the entire image requires thousands of iterations.

By downsampling the problem, we reduce the physical distance that information must travel. As Thomas Germer demonstrated in Fast Multi-Level Foreground Estimation, multi-level pyramidal solvers allow color data to traverse semi-transparent boundaries rapidly at lower resolutions. This coarse solution provides a rapid global preview that bypasses the slow convergence inherent to single-scale, purely local solvers.

Similarly, Stephen T. Barnard demonstrated in Stereo Matching by Hierarchical, Microcanonical Annealing that using Laplacian pyramids to guide stochastic search across scales drastically reduces computational complexity, making high-resolution stereo matching scalable.

Coarse-to-Fine Schedules in Neural Fields

The principle of hierarchical refinement has found a natural home in modern coordinate-based neural networks and neural radiance fields (NeRFs). Neural networks inherently suffer from spectral bias, meaning they naturally learn low-frequency, global structures before capturing high-frequency details.

To prevent networks from overfitting to high-frequency noise early in training, researchers explicitly enforce coarse-to-fine schedules:

By treating resolution not as a static property of the data, but as a dynamic lever for optimization, hierarchical refinement transforms intractable, chaotic search spaces into structured, step-by-step paths toward global convergence.

Key Foundational Work

Stereo Matching by Hierarchical, Microcanonical Annealing (1987) — contributed 1 concept elements to this direction.
Stereo Matching by Hierarchical, Microcanonical Annealing (1987) — contributed 1 concept elements to this direction.
History & citationVersion 1 · 2026-10-04

Current · Permanent link

View frozen version 1

Cite this direction

Latest version (a living page):

@misc{lacuna_coarse_to_fine_optimization_8c8d367f,
  title = {coarse-to-fine optimization},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/coarse-to-fine-optimization/rdr_8c8d367fb74449e592dad178c1b6a53b},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}

This exact version (version 1, frozen text):

@misc{lacuna_coarse_to_fine_optimization_8c8d367f_v1,
  title = {coarse-to-fine optimization},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/coarse-to-fine-optimization/rdr_8c8d367fb74449e592dad178c1b6a53b/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-21},
}
About

These directions overlap with this one through shared papers.

See something wrong? Report a mistake