Sham Kakade
Sham Machandranath Kakade | |
|---|---|
| Alma mater | Caltech University College London[1] |
| Scientific career | |
| Fields | Computer Science, Artificial Intelligence |
| Institutions | Toyota Technological Institute at Chicago Wharton Microsoft Research University of Washington Harvard University |
| Peter Dayan | |
Sham Machandranath Kakade is an American computer scientist. He is a Gordon McKay Professor in Computer Science at Harvard University, with a joint appointment in the Department of Statistics.[2] Kakade is a co-director of the Kempner Institute for the Study of Natural and Artificial Intelligence.[3][4] He co-founded the Algorithmic Foundations of Data Science Institute.[5]
Education and Career
[edit]Kakade earned a Bachelor of Science in Physics from the California Institute of Technology and a PhD from the Gatsby Computational Neuroscience Unit at University College London, under the supervision of Peter Dayan.[4] Prior to his current position at Harvard, he served as a Principal Researcher at Microsoft Research, an assistant professor at the Toyota Technological Institute at Chicago and Wharton, and a professor at the University of Washington.[4]
Research
[edit]Kakade's research includes work on Reinforcement Learning, Tensor-Algebraic methods, and Convex optimization.[3]
Reinforcement Learning
[edit]Kakade's doctoral work helped established statistical frameworks used in the study of sample complexity in reinforcement learning.[2] He co-developed methods in policy optimization, including early work on natural policy gradient, conservative policy iteration.[6][7] Kakade has contributed to theoretical analyses of reinforcement learning algorithms with provable performance guarantees.[7]
Bandit Models
[edit]Kakade has worked extensively on multi-armed and structured bandit models, including linear and Gaussian process-based bandit.[2][8] He co-authored "Gaussian Process Optimization in the Bandit Setting: No Regret and Experimental Design," which studied Gaussian process methods in a nonparametric bandit setting.[9][10] The work established regret bounds connected to information gain in Gaussian process models.[10]
Optimization
[edit]Kakade has studied convex optimization and non-covex optimization in machine learning. His work includes the analysis of optimization algorithms for escaping saddle points in non-convex problems. He has also co-authored research on optimization methods used in modern machine learning system.[2]
Awards
[edit]Kakade was a co-recipient of the Test of Time Award at the International Conference on Machine Learning (ICML) in 2020 for the paper "Gaussian Process Optimization in the Bandit Setting: No Regret and Experimental Design."[10][11][12] The ICML awards committee cited the paper's influential role in connecting Gaussian process models, bandit optimization, and experimental design.[11]
He was a recipient of the INFORMS Revenue Management and Pricing section Prize in 2014.[13] Kakade has served on the Alfred P. Sloan Foundation's selection committee for the Computer Science Sloan Research Fellowships.[14]
References
[edit]- ↑ "Sham Machandranath Kakade". Retrieved 2019-04-25.
- 1 2 3 4 "Sham Kakade | Harvard John A. Paulson School of Engineering and Applied Sciences". seas.harvard.edu. Retrieved 2026-04-07.
- 1 2 "Sham Kakade". Kempner Institute. Retrieved 2026-04-07.
- 1 2 3 chadcampbell (2022-09-23). "Science, Tech and AI Leaders Convene to Launch Kempner Institute". Chan Zuckerberg Initiative. Retrieved 2026-04-07.
- ↑ "New NSF awards will bring together cross-disciplinary science communities to develop foundations of data science". National Science Foundation. Retrieved 25 April 2019.
- ↑ "Sham Kakade". l4dc.lids.mit.edu. Retrieved 2026-04-07.
- 1 2 "Symposium Fall 2020 - MINDS Plenary Sham Kakade (2020-10-23)". Retrieved 2026-04-07.
- ↑ "Seminar @ Cornell Tech: Sham Kakade". Cornell Tech. Retrieved 2026-04-08.
- ↑ "Symposium Fall 2020 - MINDS Plenary Sham Kakade (2020-10-23)". Retrieved 2026-04-08.
- 1 2 3 Srinivas, Niranjan; Krause, Andreas; Kakade, Sham M.; Seeger, Matthias (2010-06-09). "Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting". IEEE Transactions on Information Theory. 58 (5): 3250–3265. arXiv:0912.3995. doi:10.1109/TIT.2011.2182033.
- 1 2 "ICML Test Of Time Test of Time: Gaussian Process Optimization in the Bandit Settings: No Regret and Experimental Design". icml.cc. Retrieved 2026-04-08.
- ↑ "Prof. Andreas Krause receives ICML Test of Time Award". Department of Computer Science. Retrieved 2026-04-08.
- ↑ "Section Award - Revenue Management and Pricing Section". connect.informs.org. Retrieved 2026-04-08.
- ↑ "Past Selection Committee Members". sloan.org. Retrieved 2026-04-08.