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. 2406.12241
  4. Cited By
More Efficient Randomized Exploration for Reinforcement Learning via
  Approximate Sampling

More Efficient Randomized Exploration for Reinforcement Learning via Approximate Sampling

18 June 2024
Haque Ishfaq
Yixin Tan
Yu Yang
Qingfeng Lan
Jianfeng Lu
A. Rupam Mahmood
Doina Precup
Pan Xu
ArXivPDFHTML

Papers citing "More Efficient Randomized Exploration for Reinforcement Learning via Approximate Sampling"

15 / 15 papers shown
Title
Provable and Practical: Efficient Exploration in Reinforcement Learning
  via Langevin Monte Carlo
Provable and Practical: Efficient Exploration in Reinforcement Learning via Langevin Monte Carlo
Haque Ishfaq
Qingfeng Lan
Pan Xu
A. R. Mahmood
Doina Precup
Anima Anandkumar
Kamyar Azizzadenesheli
BDL
OffRL
70
20
0
29 May 2023
A Provably Efficient Model-Free Posterior Sampling Method for Episodic
  Reinforcement Learning
A Provably Efficient Model-Free Posterior Sampling Method for Episodic Reinforcement Learning
Christoph Dann
M. Mohri
Tong Zhang
Julian Zimmert
OffRL
35
34
0
23 Aug 2022
Langevin Monte Carlo for Contextual Bandits
Langevin Monte Carlo for Contextual Bandits
Pan Xu
Hongkai Zheng
Eric Mazumdar
Kamyar Azizzadenesheli
Anima Anandkumar
31
27
0
22 Jun 2022
On Bonus-Based Exploration Methods in the Arcade Learning Environment
On Bonus-Based Exploration Methods in the Arcade Learning Environment
Adrien Ali Taïga
W. Fedus
Marlos C. Machado
Aaron Courville
Marc G. Bellemare
45
59
0
22 Sep 2021
Structured Logconcave Sampling with a Restricted Gaussian Oracle
Structured Logconcave Sampling with a Restricted Gaussian Oracle
Y. Lee
Ruoqi Shen
Kevin Tian
48
71
0
07 Oct 2020
Provably Efficient Reinforcement Learning with Linear Function
  Approximation
Provably Efficient Reinforcement Learning with Linear Function Approximation
Chi Jin
Zhuoran Yang
Zhaoran Wang
Michael I. Jordan
86
555
0
11 Jul 2019
Reinforcement Learning in Feature Space: Matrix Bandit, Kernels, and
  Regret Bound
Reinforcement Learning in Feature Space: Matrix Bandit, Kernels, and Regret Bound
Lin F. Yang
Mengdi Wang
OffRL
GP
55
285
0
24 May 2019
Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry
  Suffices
Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Suffices
Santosh Vempala
Andre Wibisono
73
264
0
20 Mar 2019
Implicit Quantile Networks for Distributional Reinforcement Learning
Implicit Quantile Networks for Distributional Reinforcement Learning
Will Dabney
Georg Ostrovski
David Silver
Rémi Munos
OffRL
96
531
0
14 Jun 2018
Prioritized Experience Replay
Prioritized Experience Replay
Tom Schaul
John Quan
Ioannis Antonoglou
David Silver
OffRL
210
3,786
0
18 Nov 2015
Deep Reinforcement Learning with Double Q-learning
Deep Reinforcement Learning with Double Q-learning
H. V. Hasselt
A. Guez
David Silver
OffRL
154
7,623
0
22 Sep 2015
Delving Deep into Rectifiers: Surpassing Human-Level Performance on
  ImageNet Classification
Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classification
Kaiming He
Xinming Zhang
Shaoqing Ren
Jian Sun
VLM
276
18,587
0
06 Feb 2015
Theoretical guarantees for approximate sampling from smooth and
  log-concave densities
Theoretical guarantees for approximate sampling from smooth and log-concave densities
A. Dalalyan
66
514
0
23 Dec 2014
Stochastic Gradient Hamiltonian Monte Carlo
Stochastic Gradient Hamiltonian Monte Carlo
Tianqi Chen
E. Fox
Carlos Guestrin
BDL
104
907
0
17 Feb 2014
The Arcade Learning Environment: An Evaluation Platform for General
  Agents
The Arcade Learning Environment: An Evaluation Platform for General Agents
Marc G. Bellemare
Yavar Naddaf
J. Veness
Michael Bowling
106
3,002
0
19 Jul 2012
1