REVIEW 3 cited by
Optimism in Reinforcement Learning with Generalized Linear Function Approximation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We design a new provably efficient algorithm for episodic reinforcement learning with generalized linear function approximation. We analyze the algorithm under a new expressivity assumption that we call "optimistic closure," which is strictly weaker than assumptions from prior analyses for the linear setting. With optimistic closure, we prove that our algorithm enjoys a regret bound of $\tilde{O}(\sqrt{d^3 T})$ where $d$ is the dimensionality of the state-action features and $T$ is the number of episodes. This is the first statistically and computationally efficient algorithm for reinforcement learning with generalized linear functions.
Forward citations
Cited by 3 Pith papers
-
The Courage to Stop: Overcoming Sunk Cost Fallacy in Deep Reinforcement Learning
Introduces LEAST, an adaptive early-episode-stopping rule for off-policy deep RL that improves learning efficiency on MuJoCo and DeepMind Control benchmarks.
-
Incentivize without Bonus: Provably Efficient Model-based Online Multi-agent RL for Markov Games
Value-incentivized exploration via best-response values gives near-optimal regret for NE/CCE in linear-model Markov games without explicit uncertainty bonuses.
-
Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning
For kernel-based reward-free RL, a simple uncertainty-maximizing exploration algorithm with unbiased samples achieves sample complexity ~O((H^3/eps)^(2+2/(p-1))) for polynomial eigendecay kernels, with an H-factor cos...
Discussion (0). Continue with ORCID to comment.