Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 36 min ago
PreprintCC BY 4.0arXiv

Optimization by Reparametrization: Time-Warped Mirror Flows with Singular Geometry

Abstract

Solving data-driven problems requires defining complex models and fitting them to data, neural networks being a motivating example. The fitting procedure can be seen as an optimization problem, which is often non-convex, and hence optimization guarantees are hard to derive. An opportunity is provided by viewing the model of interest as a redundant reparameterization--an overparameterization--of some simpler model for which optimization results are easier to achieve. In this paper, after formalizing the above idea, we revisit some recent results and derive new ones. In particular, we consider the gradient flow of some classes of linear overparameterizations and show that they correspond to suitable mirror flows on the original parameters. Our main contribution relates to the study of the latter, for which we establish well-posedness and convergence. Several specific instances are provided, including fully connected linear networks and networks with weight normalization. The results yield insight into the role of overparameterization in optimization and corresponding implicit regularization properties.

Related

  1. No-Regret Bayesian Optimization with Finite-Library Input-Warped Kernels
    Edvin Ketabati Augustinsson, Robert A. Bridges
    arXivPreprintarXiv licenceFull textOptimisation & controlStatisticsarXiv
  2. Boundary transmission and excursion geometry in the Lorentz mirror model: a numerical study
    Jian Gu, Qin Hao
    arXivPreprintarXiv licenceFull textMathematical physicsNumerical analysis & scientific computingarXiv
  3. Convex optimization on moment polytopes: Hadamard mirror descent and efficient algorithms for quantum functionals and other tensor parameters
    Mahmut Levent Doğan, Keiya Sakabe, Michael Walter
    arXivPreprintCC BY 4.0Full textMathematical physicsOptimisation & controlarXiv
  4. Multiplicative Gradient Method for Log-Homogeneous Optimization: A Unified Mirror-Descent Framework
    Chun-Neng Chu, Yen-Huan Li
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  5. The Geometry of Manifold Learning: Singular foliations via Deep Learning models
    Gabriele Novelli, Eliot Tron, Emanuele Latini +1
    arXivPreprintarXiv licenceFull textGeometry & topologyarXiv
BibTeX
@misc{vega2026optimization,
  title = {{Optimization by Reparametrization: Time-Warped Mirror Flows with Singular Geometry}},
  author = {Cristian Vega and Cesare Molinari and Lorenzo Rosasco and Silvia Villa},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.07040},
  eprint = {2610.07040},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.07040},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Optimization by Reparametrization: Time-Warped Mirror Flows with Singular Geometry
AU  - Cristian Vega
AU  - Cesare Molinari
AU  - Lorenzo Rosasco
AU  - Silvia Villa
PY  - 2026
DA  - 2026/10/05
PB  - arXiv
DO  - 10.48550/arxiv.2610.07040
UR  - https://arxiv.org/abs/2610.07040
AB  - Solving data-driven problems requires defining complex models and fitting them to data, neural networks being a motivating example. The fitting procedure can be seen as an optimization problem, which is often non-convex, and hence optimization guarantees are hard to derive. An opportunity is provided by viewing the model of interest as a redundant reparameterization--an overparameterization--of some simpler model for which optimization results are easier to achieve. In this paper, after formalizing the above idea, we revisit some recent results and derive new ones. In particular, we consider the gradient flow of some classes of linear overparameterizations and show that they correspond to suitable mirror flows on the original parameters. Our main contribution relates to the study of the latter, for which we establish well-posedness and convergence. Several specific instances are provided, including fully connected linear networks and networks with weight normalization. The results yield insight into the role of overparameterization in optimization and corresponding implicit regularization properties.
ER  -