Exponentiated gradient versus gradient descent for linear predictors
From MaRDI portal
Publication:675044
Recommendations
Cited in
(64)- Nonstationary online convex optimization with multiple predictions
- Learning to Assign Degrees of Belief in Relational Domains
- Statistical computational learning
- Efficient algorithms for implementing incremental proximal-point methods
- Distributed online bandit linear regressions with differential privacy
- A family of large margin linear classifiers and its application in dynamic environments
- Regret analysis of an online majorized semi-proximal ADMM for online composite optimization
- Optimistic optimisation of composite objective with exponentiated update
- Weighted last-step min-max algorithm with improved sub-logarithmic regret
- Recursive forecast combination for dependent heterogeneous data
- Dynamical memory control based on projection technique for online regression
- PORTFOLIO SELECTION AND ONLINE LEARNING
- A generalized online mirror descent with applications to classification and regression
- A game of prediction with expert advice
- Scale-free online learning
- Adaptive and optimal online linear regression on \(\ell^1\)-balls
- Improved algorithms for online load balancing
- Testing for association in multiview network data
- Efficient learning with virtual threshold gates
- Learning rotations with little regret
- Online variance minimization
- Cutting-plane training of structural SVMs
- Robust and sparse regression in generalized linear model by stochastic optimization
- The Concave-Convex Procedure
- Achieving fairness with a simple ridge penalty
- Recursive aggregation of estimators by the mirror descent algorithm with averaging
- Convergence of the exponentiated gradient method with Armijo line search
- Randomized linear programming solves the Markov decision problem in nearly linear (sometimes sublinear) time
- Multiplicative Updates for Nonnegative Quadratic Programming
- Constrained dual graph regularized orthogonal nonnegative matrix tri-factorization for co-clustering
- Online learning of Nash equilibria in congestion games
- Limited Stochastic Meta-Descent for Kernel-Based Online Learning
- Adaptive regularization of weight vectors
- Neural learning by geometric integration of reduced `rigid-body' equations
- The Perceptron algorithm versus Winnow: linear versus logarithmic mistake bounds when few input variables are relevant
- Adaptive stepsizes for recursive estimation with applications in approximate dynamic programming
- The entropic barrier: exponential families, log-concave geometry, and self-concordance
- Bayesian generalized probability calculus for density matrices
- Convergence rates of gradient methods for convex optimization in the space of measures
- A primal-dual perspective of online learning algorithms
- Worst-case analysis of the Perceptron and Exponentiated Update algorithms
- An efficient approach to solve the large-scale semidefinite programming problems
- Online decision making with high-dimensional covariates
- Competitive On-line Statistics
- Analysis of two gradient-based algorithms for on-line regression
- Extracting certainty from uncertainty: regret bounded by variation in costs
- Regrets of proximal method of multipliers for online non-convex optimization with long term constraints
- Exponentiated gradient algorithms for conditional random fields and max-margin Markov networks
- Prior knowledge and preferential structures in gradient descent learning algorithms
- Online Ranking by Projecting
- On the convergence of mirror descent beyond stochastic convex programming
- A continuous-time approach to online optimization
- Competing with wild prediction rules
- Learning to assign degrees of belief in relational domains
- A modular analysis of adaptive (non-)convex optimization: optimism, composite objectives, variance reduction, and variational bounds
- Foraging theory for dimensionality reduction of clustered data
- PAC-Bayesian risk bounds for group-analysis sparse regression by exponential weighting
- A kernel-based perceptron with dynamic memory
- Learning Theory
- Relative utility bounds for empirically optimal portfolios
- An entropic Landweber method for linear ill-posed problems
- A quasi-Bayesian perspective to online clustering
- Out-of-sample utility bounds for empirically optimal portfolios in a single-period investment problem
- Online learning based on online DCA and application to online classification
This page was built for publication: Exponentiated gradient versus gradient descent for linear predictors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675044)
