Pages that link to "Item:Q1823011"
From MaRDI portal
The following pages link to A general lower bound on the number of examples needed for learning (Q1823011):
Displaying 22 items.
- Smart PAC-learners (Q2431423) (← links)
- Complexity parameters for first order classes (Q2433181) (← links)
- Aspects of discrete mathematics and probability in the theory of machine learning (Q2478432) (← links)
- Improved bounds on quantum learning algorithms (Q2491374) (← links)
- Shifting: one-inclusion mistake bounds and sample compression (Q2517823) (← links)
- Bounding Embeddings of VC Classes into Maximum Classes (Q2805735) (← links)
- Theory of Classification: a Survey of Some Recent Advances (Q3373749) (← links)
- Bounds on the Sample Complexity for Private Learning and Private Data Release (Q3408209) (← links)
- A Uniform Lower Error Bound for Half-Space Learning (Q3529911) (← links)
- Smart PAC-Learners (Q3648763) (← links)
- Neural Nets with Superlinear VC-Dimension (Q4323332) (← links)
- Learning reliably and with one-sided error (Q4327384) (← links)
- Precise induction from statistical data (Q4421242) (← links)
- (Q4633018) (← links)
- On the Capabilities of Higher-Order Neurons: A Radial Basis Function Approach (Q4673536) (← links)
- Improving random forest algorithm by Lasso method (Q5033957) (← links)
- (Q5214238) (← links)
- Deep learning: a statistical viewpoint (Q5887827) (← links)
- Inductive logic programming (Q5895240) (← links)
- Computational sample complexity and attribute-efficient learning (Q5918064) (← links)
- Robust logics (Q5918074) (← links)
- Gaining degrees of freedom in subsymbolic learning (Q5941074) (← links)
