Exponential Family Model-Based Reinforcement Learning via Score Matching
Gene Li, Junbo Li, Anmol Kabra, Nati Srebro, Zhaoran Wang, Zhuoran Yang
2022年份
5被引次数
3顶会引用
摘要
We propose an optimistic model-based algorithm, dubbed SMRL, for finite-horizon episodic reinforcement learning (RL) when the transition model is specified by exponential family distributions with parameters and the reward is bounded and known. SMRL uses score matching, an unnormalized density estimation technique that enables efficient estimation of the model parameter by ridge regression. Under standard regularity assumptions, SMRL achieves online regret, where is the length of each episode and is the total number of interactions (ignoring polynomial dependence on structural scale parameters).
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper3
- Learning a Diffusion Model Policy from Rewards via Q-Score MatchingMichael Psenka, Alejandro Escontrela, Pieter Abbeel, Yi MaICML 2024 · 被引用 90 次
- Bilinear Exponential Family of MDPs: Frequentist Regret Bound with Tractable Exploration & PlanningReda Ouhamma, Debabrota Basu, Odalric MaillardAAAI 2023 · 被引用 14 次
- Provably Efficient Reinforcement Learning with Multinomial Logit Function ApproximationLong-Fei Li, Yu-Jie Zhang, Peng Zhao, Zhi-Hua ZhouNeurIPS 2024 · 被引用 11 次
它引用的顶会 Paper7
- Model-Based Reinforcement Learning with Value-Targeted RegressionAlex Ayoub, Zeyu Jia, Csaba Szepesvári, Mengdi Wang 等ICML 2020 · 被引用 324 次
- Provably Efficient Exploration in Policy OptimizationQi Cai, Zhuoran Yang, Chi Jin, Zhaoran WangICML 2020 · 被引用 304 次
- Learning Near Optimal Policies with Low Inherent Bellman ErrorAndrea Zanette, Alessandro Lazaric, Mykel J. Kochenderfer, Emma BrunskillICML 2020 · 被引用 238 次
- Naive Exploration is Optimal for Online LQRMax Simchowitz, Dylan J. FosterICML 2020 · 被引用 209 次
- Learning with Good Feature Representations in Bandits and in RL with a Generative ModelTor Lattimore, Csaba Szepesvári, Gellért WeiszICML 2020 · 被引用 181 次
相关 Paper
- Randomized Exploration for Reinforcement Learning with Multinomial Logistic Function ApproximationWooseong Cho, Taehyun Hwang, Joongkyu Lee, Min-hwan OhNeurIPS 2024 · 被引用 7 次
- Kernel-Based Reinforcement Learning: A Finite-Time AnalysisOmar Darwiche Domingues, Pierre Ménard, Matteo Pirotta, Emilie Kaufmann 等ICML 2021 · 被引用 24 次
- Optimistic Posterior Sampling for Reinforcement Learning with Few Samples and Tight GuaranteesDaniil Tiapkin, Denis Belomestny, Daniele Calandriello, Eric Moulines 等NeurIPS 2022 · 被引用 16 次
- Optimistic Policy Optimization with Bandit FeedbackLior Shani, Yonathan Efroni, Aviv Rosenberg, Shie MannorICML 2020 · 被引用 100 次
- Online Reinforcement Learning with Uncertain Episode LengthsDebmalya Mandal, Goran Radanovic, Jiarui Gan, Adish Singla 等AAAI 2023 · 被引用 9 次
