Efficient agnostic learning with average smoothness
From MaRDI portal
Cites work
- A distribution-free theory of nonparametric regression
- Adaptive metric dimensionality reduction
- Averaged modulus of continuity and bracket compactness
- Bracketing metric entropy rates and empirical central limit theorems for function classes of Besov- and Sobolev-type
- Efficient algorithms for learning functions with bounded variation
- Efficient Regression in Metric Spaces via Approximate Lipschitz Extension
- Foundations of machine learning
- scientific article; zbMATH DE number 193991 (Why is no real title available?)
- Mathematical Foundations of Infinite-Dimensional Statistical Models
- Solving Linear Programs in the Current Matrix Multiplication Time
- Weak convergence and empirical processes. With applications to statistics
This page was built for publication: Efficient agnostic learning with average smoothness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7017088)