Rademacher Chaos Complexities for Learning the Kernel Problem
From MaRDI portal
Publication:3057230
DOI10.1162/NECO_A_00028zbMATH Open1208.68190DBLPjournals/neco/YingC10WikidataQ51665656 ScholiaQ51665656MaRDI QIDQ3057230FDOQ3057230
Authors: Yiming Ying, Colin Campbell 
Publication date: 24 November 2010
Published in: Neural Computation (Search for Journal in Brave)
Recommendations
- Refined Rademacher chaos complexity bounds with applications to the multikernel learning problem
- Learning theory of randomized Kaczmarz algorithm
- Rademacher complexity for Markov chains: applications to kernel smoothing and Metropolis-Hastings
- 10.1162/153244303321897690
- scientific article; zbMATH DE number 1804106
- Researches on Rademacher complexities in statistical learning theory: a survey
- Rademacher Margin Complexity
- Estimates of the approximation error using Rademacher complexity: Learning vector-valued functions
- Stochastic complexity in learning
- Multiple spectral kernel learning and a Gaussian complexity computation
Nonparametric regression and quantile regression (62G08) Learning and adaptive systems in artificial intelligence (68T05)
Cites Work
- Learning Theory
- Statistical behavior and consistency of classification methods based on convex risk minimization.
- Local Rademacher complexities
- Optimal rates for the regularized least-squares algorithm
- Ranking and empirical minimization of \(U\)-statistics
- 10.1162/153244303321897690
- Convexity, Classification, and Risk Bounds
- Choosing multiple parameters for support vector machines
- Rademacher penalties and structural risk minimization
- Rademacher averages and phase transitions in Glivenko-Cantelli classes
- Shannon sampling and function reconstruction from point values
- Neural Network Learning
- Learning and approximation by Gaussians on Riemannian manifolds
- Multi-kernel regularized classifiers
- Fast rates for support vector machines using Gaussian kernels
- Model selection for regularized least-squares algorithm in learning theory
- Limit theorems for \(U\)-processes
- Learning Bounds for Support Vector Machines with Learned Kernels
- Scale-sensitive dimensions, uniform convergence, and learnability
Cited In (8)
- Generalization bounds for metric and similarity learning
- On the optimal estimation of probability measures in weak and strong topologies
- Refined Rademacher Chaos Complexity Bounds with Applications to the Multikernel Learning Problem
- Error Analysis of Coefficient-Based Regularized Algorithm for Density-Level Detection
- U-Processes and Preference Learning
- Modeling interactive components by coordinate kernel polynomial models
- Permutational Rademacher Complexity
- Towards learning optimized kernels for complex Langevin
This page was built for publication: Rademacher Chaos Complexities for Learning the Kernel Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3057230)
