The following pages link to Vitaly Feldman (Q439988):
Displaying 18 items.
- A complete characterization of statistical query learning with applications to evolvability (Q439989) (← links)
- Separating models of learning with faulty teachers (Q1017667) (← links)
- Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions (Q2290687) (← links)
- Statistical active learning algorithms for noise tolerance and differential privacy (Q2345952) (← links)
- The complexity of properly learning simple concept classes (Q2462500) (← links)
- (Q2788415) (← links)
- Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas (Q2816303) (← links)
- (Q2880876) (← links)
- On the Complexity of Random Satisfiability Problems with Planted Solutions (Q2941491) (← links)
- Preserving Statistical Validity in Adaptive Data Analysis (Q2941495) (← links)
- The reusable holdout: Preserving validity in adaptive data analysis (Q2961909) (← links)
- (Q3148825) (← links)
- (Q3174124) (← links)
- Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces (Q3189646) (← links)
- Experience-Induced Neural Circuits That Achieve High Capacity (Q3399355) (← links)
- Sample Complexity Bounds on Differentially Private Learning via Communication Complexity (Q3454521) (← links)
- Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization (Q4575825) (← links)
- On the Power of Learning from k-Wise Queries (Q4638095) (← links)
