Vitaly Feldman
- Artificial Intelligence top 2%
- Computational Theory and Mathematics top 5%
- Electrical and Electronic Engineering
- Cognitive Neuroscience
- Computer Networks and Communications top 10%
- Co-authors
- Toniann PitassiMoritz HardtCynthia DworkOmer ReingoldAaron RothSantosh VempalaLev ReyzinYing Xiao
- Topics
- Machine Learning and Algorithms (38 papers)Complexity and Algorithms in Graphs (21 papers)Algorithms and Data Compression (16 papers)
- Partner nations
- United StatesIsraelCanada
In The Last Decade
Vitaly Feldman
54 papers receiving 861 citations
Peers
Comparison fields: 5 of 97
- Artificial Intelligence 632
- Computational Theory and Mathematics 190
- Electrical and Electronic Engineering 177
- Cognitive Neuroscience 91
- Computer Networks and Communications 89
Countries citing papers authored by Vitaly Feldman
This map shows the geographic impact of Vitaly Feldman's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Vitaly Feldman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Vitaly Feldman more than expected).
Fields of papers citing papers by Vitaly Feldman
This network shows the impact of papers produced by Vitaly Feldman. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Vitaly Feldman. The network helps show where Vitaly Feldman may publish in the future.
Co-authorship network of co-authors of Vitaly Feldman
This figure shows the co-authorship network connecting the top 25 collaborators of Vitaly Feldman. A scholar is included among the top collaborators of Vitaly Feldman based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Vitaly Feldman. Vitaly Feldman is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | Private Stochastic Convex Optimization: Optimal Rates in L1 Geometry | 3 |
| 2 | Lossless Compression of Efficient Private Local Randomizers | 2 |
| 3 | PAC learning with stable and private predictions | 0 |
| 4 | What Neural Networks Memorize and Why: Discovering the Long Tail via Influence Estimation | 4 |
| 5 | Private Stochastic Convex Optimization with Optimal Rates | 10 |
| 6 | The Everlasting Database: Statistical Validity at a Fair Price | 1 |
| 7 | 2 | |
| 8 | 10 | |
| 9 | Dealing with Range Anxiety in Mean Estimation via Statistical Queries | 1 |
| 10 | Generalization of ERM in Stochastic Convex Optimization: The Dimension Strikes Back | 3 |
| 11 | 10 | |
| 12 | 3 | |
| 13 | 5 | |
| 14 | Statistical Active Learning Algorithms | 4 |
| 15 | 10 | |
| 16 | 0 | |
| 17 | On the Power of Membership Queries in Agnostic Learning. | 5 |
| 18 | Optimal Hardness Results for Maximizing Agreements with Monomials. | 2 |
| 19 | 1 | |
| 20 | 28 |
About Vitaly Feldman
Vitaly Feldman is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Statistics and Probability, having authored 60 papers that have together received 904 indexed citations. Recurring topics across this work include Machine Learning and Algorithms (38 papers), Complexity and Algorithms in Graphs (21 papers) and Algorithms and Data Compression (16 papers). The work is most often cited by research in Artificial Intelligence (632 citations), Computational Mathematics (9 citations) and Computational Theory and Mathematics (190 citations). Vitaly Feldman has collaborated with scholars based in United States, Israel and Canada. Frequent co-authors include Toniann Pitassi, Moritz Hardt, Cynthia Dwork, Omer Reingold, Aaron Roth, Santosh Vempala, Lev Reyzin, Ying Xiao, Elena Grigorescu and Filipp Akopyan. Their work appears in journals such as Science, Communications of the ACM and Journal of the ACM.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.