A theory of the learnable
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Inductive inference in the limit of empirically adequate theories
- Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
- Prediction-preserving reducibility
- Supervised learning and co-training
- Belief in dependence: leveraging atomic linearity in data bits for rethinking generalized linear models
- Improved generalization via tolerant training
- Cryptographic hardness for learning intersections of halfspaces
- An average-case optimal one-variable pattern language learner
- Constructive reinforcement learning
- A sufficient condition for polynomial distribution-dependent learnability
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
- PCPs and the hardness of generating synthetic data
- Logic-based neural networks
- Fourier concentration from shrinkage
- \(L^\ast\)-based learning of Markov decision processes (extended version)
- The hardest halfspace
- Contextual quick-learning and generalization by humans and machines
- On the minimum number of logical clauses inferred from examples
- An analysis of model-based interval estimation for Markov decision processes
- Learning fixed-dimension linear thresholds from fragmented data
- scientific article; zbMATH DE number 4166885 (Why is no real title available?)
- Proper learning algorithm for functions of k terms under smooth distributions.
- Learning DNF from random walks
- User-friendly Introduction to PAC-Bayes Bounds
- Learning grammars and automata with queries
- Sorting noisy data with partial information
- Classification by polynomial surfaces
- Principles of metareasoning
- Optimal quantum sample complexity of learning algorithms
- On the possibilities and limitations of pseudodeterministic algorithms
- Getting CICY high
- scientific article; zbMATH DE number 7250147 (Why is no real title available?)
- A model of concept formation.
- scientific article; zbMATH DE number 4080897 (Why is no real title available?)
- Sample complexity bounds on differentially private learning via communication complexity
- Hardness of learning Boolean functions from label proportions
- scientific article; zbMATH DE number 67636 (Why is no real title available?)
- When errors become the rule: twenty years with transformation-based learning
- Compositional sparsity of learnable functions
- MAT learners for tree series: an abstract data type and two realizations
- An inductive method with genetic algorithm for learning phrase-structure-rule of natural language
- Input-output identification of controlled discrete manufacturing systems
- Three \(\sum^ P_ 2\)-complete problems in computational learning theory
- Boosting simple learners
- Evolvability via the Fourier transform
- An Algebraic Perspective on Boolean Function Learning
- Perfect indistinguishability obfuscation for Boolean polynomial vector spaces via learning
- scientific article; zbMATH DE number 7559055 (Why is no real title available?)
- Learning fallible deterministic finite automata
- Precise induction from statistical data
- The functions of finite support: a canonical learning problem
- Learning orthogonal F-Horn formulas
- Learning from examples with unspecified attribute values.
- Detecting network intrusions using signal processing with query-based sampling filter
- Learning \(\mathrm{AC}^0\) under \(k\)-dependent distributions
- Quantum learning of concentrated Boolean functions
- Approximate testing and its relationship to learning
- PAC-learning from general examples
- Learning Modal Theories
- scientific article; zbMATH DE number 7164746 (Why is no real title available?)
- Learning with mitigating random consistency from the accuracy measure
- Fast greedy \(\mathcal{C} \)-bound minimization with guarantees
- Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs
- Safe learning for near-optimal scheduling
- BET on independence
- An Asymptotic Statistical Theory of Polynomial Kernel Methods
- Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
- Interpolation, the rudimentary geometry of spaces of Lipschitz functions, and geometric complexity
- From Hopfield nets to recursive networks to graph machines: numerical machine learning for structured data
- Absorbing random walks and the NAE2SAT problem
- Approximating shortest superstrings with constraints
- Computational limitations on learning from examples
- Learnability of quantified formulas.
- On computing probabilistic abductive explanations
- Equivalence of models for polynomial learnability
- Learning a subclass of regular patterns in polynomial time
- The degree of approximation of sets in euclidean space using sets with bounded Vapnik-Chervonenkis dimension
- Learning orthogonal F-Horn formulas
- Learning convex bodies under uniform distribution
- Geometric problems in machine learning
- A tighter generalization bound for reservoir computing
- Constrained pseudorandom functions for inner-product predicates from weaker assumptions
- Three fundamental concepts of the capacity of learning machines
- Hybrid classification algorithms based on boosting and support vector machines
- Automatically selecting and using primary effects in planning: Theory and experiments.
- Exact lower bounds for the agnostic probably-approximately-correct (PAC) machine learning model
- Permissive planning: Extending classical planning to uncertain task domains.
- The learnability of quantum states
- Prokaryotic evolutionary mechanisms accelerate learning
- Bayesian-validated computer-simulation surrogates for optimization and design: Error estimates and applications
- Analyzing robustness of Angluin's L^* algorithm in presence of noise
- An optimal algorithm for proper learning of unions of two rectangles with queries
- Partial observability and learnability
- Learning privately with labeled and unlabeled examples
- Realizable learning is all you need
- Testing piecewise functions
- Instability, complexity, and evolution
- On-line learning of rectangles and unions of rectangles
- The learnability of description logics with equality constraints
- Teaching and Compressing for Low VC-Dimension
This page was built for publication: A theory of the learnable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3714486)
