A theory of the learnable
From MaRDI portal
Publication:3714486
Recommendations
Cited in
(only showing first 100 items - show all)- PAC privacy: automatic privacy measurement and control of data processing
- E-generalization using grammars
- Decision lists over regular patterns.
- Prediction-hardness of acyclic conjunctive queries
- Learning erasing pattern languages with queries
- A geometric approach to leveraging weak learners
- The complexity of minimizing and learning OBDDs and FBDDs
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\)
- Arcing classifiers. (With discussion)
- The bounded injury priority method and the learnability of unions of rectangles
- A framework for polynomial-time query learnability
- Approximate inference of functional dependencies from relations
- Shadow tomography of quantum states
- Online estimation of discrete, continuous, and conditional joint densities using classifier chains
- Gaining degrees of freedom in subsymbolic learning
- On memoryless provers and insincere verifiers
- Bidual Horn functions and extensions
- Learning to Recognize Three-Dimensional Objects
- A time-series modeling method based on the boosting gradient-descent theory
- Languages as hyperplanes: grammatical inference with string kernels
- Construction and learnability of canonical Horn formulas
- The garden-hose model
- Wrapper induction: Efficiency and expressiveness
- Computing the expected edit distance from a string to a probabilistic finite-state automaton
- Recommendation systems: A probabilistic analysis
- Reasoning, nonmonotonicity and learning in connectionist networks that capture propositional knowledge
- The synthesis of language learners.
- A statistical approach to learning constraints
- Evasiveness through a circuit lens (extended abstract)
- Reprint of: Some thoughts about transfer learning. What role for the source domain?
- Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group
- Exploring margin setting for good generalization in multiple class discrimination
- Efficient and effective quantum compiling for entanglement-based machine learning on IBM Q devices
- Noisy Monte Carlo: convergence of Markov chains with approximate transition kernels
- Simple games with many effective voters
- Polynomial time learning of simple deterministic languages via queries and a representative sample
- Differentially private data analysis of social networks via restricted sensitivity
- On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction
- On the power of nonuniformity in proofs of security
- Playing monotone games to understand learning behaviors
- Generating logical expressions from positive and negative examples via a branch-and-bound approach
- Applying MDL to learn best model granularity
- Space-bounded communication complexity
- A Bayesian framework for learning rule sets for interpretable classification
- scientific article; zbMATH DE number 1966600 (Why is no real title available?)
- Sign-representation of Boolean functions using a small number of monomials
- Learning and incentives in user-generated content: multi-armed bandits with endogenous arms
- Neural networks as systems for recognizing patterns
- Classifier-based constraint acquisition
- Learning a circuit by injecting values
- Hardness of indentifying the minimum ordered binary decision diagram
- Exact VC-dimension of Boolean monomials
- A Boolean measure of similarity
- Probabilistic Inductive Logic Programming
- Finding the homology of submanifolds with high confidence from random samples
- Visual categorization with random projection
- Inductive inference of context-free languages based on context-free expressions
- Learning indexed families of recursive languages from positive data: A survey
- Evolutionary game dynamics in populations with different learners
- Tangible reduction in learning sample complexity with large classical samples and small quantum system
- Paradigms of truth detection
- The learnability of unions of two rectangles in the two-dimensional discretized space
- Aspects of complexity of probabilistic learning under monotonicity constraints
- Classic learning
- Speculate-correct error bounds for \(k\)-nearest neighbor classifiers
- Learning a Random DFA from Uniform Strings and State Information
- The use of tail inequalities on the probable computational time of randomized search heuristics
- A subexponential exact learning algorithm for DNF using equivalence queries
- Submodular functions: learnability, structure, and optimization
- An algorithmic theory of learning: robust concepts and random projection
- Can PAC learning algorithms tolerate random attribute noise?
- Parameterized learnability of juntas
- Using a similarity measure for credible classification
- Learning in the limit with lattice-structured hypothesis spaces
- Learning regular sets from queries and counterexamples
- Off-line reasoning for on-line efficiency: knowledge bases
- An introduction to some statistical aspects of PAC learning theory
- A probabilistic framework for memory-based reasoning
- PAC-learning a decision tree with pruning
- Noise-tolerant parallel learning of geometric concepts
- Streaming computations with a loquacious prover
- Construction of all non-reducible descriptors
- On learning a union of half spaces
- On universal learning algorithms
- Characterizing rational versus exponential learning curves
- A theory of formal synthesis via inductive learning
- PAC learning of concept classes through the boundaries of their items
- How to grow a mind: statistics, structure, and abstraction
- Adaptively secure distributed PRFs from LWE
- Exploring crypto dark matter: new simple PRF candidates and their applications
- High-dimensional penalty selection via minimum description length principle
- First-order \(jk\)-clausal theories are PAC-learnable
- Conformal prediction: a unified review of theory and new challenges
- The monotone theory for the PAC-model.
- On learning multicategory classification with sample queries.
- Approximation by superpositions of a sigmoidal function
- Experiments with AdaBoost.RT, an Improved Boosting Scheme for Regression
- Learning faster than promised by the Vapnik-Chervonenkis dimension
- Testing \(k\)-monotonicity
- Simultaneous private learning of multiple concepts
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)
