The following pages link to Occam's razor (Q1108056):
Displayed 50 items.
- Minimal consistent DFA from sample strings (Q2182675) (← links)
- Learning under \(p\)-tampering poisoning attacks (Q2202514) (← links)
- Learning higher-order logic programs (Q2203320) (← links)
- Logical reduction of metarules (Q2203321) (← links)
- On Pareto-optimal Boolean logical patterns for numerical data (Q2242805) (← links)
- Infotropism as the underlying principle of perceptual organization (Q2263970) (← links)
- Learning juntas in the presence of noise (Q2382279) (← links)
- On PAC learning algorithms for rich Boolean function classes (Q2382283) (← links)
- Data separation via a finite number of discriminant functions: a global optimization approach (Q2383778) (← links)
- Suboptimal behavior of Bayes and MDL in classification under misspecification (Q2384137) (← links)
- Quantum adiabatic machine learning (Q2393692) (← links)
- The complexity of properly learning simple concept classes (Q2462500) (← links)
- Inference of regular languages using state merging algorithms with search (Q2485087) (← links)
- Boosted ARTMAP: modifications to fuzzy ARTMAP motivated by boosting theory (Q2507302) (← links)
- Agnostic active learning (Q2517826) (← links)
- On the influence of the variable ordering for algorithmic learning using OBDDs (Q2568437) (← links)
- On the hardness of approximating the minimum consistent acyclic DFA and decision diagram. (Q2583554) (← links)
- (Q2711697) (← links)
- Introducing new predicates to model scientific revolution (Q2713343) (← links)
- PAC Learning under Helpful Distributions (Q2771492) (← links)
- Labeled Compression Schemes for Extremal Classes (Q2830265) (← links)
- Massive online teaching to bounded learners (Q2986853) (← links)
- Learning mixtures of spherical gaussians (Q2986854) (← links)
- Low-weight halfspaces for sparse boolean vectors (Q2986855) (← links)
- Learnability of DNF with representation-specific queries (Q2986856) (← links)
- Can theories be tested? (Q2986857) (← links)
- Making evolution rigorous (Q2986858) (← links)
- On the convergence of the Hegselmann-Krause system (Q2986859) (← links)
- Is privacy compatible with truthfulness? (Q2986860) (← links)
- Differentially private data analysis of social networks via restricted sensitivity (Q2986861) (← links)
- Characterizing the sample complexity of private learners (Q2986862) (← links)
- Barriers in cryptography with weak, correlated and leaky sources (Q2986863) (← links)
- On the possibilities and limitations of pseudodeterministic algorithms (Q2986864) (← links)
- Evasiveness through a circuit lens (Q2986865) (← links)
- The garden-hose model (Q2986866) (← links)
- Space-bounded communication complexity (Q2986867) (← links)
- Towards an optimal query efficient PCP? (Q2986868) (← links)
- A characterization of approximation resistance for even k-partite CSPs (Q2986869) (← links)
- On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction (Q2986870) (← links)
- On the power of many one-bit provers (Q2986871) (← links)
- Approaching utopia (Q2986872) (← links)
- Learning and incentives in user-generated content (Q2986873) (← links)
- Welfare maximization and the supermodular degree (Q2986874) (← links)
- Reachability in graph timelines (Q2986875) (← links)
- Runtime guarantees for regression problems (Q2986877) (← links)
- An energy complexity model for algorithms (Q2986878) (← links)
- Streaming computations with a loquacious prover (Q2986880) (← links)
- Adversary lower bound for the k-sum problem (Q2986881) (← links)
- Stronger methods of making quantum interactive proofs perfectly complete (Q2986882) (← links)
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time (Q2986885) (← links)