PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Feldman, Vitaly"

Author of the publication

copydeleteadd this publication to your clipboard
The Everlasting Database: Statistical Validity at a Fair Price.

, , , and . NeurIPS, page 6532-6541. (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Feldman, Vitaly
add a person with the name Feldman, Vitaly
 

Other publications of authors with the same name

Optimal bounds on approximation of submodular and XOS functions by juntas., and . ITA, page 1-10. IEEE, (2014)Learnability and Automatizability., , , , and . FOCS, page 621-630. IEEE Computer Society, (2004)Sample Complexity Bounds on Differentially Private Learning via Communication Complexity., and . SIAM J. Comput., 44 (6): 1740-1764 (2015)Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas., and . SIAM J. Comput., 45 (3): 1129-1170 (2016)Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces., , , and . J. ACM, 61 (2): 11:1-11:36 (2014)On The Power of Membership Queries in Agnostic Learning.. Electronic Colloquium on Computational Complexity (ECCC), (2008)New Results for Learning Noisy Parities and Halfspaces., , , and . Electronic Colloquium on Computational Complexity (ECCC), (2006)On Attribute Efficient and Non-adaptive Learning of Parities and DNF Expressions.. Electronic Colloquium on Computational Complexity (ECCC), (2006)Statistical Algorithms and a Lower Bound for Planted Clique., , , , and . Electronic Colloquium on Computational Complexity (ECCC), (2012)Nearly Tight Bounds on ℓ1 Approximation of Self-Bounding Functions., , and . CoRR, (2014)