Contact Information

Vitaly Feldman
Research scientist
Almaden Research Center, San Jose, CA, USA

Tab navigation

I'm a research scientist in CS Theory Group at IBM Almaden Research Center.

Before joining IBM in Aug 2007 I spent 5 very enjoyable years at Harvard University as a PhD student advised by Leslie Valiant and as a postdoc.

Previously I studied at the Technion from which I received BA and MSc in CS (advised by Nader Bshouty) and worked at IBM Research in Haifa.


My research interests are primarily in Machine Learning Theory and Computational Complexity. I'm particularly interested in questions in the overlap of these areas. I also work on understanding of natural learning systems: learning by the brain and evolution as learning. This work is based on the models pioneered by Leslie Valiant (brain, evolvability).

Here are some of my recent works, Ph.D. thesis and surveys and complete list of publications (with abstracts).

Recent/upcoming activities:

Recent/upcoming conference program committees:

Slides for some recent talks:

  • Adaptive Data Analysis without Overfitting. @Workshop on Learning. NUS, 2015: slides.
  • Preserving statistical validity in adaptive data analysis. @STOC 2015: slides.
  • Approximate resilience, monotonicity, and the complexity of agnostic learning. @SODA 2015: slides.
  • Sample complexity bounds on differentially private learning via communication complexity. @COLT 2014 and ITA 2015: slides.
  • Using data privacy for better adaptive predictions. Foundations of Learning Theory workshop @COLT 2014 : slides.
  • On the power and the limits of evolvability. Simons Institute workshop on Computational Theories of Evolution, 2014: slides.
  • Optimal bounds on approximation of submodular and XOS functions by juntas. Simons Institute workshop on Real Analysis at @FOCS 2013 : slides.

Recent work


  1. Statistical Query Algorithms for Stochastic Convex Optimization.
    With Cristobal Guzman and Santosh Vempala. Preprint, Dec. 2015.
  2. The reusable holdout: Preserving validity in adaptive data analysis.
    With Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold and Aaron Roth. Science, 2015.
    Based on STOC and NIPS papers below. See also my post on this work at IBM Research blog.
  3. Generalization in Adaptive Data Analysis and Holdout Reuse.
    With Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold and Aaron Roth. NIPS, 2015.
  4. Preserving Statistical Validity in Adaptive Data Analysis.
    With Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold and Aaron Roth. STOC 2015 . Invited to Comm. of the ACM; Invited to SICOMP special issue on STOC.
  5. Subsampled Power Iteration: a Unified Algorithm for Block Models and Planted CSP's .
    With Will Perkins and Santosh Vempala. NIPS 2015.
  6. Tight Bounds on Low-degree Spectral Concentration of Submodular and XOS Functions.
    With Jan Vondrak. FOCS 2015 .
  7. On the Complexity of Random Satisfiability Problems with Planted Solutions .
    With Will Perkins and Santosh Vempala. STOC 2015 .
  8. Nearly Tight Bounds on ℓ1 Approximation of Self-Bounding Functions.
    With Pravesh Kothari and Jan Vondrak. Preprint. Apr, 2014 .
  9. Agnostic Learning of Disjunctions on Symmetric Distributions.
    With Pravesh Kothari. JMLR 2015 (to appear) .
  10. Approximate resilience, monotonicity, and the complexity of agnostic learning .
    With Dana Dachman-Soled, Li-Yang Tan, Andrew Wan and Karl Wimmer. SODA, 2015 .
  11. The Statistical Query Complexity of Learning Sparse Halfspaces.
    Open Problem at COLT 2014.
  12. Learning Coverage Functions and Private Release of Marginals.
    With Pravesh Kothari. COLT 2014.
  13. Sample Complexity Bounds on Differentially Private Learning via Communication Complexity .
    With David Xiao. COLT 2014, SICOMP 2015 (to appear).
  14. Statistical Active Learning Algorithms for Noise Tolerance and Differential Privacy.
    With Nina Balcan. NIPS 2013 . Algorithmica. Special Issue on New Theoretical Challenges in Machine Learning (by invitation)
  15. Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas.
    With Jan Vondrak. FOCS 2013 . SICOMP 2015 (to appear), Special Issue on FOCS (by invitation)
  16. Learning using Local Membership Queries.
    With Pranjal Awasthi and Varun Kanade. COLT 2013, Best Student (Co-authored) Paper Award .
  17. Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees.
    With Pravesh Kothari and Jan Vondrak. COLT 2013 .
  18. Provenance-based Dictionary Refinement in Information Extraction.
    With Sudeepa Roy, Laura Chiticariu, Frederick Reiss and Huaiyu Zhu. SIGMOD 2013 .
  19. Statistical Algorithms and a Lower Bound for Detecting Planted Cliques.
    With Elena Grigorescu, Lev Reyzin, Santosh Vempala and Ying Xiao. STOC 2013 . Full version updated in 2015.
  20. Computational Bounds on Statistical Query Learning.
    With Varun Kanade. COLT 2012.
  21. Learning DNF Expressions from Fourier Spectrum.
    COLT 2012.
  22. Nearly Optimal Solutions for the Chow Parameters Problem and Low-weight Approximation of Halfspaces.
    With Anindya De, Ilias Diakonikolas and Rocco Servedio. STOC 2012; JACM 2014 .
  23. Distribution-Independent Evolvability of Linear Threshold Functions.
    COLT 2011.
  24. Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas.
    With Homin Lee and Rocco Servedio. COLT 2011.
  25. Distribution-Specific Agnostic Boosting.
    ITCS (formerly ICS) 2010.
  26. Agnostic Learning of Monomials by Halfspaces is Hard.
    With Venkatesan Guruswami, Prasad Raghavendra and Yi Wu. FOCS 2009; SICOMP 2012 .
  27. A Complete Characterization of Statistical Query Learning with Applications to Evolvability.
    FOCS 2009; JCSS 2012 (by invitation).
  28. Sorting and Selection with Imprecise Comparisons.
    With Miklos Ajtai, Avinatan Hassidim and Jelani Nelson. ICALP A, 2009; TALG 2015
  29. Robustness of Evolvability.
    COLT 2009.
  30. Experience-Induced Neural Circuits That Achieve High Capacity..
    With Leslie Valiant. Neural Computation 21:10, 2009.
  31. On The Power of Membership Queries in Agnostic Learning.
    COLT 2008; JMLR 10, 2009
  32. The Learning Power of Evolution.
    With Leslie Valiant. Open Problems/New Directions at COLT 2008.
  33. Evolvability from Learning Algorithms.
    STOC 2008.
  34. Separating Models of Learning with Faulty Teachers.
    With Shrenik Shah. ALT 2007; TCS 410(19), 2009 (by invitation)
  35. New Results for Learning Noisy Parities and Halfspaces.
    With Parikshit Gopalan, Subhash Khot, and Ashok Ponnuswami. FOCS 2006; SICOMP 39(2), 2009 (by invitation)
  36. Optimal Hardness Results for Maximizing Agreements with Monomials.
    CCC 2006; SICOMP 39(2), 2009 (by invitation)
  37. Hardness of Approximate Two-level Logic Minimization and PAC Learning with Membership Queries.
    STOC 2006; JCSS 75(1), 2009 (by invitation)
  38. Attribute Efficient and Non-adaptive Learning of Parities and DNF Expressions.
    COLT 2005, Best Student Paper Award; JMLR 8, 2007 (by invitation)
  39. The Complexity of Properly Learning Simple Concept Classes.
    With Misha Alekhnovich, Mark Braverman, Adam Klivans, and Toni Pitassi.
    FOCS 2004; JCSS 74(1), 2008 (by invitation)

Invited articles and surveys:

  1. Guilt Free Data Reuse.
    With Cynthia Dwork, Moritz Hardt, Toniann Pitassi, Omer Reingold and Aaron Roth. Communications of the ACM. Research Highlights (to appear)
  2. Hardness of Proper Learning.
    The Encyclopedia of Algorithms. Springer-Verlag, 2015 (2nd ed.) and 2008 (1st ed.)
  3. Statistical Query Learning.
    The Encyclopedia of Algorithms. Springer-Verlag, 2015 (2nd ed.) and 2008 (1st ed.)
  4. Structure and Learning of Valuation Functions
    With Jan Vondrak. ACM SIGecom Exchanges 12.2

Ph.D. thesis: Efficiency and Computational Limitations of Learning Algorithms. Harvard University. January 2007

A bit more about me

I spend a lot of time in the wonderful company of Polina, Aviv and Milan. I enjoy mountain biking, photography, ballroom dancing, skiing, drinking tea and visiting Paris.