Analysis of Online Composite Mirror Descent Algorithm
From MaRDI portal
Publication:5380674
Recommendations
- On the efficiency of a randomized mirror descent algorithm in online optimization problems
- Distributed Mirror Descent for Online Composite Optimization
- Mirror descent and constrained online optimization problems
- Convergence of online mirror descent
- A generalized online mirror descent with applications to classification and regression
- Distributed Online Optimization in Dynamic Environments Using Mirror Descent
- Convergence analysis of online algorithms
- Accelerated randomized mirror descent algorithms for composite non-strongly convex optimization
- Validation analysis of mirror descent stochastic approximation method
- Competitive analysis for multi-objective online algorithms
Cites work
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 6253925 (Why is no real title available?)
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Convergence of stochastic proximal gradient algorithm
- Efficient online and batch learning using forward backward splitting
- Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization
- Iterative regularization for learning with convex loss functions
- Learning theory of randomized Kaczmarz algorithm
- Linearized Bregman iterations for compressed sensing
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Modified Fejér sequences and applications
- ONLINE LEARNING WITH MARKOV SAMPLING
- On the Generalization Ability of On-Line Learning Algorithms
- Online Learning as Stochastic Approximation of Regularization Paths: Optimality and Almost-Sure Convergence
- Online Pairwise Learning Algorithms
- Online Regularized Classification Algorithms
- Online gradient descent learning algorithms
- Online learning algorithms
- Regularization schemes for minimum error entropy principle
- Sharp uniform convexity and smoothness inequalities for trace norms
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Support Vector Machines
- Support vector machine soft margin classifiers: error analysis
- Unregularized online learning algorithms with general loss functions
Cited in
(11)- Learning theory of randomized sparse Kaczmarz method
- Error analysis of the kernel regularized regression based on refined convex losses and RKBSs
- Analysis of singular value thresholding algorithm for matrix completion
- Convergence of online mirror descent
- Block coordinate type methods for optimization and learning
- A generalized online mirror descent with applications to classification and regression
- A modular analysis of adaptive (non-)convex optimization: optimism, composite objectives, variance reduction, and variational bounds
- A modular analysis of adaptive (non-)convex optimization: optimism, composite objectives, and variational bounds
- A stochastic variance reduction algorithm with Bregman distances for structured composite problems
- Sparse online regression algorithm with insensitive loss functions
- Federated learning for minimizing nonsmooth convex loss functions
This page was built for publication: Analysis of Online Composite Mirror Descent Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380674)
