Cover Image

Bilevel Learning via Inexact Stochastic Gradient Descent

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Salehi, Mohammad Sadegh, Mukherjee, Subhadip, Roberts, Lindon, Ehrhardt, Matthias J.
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control Machine Learning 65K10, 90C25, 90C26, 90C06, 90C31, 94A08
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Greedy Learning to Optimize with Convergence Guarantees
by: Fahy, Patrick, et al.
Published: (2024)

Semi-Monotone Goldstein Line Search Strategy with Application in Sparse Recovery
by: Shabani, Shima, et al.
Published: (2025)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
by: Zhou, Juan, et al.
Published: (2024)

Fast projection onto the top-k-sum constraint
by: Pan, Jianting, et al.
Published: (2025)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
by: Takahashi, Shota, et al.
Published: (2025)

A Near-Optimal Total Complexity for the Inexact Accelerated Proximal Gradient Method via Quadratic Growth
by: Li, Hongda, et al.
Published: (2026)

A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions
by: Bao, Chenglong, et al.
Published: (2025)

A distributed Douglas-Rachford splitting method for solving linear constrained multi-block weakly convex problems
by: Hu, Leyu, et al.
Published: (2024)

Bregman Stochastic Proximal Point Algorithm with Variance Reduction
by: Traoré, Cheik, et al.
Published: (2025)

Stochastic Variance-Reduced Forward-Reflected-Backward Splitting Methods for Nonmonotone Generalized Equations
by: Tran-Dinh, Quoc
Published: (2024)

A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
by: Song, Yongcun, et al.
Published: (2024)

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
by: Kabgani, Alireza, et al.
Published: (2025)

A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
by: Mannel, Florian
Published: (2024)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
by: Deng, Kangkang, et al.
Published: (2024)

Bounding-Focused Discretization Methods for the Global Optimization of Nonconvex Semi-Infinite Programs
by: Turan, Evren M., et al.
Published: (2023)

A structured L-BFGS method and its application to inverse problems
by: Mannel, Florian, et al.
Published: (2023)

A structured L-BFGS method with diagonal scaling and its application to image registration
by: Mannel, Florian, et al.
Published: (2024)

Proximal Limited-Memory Quasi-Newton Methods for Nonsmooth Nonconvex Optimization
by: Dahl, Simeon vom, et al.
Published: (2026)

Randomized block proximal method with locally Lipschitz continuous gradient
by: Pérez-Aros, Pedro, et al.
Published: (2025)

On the convergence of proximal gradient methods for convex simple bilevel optimization
by: Latafat, Puya, et al.
Published: (2023)

cuHALLaR: A GPU Accelerated Low-Rank Augmented Lagrangian Method for Large-Scale Semidefinite Programming
by: Aguirre, Jacob M., et al.
Published: (2025)

Anderson Accelerated Primal-Dual Hybrid Gradient for solving LP
by: Zhou, Yingxin, et al.
Published: (2025)

Inexact Limited Memory Bundle Method
by: Lampainen, Jenni, et al.
Published: (2026)

Strong Partitioning and a Machine Learning Approximation for Accelerating the Global Optimization of Nonconvex QCQPs
by: Kannan, Rohit, et al.
Published: (2022)

On a globally convergent semismooth* Newton method in nonsmooth nonconvex optimization
by: Gfrerer, H.
Published: (2024)

Boosted Stochastic Frank-Wolfe for Constrained Nonconvex Optimization
by: Nandhan, Navil, et al.
Published: (2026)

Asymptotic Convergence and Stability of Adaptive Gradient Methods in Smooth Non-convex Optimization
by: Jin, Ruinan, et al.
Published: (2026)

Lipschitz continuity of solution multifunctions of extended $\ell_1$ regularization problems
by: Meng, Kaiwen, et al.
Published: (2024)

On Averaging and Extrapolation for Gradient Descent
by: Luner, Alan, et al.
Published: (2024)

Simplex Frank-Wolfe: Linear Convergence and Its Numerical Efficiency for Convex Optimization over Polytopes
by: Wang, Haoning, et al.
Published: (2025)

Splitting the Conditional Gradient Algorithm
by: Woodstock, Zev, et al.
Published: (2023)

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials
by: Niu, Yi-Shuai, et al.
Published: (2018)

Accelerated Gradient Methods with Gradient Restart: Global Linear Convergence
by: Bao, Chenglong, et al.
Published: (2024)

Optimization in complex spaces with the Mixed Newton Method
by: Bakhurin, Sergey, et al.
Published: (2022)

A Semismooth Newton Stochastic Proximal Point Algorithm with Variance Reduction
by: Milzarek, Andre, et al.
Published: (2022)

Heavy-ball Differential Equation Achieves $O(\varepsilon^{-7/4})$ Convergence for Nonconvex Functions
by: Okamura, Kaito, et al.
Published: (2024)

Stability and convergence analysis of AdaGrad for non-convex optimization via novel stopping time-based techniques
by: Jin, Ruinan, et al.
Published: (2024)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
by: Xie, Xiyuan, et al.
Published: (2025)

Stochastic Algorithms for Large-Scale Composite Optimization: the Case of Single-Shot X-FEL Imaging
by: Luke, D. Russell, et al.
Published: (2024)

On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
by: Latafat, Puya, et al.
Published: (2023)