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