The following pages link to Vitaly Feldman (Q439988):
Displaying 38 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)
- Separating Models of Learning with Faulty Teachers (Q3520052) (← links)
- On Agnostic Learning of Parities, Monomials, and Halfspaces (Q3558016) (← links)
- Sorting and Selection with Imprecise Comparisons (Q3638022) (← links)
- Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization (Q4575825) (← links)
- On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186) (← links)
- On the Power of Learning from k-Wise Queries (Q4638095) (← links)
- Statistical Algorithms and a Lower Bound for Detecting Planted Cliques (Q4640281) (← links)
- (Q4645666) (← links)
- (Q4645673) (← links)
- 10.1162/153244302760200669 (Q4779559) (← links)
- Agnostic Learning of Monomials by Halfspaces Is Hard (Q4910575) (← links)
- Private stochastic convex optimization: optimal rates in linear time (Q5144932) (← links)
- Interaction is necessary for distributed learning with privacy or communication constraints (Q5144933) (← links)
- Does learning require memorization? a short tale about a long tail (Q5144980) (← links)
- A Complete Characterization of Statistical Query Learning with Applications to Evolvability (Q5171187) (← links)
- Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity (Q5236340) (← links)
- (Q5302086) (← links)
- Approximate resilience, monotonicity, and the complexity of agnostic learning (Q5363038) (← links)
- Learning Theory (Q5473638) (← links)
- Statistical algorithms and a lower bound for detecting planted cliques (Q5495836) (← links)
- Hardness of approximate two-level logic minimization and PAC learning with membership queries (Q5891926) (← links)
- Hardness of approximate two-level logic minimization and PAC learning with membership queries (Q5920702) (← links)
