REVIEW 3 cited by
A Randomised Subspace Gauss-Newton Method for Nonlinear Least-Squares
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We propose a Randomised Subspace Gauss-Newton (R-SGN) algorithm for solving nonlinear least-squares optimization problems, that uses a sketched Jacobian of the residual in the variable domain and solves a reduced linear least-squares on each iteration. A sublinear global rate of convergence result is presented for a trust-region variant of R-SGN, with high probability, which matches deterministic counterpart results in the order of the accuracy tolerance. Promising preliminary numerical results are presented for R-SGN on logistic regression and on nonlinear regression problems from the CUTEst collection.
Forward citations
Cited by 3 Pith papers
-
Model-Driven Subspaces for Large-Scale Optimization with Local Approximation Strategy
The paper proposes truncated, model-gradient-generated subspaces for large-scale optimization and gives conditional decrease and convergence theorems, but the stated guarantees are not fully proven.
-
Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems
Two linearized block coordinate descent algorithms for nonsmooth composite optimization converge in expectation to a stationary point at O(1/ε²) rate.
-
A variable dimension sketching strategy for nonlinear least-squares
A randomized subspace Levenberg-Marquardt method with adaptively chosen subspace size retains O(epsilon^-2) complexity and shows practical cost savings.
Discussion (0). Continue with ORCID to comment.