Refined Rademacher chaos complexity bounds with applications to the multikernel learning problem

DOI10.1162/NECO_A_00566MaRDI QIDQ5378343zbMATH OpenOpenAlexWikidataFDO

Authors Yunwen Lei, Lixin Ding

Publication date 12 June 2019

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1162/neco_a_00566

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Rademacher Chaos Complexities for Learning the Kernel Problem
• Local Rademacher complexities
• Refined generalization bounds of gradient learning over reproducing kernel Hilbert spaces
• Rademacher Margin Complexity
• On the convergence rate of \(l_{p}\)-norm multiple kernel learning

Cites work

• 10.1162/153244302760200713
• 10.1162/153244303321897690
• Advanced Lectures on Machine Learning
• An introduction to support vector machines and other kernel-based learning methods.
• Convexity, Classification, and Risk Bounds
• Error Analysis of Coefficient-Based Regularized Algorithm for Density-Level Detection
• Fast rates for support vector machines using Gaussian kernels
• scientific article; zbMATH DE number 5957287 (Why is no real title available?)
• scientific article; zbMATH DE number 1254560 (Why is no real title available?)
• scientific article; zbMATH DE number 1950575 (Why is no real title available?)
• Learnability of Gaussians with flexible variances
• Learning Bounds for Support Vector Machines with Learned Kernels
• Learning rates of multi-kernel regularized regression
• Learning the kernel function via regularization
• Learning the kernel matrix with semidefinite programming
• Learning Theory
• Multi-kernel regularized classifiers
• Neural Network Learning
• New approaches to statistical learning theory
• On ranking and generalization bounds
• On the mathematical foundations of learning
• Rademacher Chaos Complexities for Learning the Kernel Problem
• Statistical behavior and consistency of classification methods based on convex risk minimization.
• Support vector machine soft margin classifiers: error analysis
• The covering number in learning theory
• Uniform Central Limit Theorems
• Weak convergence and empirical processes. With applications to statistics

Cited in

(2)

• Rademacher Chaos Complexities for Learning the Kernel Problem
• Refined generalization bounds of gradient learning over reproducing kernel Hilbert spaces

This page was built for publication: Refined Rademacher chaos complexity bounds with applications to the multikernel learning problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5378343)