Pages that link to "Item:Q5363038"

The following pages link to Approximate resilience, monotonicity, and the complexity of agnostic learning (Q5363038):

Displaying 9 items.

• Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions (Q2290687) (← links)
• BKW meets Fourier new algorithms for LPN with sparse parities (Q2697880) (← links)
• On the Power of Learning from k-Wise Queries (Q4638095) (← links)
• Agnostic Learning of Monomials by Halfspaces Is Hard (Q4910575) (← links)
• Agnostic Learning in Permutation-Invariant Domains (Q4962625) (← links)
• Agnostic Learning from Tolerant Natural Proofs (Q5002638) (← links)
• Theory and Applications of Models of Computation (Q5898878) (← links)
• Aspects of complexity of probabilistic learning under monotonicity constraints (Q5958648) (← links)
• Adversarial manifold estimation (Q6118078) (← links)