Occam's razor
From MaRDI portal
Publication:1108056
DOI10.1016/0020-0190(87)90114-1zbMath0653.68084OpenAlexW2070902649MaRDI QIDQ1108056
Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth, Anselm Blumer
Publication date: 1987
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(87)90114-1
Related Items
The DNF exception problem, Efficient distribution-free learning of probabilistic concepts, Nonuniform learnability, Generalization bounds for averaged classifiers, Learning Boolean concepts in the presence of many irrelevant features, On learning width two branching programs, Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis, Pareto-optimal patterns in logical analysis of data, Learning functions of \(k\) relevant variables, Unnamed Item, The MIN PFS problem and piecewise linear model estimation, Feature selection for support vector machines using generalized Benders decomposition, Learning juntas in the presence of noise, On PAC learning algorithms for rich Boolean function classes, Data separation via a finite number of discriminant functions: a global optimization approach, Suboptimal behavior of Bayes and MDL in classification under misspecification, Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers, Learning fallible deterministic finite automata, Ockham's razor in interval identification, Quantifying inductive bias: AI learning algorithms and Valiant's learning framework, Quantum adiabatic machine learning, Surrogate modeling for fluid flows based on physics-constrained deep learning without simulation data, Selection of relevant features and examples in machine learning, Partial Occam's Razor and its applications, An efficient membership-query algorithm for learning DNF with respect to the uniform distribution, Minimal consistent DFA from sample strings, Automatically selecting and using primary effects in planning: Theory and experiments., Learning under \(p\)-tampering poisoning attacks, Learning higher-order logic programs, Logical reduction of metarules, Path loss prediction in urban environment using learning machines and dimensionality reduction techniques, Learning the set covering machine by bound minimization and margin-sparsity trade-off, 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, Introducing new predicates to model scientific revolution, The Vapnik-Chervonenkis dimension of decision trees with bounded rank, Equivalence of models for polynomial learnability, The complexity of properly learning simple concept classes, Learning in parallel, Four types of noise in data for PAC learning, On Pareto-optimal Boolean logical patterns for numerical data, On the necessity of Occam algorithms, Inference of regular languages using state merging algorithms with search, PAC Learning under Helpful Distributions, Infotropism as the underlying principle of perceptual organization, Compact MILP models for optimal and Pareto-optimal LAD patterns, The complexity of Euler's integer partition theorem, Exploring learnability between exact and PAC, Partial observability and learnability, Boosted ARTMAP: modifications to fuzzy ARTMAP motivated by boosting theory, Keeping pace with criminals: an extended study of designing patrol allocation against adaptive opportunistic criminals, Agnostic active learning, Sharpening Occam's razor, Top program construction and reduction for polynomial time meta-interpretive learning, Prediction-preserving reducibility, The quest of parsimonious XAI: a human-agent architecture for explanation formulation, Double Horn functions, The PAC-learnability of planning algorithms: Investigating simple planning domains, MILP approach to pattern generation in logical analysis of data, Labeled Compression Schemes for Extremal Classes, PAC-learning a decision tree with pruning, Learning decision trees from random examples, A general lower bound on the number of examples needed for learning, Parameterized learnability of juntas, On cognitive preferences and the plausibility of rule-based models, On the influence of the variable ordering for algorithmic learning using OBDDs, Apple tasting., On the hardness of approximating the minimum consistent acyclic DFA and decision diagram., Learnability with respect to fixed distributions, PAC-learning gains of Turing machines over circuits and neural networks, Logical analysis of binary data with missing bits, Consistency-based search in feature selection, Maximizing agreements and coagnostic learning, Fit without fear: remarkable mathematical phenomena of deep learning through the prism of interpolation, DNA sequencing and string learning, The gap between abstract and concrete results in machine learning, Constructive reinforcement learning, Backpropagation neural tree, Compression schemes for concept classes induced by three types of discrete undirected graphical models, Some models are useful, but how do we know which ones? Towards a unified Bayesian model taxonomy, Teaching and Compressing for Low VC-Dimension, Parameterized Learnability of k-Juntas and Related Problems, 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, Optimally Trained Regression Trees and Occam’s Razor, HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT, Testing by Implicit Learning: A Brief Survey, Unnamed Item, Maximizing agreements with one-sided error with applications to heuristic learning, Decision tree approximations of Boolean functions, Maximizing agreements with one-sided error with applications to heuristic learning, Computational sample complexity and attribute-efficient learning, Reconstructing Algebraic Functions from Mixed Data
Cites Work
