default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGugan Thoppe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Gugan Thoppe, Prashanth L. A., Sanjay P. Bhat:
Risk Estimation in a Markov Cost Process: Lower and Upper Bounds. ICML 2024- [c11]S. R. Eshwar, Lucas Lopes Felipe, Alexandre Reiffers-Masson, Daniel Sadoc Menasché, Gugan Thoppe:
Online Learning of Weakly Coupled MDP Policies for Load Balancing and Auto Scaling. IFIP Networking 2024: 496-501 - [i18]Swetha Ganesh, Jiayu Chen, Gugan Thoppe, Vaneet Aggarwal:
Global Convergence Guarantees for Federated Policy Gradient Methods with Adversaries. CoRR abs/2403.09940 (2024) - [i17]S. R. Eshwar, Lucas Lopes Felipe, Alexandre Reiffers-Masson, Daniel Sadoc Menasché, Gugan Thoppe:
Online Learning of Weakly Coupled MDP Policies for Load Balancing and Auto Scaling. CoRR abs/2406.14141 (2024) - [i16]S. R. Eshwar, Mayank Motwani, Nibedita Roy, Gugan Thoppe:
Reinforcement Learning with Quasi-Hyperbolic Discounting. CoRR abs/2409.10583 (2024) - 2023
- [c10]Swetha Ganesh, Alexandre Reiffers-Masson, Gugan Thoppe:
Online Learning with Adversaries: A Differential-Inclusion Analysis. CDC 2023: 1288-1293 - [c9]Swetha Ganesh, Rohan Deb, Gugan Thoppe, Amarjit Budhiraja:
Does Momentum Help in Stochastic Optimization? A Sample Complexity Analysis. UAI 2023: 602-612 - [c8]Eshwar S. R
, Shishir Kolathaya, Gugan Thoppe:
Improving Sample Efficiency in Evolutionary RL Using Off-Policy Ranking. VALUETOOLS 2023: 33-50 - [i15]Gal Dalal, Assaf Hallak, Gugan Thoppe, Shie Mannor, Gal Chechik:
SoftTreeMax: Exponential Variance Reduction in Policy Gradient via Tree Search. CoRR abs/2301.13236 (2023) - [i14]Swetha Ganesh, Alexandre Reiffers-Masson, Gugan Thoppe:
Online Learning with Adversaries: A Differential Inclusion Analysis. CoRR abs/2304.01525 (2023) - [i13]Sanjay Bhat, Prashanth L. A., Gugan Thoppe:
VaR\ and CVaR Estimation in a Markov Cost Process: Lower and Upper Bounds. CoRR abs/2310.11389 (2023) - 2022
- [j3]Konstantin Avrachenkov, Kishor Patil, Gugan Thoppe:
Online algorithms for estimating change rates of web pages. Perform. Evaluation 153: 102261 (2022) - [i12]Aditya Gopalan, Gugan Thoppe:
Approximate Q-learning and SARSA(0) under the ε-greedy Policy: a Differential Inclusion Analysis. CoRR abs/2205.13617 (2022) - [i11]Eshwar S. R, Shishir Kolathaya, Gugan Thoppe:
Improving Sample Efficiency in Evolutionary RL Using Off-Policy Ranking. CoRR abs/2208.10583 (2022) - 2021
- [c7]Gugan Thoppe, Bhumesh Kumar:
A Law of Iterated Logarithm for Multi-Agent Reinforcement Learning. NeurIPS 2021: 17927-17938 - [i10]Rahul Madhavan, Gugan Thoppe, Hemanta Makwana:
Scale Invariant Solutions for Overdetermined Linear Systems with Applications to Reinforcement Learning. CoRR abs/2104.07361 (2021) - [i9]Gugan Thoppe, Bhumesh Kumar:
A Law of Iterated Logarithm for Multi-Agent Reinforcement Learning. CoRR abs/2110.15092 (2021) - [i8]Gugan Thoppe, Rohan Deb, Swetha Ganesh, Amarjit Budhiraja:
Does Momentum Help? A Sample Complexity Analysis. CoRR abs/2110.15547 (2021) - 2020
- [j2]Primoz Skraba, Gugan Thoppe, D. Yogeshwaran:
Randomly Weighted d-Complexes: Minimal Spanning Acycles and Persistence Diagrams. Electron. J. Comb. 27(2): 2 (2020) - [c6]Gal Dalal, Balázs Szörényi, Gugan Thoppe:
A Tale of Two-Timescale Reinforcement Learning with the Tightest Finite-Time Bound. AAAI 2020: 3701-3708 - [c5]Konstantin Avrachenkov, Kishor Patil, Gugan Thoppe:
Change Rate Estimation and Optimal Freshness in Web Page Crawling. VALUETOOLS 2020: 3-10 - [i7]Konstantin Avrachenkov, Kishor Patil, Gugan Thoppe:
Change Rate Estimation and Optimal Freshness in Web Page Crawling. CoRR abs/2004.02167 (2020) - [i6]Konstantin Avrachenkov, Kishor Patil, Gugan Thoppe:
Online Algorithms for Estimating Change Rates of Web Pages. CoRR abs/2009.08142 (2020)
2010 – 2019
- 2019
- [i5]Gal Dalal, Balázs Szörényi, Gugan Thoppe:
A Tale of Two-Timescale Reinforcement Learning with the Tightest Finite-Time Bound. CoRR abs/1911.09157 (2019) - 2018
- [c4]Gal Dalal, Balázs Szörényi, Gugan Thoppe, Shie Mannor:
Finite Sample Analyses for TD(0) With Function Approximation. AAAI 2018: 6144-6160 - [c3]Gal Dalal, Gugan Thoppe, Balázs Szörényi, Shie Mannor:
Finite Sample Analysis of Two-Timescale Stochastic Approximation with Applications to Reinforcement Learning. COLT 2018: 1199-1233 - 2017
- [i4]Gal Dalal, Balázs Szörényi, Gugan Thoppe, Shie Mannor:
Concentration Bounds for Two Timescale Stochastic Approximation with Applications to Reinforcement Learning. CoRR abs/1703.05376 (2017) - [i3]Gal Dalal, Balázs Szörényi, Gugan Thoppe, Shie Mannor:
Finite Sample Analysis for TD(0) with Linear Function Approximation. CoRR abs/1704.01161 (2017) - 2016
- [c2]Gugan Thoppe, Vivek S. Borkar:
A concentration result for stochastic approximation (Extended abstract). ITA 2016: 1-2 - 2014
- [j1]Gugan Thoppe, Vivek S. Borkar, D. Manjunath:
A stochastic Kaczmarz algorithm for network tomography. Autom. 50(3): 910-914 (2014) - [i2]Gugan Thoppe, Vivek S. Borkar, Dinesh Garg:
An Improved Block Coordinate Descent Method for Quadratic Programming in High Dimensions. CoRR abs/1404.6635 (2014) - 2012
- [c1]Gugan Thoppe:
Generalized network tomography. Allerton Conference 2012: 762-769 - [i1]Gugan Thoppe:
Generalized Network Tomography. CoRR abs/1207.2530 (2012)
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 2025-01-21 00:02 CET 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:
