default search action
Sarath Pattathil
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Daron Acemoglu, Alireza Fallah, Andrea Giometto, Daniel P. Huttenlocher, Asuman E. Ozdaglar, Francesca Parise, Sarath Pattathil:
Optimal adaptive testing for epidemic control: Combining molecular and serology tests. Autom. 160: 111391 (2024) - [c13]Brendan Lucier, Sarath Pattathil, Aleksandrs Slivkins, Mengxiao Zhang:
Autobidders with Budget and ROI Constraints: Efficiency, Regret, and Pacing Dynamics. COLT 2024: 3642-3643 - 2023
- [b1]Sarath Pattathil:
Optimization and Generalization of Minimax Algorithms. MIT, USA, 2023 - [c12]Sarath Pattathil, Kaiqing Zhang, Asuman E. Ozdaglar:
Symmetric (Optimistic) Natural Policy Gradient for Multi-Agent Learning with Parameter Convergence. AISTATS 2023: 5641-5685 - [c11]Asuman E. Ozdaglar, Sarath Pattathil, Jiawei Zhang, Kaiqing Zhang:
Revisiting the Linear-Programming Framework for Offline RL with General Function Approximation. ICML 2023: 26769-26791 - [i17]Brendan Lucier, Sarath Pattathil, Aleksandrs Slivkins, Mengxiao Zhang:
Autobidders with Budget and ROI Constraints: Efficiency, Regret, and Pacing Dynamics. CoRR abs/2301.13306 (2023) - [i16]Daron Acemoglu, Asuman E. Ozdaglar, Sarath Pattathil:
Learning, Diversity and Adaptation in Changing Environments: The Role of Weak Links. CoRR abs/2305.00474 (2023) - 2022
- [j4]Vivek S. Borkar
, Sarath Pattathil
Whittle indexability in egalitarian processor sharing systems. Ann. Oper. Res. 317(2): 417-437 (2022) - [c10]Asuman E. Ozdaglar, Sarath Pattathil, Jiawei Zhang, Kaiqing Zhang:
What is a Good Metric to Study Generalization of Minimax Learners? NeurIPS 2022 - [i15]Asuman E. Ozdaglar, Sarath Pattathil, Jiawei Zhang, Kaiqing Zhang:
What is a Good Metric to Study Generalization of Minimax Learners? CoRR abs/2206.04502 (2022) - [i14]Sarath Pattathil, Kaiqing Zhang, Asuman E. Ozdaglar:
Symmetric (Optimistic) Natural Policy Gradient for Multi-agent Learning with Parameter Convergence. CoRR abs/2210.12812 (2022) - [i13]Asuman E. Ozdaglar, Sarath Pattathil, Jiawei Zhang, Kaiqing Zhang:
Revisiting the Linear-Programming Framework for Offline RL with General Function Approximation. CoRR abs/2212.13861 (2022) - 2021
- [i12]Daron Acemoglu, Alireza Fallah, Andrea Giometto, Daniel P. Huttenlocher, Asuman E. Ozdaglar, Francesca Parise, Sarath Pattathil:
Optimal adaptive testing for epidemic control: combining molecular and serology tests. CoRR abs/2101.00773 (2021) - 2020
- [j3]Sarath Pattathil, Nikhil Karamchandani, Dhruti Shah:
Jordan centre in random trees: persistence and distance to root. J. Complex Networks 8(4) (2020) - [j2]Aryan Mokhtari
Convergence Rate of 풪(1/k) for Optimistic Gradient and Extragradient Methods in Smooth Convex-Concave Saddle Point Problems. SIAM J. Optim. 30(4): 3230-3251 (2020) - [c9]Aryan Mokhtari, Asuman E. Ozdaglar, Sarath Pattathil:
A Unified Analysis of Extra-gradient and Optimistic Gradient Methods for Saddle Point Problems: Proximal Point Approach. AISTATS 2020: 1497-1507 - [c8]Alireza Fallah, Asuman E. Ozdaglar, Sarath Pattathil:
An Optimal Multistage Stochastic Gradient Method for Minimax Problems. CDC 2020: 3573-3579 - [c7]Noah Golowich, Sarath Pattathil, Constantinos Daskalakis, Asuman E. Ozdaglar:
Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems. COLT 2020: 1758-1784 - [c6]Noah Golowich, Sarath Pattathil, Constantinos Daskalakis:
Tight last-iterate convergence rates for no-regret learning in multi-player games. NeurIPS 2020 - [i11]Noah Golowich, Sarath Pattathil, Constantinos Daskalakis, Asuman E. Ozdaglar:
Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems. CoRR abs/2002.00057 (2020) - [i10]Alireza Fallah, Asuman E. Ozdaglar, Sarath Pattathil:
An Optimal Multistage Stochastic Gradient Method for Minimax Problems. CoRR abs/2002.05683 (2020) - [i9]Noah Golowich, Sarath Pattathil, Constantinos Daskalakis:
Tight last-iterate convergence rates for no-regret learning in multi-player games. CoRR abs/2010.13724 (2020)
2010 – 2019
- 2019
- [i8]Aryan Mokhtari, Asuman E. Ozdaglar, Sarath Pattathil:
A Unified Analysis of Extra-gradient and Optimistic Gradient Methods for Saddle Point Problems: Proximal Point Approach. CoRR abs/1901.08511 (2019) - [i7]Aryan Mokhtari, Asuman E. Ozdaglar, Sarath Pattathil:
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 abs/1906.01115 (2019) - [i6]Weijie Liu, Aryan Mokhtari, Asuman E. Ozdaglar, Sarath Pattathil, Zebang Shen, Nenggan Zheng:
A Decentralized Proximal Point-type Method for Saddle Point Problems. CoRR abs/1910.14380 (2019) - 2018
- [j1]Vivek S. Borkar
Opportunistic Scheduling as Restless Bandits. IEEE Trans. Control. Netw. Syst. 5(4): 1952-1961 (2018) - [c5]Vivek S. Borkar, Sarath Pattathil:
Concentration bounds for two time scale stochastic approximation. Allerton 2018: 504-511 - [c4]Sarath Pattathil, Nikhil Karamchandani, Dhruti Shah:
Persistence of the Jordan Center in Random Growing Trees. ASONAM 2018: 25-32 - 2017
- [c3]Konstantin E. Avrachenkov
Controlling G-AIMD by index policy. CDC 2017: 120-125 - [c2]Nuno K. Pratas
Massive machine-type communication (mMTC) access with integrated authentication. ICC 2017: 1-6 - [c1]Sarath Pattathil, Jayakrishnan Nair:
Optimal distributed scheduling for single-hop wireless networks. WiOpt 2017: 1-8 - [i5]Vivek S. Borkar, Gaurav S. Kasbekar, Sarath Pattathil, Priyesh Y. Shetty:
Opportunistic Scheduling as Restless Bandits. CoRR abs/1706.09778 (2017) - [i4]Vivek S. Borkar, Sarath Pattathil:
Whittle Indexability in Egalitarian Processor Sharing Systems. CoRR abs/1707.02440 (2017) - [i3]Sarath Pattathil, Vivek S. Borkar, Gaurav S. Kasbekar:
Distributed Server Allocation for Content Delivery Networks. CoRR abs/1710.11471 (2017) - [i2]Sarath Pattathil, Nikhil Karamchandani, Dhruti Shah:
Persistence of the Jordan center in Random Growing Trees. CoRR abs/1712.08712 (2017) - 2016
- [i1]Nuno K. Pratas, Sarath Pattathil, Cedomir Stefanovic, Petar Popovski:
Massive Machine-Type Communication (mMTC) Access with Integrated Authentication. CoRR abs/1610.09849 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-29 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: