Vitaly Feldman
Orcid: 000000023904759XAffiliations:
 IBM Almaden Research Center
According to our database^{1},
Vitaly Feldman
authored at least 106 papers
between 2000 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on zbmath.org

on orcid.org
On csauthors.net:
Bibliography
2024
CoRR, 2024
Proceedings of the IEEE Conference on Secure and Trustworthy Machine Learning, 2024
Private Vector Mean Estimation in the Shuffle Model: Optimal Rates Require Many Messages.
Proceedings of the Fortyfirst International Conference on Machine Learning, 2024
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024
2023
CoRR, 2023
CoRR, 2023
Stronger Privacy Amplification by Shuffling for Renyi and Approximate Differential Privacy.
Proceedings of the 2023 ACMSIAM Symposium on Discrete Algorithms, 2023
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
Proceedings of the International Conference on Machine Learning, 2023
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023
2022
CoRR, 2022
CoRR, 2022
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022
Proceedings of the International Conference on Machine Learning, 2022
Proceedings of the International Conference on Machine Learning, 2022
2021
Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization.
Math. Oper. Res., 2021
Interaction is Necessary for Distributed Learning with Privacy or Communication Constraints.
J. Priv. Confidentiality, 2021
CoRR, 2021
When is memorization of irrelevant training data necessary for highaccuracy learning?
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021
Proceedings of the 38th International Conference on Machine Learning, 2021
Proceedings of the 38th International Conference on Machine Learning, 2021
Hiding Among the Clones: A Simple and Nearly Optimal Analysis of Privacy Amplification by Shuffling.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021
2020
Tight bounds on <i>ℓ</i><sub>1</sub> approximation and learning of selfbounding functions.
Theor. Comput. Sci., 2020
Encode, Shuffle, Analyze Privacy Revisited: Formalizations and Empirical Evaluation.
CoRR, 2020
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
What Neural Networks Memorize and Why: Discovering the Long Tail via Influence Estimation.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
Proceedings of the Conference on Learning Theory, 2020
2019
Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity.
Proceedings of the Thirtieth Annual ACMSIAM Symposium on Discrete Algorithms, 2019
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019
Proceedings of the 36th International Conference on Machine Learning, 2019
High probability generalization bounds for uniformly stable algorithms with nearly optimal rate.
Proceedings of the Conference on Learning Theory, 2019
Proceedings of the Conference on Learning Theory, 2019
Open Problem: Is Margin Sufficient for NonInteractive Private Distributed Learning?
Proceedings of the Conference on Learning Theory, 2019
2018
SIAM J. Comput., 2018
CoRR, 2018
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018
Proceedings of the Conference On Learning Theory, 2018
Proceedings of the Conference On Learning Theory, 2018
2017
J. ACM, 2017
Commun. ACM, 2017
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017
Proceedings of the 30th Conference on Learning Theory, 2017
Proceedings of the 30th Conference on Learning Theory, 2017
Tight Bounds on ℓ<sub>1</sub> Approximation and Learning of SelfBounding Functions.
Proceedings of the International Conference on Algorithmic Learning Theory, 2017
Proceedings of the International Conference on Algorithmic Learning Theory, 2017
2016
Encyclopedia of Algorithms, 2016
Encyclopedia of Algorithms, 2016
ACM Trans. Algorithms, 2016
SIAM J. Comput., 2016
Generalization of ERM in Stochastic Convex Optimization: The Dimension Strikes Back.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016
Proceedings of the 29th Conference on Learning Theory, 2016
2015
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity.
SIAM J. Comput., 2015
J. Mach. Learn. Res., 2015
CoRR, 2015
Statistical Active Learning Algorithms for Noise Tolerance and Differential Privacy.
Algorithmica, 2015
Proceedings of the FortySeventh Annual ACM on Symposium on Theory of Computing, 2015
Proceedings of the TwentySixth Annual ACMSIAM Symposium on Discrete Algorithms, 2015
Subsampled Power Iteration: a Unified Algorithm for Block Models and Planted CSP's.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015
Tight Bounds on LowDegree Spectral Concentration of Submodular and XOS Functions.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015
2014
CoRR, 2014
CoRR, 2014
Proceedings of The 27th Conference on Learning Theory, 2014
Proceedings of The 27th Conference on Learning Theory, 2014
2013
SIGecom Exch., 2013
CoRR, 2013
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2013
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 58, 2013
Cognitive computing building block: A versatile and efficient digital neuron model for neurosynaptic cores.
Proceedings of the 2013 International Joint Conference on Neural Networks, 2013
Representation, Approximation and Learning of Submodular Functions Using Lowrank Decision Trees.
Proceedings of the COLT 2013, 2013
Proceedings of the COLT 2013, 2013
2012
SIAM J. Comput., 2012
Proceedings of the COLT 2012, 2012
Proceedings of the COLT 2012, 2012
A complete characterization of statistical query learning with applications to evolvability.
J. Comput. Syst. Sci., 2012
Electron. Colloquium Comput. Complex., 2012
Nearly optimal solutions for the Chow Parameters Problem and lowweight approximation of halfspaces.
Electron. Colloquium Comput. Complex., 2012
CoRR, 2012
2011
Proceedings of the COLT 2011, 2011
2010
Electron. Colloquium Comput. Complex., 2010
Proceedings of the Innovations in Computer Science, 2010
2009
Theor. Comput. Sci., 2009
SIAM J. Comput., 2009
Neural Comput., 2009
Hardness of approximate twolevel logic minimization and PAC learning with membership queries.
J. Comput. Syst. Sci., 2009
Proceedings of the COLT 2009, 2009
2008
Proceedings of the Encyclopedia of Algorithms  2008 Edition, 2008
Proceedings of the Encyclopedia of Algorithms  2008 Edition, 2008
J. Comput. Syst. Sci., 2008
Electron. Colloquium Comput. Complex., 2008
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008
Proceedings of the 21st Annual Conference on Learning Theory, 2008
2007
Proceedings of the Algorithmic Learning Theory, 18th International Conference, 2007
2006
Electron. Colloquium Comput. Complex., 2006
Electron. Colloquium Comput. Complex., 2006
Electron. Colloquium Comput. Complex., 2006
2004
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004
2002
J. Mach. Learn. Res., 2002
2000
Proceedings of the 2000 ACM SIGPLAN Conference on ObjectOriented Programming Systems, 2000