Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

4008001,2001,600 · Jun 202019922001200920172026
48 results for Bayesian Reinforcement Learning

Novel framework for Bayesian reinforcement learning infers value function distributions.

problem Bayesian reinforcement learning's challenges in inferring value function distributions.
method Inferential Induction framework for Bayesian reinforcement learning, developing Bayesian Backwards Induction algorithm.
result Proposed algorithm is competitive with state-of-the-art methods.

Bayesian meta-reinforcement learning improves over point estimates with Laplace approximation.

problem Improving meta-reinforcement learning by providing full posterior distributions.
method Augmenting point estimates with Laplace approximation for full posterior distributions.
result Our method performs similarly to variational baselines with fewer parameters.

Study on Bayesian reinforcement learning performance bounds.

problem Achieving optimal performance in model-based Bayesian reinforcement learning.
method Defining minimum Bayesian regret, deriving upper bounds using relative entropy and Wasserstein distance, and applying these to specific MDP cases.
result Upper bounds on minimum Bayesian regret for MDPs, including specific cases like MAB and online optimization with partial feedback.

Novel Bayesian meta-reinforcement learning framework improves traffic signal control robustness.

problem Lack of robustness and stability in adaptation for traffic signal control.
method Value-based Bayesian meta-reinforcement learning framework BM-DQN with fast-adaptation variation and DQN fast-update advantage.
result Framework adapts more quickly and robustly to new scenarios than previous methods.

Paper improves Bayesian regret bounds for Thompson Sampling in reinforcement learning.

problem Improving Bayesian regret bounds for Thompson Sampling in reinforcement learning.
method Using a discrete set of surrogate environments and posterior consistency analysis, the authors derive an upper bound of order O(Hdl1T)O(H\sqrt{d_{l_1}T}).
result The derived upper bound of O(Hdl1T)O(H\sqrt{d_{l_1}T}) is a significant improvement over previous bounds.

New reinforcement learning bound improves generalization for sequential data.

problem Challenges in obtaining generalization guarantees for reinforcement learning due to sequential data.
method PAC-Bayesian reinforcement learning with consideration of Markov dependencies and mixing time.
result Demonstrated practical utility through PB-SAC, providing meaningful confidence certificates.

Bayesian priors offer a compact yet general means of incorporating domain knowledge into many learning tasks. The correctness of the Bayesian analysis and inference, however, largely depends on accuracy and correctness of these priors. PAC-Bayesian methods overcome this problem by providing bounds that hold regardless …

2012-02-14abs ↗pdf ↗

Enhances RL with function approximation, improving regret bounds.

problem Improving exploration in reinforcement learning with function approximation.
method Prior-dependent Bayesian regret bound for PSRL with linear mixture MDPs, using value-targeted model learning and variance reduction.
result Established an upper bound of O(dH3TlogT){\mathcal{O}}(d\sqrt{H^3 T \log T}) for PSRL.

vsOED optimizes experiment design with reinforcement learning for Bayesian models.

problem Optimizing the sequence of experiments in Bayesian models for efficient data collection.
method Reinforcement learning with variational posterior approximations to optimize design policy.
result vsOED achieves superior sample efficiency compared to existing methods.

Bayesian optimization outperforms other methods in hyperparameter tuning for reinforcement learning.

problem Finding optimal hyperparameters that generalize across random seeds in reinforcement learning.
method Benchmarked Successive Halving, Random Search, and Bayesian Optimization with and without repetitions on PPO2 algorithms for Cartpole and Inverted Pendulum tasks.
result Bayesian optimization with noise robust acquisition function is the best choice.

The paper solves IRL for Bayesian stopping time problems.

problem Identifying optimal actions in Bayesian stopping time problems.
method Novel IRL framework using Bayesian revealed preferences.
result Identifies optimality and constructs cost function estimates.

In the Bayesian approach to sequential decision making, exact calculation of the (subjective) utility is intractable. This extends to most special cases of interest, such as reinforcement learning problems. While utility bounds are known to exist for this problem, so far none of them were particularly tight. In this pa…

2011-06-18abs ↗pdf ↗

We propose a framework based on distributional reinforcement learning and recent attempts to combine Bayesian parameter updates with deep reinforcement learning. We show that our proposed framework conceptually unifies multiple previous methods in exploration. We also derive a practical algorithm that achieves efficien…

2018-05-04abs ↗pdf ↗

We use deep reinforcement learning to optimize experimental designs efficiently.

problem Optimizing sequential experimental designs with limited exploration and black-box models.
method Reduced the optimal design problem to an MDP and solved it with deep reinforcement learning.
result Our approach achieves state-of-the-art performance on both continuous and discrete design spaces.

Bayesian RL tackles uncertainty with deep generative models and sequential samplers.

problem Optimal decision-making in uncertain environments with limited data.
method Bayesian approach using deep generative models and prequential scoring rule for posterior inference. Policy learning via expected Thompson sampling.
result Improves policy learning in high-dimensional parameter spaces and continuous action spaces.

We state the problem of inverse reinforcement learning in terms of preference elicitation, resulting in a principled (Bayesian) statistical formulation. This generalises previous work on Bayesian inverse reinforcement learning and allows us to obtain a posterior distribution on the agent's preferences, policy and optio…

2011-04-29abs ↗pdf ↗

This paper introduces a set of algorithms for Monte-Carlo Bayesian reinforcement learning. Firstly, Monte-Carlo estimation of upper bounds on the Bayes-optimal value function is employed to construct an optimistic policy. Secondly, gradient-based algorithms for approximate upper and lower bounds are introduced. Finally…

2013-03-11abs ↗pdf ↗

Gradient-EM Bayesian meta-learning accelerates adaptation with reduced computation and improved robustness.

problem Efficient and robust adaptation to new tasks with uncertainty assessment.
method Extends Bayesian meta-learning with gradient-EM algorithm, decoupling inner-update from meta-update.
result Improves accuracy with less computation cost and enhanced robustness to uncertainty.

Bayesian methods for machine learning have been widely investigated, yielding principled methods for incorporating prior information into inference algorithms. In this survey, we provide an in-depth review of the role of Bayesian methods for the reinforcement learning (RL) paradigm. The major incentives for incorporati…

2016-09-14abs ↗pdf ↗

Bayesian approach improves ε\varepsilon-greedy exploration in RL.

problem Improving ε\varepsilon-greedy exploration in model-free RL.
method Introducing a Bayesian model update for ε\varepsilon based on BMC.
result Proposed ε\varepsilon- exttt{BMC} algorithm efficiently balances exploration and exploitation.

Improved sample efficiency in reinforcement learning with deep Gaussian processes.

problem Efficiently learn to control actions with limited interaction data.
method Deep Gaussian processes that simulate dynamics with depth and prior knowledge.
result Significantly improved early sample efficiency across various tasks, including half-cheetah control.

Bayesian sOED uses PG reinforcement learning for efficient experiment design.

problem Optimizing sequential experiments for nonlinear models with limited data.
method Formulated as POMDP, solved via PG methods with neural network parameterization.
result Demonstrated advantages over batch and greedy designs in contaminant source inversion.

This paper introduces a simple, general framework for likelihood-free Bayesian reinforcement learning, through Approximate Bayesian Computation (ABC). The main advantage is that we only require a prior distribution on a class of simulators (generative models). This is useful in domains where an analytical probabilistic…

2013-03-27abs ↗pdf ↗

This paper proposes an online tree-based Bayesian approach for reinforcement learning. For inference, we employ a generalised context tree model. This defines a distribution on multivariate Gaussian piecewise-linear models, which can be updated in closed form. The tree structure itself is constructed using the cover tr…

2013-05-08abs ↗pdf ↗

Bayesian method infers local rules for collective animal movement.

problem Learn local rules governing long-term group behaviors.
method Bayesian Inverse Reinforcement Learning with Linearly-Solvable Markov Decision Process.
result Recover true costs and find value of collective movement.

Bayesian method estimates dynamics from near-optimal trajectories.

problem Estimating dynamics from near-optimal expert trajectories in reinforcement learning.
method Constraint-based Bayesian approach integrating expert near-optimality.
result Significant improvements in decision-making and transfer success.

ALINE optimizes Bayesian inference and data acquisition by strategically querying informative data.

problem Strategic acquisition of informative data for Bayesian inference in challenging tasks.
method Unified framework combining amortized Bayesian inference and active data acquisition using a transformer architecture trained via reinforcement learning.
result ALINE delivers both instant and accurate inference along with efficient selection of informative points.

This paper improves Bayesian inference for predictive models with limited data.

problem Effective uncertainty quantification for training predictive models with limited data.
method Entropy-regularized gradient estimators to approximate the Bayesian posterior.
result The method generates diverse samples from the posterior distribution efficiently.

Paper presents a new method for Bayesian deep learning that scales to Atari games.

problem Training neural networks on complex environments like Atari games is challenging.
method Adapted temporal difference Q-learning to work with Bayesian inference.
result TAGI allows for analytical inference of neural network parameters, achieving performance comparable to gradient-based methods.

Bayesian model identifies three types of travelers adapting to feedback.

problem Capturing adaptive, feedback-driven travel behavior in heterogeneous individuals.
method Latent Class Reinforcement Learning (LCRL) model with Variational Bayes estimation.
result Three distinct traveler classes identified: context-dependent, persistent exploitative, and exploratory.

SymCircuit learns PC structure via entropy-regularized RL, improving inference efficiency and accuracy.

problem Greedy algorithms in PC structure learning lead to suboptimal solutions.
method Entropy-regularized reinforcement learning to train a learned generative policy for PC structure inference.
result SymCircuit learns the optimal policy as a tempered Bayesian posterior, improving inference efficiency and accuracy.

Bayesian optimization technique scaled using Vecchia approximations.

problem Scalability issue with Gaussian process surrogate models in Bayesian optimization.
method Adapted Vecchia approximation from spatial statistics to Gaussian processes, developed improvements and extensions.
result Methods compared favorably to state-of-the-art on various test functions and reinforcement learning problems.

Bayesian ATM improves stability and efficiency in mobile health interventions.

problem Balancing intervention efficacy with user burden in mobile health interventions.
method Bayesian extension to ATM using Kalman filter-style updates.
result Bayesian ATM achieves comparable or improved scalarized returns with lower variance and more stable policy behavior.

ICEE learns new RL tasks in less time with a Transformer model.

problem Efficient in-context policy learning for reinforcement learning.
method In-context Exploration-Exploitation (ICEE) algorithm that optimizes efficiency without explicit Bayesian inference.
result ICEE solves Bayesian optimization problems as efficiently as Gaussian process biased methods but in significantly less time.

Novel framework for risk-sensitive reinforcement learning with robustness against uncertainty.

problem Risk-sensitive reinforcement learning with uncertainty in transition dynamics.
method Developed a risk-sensitive robust Markov decision process (RSRMDP), derived its Bellman equation, and proposed a Bayesian Dynamic Programming (Bayesian DP) algorithm.
result Demonstrated convergence to near-optimal policies and analyzed sample and computational complexities.

Regularization improves generalization in Bayesian RL, shown through algorithmic stability.

problem Ensuring good generalization in Bayesian reinforcement learning.
method Algorithmic stability, using regularization and fast convergence rates for mirror descent.
result Regularization makes the optimal policy stable, improving generalization.

We propose a probabilistic framework to directly insert prior knowledge in reinforcement learning (RL) algorithms by defining the behaviour policy as a Bayesian posterior distribution. Such a posterior combines task specific information with prior knowledge, thus allowing to achieve transfer learning across tasks. The …

2018-09-30abs ↗pdf ↗

The explore{exploit dilemma is one of the central challenges in Reinforcement Learning (RL). Bayesian RL solves the dilemma by providing the agent with information in the form of a prior distribution over environments; however, full Bayesian planning is intractable. Planning with the mean MDP is a common myopic approxi…

2012-03-15abs ↗pdf ↗