Mahbod Majid

According to our database, Mahbod Majid authored at least 8 papers between 2022 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2026

Privately Estimating Monotone Statistics in Polynomial Time.

Gavin Brown, Ephraim Linder, Mahbod Majid, Vikrant Singhal

CoRR, May, 2026

Computation-Utility-Privacy Tradeoffs in Bayesian Estimation.

Sitan Chen, Jingqiu Ding, Mahbod Majid, Walter McKelvie

Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

2025

Sample-Optimal Private Regression in Polynomial Time.

Prashanti Anderson, Ainesh Bakshi, Mahbod Majid, Stefan Tiegel

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Private Mean Estimation with Person-Level Differential Privacy.

Sushant Agarwal, Gautam Kamath, Mahbod Majid, Argyris Mouzakis, Rose Silver, Jonathan R. Ullman

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

On the Consistent Recovery of Joint Distributions from Conditionals.

Mahbod Majid, Rattana Pukdee, Vishwajeet Agrawal, Burak Varici, Pradeep Kumar Ravikumar

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2025

2024

Sample-Efficient Private Learning of Mixtures of Gaussians.

Hassan Ashtiani, Mahbod Majid, Shyam Narayanan

Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

2023

Robustness Implies Privacy in Statistical Estimation.

Samuel B. Hopkins, Gautam Kamath, Mahbod Majid, Shyam Narayanan

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022

Efficient mean estimation with pure differential privacy via a sum-of-squares exponential mechanism.

Samuel B. Hopkins, Gautam Kamath, Mahbod Majid

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022