Imagen de Portada

Fast Unconstrained Optimization via Hessian Averaging and Adaptive Gradient Sampling Methods

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	O'Leary-Roseberry, Thomas, Bollapragada, Raghu
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control Numerical Analysis Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Shape Derivative-Informed Neural Operators with Application to Risk-Averse Shape Optimization
por: Gong, Xindi, et al.
Publicado: (2026)

Inference of Heterogeneous Material Properties via Infinite-Dimensional Integrated DIC
por: Kirchhoff, Joseph, et al.
Publicado: (2024)

Adaptive Proximal Gradient Method for Convex Optimization
por: Malitsky, Yura, et al.
Publicado: (2023)

Adaptive Lipschitz-Free Conditional Gradient Methods for Stochastic Composite Nonconvex Optimization
por: Yuan, Ganzhao
Publicado: (2026)

OptEMA: Adaptive Exponential Moving Average for Stochastic Optimization with Zero-Noise Optimality
por: Yuan, Ganzhao
Publicado: (2026)

Enhanced Adaptive Gradient Algorithms for Nonconvex-PL Minimax Optimization
por: Huang, Feihu, et al.
Publicado: (2023)

Derivative-informed neural operator acceleration of geometric MCMC for infinite-dimensional Bayesian inverse problems
por: Cao, Lianghao, et al.
Publicado: (2024)

Fast and Provable Tensor-Train Format Tensor Completion via Precondtioned Riemannian Gradient Descent
por: Bian, Fengmiao, et al.
Publicado: (2025)

Super Gradient Descent: Global Optimization requires Global Gradient
por: Achour, Seifeddine
Publicado: (2024)

Dimension reduction for derivative-informed operator learning: An analysis of approximation errors
por: Luo, Dingcheng, et al.
Publicado: (2025)

LazyDINO: Fast, scalable, and efficiently amortized Bayesian inversion via structure-exploiting and surrogate-driven measure transport
por: Cao, Lianghao, et al.
Publicado: (2024)

Gradient is All You Need? How Consensus-Based Optimization can be Interpreted as a Stochastic Relaxation of Gradient Descent
por: Riedl, Konstantin, et al.
Publicado: (2023)

Provably Faster Gradient Descent via Long Steps
por: Grimmer, Benjamin
Publicado: (2023)

The Essential Best and Average Rate of Convergence of the Exact Line Search Gradient Descent Method
por: Yu, Thomas
Publicado: (2023)

On the Convergence of the Gradient Descent Method with Stochastic Fixed-point Rounding Errors under the Polyak-Lojasiewicz Inequality
por: Xia, Lu, et al.
Publicado: (2023)

Efficient Trajectory Inference in Wasserstein Space Using Consecutive Averaging
por: Banerjee, Amartya, et al.
Publicado: (2024)

A Natural Primal-Dual Hybrid Gradient Method for Adversarial Neural Network Training on Solving Partial Differential Equations
por: Liu, Shu, et al.
Publicado: (2024)

Primal-Dual Methods for Nonsmooth Nonconvex Optimization with Orthogonality Constraints
por: Zhu, Linglingzhi, et al.
Publicado: (2026)

Nonlinear Assimilation via Score-based Sequential Langevin Sampling
por: Ding, Zhao, et al.
Publicado: (2024)

A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints
por: Yuan, Ganzhao
Publicado: (2023)

Policy Gradient with Second Order Momentum
por: Sun, Tianyu
Publicado: (2025)

Averaged Adam accelerates stochastic optimization in the training of deep neural network approximations for partial differential equation and optimal control problems
por: Dereich, Steffen, et al.
Publicado: (2025)

Gradient Descent as a Perceptron Algorithm: Understanding Dynamics and Implicit Acceleration
por: Tyurin, Alexander
Publicado: (2025)

A Retrospective Approximation Approach for Smooth Stochastic Optimization
por: Newton, David, et al.
Publicado: (2021)

Dynamic Proximal Gradient Algorithms for Schatten-$p$ Quasi-Norm Regularized Problems
por: Shen, Weiping, et al.
Publicado: (2026)

Acceleration Methods
por: d'Aspremont, Alexandre, et al.
Publicado: (2021)

Accuracy of Discretely Sampled Stochastic Policies in Continuous-time Reinforcement Learning
por: Jia, Yanwei, et al.
Publicado: (2025)

Fundamental Bias in Inverting Random Sampling Matrices with Application to Sub-sampled Newton
por: Niu, Chengmei, et al.
Publicado: (2025)

A New Fast Adaptive Linearized Alternating Direction Multiplier Method for Convex Optimization
por: Wang, Boran
Publicado: (2024)

Faster Randomized Methods for Orthogonality Constrained Problems
por: Shustin, Boris, et al.
Publicado: (2021)

State-Dependent Lyapunov Method for Rank-1 Matrix Factorization
por: Moon, Jaehong
Publicado: (2026)

Quantitative Convergences of Lie Group Momentum Optimizers
por: Kong, Lingkai, et al.
Publicado: (2024)

Nonlinear Dimensionality Reduction Techniques for Bayesian Optimization
por: Long, Luo, et al.
Publicado: (2025)

Random Subspace Cubic-Regularization Methods, with Applications to Low-Rank Functions
por: Cartis, Coralia, et al.
Publicado: (2025)

Scalable Acceleration for Classification-Based Derivative-Free Optimization
por: Han, Tianyi, et al.
Publicado: (2023)

Dual Cone Gradient Descent for Training Physics-Informed Neural Networks
por: Hwang, Youngsik, et al.
Publicado: (2024)

A Trust-Region Interior-Point Stochastic Sequential Quadratic Programming Method
por: Fang, Yuchen, et al.
Publicado: (2026)

A Gauss-Newton Approach for Min-Max Optimization in Generative Adversarial Networks
por: Mishra, Neel, et al.
Publicado: (2024)

UAdam: Unified Adam-Type Algorithmic Framework for Non-Convex Stochastic Optimization
por: Jiang, Yiming, et al.
Publicado: (2023)

Modified Loss of Momentum Gradient Descent: Fine-Grained Analysis
por: Cattaneo, Matias D., et al.
Publicado: (2025)