A theory of the learnable
From MaRDI portal
Publication:3714486
DOI10.1145/1968.1972zbMath0587.68077OpenAlexW4238893454WikidataQ29398622 ScholiaQ29398622MaRDI QIDQ3714486
Publication date: 1984
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1968.1972
Related Items
Sign-representation of Boolean functions using a small number of monomials, On universal learning algorithms, Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs, Safe learning for near-optimal scheduling, On learning width two branching programs, Learning conjunctions with noise under product distributions, PACS, simple-PAC and query learning, Learning unions of high-dimensional boxes over the reals, Interpreted and generated signals, Simple games with many effective voters, Identification of pattern languages from examples and queries, Learning regular sets from queries and counterexamples, Shared farthest neighbor approach to clustering of high dimensionality, low cardinality data, An algorithmic theory of learning: robust concepts and random projection, Probability and plurality for aggregations of learning machines, Quantifying inductive bias: AI learning algorithms and Valiant's learning framework, Occam's razor, A Boolean measure of similarity, On ordinal VC-dimension and some notions of complexity, From learning in the limit to stochastic finite learning, Learning a subclass of regular patterns in polynomial time, Paradigms of truth detection, Learning invariant features using inertial priors, Learning intersections and thresholds of halfspaces, Learning faster than promised by the Vapnik-Chervonenkis dimension, Using relevance queries for identification of read-once functions, Defaults and relevance in model-based reasoning, The Perceptron algorithm versus Winnow: linear versus logarithmic mistake bounds when few input variables are relevant, Knowing what doesn't matter: exploiting the omission of irrelevant data, Supervised learning and co-training, PAC learning, VC dimension, and the arithmetic hierarchy, On the hardness of learning intersections of two halfspaces, Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited, A time-series modeling method based on the boosting gradient-descent theory, Languages as hyperplanes: grammatical inference with string kernels, Knows what it knows: a framework for self-aware learning, Construction and learnability of canonical Horn formulas, Learning Boolean specifications, Learning random monotone DNF, The use of tail inequalities on the probable computational time of randomized search heuristics, Learning from hints in neural networks, Learning Boolean functions in \(AC^0\)on attribute and classification noise -- estimating an upper bound on attribute and classification noise, A complete characterization of statistical query learning with applications to evolvability, Reliable agnostic learning, On learning a union of half spaces, Logical analysis of data: classification with justification, Fully corrective boosting with arbitrary loss and regularization, Measuring teachability using variants of the teaching dimension, Learning indexed families of recursive languages from positive data: A survey, Algebraic methods proving Sauer's bound for teaching complexity, Kernelization of matrix updates, when and how?, Taming teams with mind changes, Securely obfuscating re-encryption, Spectral learning of weighted automata. A forward-backward perspective, Approximate inference of functional dependencies from relations, Computational aspects of monotone dualization: a brief survey, Four types of noise in data for PAC learning, Shortest consistent superstrings computable in polynomial time, Towards a mathematical theory of machine discovery from facts, Complexity of computing Vapnik-Chervonenkis dimension and some generalized dimensions, Classic learning, On the limits of proper learnability of subclasses of DNF formulas, Neural networks with quadratic VC dimension, Constraint acquisition, Three \(\sum^ P_ 2\)-complete problems in computational learning theory, On the complexity of learning strings and sequences, A machine discovery from amino acid sequences by decision trees over regular patterns, An analysis of model-based interval estimation for Markov decision processes, Evolvability via the Fourier transform, Learning read once functions using subcube parity queries, Detecting network intrusions using signal processing with query-based sampling filter, Playing monotone games to understand learning behaviors, Polynomial time learning of simple deterministic languages via queries and a representative sample, Improving optical Fourier pattern recognition by accommodating the missing information, Learning in the limit with lattice-structured hypothesis spaces, On the Fourier spectrum of symmetric Boolean functions, The geometry of quantum learning, Partial observability and learnability, Learning conditional preference networks, Fuzzy lattice reasoning (FLR) classifier and its application for ambient ozone estimation, Resource restricted computability theoretic learning: Illustrative topics and problems, Sharpening Occam's razor, Unconditional lower bounds for learning intersections of halfspaces, A theory of learning with similarity functions, Random walks for selected Boolean implication and equivalence problems, An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution, Teachability in computational learning, Separating models of learning with faulty teachers, On learning from queries and counterexamples in the presence of noise, Results on learnability and the Vapnik-Chervonenkis dimension, Prediction-preserving reducibility, Using a similarity measure for credible classification, A \(\mathbb R\)eal generalization of discrete AdaBoost, MAT learners for tree series: an abstract data type and two realizations, Parameterized learnability of juntas, Instability, complexity, and evolution, Learnability with respect to fixed distributions, Training sequences, On learning embedded midbit functions, Maximizing agreements and coagnostic learning, DNA sequencing and string learning, Learning to Recognize Three-Dimensional Objects, Sample Complexity Bounds on Differentially Private Learning via Communication Complexity, Fast Pseudorandom Functions Based on Expander Graphs, The GGM Function Family Is a Weakly One-Way Family of Functions, Bloom Filters in Adversarial Environments, Efficient Pseudorandom Functions via On-the-Fly Adaptation, Boosting the partial least square algorithm for regression modelling, Reduction from Cost-Sensitive Ordinal Ranking to Weighted Binary Classification, An inductive inference approach to classification, A framework for polynomial-time query learnability, Structural analysis of polynomial-time query learnability, Learning Weighted Automata, Discriminative Reranking for Natural Language Parsing, Abductive learning of quantized stochastic processes with probabilistic finite automata, The learnability of quantum states, Learning reliably and with one-sided error, Efficiency in the Identification in the Limit Learning Paradigm, Learning Grammars and Automata with Queries, Learning Probability Distributions Generated by Finite-State Machines, Learning Tree Languages, Separating Models of Learning with Faulty Teachers, Parameterized Learnability of k-Juntas and Related Problems, Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries, On Learning Regular Expressions and Patterns Via Membership and Correction Queries, Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries, Massive online teaching to bounded learners, Learning mixtures of spherical gaussians, Low-weight halfspaces for sparse boolean vectors, Learnability of DNF with representation-specific queries, Can theories be tested?, Making evolution rigorous, On the convergence of the Hegselmann-Krause system, Is privacy compatible with truthfulness?, Differentially private data analysis of social networks via restricted sensitivity, Characterizing the sample complexity of private learners, Barriers in cryptography with weak, correlated and leaky sources, On the possibilities and limitations of pseudodeterministic algorithms, Evasiveness through a circuit lens, The garden-hose model, Space-bounded communication complexity, Towards an optimal query efficient PCP?, A characterization of approximation resistance for even k-partite CSPs, On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction, On the power of many one-bit provers, Approaching utopia, Learning and incentives in user-generated content, Welfare maximization and the supermodular degree, Reachability in graph timelines, Runtime guarantees for regression problems, An energy complexity model for algorithms, Streaming computations with a loquacious prover, Adversary lower bound for the k-sum problem, Stronger methods of making quantum interactive proofs perfectly complete, Active self-assembly of algorithmic shapes and patterns in polylogarithmic time, An equational approach to secure multi-party computation, Publicly verifiable proofs of sequential work, On the power of nonuniformity in proofs of security, Fast reductions from RAMs to delegatable succinct constraint satisfaction problems, Resource-based corruptions and the combinatorics of hidden diversity, Time hierarchies for sampling distributions, Properties and applications of boolean function composition, Pseudo-partitions, transversality and locality, Competing provers protocols for circuit evaluation, Catch them if you can, Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints, Robust optimization in the presence of uncertainty, Sorting noisy data with partial information, New affine-invariant codes from lifting, H-wise independence, Sparse extractor families for all the entropy, On the power of conditional samples in distribution testing, Natural Language Processing, Moving from Rules to Data, Learning $$AC^0$$ Under k-Dependent Distributions, Inductive inference of context-free languages based on context-free expressions, On the relationship between diagnostic and checking tests of the read-once functions, On learning monotone Boolean functions with irrelevant variables, On the Complexity of Computing and Learning with Multiplicative Neural Networks, On some recent advances on high dimensional Bayesian statistics, Precise induction from statistical data, The functions of finite support: a canonical learning problem, Order-Revealing Encryption and the Hardness of Private Learning, On the Nonlearnability of a Single Spiking Neuron, Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas, On memoryless provers and insincere verifiers, Hybrid classification algorithms based on boosting and support vector machines, Learning Hurdles for Sleeping Experts, On Statistically Secure Obfuscation with Approximate Correctness, Random Graphs In A Neural Computation Model, Computing the Expected Edit Distance from a String to a PFA, Labeled Compression Schemes for Extremal Classes, On the Evolution of Monotone Conjunctions: Drilling for Best Approximations, An Algebraic Perspective on Boolean Function Learning, Agnostic Clustering, Learning a Random DFA from Uniform Strings and State Information, Interactive Clustering of Linear Classes and Cryptographic Lower Bounds, Bounds on the Sample Complexity for Private Learning and Private Data Release, BOOSTING-BASED FRAMEWORK FOR PORTFOLIO STRATEGY DISCOVERY AND OPTIMIZATION, SIMILARITY-BASED COMBINATION OF MULTIPLE CLUSTERINGS, An inductive method with genetic algorithm for learning phrase-structure-rule of natural language, Understanding generalization error of SGD in nonconvex optimization, Testing graphs against an unknown distribution, Learning linear PCA with convex semi-definite programming, RotEqNet: rotation-equivariant network for fluid systems with symmetric high-order tensors, Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2\)], Noisy Monte Carlo: convergence of Markov chains with approximate transition kernels, On the Vapnik-Chervonenkis dimension of computer programs which use transcendental elementary operations, Discriminative learning can succeed where generative learning fails, Exact learning from an honest teacher that answers membership queries, Revisiting Shinohara's algorithm for computing descriptive patterns, Circuit lower bounds from learning-theoretic approaches, Learning intersection-closed classes with signatures, Learning juntas in the presence of noise, On PAC learning algorithms for rich Boolean function classes, `Ideal learning' of natural language: positive results about learning from positive evidence, Guest editorial: Learning theory, Logical analysis of data -- the vision of Peter L. Hammer, Formal language identification: query learning vs. gold-style learning, Learning finite state models from recurrent neural networks, From equivalence queries to PAC learning: the case of implication theories, Off-line reasoning for on-line efficiency: knowledge bases, PALO: a probabilistic hill-climbing algorithm, Algebraic machine learning: emphasis on efficiency, PAC learning in non-linear FIR models, Minimizing depth of decision trees with hypotheses, Minimal consistent DFA from sample strings, Value iteration for simple stochastic games: stopping criterion and learning algorithm, Probably approximately optimal satisficing strategies, Noise modelling and evaluating learning from examples, On the hardness of approximate reasoning, Learning cost-sensitive active classifiers, Quantum learning Boolean linear functions w.r.t. product distributions, Tangible reduction in learning sample complexity with large classical samples and small quantum system, Logic explained networks, A quantum algorithm to estimate the Gowers \(U_2\) norm and linearity testing of Boolean functions, The unbounded-error communication complexity of symmetric functions, Gibbs posterior concentration rates under sub-exponential type losses, Learning under \(p\)-tampering poisoning attacks, On biased random walks, corrupted intervals, and learning under adversarial design, PCPs and the hardness of generating synthetic data, Learning with mitigating random consistency from the accuracy measure, Fast greedy \(\mathcal{C} \)-bound minimization with guarantees, Classification with label noise: a Markov chain sampling framework, Learning privately with labeled and unlabeled examples, Discriminative training of conditional random fields with probably submodular constraints, E-generalization using grammars, Some natural conditions on incremental learning, Learning with errors in answers to membership queries, The complexity of properly learning simple concept classes, Learning intersections of halfspaces with a margin, A general comparison of language learning from examples and from queries, Best lower bound on the probability of a binomial exceeding its expectation, Bounds on the sample complexity for private learning and private data release, Aspects of discrete mathematics and probability in the theory of machine learning, PAC-learning in the presence of one-sided classification~noise, Robust domain adaptation, Finding the homology of submanifolds with high confidence from random samples, On the mathematical foundations of learning, Exploring margin setting for good generalization in multiple class discrimination, Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms, Controlling the losing probability in a monotone game, PAC Learning under Helpful Distributions, Learning expressions and programs over monoids, A fixed-distribution PAC learning theory for neural FIR models, Improved bounds on quantum learning algorithms, Polynomial certificates for propositional classes, Getting CICY high, The theoretical analysis of FDA and applications, An algorithmic theory of learning: Robust concepts and random projection, Connectionist computations of intuitionistic reasoning, The optimal PAC bound for intersection-closed concept classes, Regression conformal prediction with random forests, The complexity of exact learning of acyclic conditional preference networks from swap examples, The power of random counterexamples, Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions, Cryptographic hardness for learning intersections of halfspaces, Efficient learning algorithms yield circuit lower bounds, A linear relation between input and first layer in neural networks, Deep learning the hyperbolic volume of a knot, Variational Monte Carlo -- bridging concepts of machine learning and high-dimensional partial differential equations, On PAC-Bayesian bounds for random forests, The teaching size: computable teachers and learners for universal languages, Learning algorithms, Probably bounded suboptimal heuristic search, Proper learning of \(k\)-term DNF formulas from satisfying assignments, Exact lower bounds for the agnostic probably-approximately-correct (PAC) machine learning model, Interpolation, the rudimentary geometry of spaces of Lipschitz functions, and geometric complexity, Mean estimation and regression under heavy-tailed distributions: A survey, Learning DNF from random walks, From Hopfield nets to recursive networks to graph machines: numerical machine learning for structured data, Learning erasing pattern languages with queries, Learning from positive and unlabeled examples, Prediction-hardness of acyclic conjunctive queries, Quantum learning of concentrated Boolean functions, Analyzing and repairing concept drift adaptation in data stream classification, Statistical active learning algorithms for noise tolerance and differential privacy, A quantum algorithm of K-means toward practical use, Conformal prediction: a unified review of theory and new challenges, Distribution-free robust linear regression, Unconfused ultraconservative multiclass algorithms, The complexity of minimizing and learning OBDDs and FBDDs, Modeling a dynamic environment using a Bayesian multiple hypothesis approach, Dynamic sizing of multilayer perceptrons, Efficient distribution-free learning of probabilistic concepts, Nonuniform learnability, On the effects of noise and speed on computations, Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach, A review of combinatorial problems arising in feedforward neural network design, A linear time equivalence test for read-twice DNF formulas, The query complexity of learning DFA, Halfspace learning, linear programming, and nonmalicious distributions, On the learnability of monotone \(k\mu\)-DNF formulae under product distributions, Approximating shortest superstrings with constraints, Adaptively secure distributed PRFs from LWE, First-order \(jk\)-clausal theories are PAC-learnable, Toward efficient agnostic learning, The learnability of description logics with equality constraints, On-line learning of rectangles and unions of rectangles, Simple learning algorithms using divide and conquer, Incorporating statistical information into expert classification systems to reduce classification costs, Learning an intersection of a constant number of halfspaces over a uniform distribution, A sufficient condition for polynomial distribution-dependent learnability, Logical analysis of numerical data, Characterizing rational versus exponential learning curves, Efficient learning of typical finite automata from random walks, On the complexity of learning from drifting distributions, Error-free and best-fit extensions of partially defined Boolean functions, A graph-theoretic result for a model of neural computation, On the value of partial information for learning from examples, Partial Occam's Razor and its applications, Efficient learning with virtual threshold gates, An efficient membership-query algorithm for learning DNF with respect to the uniform distribution, Schema induction for logic program synthesis, On convergence proofs in system identification -- a general principle using ideas from learning theory, Improved generalization via tolerant training, Logical settings for concept-learning, Approximate testing and its relationship to learning, Recent advances of grammatical inference, Probabilistic language learning under monotonicity constraints, Learning nested differences in the presence of malicious noise, Learning orthogonal F-Horn formulas, A framework for incremental learning of logic programs, PAC-learning from general examples, PAC learning of concept classes through the boundaries of their items, Permissive planning: Extending classical planning to uncertain task domains., Automatically selecting and using primary effects in planning: Theory and experiments., Complexity in the case against accuracy estimation, Identification of function distinguishable languages., Learning from examples with unspecified attribute values., Bayesian-validated computer-simulation surrogates for optimization and design: Error estimates and applications, The monotone theory for the PAC-model., Queries revisited., Learnability of quantified formulas., On learning multicategory classification with sample queries., Learning regular languages from counterexamples, The Vapnik-Chervonenkis dimension of decision trees with bounded rank, Equivalence of models for polynomial learnability, Learning elementary formal systems, Efficient learning of context-free grammars from positive structural examples, Learning in parallel, Principles of metareasoning, Inductive reasoning and Kolmogorov complexity, On the necessity of Occam algorithms, Nested annealing: A provable improvement to simulated annealing, Learning convex bodies under uniform distribution, Rank-\(r\) decision trees are a subclass of \(r\)-decision lists, Decision theoretic generalizations of the PAC model for neural net and other learning applications, Structure identification in relational data, IIPS: A framework for specifying inductive-inference problems, Bounding sample size with the Vapnik-Chervonenkis dimension, The degree of approximation of sets in euclidean space using sets with bounded Vapnik-Chervonenkis dimension, Learning approximately regular languages with reversible languages, Neural networks as systems for recognizing patterns, General bounds on statistical query learning and PAC learning with noise via hypothesis boosting, Optimal mistake bound learning is hard, Specification and simulation of statistical query algorithms for efficiency and noise tolerance, Learning with unreliable boundary queries, Learning with restricted focus of attention, Double Horn functions, An introduction to some statistical aspects of PAC learning theory, Learning dynamical systems in a stationary environment, A probabilistic framework for memory-based reasoning, Sample size lower bounds in PAC learning by Algorithmic Complexity Theory, On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems, Approximating hyper-rectangles: Learning and pseudorandom sets, PAC-learning a decision tree with pruning, An average-case optimal one-variable pattern language learner, Noise-tolerant parallel learning of geometric concepts, Synthesizers and their application to the parallel construction of pseudo-random functions, Applying MDL to learn best model granularity, On the boosting ability of top-down decision tree learning algorithms, On the learnability of rich function classes, A general frmework for supervised learning. Probably almost Bayesian algorithms, Combinatorics and connectionism, A result of Vapnik with applications, A geometric approach to leveraging weak learners, Generating logical expressions from positive and negative examples via a branch-and-bound approach, Ordered binary decision diagrams as knowledge-bases, Extremes in the degrees of inferability, Logical analysis of binary data with missing bits, Learning elementary formal systems with queries., Advanced elementary formal systems., Decision lists over regular patterns., Effects of domain characteristics on instance-based learning algorithms., PAC learning of probability distributions over a discrete domain., More efficient PAC-learning of DNF with membership queries under the uniform distribution, On learning monotone DNF under product distributions, Some connections between learning and optimization, Learning functions of \(k\) relevant variables, Construction of all non-reducible descriptors, Efficient algorithms for learning functions with bounded variation, Learning DNF in time \(2^{\widetilde O(n^{1/3})}\), Exploring crypto dark matter: new simple PRF candidates and their applications, High-dimensional penalty selection via minimum description length principle, Can PAC learning algorithms tolerate random attribute noise?, Simpler PAC-Bayesian bounds for hostile data, Testing nonlinear operators, Classification by polynomial surfaces, Autonomous theory building systems, Fusion methods for multiple sensor systems with unknown error densities, A generalization of Sauer's lemma, Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers, Learning fallible deterministic finite automata, Inductive inference in the limit of empirically adequate theories, Execution of simple similarity predicates in the DSM method for automatic generation of hypotheses, Linear codes interpolation from noisy patterns by means of a vector quantization process, Tracking concept drift using a constrained penalized regression combiner, An approach to guided learning of Boolean functions, Noise peeling methods to improve boosting algorithms, Surrogates for numerical simulations; optimization of eddy-promoter heat exchangers, Informational properties of neural nets performing algorithmic and logical tasks, The bounded injury priority method and the learnability of unions of rectangles, On the minimum number of logical clauses inferred from examples, Proofs of Work from worst-case assumptions, A theory of formal synthesis via inductive learning, An incremental learning algorithm for constructing Boolean functions from positive and negative examples, A computational learning theory of active object recognition under uncertainty, An improved lower bound on query complexity for quantum PAC learning, Learning figures with the Hausdorff metric by fractals -- towards computable binary classification, Quantum speed-up for unsupervised learning, Learning monotone nonlinear models using the Choquet integral, A comparative analysis of recent identification approaches for discrete-event systems, Learning the set covering machine by bound minimization and margin-sparsity trade-off, Polynomial regression under arbitrary product distributions, The security of machine learning, Mining probabilistic automata: a statistical view of sequential pattern mining, Bidual Horn functions and extensions, Minimum self-dual decompositions of positive dual-minor Boolean functions, Efficient algorithmic learning of the structure of permutation groups by examples, Bootstrap -- an exploration, Prokaryotic evolutionary mechanisms accelerate learning, \(P\)-sufficient statistics for PAC learning \(k\)-term-DNF formulas through enumeration, Wrapper induction: Efficiency and expressiveness, On classifier behavior in the presence of mislabeling noise, Online estimation of discrete, continuous, and conditional joint densities using classifier chains, \(L^\ast\)-based learning of Markov decision processes (extended version), The hardest halfspace, Optimization approaches to supervised classification, Algorithms for strategyproof classification, TeLEx: learning signal temporal logic from positive examples using tightness metric, Speculate-correct error bounds for \(k\)-nearest neighbor classifiers, Fourier concentration from shrinkage, Learning local transductions is hard, A new maximum margin algorithm for one-class problems and its boosting implementation, Exploring learnability between exact and PAC, New lower bounds for statistical query learning, (Machine) learning parameter regions, Evolutionary game dynamics in populations with different learners, Testing piecewise functions, Multiple-source adaptation theory and algorithms, Adaptively secure distributed PRFs from \(\mathsf{LWE}\), Classifier-based constraint acquisition, Logic-based neural networks, Arcing classifiers. (With discussion), The learnability of unions of two rectangles in the two-dimensional discretized space, Top program construction and reduction for polynomial time meta-interpretive learning, New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries, Guided inference of nested monotone Boolean functions, The PAC-learnability of planning algorithms: Investigating simple planning domains, Approximate minimization of weighted tree automata, Learning decision trees from random examples, A general lower bound on the number of examples needed for learning, Trade-off among parameters affecting inductive inference, Hardness of indentifying the minimum ordered binary decision diagram, Exact VC-dimension of Boolean monomials, A subexponential exact learning algorithm for DNF using equivalence queries, Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors), The consistency dimension and distribution-dependent learning from queries., On learning unions of pattern languages and tree patterns in the mistake bound model., PAC learning with nasty noise., On the power of incremental learning., The synthesis of language learners., Proper learning algorithm for functions of \(k\) terms under smooth distributions., On the complexity of learning for spiking neurons with temporal coding., Apple tasting., Improved lower bounds for learning from noisy examples: An information-theoretic approach, Learning fixed-dimension linear thresholds from fragmented data, Exploiting random walks for learning, Reasoning, nonmonotonicity and learning in connectionist networks that capture propositional knowledge, Variants of iterative learning, Data-driven approximation for extracting the transition dynamics of a genetic regulatory network with non-Gaussian Lévy noise, The Limitations of Optimization from Samples, On the Power of Learning from k-Wise Queries, What Circuit Classes Can Be Learned with Non-Trivial Savings?, On the hardness of approximating the minimum consistent OBDD problem, Boolean analysis of incomplete examples, Ising model selection using ℓ 1-regularized linear regression: a statistical mechanics analysis*, Approximate Degree in Classical and Quantum Computing, Concept learning by example decomposition, Unnamed Item, Unnamed Item, Quantum machine learning: a classical perspective, Watermarking Cryptographic Capabilities, Submodular Functions: Learnability, Structure, and Optimization, Unnamed Item, Ten More Years of Error Rate Research, An Asymptotic Statistical Theory of Polynomial Kernel Methods, Differentially Private Learning of Geometric Concepts, On the complexity of small description and related topics, Computability of validity and satisfiability in probability logics over finite and countable models, Constructive reinforcement learning, Unnamed Item, Unnamed Item, A theoretical framework for deep transfer learning, On Active and Passive Testing, Teaching and Compressing for Low VC-Dimension, Computing the Expected Edit Distance from a String to a Probabilistic Finite-State Automaton, Learning lipschitz functions, Shadow Tomography of Quantum States, Improving Generalization via Attribute Selection on Out-of-the-Box Data, Visual Categorization with Random Projection, Efficient and effective quantum compiling for entanglement-based machine learning on IBM Q devices, Learning nested concept classes with limited storage, Absorbing random walks and the NAE2SAT problem, New degree bounds for polynomial threshold functions, Agnostic Learning from Tolerant Natural Proofs, On the Complexity of Learning a Class Ratio from Unlabeled Data, Single-class classification with mapping convergence, Making the Most of Your Samples, Unnamed Item, Learning nonsingular phylogenies and hidden Markov models, Implementation of Boolean functions with a bounded number of zeros by disjunctive normal forms, On the complexity of compressing obfuscation, Temporal Disaggregation of Economic Time Series using Artificial Neural Networks, Input–output identification of controlled discrete manufacturing systems, Single-class classification with mapping convergence, When Errors Become the Rule, Explanatory and creative alternatives to the MDL principle, Closure properties of uniform convergence of empirical means and PAC learnability under a family of probability measures., Gaining degrees of freedom in subsymbolic learning, Learning logic programs with structured background knowledge, Monotone term decision lists, Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries, Probabilistic inductive inference: A survey, PROBLEM SOLVING WITH INSUFFICIENT RESOURCES, Optimal bounds for sign-representing the intersection of two halfspaces by polynomials, Unnamed Item, Inductive inference of unbounded unions of pattern languages from positive data, Unnamed Item, Unnamed Item, Unnamed Item, Maximizing agreements with one-sided error with applications to heuristic learning, Determination and the No-Free-Lunch Paradox, Approximating shortest superstrings with constraints, Approximation by superpositions of a sigmoidal function, Pac-learning non-recursive Prolog clauses, Improved learning of \(k\)-parities, Probabilistic Inductive Logic Programming, Maximizing agreements with one-sided error with applications to heuristic learning, Philosophical issues in Kolmogorov complexity, Computational sample complexity and attribute-efficient learning, Robust logics, BET on Independence, Pac-learning non-recursive Prolog clauses, Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds, CASCADING RANDOM WALKS, A learning algorithm for the longest common subsequence problem, Locating Errors in Faulty Formulas, Unnamed Item, Valid Generalisation from Approximate Interpolation, Experiments with AdaBoost.RT, an Improved Boosting Scheme for Regression, A Connectionist Computational Model for Epistemic and Temporal Reasoning, Hardness of approximate two-level logic minimization and PAC learning with membership queries, Learning a circuit by injecting values, The Crystallizing Substochastic Sequential Machine Extractor: CrySSMEx, Unnamed Item, Unnamed Item, Neural networks and some applications to finance, Quantum Hardness of Learning Shallow Classical Circuits, Probably Approximately Correct, Unnamed Item, Unnamed Item, O-PCF algorithm for one-class classification, Unnamed Item, Unnamed Item, Unnamed Item, Pseudorandom Functions: Three Decades Later, The Complexity of Differential Privacy, Agnostically Learning Boolean Functions with Finite Polynomial Representation, High-Dimensional Data Classification, On (simple) decision tree rank, Grammatical inference: An old and new paradigm, On approximately identifying concept classes in the limit, From undecidability of non-triviality and finiteness to undecidability of learnability, Framework for learning and control in the classical and quantum domains, On the non-efficient PAC learnability of conjunctive queries, Simulating teams with many conjectures, Simple PAC learning of simple decision lists, An optimal algorithm for proper learning of unions of two rectangles with queries, Is there a role for statistics in artificial intelligence?, Almost optimal proper learning and testing polynomials, Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu, How to describe the spatial near-far relations among concepts?, On computing probabilistic abductive explanations, The power of natural properties as oracles, Adversarial manifold estimation, Homomorphic encryption: a mathematical survey, User-friendly Introduction to PAC-Bayes Bounds, PAC learning halfspaces in non-interactive local differential privacy model with public unlabeled data, Learning picture sets from examples, PAC privacy: automatic privacy measurement and control of data processing, A survey of model learning techniques for recurrent neural networks, Invariant inference with provable complexity from the monotone theory, Richness fallacy, SAT-based invariant inference and its relation to concept learning, Exact learning of subclasses of CDNF formulas with membership queries, Unnamed Item, Learning orthogonal F-Horn formulas, Learning nested differences in the presence of malicious noise, Almost Optimal Testers for Concise Representations., Pseudorandom generators without the XOR lemma, Improved bounds on the sample complexity of learning, Agnostic learning of geometric patterns, Recommendation systems: A probabilistic analysis, Towards intelligent image retrieval, Decision lists and related Boolean functions, Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions, Aspects of complexity of probabilistic learning under monotonicity constraints, Complexity of learning in artificial neural networks, Probabilistic learnability of context-free grammars with basic distributional properties from positive examples
