Skip to content
conftrace_

stochastic gradient descent

1,337 papers

SGD

Papers

Faster Convergence of Riemannian Stochastic Gradient Descent with Increasing Batch Size ACML 2025 Feature learning from non-Gaussian inputs: the case of Independent Component Analysis in high dimensions ICML 2025 Generalization Bounds and Model Complexity for Kolmogorov–Arnold Networks ICLR 2025 Generalization Lower Bounds for GD and SGD in Smooth Stochastic Convex Optimization AISTATS 2025 Global Convergence and Rich Feature Learning in L-Layer Infinite-Width Neural Networks under μ Parametrization ICML 2025 Gradient correlation is a key ingredient to accelerate SGD with momentum ICLR 2025 Gradient descent with generalized Newton’s method ICLR 2025 High-probability Convergence Bounds for Online Nonlinear Stochastic Gradient Descent under Heavy-tailed Noise AISTATS 2025 IDInit: A Universal and Stable Initialization Method for Neural Network Training ICLR 2025 Improved Rates of Differentially Private Nonconvex-Strongly-Concave Minimax Optimization AAAI 2025 Improving Deep Learning Speed and Performance Through Synaptic Neural Balance AAAI 2025 Investigating the Role of Weight Decay in Enhancing Nonconvex SGD CVPR 2025 Learning a Single Index Model from Anisotropic Data with Vanilla Stochastic Gradient Descent AISTATS 2025 Learning Curves of Stochastic Gradient Descent in Kernel Regression ICML 2025 Learning to Sample in Stochastic Optimization UAI 2025 Leveraging Flatness to Improve Information-Theoretic Generalization Bounds for SGD ICLR 2025 LiD-FL: Towards List-Decodable Federated Learning AAAI 2025 Locally Optimal Descent for Dynamic Stepsize Scheduling AISTATS 2025 MAST: model-agnostic sparsified training ICLR 2025 MGDA Converges under Generalized Smoothness, Provably ICLR 2025 MindFlayer SGD: Efficient Parallel SGD in the Presence of Heterogeneous and Random Worker Compute Times UAI 2025 Mixing Times and Privacy Analysis for the Projected Langevin Algorithm under a Modulus of Continuity JMLR 2025 Mixture of Experts Provably Detect and Learn the Latent Cluster Structure in Gradient-Based Learning ICML 2025 Nearly Optimal Sample Complexity for Learning with Label Proportions ICML 2025 Nonasymptotic Analysis of Stochastic Gradient Descent with the Richardson–Romberg Extrapolation ICLR 2025