A Vector-Contraction Inequality for Rademacher Complexities
From MaRDI portal
Publication:2830263
DOI10.1007/978-3-319-46379-7_1zbMath1478.68296arXiv1605.00251OpenAlexW2962708723MaRDI QIDQ2830263
Publication date: 9 November 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.00251
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computational learning theory (68Q32) Inequalities; stochastic orderings (60E15) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (max. 100)
Graphical Convergence of Subgradients in Nonconvex Optimization and Learning ⋮ Handling concept drift via model reuse ⋮ Multi-kernel learning for multi-label classification with local Rademacher complexity ⋮ Unnamed Item ⋮ Also for \(k\)-means: more data does not imply better performance ⋮ Robust \(k\)-means clustering for distributions with two moments ⋮ On strong consistency of kernel \(k\)-means: a Rademacher complexity approach ⋮ Convergence Analysis of Machine Learning Algorithms for the Numerical Solution of Mean Field Control and Games I: The Ergodic Case ⋮ Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods ⋮ Compressive sensing and neural networks from a statistical learning perspective ⋮ From inexact optimization to learning via gradient concentration
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Empirical margin distributions and bounding the generalization error of combined classifiers
- Transfer bounds for linear feature learning
- Optimal rates for the regularized least-squares algorithm
- Concentration Inequalities
- 10.1162/15324430260185628
- On the Performance of Clustering in Hilbert Spaces
- On the best constants in the Khinchin inequality
- 10.1162/1532443041424300
- 10.1162/153244303321897690
- $K$-Dimensional Coding Schemes in Hilbert Spaces
This page was built for publication: A Vector-Contraction Inequality for Rademacher Complexities