Sarath Pattathil

Orcid: 0000-0001-7908-8209

According to our database1, Sarath Pattathil authored at least 22 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Optimal adaptive testing for epidemic control: Combining molecular and serology tests.
Autom., February, 2024

2023
Learning, Diversity and Adaptation in Changing Environments: The Role of Weak Links.
CoRR, 2023

Autobidders with Budget and ROI Constraints: Efficiency, Regret, and Pacing Dynamics.
CoRR, 2023

Revisiting the Linear-Programming Framework for Offline RL with General Function Approximation.
Proceedings of the International Conference on Machine Learning, 2023

Symmetric (Optimistic) Natural Policy Gradient for Multi-Agent Learning with Parameter Convergence.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Whittle indexability in egalitarian processor sharing systems.
Ann. Oper. Res., 2022

What is a Good Metric to Study Generalization of Minimax Learners?
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2020
Convergence Rate of 풪(1/k) for Optimistic Gradient and Extragradient Methods in Smooth Convex-Concave Saddle Point Problems.
SIAM J. Optim., 2020

Jordan centre in random trees: persistence and distance to root.
J. Complex Networks, 2020

Tight last-iterate convergence rates for no-regret learning in multi-player games.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems.
Proceedings of the Conference on Learning Theory, 2020

An Optimal Multistage Stochastic Gradient Method for Minimax Problems.
Proceedings of the 59th IEEE Conference on Decision and Control, 2020

A Unified Analysis of Extra-gradient and Optimistic Gradient Methods for Saddle Point Problems: Proximal Point Approach.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
A Decentralized Proximal Point-type Method for Saddle Point Problems.
CoRR, 2019

Proximal Point Approximations Achieving a Convergence Rate of O(1/k) for Smooth Convex-Concave Saddle Point Problems: Optimistic Gradient and Extra-gradient Methods.
CoRR, 2019

2018
Opportunistic Scheduling as Restless Bandits.
IEEE Trans. Control. Netw. Syst., 2018

Persistence of the Jordan Center in Random Growing Trees.
Proceedings of the IEEE/ACM 2018 International Conference on Advances in Social Networks Analysis and Mining, 2018

Concentration bounds for two time scale stochastic approximation.
Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017
Distributed Server Allocation for Content Delivery Networks.
CoRR, 2017

Optimal distributed scheduling for single-hop wireless networks.
Proceedings of the 15th International Symposium on Modeling and Optimization in Mobile, 2017

Massive machine-type communication (mMTC) access with integrated authentication.
Proceedings of the IEEE International Conference on Communications, 2017

Controlling G-AIMD by index policy.
Proceedings of the 56th IEEE Annual Conference on Decision and Control, 2017


  Loading...