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,657 papers · 148 categories

Trend · papers per month

58117175233 · Jun 202019922001200920172026
48 results for Bayesian RL

This paper shows RL with KL penalties is equivalent to Bayesian inference for fine-tuning LMs.

problem Fine-tuning large language models to avoid undesirable features.
method Analyzed KL-regularized RL and showed it's equivalent to variational inference.
result KL-regularized RL avoids distribution collapse and is more insightful as Bayesian inference.

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 ↗

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.

Bayesian RL enhances LLMs to reflectively explore and correct errors.

problem LLMs trained via RL lack reflective behaviors like rethinking and error correction.
method Bayesian RL framework that optimizes expected return under posterior distribution over Markov decision processes.
result BARL algorithm improves LLM performance in reasoning tasks.

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 ↗

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.

BCPO optimizes offline RL policies by converting uncertainty into conservative bounds.

problem Offline RL's fragility under distribution shifts and model errors.
method Bayesian approach with credible lower bounds and KL regularization.
result BCPO yields an uncertainty-calibrated policy that avoids exploiting model errors.

In preference-based reinforcement learning (RL), an agent interacts with the environment while receiving preferences instead of absolute feedback. While there is increasing research activity in preference-based RL, the design of formal frameworks that admit tractable theoretical analysis remains an open challenge. Buil…

2019-08-04abs ↗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.

We study reinforcement learning (RL) in high dimensional episodic Markov decision processes (MDP). We consider value-based RL when the optimal Q-value is a linear function of d-dimensional state-action feature representation. For instance, in deep-Q networks (DQN), the Q-value is a linear function of the feature repres…

2018-02-13abs ↗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 ↗

BOMS enhances offline MBRL by improving model selection with Bayesian optimization.

problem Inaccurate model selection in offline MBRL due to distribution shift.
method Proposes BOMS, an active model selection framework using Bayesian optimization.
result Improves model selection with only a small amount of online interaction.

Control of non-episodic, finite-horizon dynamical systems with uncertain dynamics poses a tough and elementary case of the exploration-exploitation trade-off. Bayesian reinforcement learning, reasoning about the effect of actions and future observations, offers a principled solution, but is intractable. We review, then…

2015-10-13abs ↗pdf ↗

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.

A common problem in Machine Learning and statistics consists in detecting whether the current sample in a stream of data belongs to the same distribution as previous ones, is an isolated outlier or inaugurates a new distribution of data. We present a hierarchical Bayesian algorithm that aims at learning a time-specific…

2018-05-15abs ↗pdf ↗

This study assesses model influence on RL algorithm performance.

problem Unclear contribution of model-based RL algorithms to recent progress.
method Established a set of models for comparison, including NNs, BNNs, GPs, and ensembles.
result Concrete Dropout NN shows superior performance across benchmark tasks.

Tabular Q-learning outperforms advanced RL methods in monetary policy.

problem Dynamic setting of short-term interest rates to stabilize inflation and unemployment under uncertain macroeconomic conditions.
method Discrete-action Markov Decision Process with tabular Q-learning, SARSA, Actor-Critic, Deep Q-Networks, Bayesian Q-learning, POMDP formulations.
result Standard tabular Q-learning achieved the best performance (-615.13 +- 309.58 mean return) compared to advanced RL methods and traditional policy rules.

CAGES optimizes expensive RL problems by efficiently learning gradients from multiple sources.

problem Optimizing expensive-to-evaluate functions in high-dimensional spaces.
method Cost-Aware Gradient Entropy Search (CAGES) for multi-fidelity Bayesian optimization.
result Significant performance improvements on synthetic and RL benchmark problems.

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 ↗

This work uses RL to optimize batch experiments in SDOE.

problem Maximizing knowledge with limited resources and constraints.
method Reinforcement Learning for batch-sampling in Bayesian SDOE.
result The proposed algorithm optimizes experiment selection for multiple tasks.

We introduce a deep generative model for functions. Our model provides a joint distribution p(f, z) over functions f and latent variables z which lets us efficiently sample from the marginal p(f) and maximize a variational lower bound on the entropy H(f). We can thus maximize objectives of the form E_{f~p(f)}[R(f)] + c…

2018-07-11abs ↗pdf ↗

ContraBAR uses contrastive learning to learn Bayes-optimal policies in RL.

problem Learning optimal policies for unknown tasks sampled from a known distribution.
method Proposes ContraBAR, a meta RL algorithm using contrastive predictive coding (CPC) for belief inference.
result ContraBAR achieves comparable performance to state-of-the-art methods and is computationally efficient.

Scalable and effective exploration remains a key challenge in reinforcement learning (RL). While there are methods with optimality guarantees in the setting of discrete state and action spaces, these methods cannot be applied in high-dimensional deep RL scenarios. As such, most contemporary RL relies on simple heuristi…

2016-05-31abs ↗pdf ↗

Reinforcement learning (RL) methods often rely on massive exploration data to search optimal policies, and suffer from poor sampling efficiency. This paper presents a mixed reinforcement learning (mixed RL) algorithm by simultaneously using dual representations of environmental dynamics to search the optimal policy wit…

2020-02-28abs ↗pdf ↗

In record linkage (RL), or exact file matching, the goal is to identify the links between entities with information on two or more files. RL is an important activity in areas including counting the population, enhancing survey frames and data, and conducting epidemiological and follow-up studies. RL is challenging when…

2012-12-20abs ↗pdf ↗

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.

Dropout is used as a practical tool to obtain uncertainty estimates in large vision models and reinforcement learning (RL) tasks. But to obtain well-calibrated uncertainty estimates, a grid-search over the dropout probabilities is necessary - a prohibitive operation with large models, and an impossible one with RL. We …

2017-05-22abs ↗pdf ↗

Develops a personalized reinforcement learning algorithm for dyadic health interventions.

problem Personalizing health interventions for dyadic relationships in mobile health.
method Dyadic Reinforcement Learning (dyadic RL), a Bayesian and hierarchical online algorithm.
result Established a regret bound and demonstrated empirical performance through simulations and real data.

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.

In reinforcement learning (RL), agents often operate in partially observed and uncertain environments. Model-based RL suggests that this is best achieved by learning and exploiting a probabilistic model of the world. 'Active inference' is an emerging normative framework in cognitive and computational neuroscience that …

2019-11-24abs ↗pdf ↗

This work tackles model-based RL by optimizing state-action queries to learn policies with minimal data.

problem Expensive state transitions in practical RL problems limit the use of standard RL algorithms.
method Bayesian optimal experimental design to guide selection of state-action queries.
result Data-efficient RL approach that learns optimal policies with up to 1,000x less data.

This study uses HMM and RL to dynamically allocate equities, Treasuries, and gold based on market regimes.

problem Developing a dynamic portfolio allocation strategy for different market conditions.
method Characterizes market regimes using Markov switching models and HMM, then applies RL for allocation decisions.
result RL-based allocation outperforms passive strategies, providing lower drawdowns and higher Sharpe ratios.

New bounds on IDS for RL show how to balance computation and learning efficiency.

problem Understanding and optimizing information-directed sampling (IDS) for reinforcement learning.
method Developed novel information-theoretic tools to bound information ratio and cumulative information gain.
result Derived prior-free Bayesian regret bounds for IDS in tabular finite-horizon MDPs and improved computational efficiency.

Novel MBRL method for large-scale RL with reduced posterior complexity.

problem Theoretical guarantees for MBRL in large spaces with complex models.
method Kernelized Stein Discrepancy for compression of posterior estimate.
result Sublinear Bayesian regret and up to 50% reduction in training time.