20 results for “stochastic-gradient algorithm”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper introduces a new tamed stochastic gradient Hamiltonian Monte Carlo (tSGHMC) algorithm for sampling and optimization problems with large stochastic gradients, providing error bounds and perf…
This paper proposes HT-PAder, a parameter-free algorithm for online convex optimization in non-stationary environments with heavy-tailed noise, achieving an expected universal dynamic regret.
This paper shows that stochastic nonconvex optimization can be reduced to ordinary static regret minimization in online convex optimization, and establishes convergence rates for smooth and Lipschitz…
This paper provides the first non-vacuous generalization analysis for the Stochastic Variance Reduced Gradient (SVRG) method by establishing sharp, data-dependent algorithmic stability bounds, thereby…
A parallel framework is proposed to improve the adaptivity of static gradient methods by having processors search for appropriate iteration numbers.
This paper reviews models of inexact computational oracles in smooth continuous optimization and their implications for optimization algorithms.
The paper analyzes a new class of asynchronous adaptive first-order optimization methods and proves their stochastic convergence rate is O(1/sqrt{t}) for non-convex functions.
This paper introduces Curvature-Weighted Gradient Diversity (CWGD), a geometry-aware measure for optimization noise that reduces the asymptotic optimization error floor by up to a factor of two compar…
The paper studies the stationary behavior and distributional limits of constant-step stochastic gradient descent with momentum (SGDM) as a nonlinear time series.
This paper proposes a one-trial proximal algorithm for minimizing nonsmooth, nonconvex objectives with unknown weak-convexity parameter.
The paper proposes Weight Adaptation ASNG, a probabilistic model-based evolutionary algorithm that adapts its weight parameters to improve optimization efficiency and robustness.
This paper studies the fluctuations of infinitesimal gradient boosting and establishes a functional central limit theorem.
This paper provides a comprehensive generalization analysis of Stochastic Gradient Descent with Momentum (SGDM) by establishing tight, on-average model stability bounds that show SGDM can generalize w…
This paper proposes a randomized iterative method called Sequential Preconditioned Conjugate Gradient Method (SPCG) for large-scale linear statistical models, which significantly reduces computational…
This paper proves that Random Reshuffling in Shuffling Stochastic Gradient Descent dominates vanilla SGD in smooth convex optimization after any finite number of epochs.
Proposes CR-EA-C, a confidence-driven evolutionary algorithm for solving noisy black-box optimization problems under joint chance constraints.
This paper derives the complete theory of covariance regret functional for decision making, providing insights on steepest-descent directions and boundary-optimal solutions.