The following pages link to Occam's razor (Q1108056):
Displaying 45 items.
- Stronger methods of making quantum interactive proofs perfectly complete (Q2986882) (← links)
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time (Q2986885) (← links)
- An equational approach to secure multi-party computation (Q2986886) (← links)
- Publicly verifiable proofs of sequential work (Q2986887) (← links)
- On the power of nonuniformity in proofs of security (Q2986888) (← links)
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems (Q2986889) (← links)
- Resource-based corruptions and the combinatorics of hidden diversity (Q2986890) (← links)
- Time hierarchies for sampling distributions (Q2986891) (← links)
- Properties and applications of boolean function composition (Q2986892) (← links)
- Pseudo-partitions, transversality and locality (Q2986893) (← links)
- Competing provers protocols for circuit evaluation (Q2986894) (← links)
- Catch them if you can (Q2986895) (← links)
- Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints (Q2986896) (← links)
- Robust optimization in the presence of uncertainty (Q2986897) (← links)
- Sorting noisy data with partial information (Q2986898) (← links)
- New affine-invariant codes from lifting (Q2986899) (← links)
- H-wise independence (Q2986900) (← links)
- Sparse extractor families for all the entropy (Q2986901) (← links)
- On the power of conditional samples in distribution testing (Q2986902) (← links)
- HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT (Q3021972) (← links)
- Russell and Wittgenstein on Occam’s Razor (Q3295781) (← links)
- Optimally Trained Regression Trees and Occam’s Razor (Q3298732) (← links)
- DNA sequencing and string learning (Q3445271) (← links)
- Parameterized Learnability of k-Juntas and Related Problems (Q3520054) (← links)
- The gap between abstract and concrete results in machine learning (Q4009244) (← links)
- (Q4040899) (← links)
- Reconstructing Algebraic Functions from Mixed Data (Q4210162) (← links)
- Coding Ockham's Razor (Q4583135) (← links)
- Teaching and Compressing for Low VC-Dimension (Q4604393) (← links)
- Testing by Implicit Learning: A Brief Survey (Q4933369) (← links)
- Constructive reinforcement learning (Q4952979) (← links)
- (Q5092472) (← links)
- (Q5373689) (← links)
- Occam’s Hammer (Q5432429) (← links)
- Fit without fear: remarkable mathematical phenomena of deep learning through the prism of interpolation (Q5887828) (← links)
- Maximizing agreements with one-sided error with applications to heuristic learning (Q5916204) (← links)
- Computational sample complexity and attribute-efficient learning (Q5918064) (← links)
- Maximizing agreements with one-sided error with applications to heuristic learning (Q5921687) (← links)
- Decision tree approximations of Boolean functions (Q5958322) (← links)
- Backpropagation neural tree (Q6072502) (← links)
- Some models are useful, but how do we know which ones? Towards a unified Bayesian model taxonomy (Q6185714) (← links)
- Short Boolean formulas as explanations in practice (Q6545522) (← links)
- On the failings of Shapley values for explainability (Q6577659) (← links)
- A deep learning -- genetic algorithm approach for aerodynamic inverse design via optimization of pressure distribution (Q6588345) (← links)
- Bootstrapping complex time-to-event data without individual patient data, with a view toward time-dependent exposures (Q6625162) (← links)
