Pages that link to "Item:Q5307576"
From MaRDI portal
The following pages link to Uniform-Distribution Learnability of Noisy Linear Threshold Functions with Restricted Focus of Attention (Q5307576):
Displaying 6 items.
- A polynomial-time algorithm for learning noisy linear threshold functions (Q1271190) (← links)
- On restricted-focus-of-attention learnability of Boolean functions (Q1383194) (← links)
- Learning fixed-dimension linear thresholds from fragmented data (Q1854473) (← links)
- Polynomial regression under arbitrary product distributions (Q1959600) (← links)
- A robust Khintchine inequality, and algorithms for computing optimal constants in Fourier analysis and high-dimensional geometry (Q2808162) (← links)
- Agnostic Learning from Tolerant Natural Proofs (Q5002638) (← links)
