ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2002.00874
  4. Cited By
Finite-Sample Analysis of Stochastic Approximation Using Smooth Convex
  Envelopes

Finite-Sample Analysis of Stochastic Approximation Using Smooth Convex Envelopes

3 February 2020
Zaiwei Chen
S. T. Maguluri
Sanjay Shakkottai
Karthikeyan Shanmugam
ArXivPDFHTML

Papers citing "Finite-Sample Analysis of Stochastic Approximation Using Smooth Convex Envelopes"

11 / 11 papers shown
Title
A Piecewise Lyapunov Analysis of Sub-quadratic SGD: Applications to Robust and Quantile Regression
A Piecewise Lyapunov Analysis of Sub-quadratic SGD: Applications to Robust and Quantile Regression
Yixuan Zhang
Dongyan
Yudong Chen
Qiaomin Xie
40
0
0
11 Apr 2025
Stochastic Halpern iteration in normed spaces and applications to reinforcement learning
Stochastic Halpern iteration in normed spaces and applications to reinforcement learning
Mario Bravo
Juan Pablo Contreras
48
3
0
19 Mar 2024
Finite-Time Analysis of Whittle Index based Q-Learning for Restless
  Multi-Armed Bandits with Neural Network Function Approximation
Finite-Time Analysis of Whittle Index based Q-Learning for Restless Multi-Armed Bandits with Neural Network Function Approximation
Guojun Xiong
Jian Li
38
13
0
03 Oct 2023
TD Convergence: An Optimization Perspective
TD Convergence: An Optimization Perspective
Kavosh Asadi
Shoham Sabach
Yao Liu
Omer Gottesman
Rasool Fakoor
MU
25
8
0
30 Jun 2023
Minimax-Optimal Multi-Agent RL in Markov Games With a Generative Model
Minimax-Optimal Multi-Agent RL in Markov Games With a Generative Model
Gen Li
Yuejie Chi
Yuting Wei
Yuxin Chen
37
18
0
22 Aug 2022
A Statistical Analysis of Polyak-Ruppert Averaged Q-learning
A Statistical Analysis of Polyak-Ruppert Averaged Q-learning
Xiang Li
Wenhao Yang
Jiadong Liang
Zhihua Zhang
Michael I. Jordan
48
15
0
29 Dec 2021
Breaking the Sample Complexity Barrier to Regret-Optimal Model-Free
  Reinforcement Learning
Breaking the Sample Complexity Barrier to Regret-Optimal Model-Free Reinforcement Learning
Gen Li
Laixi Shi
Yuxin Chen
Yuejie Chi
OffRL
49
51
0
09 Oct 2021
Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
Gen Li
Changxiao Cai
Ee
Yuting Wei
Yuejie Chi
OffRL
55
75
0
12 Feb 2021
Finite-Time Analysis for Double Q-learning
Finite-Time Analysis for Double Q-learning
Huaqing Xiong
Linna Zhao
Yingbin Liang
Wei Zhang
25
31
0
29 Sep 2020
Breaking the Sample Size Barrier in Model-Based Reinforcement Learning
  with a Generative Model
Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model
Gen Li
Yuting Wei
Yuejie Chi
Yuxin Chen
39
125
0
26 May 2020
Finite-Sample Analysis of Nonlinear Stochastic Approximation with
  Applications in Reinforcement Learning
Finite-Sample Analysis of Nonlinear Stochastic Approximation with Applications in Reinforcement Learning
Zaiwei Chen
Sheng Zhang
Thinh T. Doan
John-Paul Clarke
S. T. Maguluri
30
58
0
27 May 2019
1