Pages that link to "Item:Q3558021"

The following pages link to Hardness of Learning Halfspaces with Noise (Q3558021):

Displaying 10 items.

• On the hardness of learning intersections of two halfspaces (Q619909) (← links)
• Approximating maximum satisfiable subsystems of linear equations of bounded width (Q963367) (← links)
• Polynomial regression under arbitrary product distributions (Q1959600) (← links)
• Stronger data poisoning attacks break data sanitization defenses (Q2127214) (← links)
• Robust classification via MOM minimization (Q2203337) (← links)
• Complexity and approximability of parameterized MAX-CSPs (Q2408203) (← links)
• Regret minimization in online Bayesian persuasion: handling adversarial receiver's types under full and partial feedback models (Q2680788) (← links)
• Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
• (Q5053206) (← links)
• Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)