Co-occurring keywords · papers mentioning both
Papers
Convergence and complexity of block majorization-minimization for constrained block-Riemannian optimization
JMLR 2026
Almost Sure Convergence of Dropout Algorithms for Neural Networks
JMLR 2025
Cauchy-Schwarz Regularizers
ICLR 2025
Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness
ICLR 2025
Cubic regularized subspace Newton for non-convex optimization
AISTATS 2025
Differentiable Quadratic Optimization For the Maximum Independent Set Problem
ICML 2025
DUET: Decentralized Bilevel Optimization without Lower-Level Strong Convexity
ICLR 2025
Exploring The Loss Landscape Of Regularized Neural Networks Via Convex Duality
ICLR 2025
From Gradient Clipping to Normalization for Heavy Tailed SGD
AISTATS 2025
Guided Zeroth-Order Methods for Stochastic Non-convex Problems with Decision-Dependent Distributions
ICML 2025
Improved Sample Complexity for Private Nonsmooth Nonconvex Optimization
ICML 2025
Increasing Batch Size Improves Convergence of Stochastic Gradient Descent with Momentum
ACML 2025
Learning In-context n-grams with Transformers: Sub-n-grams Are Near-Stationary Points
ICML 2025
Loss Landscape of Shallow ReLU-like Neural Networks: Stationary Points, Saddle Escape, and Network Embedding
ICLR 2025
Neural Collapse Beyond the Unconstrained Features Model: Landscape, Dynamics, and Generalization in the Mean-Field Regime
ICML 2025
Provable Complexity Improvement of AdaGrad over SGD: Upper and Lower Bounds in Stochastic Non-Convex Optimization
COLT 2025
The Adaptive Complexity of Finding a Stationary Point
COLT 2025
Two-Timescale Gradient Descent Ascent Algorithms for Nonconvex Minimax Optimization
JMLR 2025
A Lower Bound and a Near-Optimal Algorithm for Bilevel Empirical Risk Minimization
AISTATS 2024
An Algorithm with Optimal Dimension-Dependence for Zero-Order Nonsmooth Nonconvex Stochastic Optimization
JMLR 2024
A Nearly Optimal Single Loop Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness
ICML 2024
An Online Optimization Perspective on First-Order and Zero-Order Decentralized Nonsmooth Nonconvex Stochastic Optimization
ICML 2024
Convergence and Complexity Guarantee for Inexact First-order Riemannian Optimization Algorithms
ICML 2024
Double Momentum Method for Lower-Level Constrained Bilevel Optimization
ICML 2024
Dropout Enhanced Bilevel Training
ICLR 2024