Dual averaging methods for regularized stochastic learning and online optimization
From MaRDI portal
Recommendations
- Manifold identification in dual averaging for regularized stochastic online learning
- Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
- Accelerated dual-averaging primal–dual method for composite convex minimization
- A stochastic algorithm with optimal convergence rate for strongly convex optimization problems
- Adaptive subgradient methods for online learning and stochastic optimization
Cited in
(86)- Stochastic mirror descent dynamics and their convergence in monotone variational inequalities
- Stochastic mirror descent method for distributed multi-agent optimization
- Group online adaptive learning
- Scale-free online learning
- Learning in games with continuous action sets and unknown payoff functions
- On variance reduction for stochastic smooth convex optimization with multiplicative noise
- Gradient-free method for nonsmooth distributed optimization
- Convergence of stochastic proximal gradient algorithm
- Randomized smoothing variance reduction method for large-scale non-smooth convex optimization
- Asymptotic properties of dual averaging algorithm for constrained distributed stochastic optimization
- One-stage tree: end-to-end tree builder and pruner
- Large-scale multivariate sparse regression with applications to UK Biobank
- Statistical inference for model parameters in stochastic gradient descent
- Algorithms for stochastic optimization with function or expectation constraints
- Convergence of distributed gradient-tracking-based optimization algorithms with random graphs
- Incrementally updated gradient methods for constrained and regularized optimization
- Robust and sparse regression in generalized linear model by stochastic optimization
- Hedge algorithm and dual averaging schemes
- Proximal average approximated incremental gradient descent for composite penalty regularized empirical risk minimization
- A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression
- Online learning over a decentralized network through ADMM
- Asymptotic optimality in stochastic optimization
- Sparse learning for large-scale and high-dimensional data: a randomized convex-concave optimization approach
- Scale-free algorithms for online linear optimization
- Stochastic forward-backward splitting for monotone inclusions
- Distributed subgradient method for multi-agent optimization with quantized communication
- A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks
- A family of second-order methods for convex \(\ell _1\)-regularized optimization
- A tight bound of hard thresholding
- A sparsity preserving stochastic gradient methods for sparse regression
- An incremental mirror descent subgradient algorithm with random sweeping and proximal step
- Stochastic primal-dual coordinate method for regularized empirical risk minimization
- Harder, Better, Faster, Stronger Convergence Rates for Least-Squares Regression
- Linear coupling: an ultimate unification of gradient and mirror descent
- Global convergence rate of proximal incremental aggregated gradient methods
- Online manifold regularization by dual ascending procedure
- A generalized online mirror descent with applications to classification and regression
- Online sufficient dimension reduction through sliced inverse regression
- Graph-dependent implicit regularisation for distributed stochastic subgradient descent
- A data efficient and feasible level set method for stochastic convex optimization with expectation constraints
- Accelerated dual-averaging primal–dual method for composite convex minimization
- Dual iterative hard thresholding
- Minimizing finite sums with the stochastic average gradient
- Adaptive sequential machine learning
- A Single Timescale Stochastic Approximation Method for Nested Stochastic Optimization
- Accelerate stochastic subgradient method by leveraging local growth condition
- Incremental majorization-minimization optimization with application to large-scale machine learning
- A stochastic algorithm with optimal convergence rate for strongly convex optimization problems
- Adaptive subgradient methods for online learning and stochastic optimization
- Manifold identification in dual averaging for regularized stochastic online learning
- Stochastic dual coordinate ascent methods for regularized loss minimization
- On the convergence of mirror descent beyond stochastic convex programming
- A general framework of online updating variable selection for generalized linear models with streaming datasets
- On the dual formulation of regularized linear systems with convex risks
- Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
- An indefinite proximal subgradient-based algorithm for nonsmooth composite optimization
- Distributed one-pass online AUC maximization
- Online Estimation for Functional Data
- No-regret algorithms in on-line learning, games and convex optimization
- No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization
- Regularized quasi-monotone method for stochastic optimization
- Simple and fast algorithm for binary integer and online linear programming
- When will gradient methods converge to max-margin classifier under ReLU models?
- Fast iterative regularization by reusing data
- A new computational framework for log-concave density estimation
- Bregman methods for large-scale optimization with applications in imaging
- Stochastic algorithms with geometric step decay converge linearly on sharp functions
- A single cut proximal bundle method for stochastic convex composite optimization
- Distributed online stochastic gradient tracking
- Decentralized stochastic subgradient projection optimization algorithms over random networks
- Efficient distributed learning in stochastic non-cooperative games without information exchange
- A novel framework for online supervised learning with feature selection
- Stochastic feature selection with annealing and its applications to streaming data
- Efficient projection-free online convex optimization using stochastic gradients
- Stochastic approximation based confidence regions for stochastic variational inequalities
- Inference for high-dimensional streamed longitudinal data
- Sample size selection in optimization methods for machine learning
- Online alternating direction method of multipliers for online composite optimization
- Low-Rank Dependence Decomposition via Accelerated Symmetric Non-negative Matrix Factorization
- Policy optimization over general state and action spaces
- Dual averaging algorithm with memory mechanism for nonsmooth optimization problems
- A normal map-based proximal stochastic gradient method: convergence and identification properties
- Stochastic primal dual fixed point method for composite optimization
- Make _1 regularization effective in training sparse CNN
- Feature-aware regularization for sparse online learning
- A stochastic variational framework for fitting and diagnosing generalized linear mixed models
This page was built for publication: Dual averaging methods for regularized stochastic learning and online optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2896156)
