pith. machine review for the scientific record. sign in

Vitaly Feldman

Identifiers

No identifiers captured yet.

Papers (36)

  1. Cram Less to Fit More: Training Data Pruning Improves Memorization of Facts cs.CL · 2026 · author #2
  2. The advantages of multiple classes for reducing overfitting from test set reuse cs.LG · 2019 · author #1
  3. High probability generalization bounds for uniformly stable algorithms with nearly optimal rate cs.LG · 2019 · author #1
  4. Generalization Bounds for Uniformly Stable Algorithms cs.LG · 2018 · author #1
  5. Privacy Amplification by Iteration cs.LG · 2018 · author #1
  6. Privacy-preserving Prediction cs.LG · 2018 · author #2
  7. The Everlasting Database: Statistical Validity at a Fair Price cs.LG · 2018 · author #2
  8. Calibrating Noise to Variance in Adaptive Data Analysis cs.LG · 2017 · author #1
  9. Generalization for Adaptively-chosen Estimators via Stable Median cs.LG · 2017 · author #1
  10. On the Power of Learning from $k$-Wise Queries cs.LG · 2017 · author #1
  11. Dealing with Range Anxiety in Mean Estimation via Statistical Queries cs.LG · 2016 · author #1
  12. Generalization of ERM in Stochastic Convex Optimization: The Dimension Strikes Back cs.LG · 2016 · author #1
  13. A General Characterization of the Statistical Query Complexity cs.LG · 2016 · author #1
  14. Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization cs.LG · 2015 · author #1
  15. Generalization in Adaptive Data Analysis and Holdout Reuse cs.LG · 2015 · author #2
  16. Tight Bounds on Low-degree Spectral Concentration of Submodular and XOS functions cs.DS · 2015 · author #1
  17. Sorting and Selection with Imprecise Comparisons cs.DS · 2015 · author #2
  18. Preserving Statistical Validity in Adaptive Data Analysis cs.LG · 2014 · author #2
  19. Subsampled Power Iteration: a Unified Algorithm for Block Models and Planted CSP's cs.DS · 2014 · author #1
  20. Agnostic Learning of Disjunctions on Symmetric Distributions cs.LG · 2014 · author #1
  21. Approximate resilience, monotonicity, and the complexity of agnostic learning cs.LG · 2014 · author #2
  22. Tight Bounds on $\ell_1$ Approximation and Learning of Self-Bounding Functions cs.LG · 2014 · author #1
  23. Sample Complexity Bounds on Differentially Private Learning via Communication Complexity cs.DS · 2014 · author #1
  24. On the Complexity of Random Satisfiability Problems with Planted Solutions cs.CC · 2013 · author #1
  25. Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas cs.DS · 2013 · author #1
  26. Statistical Active Learning Algorithms for Noise Tolerance and Differential Privacy cs.LG · 2013 · author #2
  27. Learning Coverage Functions and Private Release of Marginals cs.LG · 2013 · author #1
  28. Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees cs.LG · 2013 · author #1
  29. Learning using Local Membership Queries cs.LG · 2012 · author #2
  30. Nearly optimal solutions for the Chow Parameters Problem and low-weight approximation of halfspaces cs.CC · 2012 · author #3
  31. Learning DNF Expressions from Fourier Spectrum cs.LG · 2012 · author #1
  32. Statistical Algorithms and a Lower Bound for Detecting Planted Clique cs.CC · 2012 · author #1
  33. Distribution-Independent Evolvability of Linear Threshold Functions cs.LG · 2011 · author #1
  34. Agnostic Learning of Monomials by Halfspaces is Hard cs.CC · 2010 · author #1
  35. A Complete Characterization of Statistical Query Learning with Applications to Evolvability cs.CC · 2010 · author #1
  36. Distribution-Specific Agnostic Boosting cs.LG · 2009 · author #1

Mentions

No mention provenance yet.

Frequent Coauthors