An algorithm for learning representations of models with scarce data
From MaRDI portal
(Redirected from An algorithm for learning representations of models with scarce data)
Recommendations
- Learning algorithms may perform worse with increasing training set size: algorithm-data incompatibility
- Learning data manifolds with a cutting plane method
- How much data is sufficient to learn high-performing algorithms? generalization guarantees for data-driven algorithm design
- Algorithmic learning and deep neural networks
- Lipschitz-regularized gradient flows and generative particle algorithms for high-dimensional scarce data
Cites work
- A theory of the learnable
- A topological view of unsupervised learning from noisy data
- Active learning
- Breast Cancer Diagnosis and Prognosis Via Linear Programming
- Complexity theoretic limitations on learning halfspaces
- Convexity, Classification, and Risk Bounds
- Cryptographic hardness for learning intersections of halfspaces
- Cryptographic limitations on learning Boolean formulae and finite automata
- Curvature Measures
- Efficient noise-tolerant learning from statistical queries
- Finding the homology of submanifolds with high confidence from random samples
- Foundations of machine learning
- Generalization in Deep Learning
- scientific article; zbMATH DE number 1728675 (Why is no real title available?)
- scientific article; zbMATH DE number 5984526 (Why is no real title available?)
- scientific article; zbMATH DE number 3149985 (Why is no real title available?)
- scientific article; zbMATH DE number 5506223 (Why is no real title available?)
- scientific article; zbMATH DE number 2080645 (Why is no real title available?)
- scientific article; zbMATH DE number 7626722 (Why is no real title available?)
- scientific article; zbMATH DE number 6276119 (Why is no real title available?)
- Inference of curvature using tubular neighborhoods
- Logistic regression, AdaBoost and Bregman distances
- Nonparametric ridge estimation
- On surrogate loss functions and \(f\)-divergences
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Online learning and online convex optimization
- Overcoming catastrophic forgetting in neural networks
- Robust topological inference: distance to a measure and kernel distance
- Scale-sensitive dimensions, uniform convergence, and learnability
- Scikit-learn: machine learning in Python
- The optimal sample complexity of PAC learning
- The true sample complexity of active learning
- Understanding machine learning. From theory to algorithms
Cited in
(1)
This page was built for publication: An algorithm for learning representations of models with scarce data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6660916)
