On the Generalization Ability of On-Line Learning Algorithms
From MaRDI portal
Recommendations
Cited in
(80)- On martingale extensions of Vapnik-Chervonenkis theory with applications to online learning
- A survey of algorithms and analysis for adaptive online learning
- No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization
- Online pairwise learning algorithms with convex loss functions
- On the perceptron's compression
- On the dual gradient descent method for the resource allocation problem in multiagent systems
- Discussion of ``Estimating the historical and future probabilities of large terrorist events by Aaron Clauset and Ryan Woodard
- A guide to stochastic optimisation for large-scale inverse problems
- scientific article; zbMATH DE number 67625 (Why is no real title available?)
- Online regression with varying Gaussians and non-identical distributions
- PAMR: passive aggressive mean reversion strategy for portfolio selection
- Improved Risk Tail Bounds for On-Line Algorithms
- Fast learning rates in statistical inference through aggregation
- A Randomized Online Learning Algorithm for Better Variance Control
- Algorithmic Learning Theory
- Applications of regularized least squares to pattern classification
- Analysis of Online Composite Mirror Descent Algorithm
- Online minimum error entropy algorithm with unbounded sampling
- Optimization methods for large-scale machine learning
- Online chaotic time series prediction using unbiased composite kernel machine via Cholesky factorization
- Online learning with (multiple) kernels: a review
- Sparse regression learning by aggregation and Langevin Monte-Carlo
- Online passive-aggressive active learning
- On-line learning with linear loss constraints.
- Generalization properties of doubly stochastic learning algorithms
- Learning Theory and Kernel Machines
- Online infinite-dimensional regression: learning linear operators
- Mirror averaging with sparsity priors
- Estimating the historical and future probabilities of large terrorist events
- A Second-Order Perceptron Algorithm
- PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification
- scientific article; zbMATH DE number 7306853 (Why is no real title available?)
- New insights on concentration inequalities for self-normalized martingales
- Discussion of ``Estimating the historical and future probabilities of large terrorist events by Aaron Clauset and Ryan Woodard
- The generalization performance of ERM algorithm with strongly mixing observations
- Exponentiated gradient meets gradient descent
- Optimal rates for multi-pass stochastic gradient methods
- Self-tuning bandits over unknown covariate-shifts
- Efficient methods for online multiclass logistic regression
- Aggregation by exponential weighting, sharp PAC-Bayesian bounds and sparsity
- Discussion of ``Estimating the historical and future probabilities of large terrorist events by Aaron Clauset and Ryan Woodard
- Discussion of ``Estimating the historical and future probabilities of large terrorist events by Aaron Clauset and Ryan Woodard
- Discussion of ``Estimating the historical and future probabilities of large terrorist events by Aaron Clauset and Ryan Woodard
- Discussion of ``Estimating the historical and future probabilities of large terrorist events by Aaron Clauset and Ryan Woodard
- Functional incremental least square regression algorithm
- Convergence of unregularized online learning algorithms
- Structural online learning
- scientific article; zbMATH DE number 7625184 (Why is no real title available?)
- Online transfer learning
- On-line learning of linear functions
- Unregularized online algorithms with varying Gaussians
- Estimating latent feature-feature interactions in large feature-rich graphs
- An unbiased LSSVM model for classification and regression
- scientific article; zbMATH DE number 2089358 (Why is no real title available?)
- Stability and optimization error of stochastic gradient descent for pairwise learning
- PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification
- Learning hurdles for sleeping experts
- Online Pairwise Learning Algorithms
- Tracking nonstationary streaming data via exponentially weighted moving average stochastic gradient descent
- Pegasos: primal estimated sub-gradient solver for SVM
- On Tracking Varying Bounds When Forecasting Bounded Time Series
- Making the last iterate of SGD information theoretically optimal
- Learning Kernel Perceptrons on Noisy Data Using Random Projections
- High probability bounds on AdaGrad for constrained weakly convex optimization
- Optimal and efficient algorithms for decentralized online convex optimization
- Online risk-averse submodular maximization
- Recursive aggregation of estimators by the mirror descent algorithm with averaging
- Optimistic optimisation of composite objective with exponentiated update
- Rejoinder of ``Estimating the historical and future probabilities of large terrorist events by Aaron Clauset and Ryan Woodard
- Unregularized online learning algorithms with general loss functions
- Average stability is invariant to data preconditioning. Implications to exp-concave empirical risk minimization
- A primal-dual perspective of online learning algorithms
- Fully online classification by regularization
- Learning to classify with missing and corrupted features
- A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization
- scientific article; zbMATH DE number 1804117 (Why is no real title available?)
- scientific article; zbMATH DE number 6860836 (Why is no real title available?)
- The asymptotics of ranking algorithms
- scientific article; zbMATH DE number 1800544 (Why is no real title available?)
- 10.1162/153244303765208368
This page was built for publication: On the Generalization Ability of On-Line Learning Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546662)
