Efficient distribution-free learning of probabilistic concepts
From MaRDI portal
Recommendations
Cites work
- A learning criterion for stochastic rules
- A theory of the learnable
- Central limit theorems for empirical measures
- Computational limitations on learning from examples
- Convergence of stochastic processes
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Equivalence of models for polynomial learnability
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- Fuzzy sets
- scientific article; zbMATH DE number 432830 (Why is no real title available?)
- scientific article; zbMATH DE number 3880135 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 48454 (Why is no real title available?)
- scientific article; zbMATH DE number 67635 (Why is no real title available?)
- scientific article; zbMATH DE number 3436645 (Why is no real title available?)
- Learnability and the Vapnik-Chervonenkis dimension
- Occam's razor
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Probability Inequalities for Sums of Bounded Random Variables
- Toward efficient agnostic learning
Cited in
(61)- Maximal width learning of binary functions
- A graph-theoretic generalization of the Sauer-Shelah lemma
- Scale-sensitive dimensions and skeleton estimates for classification
- Prediction, learning, uniform convergence, and scale-sensitive dimensions
- Learning with restricted focus of attention
- Efficient distribution-free population learning of simple concepts
- On the boosting ability of top-down decision tree learning algorithms
- On-line maximum likelihood prediction with respect to general loss functions
- Approximation and learning of convex superpositions
- Learning from examples with unspecified attribute values.
- Approximate location of relevant variables under the crossover distribution.
- Structural results about exact learning with unspecified attribute values
- Learnability in Hilbert spaces with reproducing kernels
- Robust regression using biased objectives
- Learning fixed-dimension linear thresholds from fragmented data
- PAC learning of probability distributions over a discrete domain.
- Efficient algorithms for learning functions with bounded variation
- Uniform approximation of Vapnik-Chervonenkis classes
- Optimal approximation rate of ReLU networks in terms of width and depth
- Primal and dual combinatorial dimensions
- Nonlinear approximation via compositions
- On biased random walks, corrupted intervals, and learning under adversarial design
- Sequential complexities and uniform martingale laws of large numbers
- Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions
- Efficient learning with robust gradient descent
- Exact lower bounds for the agnostic probably-approximately-correct (PAC) machine learning model
- \(L_{p}\)-norm Sauer-Shelah lemma for margin multi-category classifiers
- Aspects of discrete mathematics and probability in the theory of machine learning
- Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
- An algorithmic theory of learning: Robust concepts and random projection
- Integer cells in convex sets
- Learning cost-sensitive active classifiers
- scientific article; zbMATH DE number 1706378 (Why is no real title available?)
- On martingale extensions of Vapnik-Chervonenkis theory with applications to online learning
- On the learnability of discrete distributions
- Sample Complexity of Classifiers Taking Values in ℝQ, Application to Multi-Class SVMs
- Probably Approximate Learning over Classes of Distributions
- Knows what it knows: a framework for self-aware learning
- Robustness and generalization
- scientific article; zbMATH DE number 1081131 (Why is no real title available?)
- scientific article; zbMATH DE number 2080445 (Why is no real title available?)
- Making decision trees feasible in ultrahigh feature and label dimensions
- An easy-to-hard learning paradigm for multiple classes and multiple labels
- Visual stability analysis for model selection in graded possibilistic clustering
- Efficiently learning structured distributions from untrusted batches
- Deep Network Approximation for Smooth Functions
- Deep network approximation characterized by number of neurons
- Margin error bounds for support vector machines on reproducing kernel Banach spaces
- Data reduction for weighted and outlier-resistant clustering
- Computational sample complexity and attribute-efficient learning
- A note on a scale-sensitive dimension of linear bounded functionals in Banach spaces
- Regularization and statistical learning theory for data analysis.
- Comments on: Support vector machines maximizing geometric margins for multi-class classification
- Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu
- Realizable learning is all you need
- An improved uniform convergence bound with fat-shattering dimension
- Isotropic kernel machine
- Learning stochastic decision trees
- Prediction-preserving reducibility
- An algorithmic theory of learning: robust concepts and random projection
- Partial observability and learnability
This page was built for publication: Efficient distribution-free learning of probabilistic concepts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329154)
