paper-with-me

Papers

Optimization Geometrodynamics: Variational Reduction and Interaction Curvature

2026-07-07 · Zavier Li arxiv

Adaptive optimizers carry hidden states that change how visible gradients become parameter motion. We develop optimization geometrodynamics as a variational theory of this hidden geometry. Infimal pushforward eliminates all hidden states realizing the same action and composes across optimizer hierarchies. Under smooth nondegeneracy, it yields hidden susceptibility and the Schur-complement curvature seen after relaxation. For affine pre-reduction perturbations, the induced interaction curvature is the negative-semidefinite operator $-G^*H^{-1}G$, whose mixed entries integrate to finite mechanism contrasts. Our main realization is the determinant-one affine-invariant SPD action map $P\mapsto PA$. We prove a global analytic bundle with closed totally geodesic fibers and a unique analytic nearest-controller section. A strongly convex fiber theorem and an explicit logarithmic action residual give a globally linearly convergent solver from every feasible initializer, together with nonasymptotic value, controller-distance, and residual bounds and observable posterior stopping certificates. A conditional inexact result propagates supplied rigorous residual-error and radius majorants. The dense spectral kernel is confined to an active subspace of dimension $r\le 2m$, yielding an explicit spectral-arithmetic operation bound and a strict dimensional reduction when $r<d$. For nested shape-normalized quadratic actions, canonical multi-secant projections satisfy an exact CAT(0) Pythagorean decrease and recover the determinant-one inverse Hessian shape at the sharp rank threshold $d-1$, provided the scalar gauge $c_H=(\det H)^{1/d}$ is known. These results turn the action bundle into an exact iterative computation with posterior certificates and a finite-identification theory.

📄 PDF Abstract BibTeX arXiv:2607.06723

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Variational Quantum Classifiers Through the Lens of the Hessian

2021-05-21 · Pinaki Sen, Amandeep Singh Bhatia, Kamalpreet Singh Bhangu, Ahmed Elbeltagi

In quantum computing, the variational quantum algorithms (VQAs) are well suited for finding optimal combinations of things in specific applications ranging from chemistry all the way to finance. The training of VQAs with…

Boosting Variational Inference With Locally Adaptive Step-Sizes

2021-05-19 · Gideon Dresdner, Saurav Shekhar, Fabian Pedregosa, Francesco Locatello 외

Variational Inference makes a trade-off between the capacity of the variational family and the tractability of finding an approximate posterior distribution. Instead, Boosting Variational Inference allows practitioners t…

Variational Inference

Self-Supervised Learning by Curvature Alignment

2025-11-21 · Benyamin Ghojogh, M. Hadi Sepanj, Paul Fieguth arxiv

Self-supervised learning (SSL) has recently advanced through non-contrastive methods that couple an invariance term with variance, covariance, or redundancy-reduction penalties. While such objectives shape first- and sec…

Self-Supervised Learning

Restricted Dynamic Geometric Complexity: Certificates for Structured Preconditioning

2026-07-08 · Zavier Li arxiv

Optimization geometrodynamics views optimizer state as evolving geometry. Its full positive-definite quadratic benchmark gives the least affine-invariant deformation needed to reduce condition number when arbitrary metri…

Discrete Curvature Graph Information Bottleneck

2024-12-28 · Xingcheng Fu, Jian Wang, Yisen Gao, Qingyun Sun 외

Graph neural networks(GNNs) have been demonstrated to depend on whether the node effective information is sufficiently passing. Discrete curvature (Ricci curvature) is used to study graph connectivity and information pro…