World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
43
Citations
9594
World Ranking
7876
National Ranking
3404

Overview

Kamalika Chaudhuri is affiliated with the University of California, San Diego in the United States. Their research primarily falls within the field of Computer Science, with a particular focus on Artificial Intelligence, Computer Vision and Pattern Recognition, and Statistics and Probability. Other subfields include Sociology and Political Science as well as Computer Networks and Communications.

The scientist's work covers a range of topics related to machine learning and data privacy. Key themes in their research include Privacy-Preserving Technologies in Data, Adversarial Robustness in Machine Learning, Cryptography and Data Security, Machine Learning and Algorithms, Domain Adaptation and Few-Shot Learning, Generative Adversarial Networks and Image Synthesis, and Machine Learning and Data Classification.

Selected recent papers authored or co-authored by Kamalika Chaudhuri are as follows:

  • "A Closer Look at Accuracy vs. Robustness", 2020, arXiv (Cornell University)
  • "Approximate Data Deletion from Machine Learning Models", 2020, arXiv (Cornell University)
  • "An Introduction to Vision-Language Modeling", 2024, arXiv (Cornell University)
  • "Differentially Private Triangle and 4-Cycle Counting in the Shuffle Model", 2022, Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security
  • "A Non-Parametric Test to Detect Data-Copying in Generative Models", 2020, arXiv (Cornell University)

Frequent co-authors with whom Kamalika Chaudhuri has collaborated include:

  • Chuan Guo
  • Casey Meehan
  • Jacob Imola
  • Robi Bhattacharjee
  • Ruihan Wu

The main venues where their work has been published include:

  • arXiv (Cornell University)
  • Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security
  • Journal of Artificial Intelligence Research
  • Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
  • IEEE Journal on Selected Areas in Information Theory

Best Publications

  • Differentially Private Empirical Risk Minimization

    Kamalika Chaudhuri;Claire Monteleoni;Anand D. Sarwate

  • Multi-view clustering via canonical correlation analysis

    Kamalika Chaudhuri;Sham M. Kakade;Karen Livescu;Karthik Sridharan

  • Privacy-preserving logistic regression

    Kamalika Chaudhuri;Claire Monteleoni

  • Stochastic gradient descent with differentially private updates

    Shuang Song;Kamalika Chaudhuri;Anand D. Sarwate

  • Privacy, accuracy, and consistency too: a holistic solution to contingency table release

    Boaz Barak;Kamalika Chaudhuri;Cynthia Dwork;Satyen Kale

  • Spectral Clustering of Graphs with General Degrees in the Extended Planted Partition Model

    Kamalika Chaudhuri;Fan Chung;Alexander Tsiatas

  • Signal Processing and Machine Learning with Differential Privacy: Algorithms and Challenges for Continuous Data

    A. D. Sarwate;K. Chaudhuri

  • Paths, trees, and minimum latency tours

    K. Chaudhuri;B. Godfrey;S. Rao;K. Talwar

  • Selfish caching in distributed systems: a game-theoretic analysis

    Byung-Gon Chun;Kamalika Chaudhuri;Hoeteck Wee;Marco Barreno

  • Location determination of a mobile device using IEEE 802.11b access point signals

    Unknown

  • Bolt-on Differential Privacy for Scalable Stochastic Gradient Descent-based Analytics

    Xi Wu;Fengan Li;Arun Kumar;Kamalika Chaudhuri

  • Near-optimal Differentially Private Principal Components

    Kamalika Chaudhuri;Anand Sarwate;Kaushik Sinha

  • A near-optimal algorithm for differentially-private principal components

    Kamalika Chaudhuri;Anand D. Sarwate;Kaushik Sinha

  • Pufferfish Privacy Mechanisms for Correlated Data

    Shuang Song;Yizhen Wang;Kamalika Chaudhuri

  • Rates of convergence for the cluster tree

    Kamalika Chaudhuri;Sanjoy Dasgupta

  • iDASH: integrating data for analysis, anonymization, and sharing

    Lucila Ohno-Machado;Vineet Bafna;Aziz A Boxwala;Brian E Chapman

  • A Parameter-free Hedging Algorithm

    Kamalika Chaudhuri;Yoav Freund;Daniel J. Hsu

  • Rates of Convergence for Nearest Neighbor Classification

    Kamalika Chaudhuri;Sanjoy Dasgupta

  • When random sampling preserves privacy

    Kamalika Chaudhuri;Nina Mishra

  • Sample Complexity Bounds for Dierentially Private Learning

    Kamalika Chaudhuri;Daniel Hsu

  • A Closer Look at Accuracy vs. Robustness

    Yao-Yuan Yang;Cyrus Rashtchian;Hongyang Zhang;Russ R. Salakhutdinov

  • Exploring Connections Between Active Learning and Model Extraction

    Varun Chandrasekaran;Kamalika Chaudhuri;Irene Giacomelli;Somesh Jha

  • Approximate Data Deletion from Machine Learning Models: Algorithms and Evaluations.

    Zachary Izzo;Mary Anne Smart;Kamalika Chaudhuri;James Y. Zou

  • Signal Processing and Machine Learning with Differential Privacy

    Anand D. Sarwate;Kamalika Chaudhuri

  • Near-Optimal Algorithms for Differentially-Private Principal Components

    Kamalika Chaudhuri;Anand D. Sarwate;Kaushik Sinha

Frequent Co-Authors

Daniel Hsu
Daniel Hsu Columbia University
Tara Javidi
Tara Javidi University of California, San Diego
Satish Rao
Satish Rao University of California, Berkeley
Sanjoy Dasgupta
Sanjoy Dasgupta University of California, San Diego
Max Welling
Max Welling University of Amsterdam
Somesh Jha
Somesh Jha University of Wisconsin–Madison
Kunal Talwar
Kunal Talwar Apple (United States)
Ruslan Salakhutdinov
Ruslan Salakhutdinov Carnegie Mellon University
Robert E. Tarjan
Robert E. Tarjan Princeton University
Shuang Song
Shuang Song Harbin Institute of Technology

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

As the field of Computer Science continues to grow, students are often interested in related educational pathways that can broaden their career prospects. Many ask, what can you do with an environmental studies degree? Careers in environmental research, consulting, and sustainability often require strong analytical and programming skills—areas where computer science graduates excel.

For those seeking a fast-track option, a 1 year computer science degree online can help you quickly gain or enhance your technical expertise from anywhere in the world. Similarly, professionals interested in cross-disciplinary technical roles may find value in online engineering degrees such as an environmental engineer degree online or the cheapest online master's mechanical engineering programs.

Exploring these related programs can provide unique opportunities and flexibility as you shape your career in technology or broaden your impact into other STEM fields.

Best Scientists Citing Kamalika Chaudhuri

Trending Scientists