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

52104156208 · Jun 202019922001200920172026
48 results for Hybrid Transfer RL

HySRL improves RL sample efficiency with shifted-dynamics data.

problem Leveraging historical data with shifted dynamics to improve sample efficiency in RL.
method HySRL, a hybrid transfer RL algorithm that uses prior information on dynamics shift to achieve better sample complexity.
result HySRL achieves problem-dependent sample complexity and outperforms pure online RL.

Paper proposes a hybrid RL algorithm that combines offline and online data without needing reward info.

problem How to efficiently use online data to improve RL policies using only offline data.
method A three-stage hybrid RL algorithm that uses reward-agnostic exploration and model-based offline RL.
result The hybrid RL algorithm outperforms both pure offline and pure online RL in sample complexity.

New algorithm fills gaps in offline data for hybrid RL, achieving similar gains without coverage assumptions.

problem Lack of provable benefits in hybrid RL with coverage assumptions.
method Warm-starting optimistic online algorithms with offline data in experience replay buffer.
result Hybrid RL gains similar to offline-only RL without coverage assumptions, demonstrating efficient exploration.

Hybrid RL algorithm combines offline and online data for robust and efficient policy learning.

problem Combining robust on-policy methods with efficient offline data for hybrid RL.
method Integrates off-policy training on offline data into on-policy NPG framework.
result Achieves state-of-the-art theoretical guarantees and maintains on-policy NPG guarantees.

Unified hybrid RL algorithm improves online RL performance with offline data.

problem Improving reinforcement learning performance with limited online data.
method A unified hybrid RL algorithm combining offline and online data.
result Unified algorithm achieves state-of-the-art results in sub-optimality gap and online learning regret.

SF-DQN improves RL transfer by learning successor features.

problem Transfer RL with shared dynamics but different reward functions.
method Decomposes Q-function into SF and reward mapping; uses GPI for policy improvement.
result SF-DQN with GPI converges faster and generalizes better than traditional RL methods.

Q-learning is one of the most popular methods in Reinforcement Learning (RL). Transfer Learning aims to utilize the learned knowledge from source tasks to help new tasks to improve the sample complexity of the new tasks. Considering that data collection in RL is both more time and cost consuming and Q-learning converge…

2018-09-21abs ↗pdf ↗

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 ↗

We consider the problem of knowledge transfer when an agent is facing a series of Reinforcement Learning (RL) tasks. We introduce a novel metric between Markov Decision Processes (MDPs) and establish that close MDPs have close optimal value functions. Formally, the optimal value functions are Lipschitz continuous with …

2020-01-15abs ↗pdf ↗

Current reinforcement learning (RL) methods can successfully learn single tasks but often generalize poorly to modest perturbations in task domain or training procedure. In this work, we present a decoupled learning strategy for RL that creates a shared representation space where knowledge can be robustly transferred. …

2018-04-27abs ↗pdf ↗

Reincarnating RL reuses prior work to accelerate RL progress.

problem Efficiency and accessibility in reinforcement learning for large-scale applications.
method Transfer of learned policies between RL agents or design iterations, focusing on value-based RL.
result Demonstrated gains in performance over tabula rasa RL on various tasks.

Transfer Learning (TL) has shown great potential to accelerate Reinforcement Learning (RL) by leveraging prior knowledge from past learned policies of relevant tasks. Existing transfer approaches either explicitly computes the similarity between tasks or select appropriate source policies to provide guided explorations…

2020-02-19abs ↗pdf ↗

One-step Bellman alignment improves online RL by reducing task mismatch.

problem Online RL struggles with task similarity defined by rewards or transitions.
method One-step Bellman alignment and re-weighted targeting (RWT) to correct task mismatch.
result Regret bounds show task shift complexity, not target MDP, affects performance.

We extend the concept of transfer learning, widely applied in modern machine learning algorithms, to the emerging context of hybrid neural networks composed of classical and quantum elements. We propose different implementations of hybrid transfer learning, but we focus mainly on the paradigm in which a pre-trained cla…

2019-12-17abs ↗pdf ↗

Proposes a method to improve few-shot transfer in off-dynamics RL.

problem Traditional RL struggles with transferring policies between environments with different dynamics.
method Introduces a penalty to regulate source-trained policies in target environments with limited data.
result Improves performance in various off-dynamics RL scenarios compared to existing methods.

Paper introduces a new method for improving reinforcement learning performance using transfer learning.

problem Improving reinforcement learning performance with limited sample sizes in dynamic decision-making scenarios.
method Developed a novel ``re-weighted targeting procedure'' and ``transfer deep QQ^*-learning'' approach.
result Demonstrated improved reinforcement learning performance through strategic sample construction.

Hybrid framework optimizes reinsurance using generative models and reinforcement learning.

problem Traditional reinsurance optimization relies on restrictive assumptions and static designs.
method Combines VAEs for joint distribution learning and PPO for dynamic treaty parameter adaptation.
result Hybrid method produces more resilient outcomes with higher surpluses and lower tail risk.

Hybrid RL method optimizes trading by balancing continuous and discrete actions.

problem Optimal execution in algorithmic trading with continuous-discrete action space.
method Combines continuous and discrete RL agents for better trading decisions.
result Significantly outperforms existing methods in trading efficiency and stability.

In recent years, supervised machine learning models have demonstrated tremendous success in a variety of application domains. Despite the promising results, these successful models are data hungry and their performance relies heavily on the size of training data. However, in many healthcare applications it is difficult…

2018-12-03abs ↗pdf ↗

Offline RL tackles resource-constrained online deployment with improved policy transfer.

problem Training policies with limited online features using a rich offline dataset.
method Introduce a policy transfer algorithm that first trains a teacher agent with full offline features and then transfers knowledge to a student agent with limited online features.
result Consistent improvement in performance over baseline methods on resource-constrained datasets.

We consider the transfer of experience samples (i.e., tuples < s, a, s', r >) in reinforcement learning (RL), collected from a set of source tasks to improve the learning process in a given target task. Most of the related approaches focus on selecting the most relevant source samples for solving the target task, but t…

2018-05-28abs ↗pdf ↗

In this report, we present a new reinforcement learning (RL) benchmark based on the Sonic the Hedgehog (TM) video game franchise. This benchmark is intended to measure the performance of transfer learning and few-shot learning algorithms in the RL domain. We also present and evaluate some baseline algorithms on the new…

2018-04-10abs ↗pdf ↗

New algorithm uses density ratios for efficient online reinforcement learning.

problem Challenges in collecting exploratory data for online reinforcement learning.
method Density ratio modeling for online exploration, combining truncation and optimism.
result Sample-efficient online exploration achieved with GLOW and HyGLOW.

Framework for lifelong learning using eigentasks to avoid forgetting and transfer knowledge.

problem Avoiding forgetting and transferring knowledge in lifelong learning.
method Eigentask framework: skills paired with generative models, wake-sleep cycle for learning and consolidation.
result Improved performance in supervised continual learning, evidence of forward knowledge transfer.

Transfer in Reinforcement Learning (RL) refers to the idea of applying knowledge gained from previous tasks to solving related tasks. Learning a universal value function (Schaul et al., 2015), which generalizes over goals and states, has previously been shown to be useful for transfer. However, successor features are b…

2020-01-05abs ↗pdf ↗

UCB-TQL learns from multiple tasks with shared dynamics and adapts to task-specific variations.

problem Transfer reinforcement learning with composite MDPs where tasks share core dynamics but have sparse differences.
method UCB-TQL, a novel transfer RL algorithm for composite MDPs.
result Achieved a regret bound of ildeO(eH5N) ilde{O}(\sqrt{eH^5N}) that scales independently of the ambient dimension.

Paper tackles sim-to-real transfer in continuous domains with partial observations.

problem Lack of theoretical foundation for sim-to-real transfer in continuous domains with partial observations.
method Developed a new algorithm for infinite-horizon average-cost LQGs and established a regret bound.
result A popular robust adversarial training algorithm can learn competitive policies from simulation to real-world environments.

Study proposes adaptive RL for dynamic portfolio optimization.

problem Traditional portfolio optimization models fail to adapt to regime shifts.
method Regime-aware reinforcement learning framework with hybrid observations and constrained reward functions.
result Transformer PPO achieves highest risk-adjusted returns, while LSTM variants offer a good balance.

Paper presents a hybrid framework combining sentiment analysis and market indicators for financial portfolio optimization.

problem Improving financial portfolio optimization through better integration of sentiment and market data.
method A three-tier hierarchical RL framework integrating LLMs, DRL, and market data.
result Achieved a 26% annualized return and Sharpe ratio of 1.2, outperforming benchmarks.

Paper analyzes AIRL in high-dimensional spaces using random matrix theory.

problem AIRL's performance challenges in high-dimensional environments.
method Examined the rank of the matrix derived from transition matrix, applied random matrix theory.
result High-dimensional scenarios reveal transfer limitations not inherent to AIRL framework.

Paper tackles robust knowledge transfer in parallel RL tasks.

problem Transfer knowledge from low-tier to high-tier tasks in parallel RL without shared dynamics or reward functions.
method Identifies Optimal Value Dominance condition and proposes online learning algorithms for both tasks.
result Achieves constant regret on partial states and near-optimal regret when tasks are dissimilar.

Transfer and adaptation to new unknown environmental dynamics is a key challenge for reinforcement learning (RL). An even greater challenge is performing near-optimally in a single attempt at test time, possibly without access to dense rewards, which is not addressed by current methods that require multiple experience …

2019-10-17abs ↗pdf ↗

The composition of elementary behaviors to solve challenging transfer learning problems is one of the key elements in building intelligent machines. To date, there has been plenty of work on learning task-specific policies or skills but almost no focus on composing necessary, task-agnostic skills to find a solution to …

2019-05-25abs ↗pdf ↗