Cover Image

Exploiting weight-space symmetries for approximating curvature

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Artemev, Artem, Xia, Rui, Boyd, Benjamin M., Yu, Youjing, Dangel, Felix, Hennequin, Guillaume, Bernacchia, Alberto
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Can We Remove the Square-Root in Adaptive Gradient Methods? A Second-Order Perspective
by: Lin, Wu, et al.
Published: (2024)

Mean-square and linear convergence of a stochastic proximal point algorithm in metric spaces of nonpositive curvature
by: Pischke, Nicholas
Published: (2025)

Feature weighting for data analysis via evolutionary simulation
by: Daniilidis, Aris, et al.
Published: (2025)

A successive approximation method in functional spaces for hierarchical optimal control problems and its application to learning
by: Befekadu, Getachew K.
Published: (2024)

Exploiting Exogenous Structure for Sample-Efficient Reinforcement Learning
by: Wan, Jia, et al.
Published: (2024)

Exploiting Similarity for Computation and Communication-Efficient Decentralized Optimization
by: Takezawa, Yuki, et al.
Published: (2025)

Deconstructing the Goldilocks Zone of Neural Network Initialization
by: Vysogorets, Artem, et al.
Published: (2024)

A block-coordinate descent framework for non-convex composite optimization. Application to sparse precision matrix estimation
by: Lauga, Guillaume
Published: (2026)

Gathering and Exploiting Higher-Order Information when Training Large Structured Models
by: Wolinski, Pierre
Published: (2023)

Online Complexity Estimation for Repetitive Scenario Design
by: Berger, Guillaume O., et al.
Published: (2025)

PAC Learnability of Scenario Decision-Making Algorithms: Necessary Conditions and Sufficient Conditions
by: Berger, Guillaume O., et al.
Published: (2025)

Improved Compression Bounds for Scenario Decision Making
by: Berger, Guillaume O.
Published: (2025)

Black-Box Approximation and Optimization with Hierarchical Tucker Decomposition
by: Ryzhakov, Gleb, et al.
Published: (2024)

Gluon: Making Muon & Scion Great Again! (Bridging Theory and Practice of LMO-based Optimizers for LLMs)
by: Riabinin, Artem, et al.
Published: (2025)

Constructive approximate transport maps with normalizing flows
by: Álvarez-López, Antonio, et al.
Published: (2024)

Learning based convex approximation for constrained parametric optimization
by: Liu, Kang, et al.
Published: (2025)

Size and depth of monotone neural networks: interpolation and approximation
by: Mikulincer, Dan, et al.
Published: (2022)

Specifying and Solving Robust Empirical Risk Minimization Problems Using CVXPY
by: Luxenberg, Eric, et al.
Published: (2023)

Solving 0-1 Integer Programs with Unknown Knapsack Constraints Using Membership Oracles
by: Messana, Rosario, et al.
Published: (2024)

Automatic nonlinear MPC approximation with closed-loop guarantees
by: Tokmak, Abdullah, et al.
Published: (2023)

Model approximation in MDPs with unbounded per-step cost
by: Bozkurt, Berk, et al.
Published: (2024)

PACSBO: Probably approximately correct safe Bayesian optimization
by: Tokmak, Abdullah, et al.
Published: (2024)

Where Does Warm-Up Come From? Adaptive Scheduling for Norm-Constrained Optimizers
by: Riabinin, Artem, et al.
Published: (2026)

Non-geodesically-convex optimization in the Wasserstein space
by: Luu, Hoang Phuc Hau, et al.
Published: (2024)

A unified framework for establishing the universal approximation of transformer-type architectures
by: Cheng, Jingpu, et al.
Published: (2025)

When GNNs meet symmetry in ILPs: an orbit-based feature augmentation approach
by: Chen, Qian, et al.
Published: (2025)

Near-Linear Time Projection onto the $\ell_{1,\infty}$ Ball; Application to Sparse Autoencoders
by: Perez, Guillaume, et al.
Published: (2023)

Proximal basin hopping: global optimization with guarantees
by: Lauga, Guillaume, et al.
Published: (2026)

Robust Neural IDA-PBC: passivity-based stabilization under approximations
by: Sanchez-Escalonilla, Santiago, et al.
Published: (2024)

Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees
by: Agafonov, Artem, et al.
Published: (2025)

Mean-Field Langevin Dynamics for Signed Measures via a Bilevel Approach
by: Wang, Guillaume, et al.
Published: (2024)

Muon Does Not Converge on Convex Lipschitz Functions
by: Parshakova, Tetiana, et al.
Published: (2026)

Robust stabilization of polytopic systems via fast and reliable neural network-based approximations
by: Fabiani, Filippo, et al.
Published: (2022)

Deterministic Trajectory Optimization through Probabilistic Optimal Control
by: Filabadi, Mohammad Mahmoudi, et al.
Published: (2024)

Convergence rates of stochastic gradient method with independent sequences of step-size and momentum weight
by: Hwang, Wen-Liang
Published: (2024)

Bias-Optimal Bounds for SGD: A Computer-Aided Lyapunov Analysis
by: Cortild, Daniel, et al.
Published: (2025)

Efficient algorithms for regularized Poisson Non-negative Matrix Factorization
by: Perraudin, Nathanaël, et al.
Published: (2024)

Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization
by: Hihat, Massil, et al.
Published: (2023)

Multivariate Online Linear Regression for Hierarchical Forecasting
by: Hihat, Massil, et al.
Published: (2024)

Accelerated stochastic approximation with state-dependent noise
by: Ilandarideva, Sasila, et al.
Published: (2023)