Gautam Chandrasekaran

According to our database, Gautam Chandrasekaran authored at least 12 papers between 2021 and 2026.

Collaborative distances:

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

2026

Iterative Chow Filtering for Learning with Distribution Shift.

Gautam Chandrasekaran, Georgios Gkrinias, Adam R. Klivans, Konstantinos Stavropoulos, Arsen Vasilyan

CoRR, May, 2026

Learning AC⁰ Under Graphical Models.

Gautam Chandrasekaran, Jason Gaitonde, Ankur Moitra, Arsen Vasilyan

CoRR, April, 2026

Sparse Linear Regression Is Easy on Random Supports.

Gautam Chandrasekaran, Raghu Meka, Konstantinos Stavropoulos

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

A Fully Polynomial-Time Algorithm for Robustly Learning Halfspaces over the Hypercube.

Gautam Chandrasekaran, Adam R. Klivans, Konstantinos Stavropoulos, Arsen Vasilyan

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

2025

Learning the Sherrington-Kirkpatrick Model Even at Low Temperature.

Gautam Chandrasekaran, Adam R. Klivans

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

Learning Juntas under Markov Random Fields.

Gautam Chandrasekaran, Adam R. Klivans

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

Learning Neural Networks with Distribution Shift: Efficiently Certifiable Guarantees.

Gautam Chandrasekaran, Adam R. Klivans, Lin Lin Lee, Konstantinos Stavropoulos

Proceedings of the Thirteenth International Conference on Learning Representations, 2025

2024

Efficient Discrepancy Testing for Learning with Distribution Shift.

Gautam Chandrasekaran, Adam R. Klivans, Vasilis Kontonis, Konstantinos Stavropoulos, Arsen Vasilyan

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

Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random.

Gautam Chandrasekaran, Vasilis Kontonis, Konstantinos Stavropoulos, Kevin Tian

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

Smoothed Analysis for Learning Concepts with Low Intrinsic Dimension.

Gautam Chandrasekaran, Adam R. Klivans, Vasilis Kontonis, Raghu Meka, Konstantinos Stavropoulos

Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023

Learning in online MDPs: is there a price for handling the communicating case?

Gautam Chandrasekaran, Ambuj Tewari

Proceedings of the Uncertainty in Artificial Intelligence, 2023

2021

Online Learning in Adversarial MDPs: Is the Communicating Case Harder than Ergodic?

Gautam Chandrasekaran, Ambuj Tewari

CoRR, 2021