Toward efficient agnostic learning
From MaRDI portal
Publication:1342730
DOI10.1007/BF00993468zbMath0938.68797OpenAlexW4214821481MaRDI QIDQ1342730
Linda M. Sellie, Robert E. Schapire, Michael Kearns
Publication date: 21 June 2000
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00993468
Related Items
Efficient distribution-free learning of probabilistic concepts, Learning conjunctions with noise under product distributions, Some connections between learning and optimization, Efficient algorithms for learning functions with bounded variation, Oracle inequalities for the Lasso in the high-dimensional Aalen multiplicative intensity model, Sample Complexity Bounds on Differentially Private Learning via Communication Complexity, Approximate Degree in Classical and Quantum Computing, On the complexity of function learning, Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces, \(L_{p}\)-norm Sauer-Shelah lemma for margin multi-category classifiers, Exploiting label dependencies for improved sample complexity, Proofs of Work from worst-case assumptions, Self-improved gaps almost everywhere for the agnostic approximation of monomials, Computability of validity and satisfiability in probability logics over finite and countable models, Rationality and intelligence, Supervised box clustering, On approximately identifying concept classes in the limit, Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu, Knows what it knows: a framework for self-aware learning, Unnamed Item, On the difficulty of approximately maximizing agreements., Indistinguishable predictions and multi-group fair learning, PAC learning halfspaces in non-interactive local differential privacy model with public unlabeled data, Voting rules as error-correcting codes, PEBBL: an object-oriented framework for scalable parallel branch and bound, Rates of convergence in active learning, Simple Iterative Heuristics for Correlation Clustering, On biased random walks, corrupted intervals, and learning under adversarial design, Hierarchical design of fast minimum disagreement algorithms, A complete characterization of statistical query learning with applications to evolvability, Reliable agnostic learning, A new column generation algorithm for logical analysis of data, Polynomial regression under arbitrary product distributions, Towards a proof of the Fourier-entropy conjecture?, Learning $$AC^0$$ Under k-Dependent Distributions, Bayesian model averaging: A tutorial. (with comments and a rejoinder)., Agnostic Learning from Tolerant Natural Proofs, Robust Estimators in High-Dimensions Without the Computational Intractability, PAC-learning in the presence of one-sided classification~noise, On the complexity of compressing obfuscation, Surrogate losses in passive and active learning, A note on the inapproximability of correlation clustering, Learning local transductions is hard, Agnostic learning of geometric patterns, Tolerant property testing and distance approximation, Comments on: Support vector machines maximizing geometric margins for multi-class classification, Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions, An Improved Branch-and-Bound Method for Maximum Monomial Agreement, Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas, Prediction, learning, uniform convergence, and scale-sensitive dimensions, Learning with restricted focus of attention, Learning Hurdles for Sleeping Experts, Agnostic Clustering, Hierarchical Design of Fast Minimum Disagreement Algorithms, Unnamed Item, A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis, Exact lower bounds for the agnostic probably-approximately-correct (PAC) machine learning model, Clustering with qualitative information, Learning with queries corrupted by classification noise, Sparsistency and agnostic inference in sparse PCA, PAC learning with nasty noise., On the complexity of learning for spiking neurons with temporal coding., Unnamed Item, On the robustness of randomized classifiers to adversarial examples, Agnostically Learning Boolean Functions with Finite Polynomial Representation, Maximizing agreements and coagnostic learning
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- A learning criterion for stochastic rules
- Central limit theorems for empirical measures
- Tracking drifting concepts by minimizing disagreements
- A Markovian extension of Valiant's learning model
- Learning in the Presence of Malicious Errors
- Constant depth circuits, Fourier transform, and learnability
- Recent Developments in Nonparametric Density Estimation
- Learnability and the Vapnik-Chervonenkis dimension
- A theory of the learnable
- Computational limitations on learning from examples
- Density estimation by stochastic complexity
- Cryptographic limitations on learning Boolean formulae and finite automata
- Probability Inequalities for Sums of Bounded Random Variables
- Convergence of stochastic processes
