( en | de | ru )

 

Disambiguation of "Feldman, Vitaly"

Author of the publication

copydeleteadd this publication to your clipboard
PAC learning with stable and private predictions.

, and . CoRR, (2019)

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.

Jon Feldman

Vitaly Raev

Vitaly Alexandrov

Vitaly Teterin

Aleksandar Feldman

 

Other publications of authors with the same name

Encode, Shuffle, Analyze Privacy Revisited: Formalizations and Empirical Evaluation., , , , , , and . CoRR, (2020)Optimal bounds on approximation of submodular and XOS functions by juntas., and . ITA, page 1-10. IEEE, (2014)Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas., and . SIAM J. Comput., 45 (3): 1129-1170 (2016)Sample Complexity Bounds on Differentially Private Learning via Communication Complexity., and . SIAM J. Comput., 44 (6): 1740-1764 (2015)Nearly Tight Bounds on ℓ1 Approximation of Self-Bounding Functions., , and . CoRR, (2014)Learning without Interaction Requires Separation., and . CoRR, (2018)Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces., , , and . J. ACM, 61 (2): 11:1-11:36 (2014)Separating Models of Learning with Faulty Teachers., , and . ALT, volume 4754 of Lecture Notes in Computer Science, page 94-106. Springer, (2007)On Attribute Efficient and Non-adaptive Learning of Parities and DNF Expressions.. COLT, volume 3559 of Lecture Notes in Computer Science, page 576-590. Springer, (2005)On Using Extended Statistical Queries to Avoid Membership Queries., and . COLT/EuroCOLT, volume 2111 of Lecture Notes in Computer Science, page 529-545. Springer, (2001)