Aspects of discrete mathematics and probability in the theory of machine learning

DOI10.1016/J.DAM.2007.05.040MaRDI QIDQ2478432zbMATH OpenOpenAlexFDO

Authors Martin Anthony

Publication date 28 March 2008

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2007.05.040

zbMATH Keywords

concentration of measurecovering numbersmachine learninguniform Glivenko-Cantelli theoremsVapnik-Chervonenkis dimension

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• New approaches to statistical learning theory
• scientific article; zbMATH DE number 2018619
• Statistical learning theory: A primer
• Statistical learning theory: models, concepts, and results
• scientific article; zbMATH DE number 2115052

Cites work

• 10.1162/153244303768966111
• A combinatorial problem; stability and order for models and theories in infinitary languages
• A general lower bound on the number of examples needed for learning
• A sharp concentration inequality with applications
• A theory of the learnable
• Central limit theorems for empirical measures
• Combinatorial methods in density estimation
• Concentration inequalities using the entropy method
• Convergence of stochastic processes
• Decision theoretic generalizations of the PAC model for neural net and other learning applications
• Efficient distribution-free learning of probabilistic concepts
• Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
• Existence of submatrices with all possible columns
• scientific article; zbMATH DE number 2089353 (Why is no real title available?)
• scientific article; zbMATH DE number 2089354 (Why is no real title available?)
• scientific article; zbMATH DE number 1804106 (Why is no real title available?)
• scientific article; zbMATH DE number 4170917 (Why is no real title available?)
• scientific article; zbMATH DE number 3957109 (Why is no real title available?)
• scientific article; zbMATH DE number 53984 (Why is no real title available?)
• scientific article; zbMATH DE number 3436645 (Why is no real title available?)
• scientific article; zbMATH DE number 1950575 (Why is no real title available?)
• scientific article; zbMATH DE number 926775 (Why is no real title available?)
• scientific article; zbMATH DE number 1391397 (Why is no real title available?)
• Learnability and the Vapnik-Chervonenkis dimension
• Neural Network Learning
• On the density of families of sets
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks
• Probability Inequalities for Sums of Bounded Random Variables
• Scale-sensitive dimensions, uniform convergence, and learnability
• Some limit theorems for empirical processes (with discussion)
• Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
• Structural risk minimization over data-dependent hierarchies
• The Glivenko-Cantelli problem
• The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network
• Uniform Central Limit Theorems
• Weak convergence and empirical processes. With applications to statistics

Cited in

(4)

• Some connections between learning and optimization
• Generalization error bounds for the logical analysis of data
• An improved analysis of the Rademacher data-dependent bound using its self bounding property
• Appropriate Data Density Models in Probabilistic Machine Learning Approaches for Data Analysis

This page was built for publication: Aspects of discrete mathematics and probability in the theory of machine learning

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