Pages that link to "Item:Q5305870"
From MaRDI portal
The following pages link to Learning Theory and Kernel Machines (Q5305870):
Displaying 13 items.
- Random arithmetic formulas can be reconstructed efficiently (Q488050) (← links)
- Learning sparse multivariate polynomials over a field with queries and counterexamples. (Q960464) (← links)
- Simplicial complexes and Macaulay's inverse systems (Q966451) (← links)
- Learning matrix functions over rings (Q1271196) (← links)
- Interval conjectures for level Hilbert functions (Q2390481) (← links)
- Cryptographic hardness for learning intersections of halfspaces (Q2517820) (← links)
- Efficient learning algorithms yield circuit lower bounds (Q2517822) (← links)
- (Q3002772) (← links)
- On the degree two entry of a Gorenstein $h$-vector and a conjecture of Stanley (Q3518232) (← links)
- (Q5089246) (← links)
- Learning a circuit by injecting values (Q5891929) (← links)
- Arithmetic circuits, structured matrices and (not so) deep learning (Q6109070) (← links)
- Categories of Differentiable Polynomial Circuits for Machine Learning (Q6393524) (← links)
