"Optimal Regret Bounds via Low-Rank Structured Variation in Non-Stationary ..."

Tuan Dam (2025)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2026-06-26

- view
  - electronic edition @ nips.cc (open access)
- export record
  dblp key:
  - conf/nips/Dam25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/nips/Dam25
Tuan Dam:
Optimal Regret Bounds via Low-Rank Structured Variation in Non-Stationary Reinforcement Learning. NeurIPS 2025

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.