paper-with-me

Papers

Revisiting the Variable Projection Method for Separable Nonlinear Least Squares Problems

2017-07-01 · CVPR 2017 7 · Je Hyeong Hong, Christopher Zach, Andrew Fitzgibbon

Variable Projection (VarPro) is a framework to solve optimization problems efficiently by optimally eliminating a subset of the unknowns. It is in particular adapted for Separable Nonlinear Least Squares (SNLS) problems, a class of optimization problems including low-rank matrix factorization with missing data and affine bundle adjustment as instances. VarPro-based methods have received much attention over the last decade due to the experimentally observed large convergence basin for certain problem classes, where they have a clear advantage over standard methods based on Joint optimization over all unknowns. Yet no clear answers have been found in the literature as to why VarPro outperforms others and why Joint optimization, which has been successful in solving many computer vision tasks, fails on this type of problems. Also, the fact that VarPro has been mainly tested on small to medium-sized datasets has raised questions about its scalability. This paper intends to address these unsolved puzzles.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Constrained Variable Projection for Structured Problems

2026-06-22 · Emanuele Zangrando, Sara Venturini, Francesco Rinaldi, Francesco Tudisco arxiv

Variable projection is a classical technique for separable nonlinear least-squares problems, in which variables that enter linearly are eliminated exactly, yielding a reduced nonlinear problem. By expressing this framewo…

Bilevel OptimizationFew-Shot Learning

Numerical Approximation of Partial Differential Equations by a Variable Projection Method with Artificial Neural Networks

2022-01-24 · Suchuan Dong, Jielin Yang

We present a method for solving linear and nonlinear PDEs based on the variable projection (VarPro) framework and artificial neural networks (ANN). For linear PDEs, enforcing the boundary/initial value problem on the col…

Symbolic Regression with Fast Function Extraction and Nonlinear Least Squares Optimization

2022-09-20 · Lukas Kammerer, Gabriel Kronberger, Michael Kommenda

Fast Function Extraction (FFX) is a deterministic algorithm for solving symbolic regression problems. We improve the accuracy of FFX by adding parameters to the arguments of nonlinear functions. Instead of only optimizin…

regressionSymbolic Regression

Sparse Variable Projection in Robotic Perception: Exploiting Separable Structure for Efficient Nonlinear Optimization

2025-12-08 · Alan Papalia, Nikolas Sanderson, Haoyu Han, Heng Yang 외 arxiv

Robotic perception often requires solving large nonlinear least-squares (NLS) problems. While sparsity has been well-exploited to scale solvers, a complementary and underexploited structure is \emph{separability} -- wher…

Boost Like a (Var)Pro: Trust-Region Gradient Boosting via Variable Projection

2026-03-24 · Abhijit Chowdhary, Elizabeth Newman, Deepanshu Verma arxiv

Gradient boosting, a method of building additive ensembles from weak learners, has established itself as a practical and theoretically-motivated approach to approximate functions, especially using decision tree weak lear…