Online Learning in Adversarial MDPs: Is the Communicating Case Harder than Ergodic? - Gautam Chandrasekaran; Ambuj Tewari (CoRR, 2021)

Learning in online MDPs: is there a price for handling the communicating case? - Gautam Chandrasekaran; Ambuj Tewari (UAI, 2023)

Smoothed Analysis for Learning Concepts with Low Intrinsic Dimension. - Gautam Chandrasekaran; Adam R. Klivans; Vasilis Kontonis; Raghu Meka; Konstantinos Stavropoulos (COLT, 2024)

Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random. - Gautam Chandrasekaran; Vasilis Kontonis; Konstantinos Stavropoulos; Kevin Tian (NeurIPS, 2024)

Efficient Discrepancy Testing for Learning with Distribution Shift. - Gautam Chandrasekaran; Adam R. Klivans; Vasilis Kontonis; Konstantinos Stavropoulos; Arsen Vasilyan (NeurIPS, 2024)

Learning Neural Networks with Distribution Shift: Efficiently Certifiable Guarantees. - Gautam Chandrasekaran; Adam R. Klivans; Lin Lin Lee; Konstantinos Stavropoulos (ICLR, 2025)

Learning the Sherrington-Kirkpatrick Model Even at Low Temperature. - Gautam Chandrasekaran; Adam R. Klivans (STOC, 2025)

Learning Juntas under Markov Random Fields. - Gautam Chandrasekaran; Adam R. Klivans (CoRR, 2025)