Pages that link to "Item:Q1106669"
From MaRDI portal
The following pages link to Quantifying inductive bias: AI learning algorithms and Valiant's learning framework (Q1106669):
Displaying 39 items.
- Constraint acquisition (Q511791) (← links)
- Hyperrelations in version space (Q707236) (← links)
- Prediction-preserving reducibility (Q756441) (← links)
- Version spaces and the consistency problem (Q814597) (← links)
- Learning decision trees with taxonomy of propositionalized attributes (Q955830) (← links)
- Sharpening Occam's razor (Q1007542) (← links)
- Parameterized learnability of juntas (Q1034613) (← links)
- Partial Occam's Razor and its applications (Q1127393) (← links)
- System design and evaluation using discrete event simulation with AI (Q1129321) (← links)
- Embedding decision-analytic control in a learning architecture (Q1182163) (← links)
- Principles of metareasoning (Q1187348) (← links)
- Decision theoretic generalizations of the PAC model for neural net and other learning applications (Q1198550) (← links)
- Reasoning about model accuracy (Q1199915) (← links)
- Bounding sample size with the Vapnik-Chervonenkis dimension (Q1209149) (← links)
- Specification and simulation of statistical query algorithms for efficiency and noise tolerance (Q1271551) (← links)
- Combinatorics and connectionism (Q1313821) (← links)
- A result of Vapnik with applications (Q1314333) (← links)
- Theory refinement combining analytical and empirical methods (Q1327162) (← links)
- Iterative versionspaces (Q1337690) (← links)
- The minimum feature set problem (Q1338270) (← links)
- A sufficient condition for polynomial distribution-dependent learnability (Q1364775) (← links)
- Solving the multiple instance problem with axis-parallel rectangles. (Q1399120) (← links)
- A computational study on the performance of artificial neural networks under changing structural design and data distribution (Q1600897) (← links)
- The complexity of theory revision (Q1606294) (← links)
- Learning decision trees from random examples (Q1823009) (← links)
- A general lower bound on the number of examples needed for learning (Q1823011) (← links)
- Scaling, machine learning, and genetic neural nets (Q1823720) (← links)
- A reduction algorithm meeting users' requirements. (Q1850684) (← links)
- Autonomous theory building systems (Q1897404) (← links)
- Shifting vocabulary bias in speedup learning (Q1900986) (← links)
- An approach to guided learning of Boolean functions (Q1910784) (← links)
- Learning the set covering machine by bound minimization and margin-sparsity trade-off (Q1959549) (← links)
- Finite electro-elasticity with physics-augmented neural networks (Q2083132) (← links)
- PALO: a probabilistic hill-climbing algorithm (Q2171267) (← links)
- On the fusion of threshold classifiers for categorization and dimensionality reduction (Q2513348) (← links)
- Noise modelling and evaluating learning from examples (Q2674201) (← links)
- DNA sequencing and string learning (Q3445271) (← links)
- Advanced discretization techniques for hyperelastic physics-augmented neural networks (Q6062433) (← links)
- Nonlinear electro-elastic finite element analysis with neural network constitutive models (Q6497139) (← links)
