Karthikeyan Shanmugam
Google Deepmind India, Google (India), The University of Texas at Austin, University of Southern California, IBM Research - Thomas J. Watson Research Center, Indian Institute of Technology Madras
About
Karthikeyan Shanmugam is currently a Research Scientist at Google DeepMind India in the Machine Learning and Optimization Team. Previously, he was a Research Staff Member with the IBM Research AI, NY during the period 2017-2022 and a Herman Goldstine Postdoctoral Fellow at IBM Research, NY in the period 2016-2017. He obtained his Ph.D. in ECE from UT Austin in 2016. He is a recipient of the IBM Corporate Technical Award in 2021 for his work on Trustworthy AI. His current research focus is on causal inference, online learning, representation learning and Foundation Models in Machine Learning. He is also interested in Information Theory and Coding Theory.
Employment
-
Google Deepmind India Research Scientist2024 - Present
-
Google (India) Research Scientist2022 - 2024
-
IBM Research - Thomas J. Watson Research Center Research Staff Member2017 - 2022
Education
-
The University of Texas at Austin Doctor of Philosophy2013 - 2016
-
University of Southern California Master of Science2010 - 2012
-
Indian Institute of Technology Madras Master of Technology2005 - 2010
-
Indian Institute of Technology Madras Bachelor of Technology2005 - 2010
Projects & Funding
Projects & funding information is unavailable.
Publications (138)
- Online Bidding under RoS Constraints without Knowing the Value Save
- Bandits with Stochastic Experts: Constant Regret, Empirical Experts and Episodes Save
- A Lyapunov Theory for Finite-Sample Guarantees of Markovian Stochastic Approximation Save
- Fault Injection Based Interventional Causal Learning for Distributed Applications Save
- Front-door Adjustment Beyond Markov Equivalence with Limited Graph Knowledge Save
- Identifiability Guarantees for Causal Disentanglement from Soft Interventions Save
- InfoNCE Loss Provably Learns Cluster-Preserving Representations Save
- InfoNCE Loss Provably Learns Cluster-Preserving Representations Save
- Optimal Algorithms for Latent Bandits with Cluster Structure Save
- Optimal Algorithms for Latent Bandits with Cluster Structure Save