Realizable learning is all you need
From MaRDI portal
Publication:6566462
Cites work
- scientific article; zbMATH DE number 1804109 (Why is no real title available?)
- scientific article; zbMATH DE number 3446442 (Why is no real title available?)
- 10.1162/153244302760200704
- A Characterization of Strong Learnability in the Statistical Query Model
- A discriminative model for semi-supervised learning
- A metric entropy bound is not sufficient for learnability
- A theory of the learnable
- Adversarial laws of large numbers and optimal regret in online classification
- Approximate correlation clustering using same-cluster queries
- Characterizing the sample complexity of private learners
- Closure properties of uniform convergence of empirical means and PAC learnability under a family of probability measures.
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Efficient distribution-free learning of probabilistic concepts
- Efficient noise-tolerant learning from statistical queries
- Fat-shattering and the learnability of real-valued functions
- Improved bounds on the sample complexity of learning
- Improving predictive inference under covariate shift by weighting the log-likelihood function
- Learnability and the Vapnik-Chervonenkis dimension
- Learnability with respect to fixed distributions
- Learnability, stability and uniform convergence
- Learning decision rules for pattern classification under a family of probability measures
- Learning from multiple sources
- Learning in the Presence of Malicious Errors
- Learning privately with labeled and unlabeled examples
- Loss minimization and parameter estimation with heavy tails
- Minimax analysis of active learning
- Multiclass learnability and the ERM principle
- On agnostic learning of parities, monomials, and halfspaces
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Private PAC learning implies finite Littlestone dimension
- Private learning and sanitization: pure vs. approximate differential privacy
- Sample-efficient strategies for learning in the presence of noise
- The weighted majority algorithm
- What can we learn privately?
This page was built for publication: Realizable learning is all you need
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566462)
