Saved in:
| Main Authors: | Flynn, Hamish, Reeb, David, Kandemir, Melih, Peters, Jan |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2309.14298 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Tighter Confidence Bounds for Sequential Kernel Regression
by: Flynn, Hamish, et al.
Published: (2024)
by: Flynn, Hamish, et al.
Published: (2024)
Weighted Sequential Bayesian Inference for Non-Stationary Linear Contextual Bandits
by: Werge, Nicklas, et al.
Published: (2023)
by: Werge, Nicklas, et al.
Published: (2023)
Posterior Sampling Reinforcement Learning with Gaussian Processes for Continuous Control: Sublinear Regret Bounds for Unbounded State Spaces
by: Flynn, Hamish, et al.
Published: (2026)
by: Flynn, Hamish, et al.
Published: (2026)
Linear Bandits with Non-i.i.d. Noise
by: Abélès, Baptiste, et al.
Published: (2025)
by: Abélès, Baptiste, et al.
Published: (2025)
Sparse Nonparametric Contextual Bandits
by: Flynn, Hamish, et al.
Published: (2025)
by: Flynn, Hamish, et al.
Published: (2025)
Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards
by: Tajdini, Artin, et al.
Published: (2025)
by: Tajdini, Artin, et al.
Published: (2025)
Deterministic Uncertainty Propagation for Improved Model-Based Offline Reinforcement Learning
by: Akgül, Abdullah, et al.
Published: (2024)
by: Akgül, Abdullah, et al.
Published: (2024)
Relative Information Gain and Gaussian Process Regression
by: Flynn, Hamish
Published: (2025)
by: Flynn, Hamish
Published: (2025)
Improving Actor-Critic Training with Steerable Action-Value Approximation Errors
by: Tasdighi, Bahareh, et al.
Published: (2024)
by: Tasdighi, Bahareh, et al.
Published: (2024)
Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit Feedback and Unknown Transition
by: Li, Long-Fei, et al.
Published: (2024)
by: Li, Long-Fei, et al.
Published: (2024)
Continual Learning of Multi-modal Dynamics with External Memory
by: Akgül, Abdullah, et al.
Published: (2022)
by: Akgül, Abdullah, et al.
Published: (2022)
Bayesian Bandit Algorithms with Approximate Inference in Stochastic Linear Bandits
by: Huang, Ziyi, et al.
Published: (2024)
by: Huang, Ziyi, et al.
Published: (2024)
A Measure-Theoretic Finite-Sample Theory for Adaptive-Data Fitted Q-Iteration
by: Haussmann, Manuel, et al.
Published: (2026)
by: Haussmann, Manuel, et al.
Published: (2026)
EdVAE: Mitigating Codebook Collapse with Evidential Discrete Variational Autoencoders
by: Baykal, Gulcin, et al.
Published: (2023)
by: Baykal, Gulcin, et al.
Published: (2023)
Disentanglement with Factor Quantized Variational Autoencoders
by: Baykal, Gulcin, et al.
Published: (2024)
by: Baykal, Gulcin, et al.
Published: (2024)
Confidence Sequences for Generalized Linear Models via Regret Analysis
by: Clerico, Eugenio, et al.
Published: (2025)
by: Clerico, Eugenio, et al.
Published: (2025)
Improved Bound for Robust Causal Bandits with Linear Models
by: Yan, Zirui, et al.
Published: (2024)
by: Yan, Zirui, et al.
Published: (2024)
Improved Algorithms for Nash Welfare in Linear Bandits
by: Sarkar, Dhruv, et al.
Published: (2026)
by: Sarkar, Dhruv, et al.
Published: (2026)
Algorithmic Stability of Stochastic Gradient Descent with Momentum under Heavy-Tailed Noise
by: Dang, Thanh, et al.
Published: (2025)
by: Dang, Thanh, et al.
Published: (2025)
Overcoming Non-stationary Dynamics with Evidential Proximal Policy Optimization
by: Akgül, Abdullah, et al.
Published: (2025)
by: Akgül, Abdullah, et al.
Published: (2025)
Self-Normalized Martingales and Uniform Regret Bounds for Linear Regression
by: Chen, Fan, et al.
Published: (2026)
by: Chen, Fan, et al.
Published: (2026)
Sparse Optimistic Information Directed Sampling
by: Schwartz, Ludovic, et al.
Published: (2025)
by: Schwartz, Ludovic, et al.
Published: (2025)
Bridging the Performance Gap Between Target-Free and Target-Based Reinforcement Learning
by: Vincent, Théo, et al.
Published: (2025)
by: Vincent, Théo, et al.
Published: (2025)
An Improved Algorithm for Adversarial Linear Contextual Bandits via Reduction
by: van Erven, Tim, et al.
Published: (2025)
by: van Erven, Tim, et al.
Published: (2025)
Policy-based Tuning of Autoregressive Image Models with Instance- and Distribution-Level Rewards
by: Baran, Orhun Buğra, et al.
Published: (2026)
by: Baran, Orhun Buğra, et al.
Published: (2026)
Hitting Time Isomorphism for Multi-Stage Planning with Foundation Policies
by: Boock, Magnus Victor, et al.
Published: (2026)
by: Boock, Magnus Victor, et al.
Published: (2026)
Minimax Rate-Optimal Algorithms for High-Dimensional Stochastic Linear Bandits
by: Liu, Jingyu, et al.
Published: (2025)
by: Liu, Jingyu, et al.
Published: (2025)
Heavy-Tailed Linear Bandits: Huber Regression with One-Pass Update
by: Wang, Jing, et al.
Published: (2025)
by: Wang, Jing, et al.
Published: (2025)
Active Learning for Stochastic Contextual Linear Bandits
by: Brunskill, Emma, et al.
Published: (2026)
by: Brunskill, Emma, et al.
Published: (2026)
PAC-Bayesian Soft Actor-Critic Learning
by: Tasdighi, Bahareh, et al.
Published: (2023)
by: Tasdighi, Bahareh, et al.
Published: (2023)
Adaptive Ensemble Aggregation for Actor-Critics
by: Werge, Nicklas, et al.
Published: (2025)
by: Werge, Nicklas, et al.
Published: (2025)
Deep Exploration with PAC-Bayes
by: Tasdighi, Bahareh, et al.
Published: (2024)
by: Tasdighi, Bahareh, et al.
Published: (2024)
Distributional Active Inference
by: Akgül, Abdullah, et al.
Published: (2026)
by: Akgül, Abdullah, et al.
Published: (2026)
Regret Distribution in Stochastic Bandits: Optimal Trade-off between Expectation and Tail Risk
by: Simchi-Levi, David, et al.
Published: (2023)
by: Simchi-Levi, David, et al.
Published: (2023)
Regret Tail Characterization of Optimal Bandit Algorithms with Generic Rewards
by: Panda, Subhodip, et al.
Published: (2026)
by: Panda, Subhodip, et al.
Published: (2026)
A Simple and Optimal Policy Design with Safety against Heavy-Tailed Risk for Stochastic Bandits
by: Simchi-Levi, David, et al.
Published: (2022)
by: Simchi-Levi, David, et al.
Published: (2022)
Data-Driven Upper Confidence Bounds with Near-Optimal Regret for Heavy-Tailed Bandits
by: Tamás, Ambrus, et al.
Published: (2024)
by: Tamás, Ambrus, et al.
Published: (2024)
Learning to Sparsify Stochastic Linear Bandits
by: Wang, Zhengmiao, et al.
Published: (2026)
by: Wang, Zhengmiao, et al.
Published: (2026)
Deep Actor-Critics with Tight Risk Certificates
by: Tasdighi, Bahareh, et al.
Published: (2025)
by: Tasdighi, Bahareh, et al.
Published: (2025)
Improved Regret Bounds for Bandits with Expert Advice
by: Cesa-Bianchi, Nicolò, et al.
Published: (2024)
by: Cesa-Bianchi, Nicolò, et al.
Published: (2024)
Similar Items
-
Tighter Confidence Bounds for Sequential Kernel Regression
by: Flynn, Hamish, et al.
Published: (2024) -
Weighted Sequential Bayesian Inference for Non-Stationary Linear Contextual Bandits
by: Werge, Nicklas, et al.
Published: (2023) -
Posterior Sampling Reinforcement Learning with Gaussian Processes for Continuous Control: Sublinear Regret Bounds for Unbounded State Spaces
by: Flynn, Hamish, et al.
Published: (2026) -
Linear Bandits with Non-i.i.d. Noise
by: Abélès, Baptiste, et al.
Published: (2025) -
Sparse Nonparametric Contextual Bandits
by: Flynn, Hamish, et al.
Published: (2025)