Improved Risk Tail Bounds for On-Line Algorithms
From MaRDI portal
Publication:3604417
Recommendations
Cited in
(6)- On the Generalization Ability of On-Line Learning Algorithms
- Online regularized learning with pairwise loss functions
- New insights on concentration inequalities for self-normalized martingales
- Real-time model learning using incremental sparse spectrum Gaussian process regression
- Convergence rate analysis for optimal computing budget allocation algorithms
- Optimistic optimisation of composite objective with exponentiated update
This page was built for publication: Improved Risk Tail Bounds for On-Line Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604417)