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

Trend · papers per month

3977116154 · Jun 202019922001200920172026
48 results for RL vs Model-Based

RL agent outperforms model-based approach in detecting price manipulation.

problem Detecting and exploiting price manipulation opportunities.
method Compared model-free RL with model-based approach in a market with Almgren-Chriss framework.
result RL consistently outperforms model-based approach, especially with noisy parameter estimates.

Introduces LoCA regret to evaluate model-based RL methods.

problem Lack of consistent metrics to evaluate model-based RL methods.
method Inspired by neuroscience, introduces LoCA regret to measure model-based behavior.
result LoCA regret can identify model-based behavior and assess how close methods are to optimal model-based behavior.

Unified framework for model-based RL with sample complexity guarantees.

problem Designing efficient posterior sampling methods for model-based RL.
method Optimistic posterior sampling, Hellinger distance reduction, data likelihood measurement.
result Unified algorithms with state-of-the-art sample complexity guarantees.

FOCUS improves offline RL by incorporating causal structure into world-models.

problem Learning effective policies from historical data without interaction.
method FOCUS proposes a practical algorithm that learns and leverages causal structure in offline RL.
result FOCUS outperforms plain model-based offline RL algorithms and other causal model-based RL algorithms.

This work explores representation complexity in RL paradigms, revealing model-based RL as the easiest task.

problem Investigating the representation complexity gap among model-based, policy-based, and value-based RL.
method Demonstrated through analysis of Markov decision processes (MDPs) and introduced new classes of MDPs.
result Representation complexity hierarchy: model-based RL > policy-based RL > value-based RL.

MADE improves exploration in RL by maximizing deviation from explored regions.

problem Efficient exploration in high-dimensional RL tasks with sparse rewards.
method Proposes a new exploration approach via maximizing the deviation of the occupancy of the next policy from explored regions, adding it as an adaptive regularizer to the RL objective.
result Significantly improves sample efficiency in navigation and locomotion tasks.

Paper tackles sample-efficient offline RL, proposing data diversity and unified algorithms.

problem Sample-efficient learning from historical data for sequential decision-making.
method Proposes data diversity and unifies three offline RL algorithm classes: VS, RO, and PS.
result Comparable sample efficiency for VS, RO, and PS algorithms under standard assumptions.

Optimistic RL algorithms are simplified for deep RL with competitive performance.

problem Achieving accurate optimism in model-based RL for large-scale problems.
method Interpreting scalable optimistic model-based algorithms as solving a tractable noise augmented MDP.
result Competitive regret bound of ildeO(SHAT) ilde{\mathcal{O}}( |\mathcal{S}|H\sqrt{|\mathcal{A}| T } ) for Gaussian noise augmentation.

This study tackles adversarial corruption in model-based reinforcement learning.

problem Adversarial corruption in model-based reinforcement learning.
method Maximum likelihood estimation (MLE) approach for learning transition model in both online and offline settings.
result Proves a regret of ildeO(T+C) ilde{\mathcal{O}}(\sqrt{T} + C) for CR-OMLE and a suboptimality of O(C/n)\mathcal{O}(C/n) for CR-PMLE.

Clarifies model-based RL's theoretical issues and counterexamples for popular losses.

problem Model-based reinforcement learning's empirical performance vs. theoretical properties and popular loss functions.
method Analyzes empirical and theoretical aspects of model-based RL and constructs counterexamples for losses.
result MuZero loss fails in stochastic and deterministic environments, leading to exponential sample complexity.

Unified framework for policy improvement in RL with benefits in data efficiency and computation.

problem Improving data efficiency and computation in reinforcement learning for continuous control.
method Local, regularized policy improvement with tree search for continuous action spaces.
result Improves data efficiency and reduces wall-clock time in high-dimensional domains.

Proposes a method for model-based RL in complex environments without perfect simulators.

problem Lack of cheap and perfect simulators in real-world tasks.
method Induces a world program by learning dynamics and actions in graph-based environments.
result World program enables complex planning tasks in environments without perfect simulators.

RH-UCRL combines pessimism and optimism for robust RL.

problem Ensuring reliable performance in real-world RL tasks with worst-case scenarios.
method RH-UCRL is a model-based RL algorithm that optimizes between an agent and an adversary, distinguishing between epistemic and aleatoric uncertainty.
result RH-UCRL achieves near-optimal sample complexity guarantees and outperforms other robust RL algorithms in adversarial environments.

New algorithms achieve uniform-PAC guarantees for RL with bounded eluder dimension.

problem Achieving strong performance guarantees in reinforcement learning.
method Proposes algorithms for nonlinear bandits and model-based episodic RL with a bounded eluder dimension.
result Achieves uniform-PAC sample complexity that matches state-of-the-art regret bounds or sample complexity guarantees.

RL in MFGs is as hard as solving many single-agent RL problems.

problem Learning Nash Equilibrium in Mean-Field Games (MFGs).
method Introduce P-MBED to measure model complexity, develop a novel exploration strategy, and establish polynomial sample complexity results.
result Learning Nash Equilibrium in MFGs is no more statistically challenging than solving a logarithmic number of single-agent RL problems.

We discuss deep reinforcement learning in an overview style. We draw a big picture, filled with details. We discuss six core elements, six important mechanisms, and twelve applications, focusing on contemporary work, and in historical contexts. We start with background of artificial intelligence, machine learning, deep…

2018-10-15abs ↗pdf ↗

A method for learning a context latent vector to improve generalization in model-based RL.

problem Learning a global dynamics model that can generalize across different dynamics.
method Decomposes learning a global dynamics model into two stages: learning a context latent vector and predicting next states.
result Achieves superior generalization across various simulated robotics and control tasks.

Efficient RL algorithm for multinomial logistic MDPs with provable guarantees.

problem Model-based RL for episodic MDPs with unknown transition probabilities.
method Upper confidence bound-based algorithm for exploration-exploitation balance.
result Achieves ildeO(dH3T) ilde{O}(d \sqrt{H^3 T}) regret bound for multinomial logistic models.

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.

Myopic optimization outperforms reinforcement learning in portfolio management, leading to lower returns and higher risks.

problem Reinforcement learning strategies in portfolio management yield lower or negative returns and higher risks compared to myopic optimization.
method Modeling execution/liquidation frictions with mark-to-market accounting, using Malliavin calculus to derive policy gradients and risk shadow price, and quantifying phantom profit.
result Myopic optimization outperforms reinforcement learning in portfolio management, leading to better returns and lower risks.

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 paper optimizes model-based RL for two-player zero-sum games with near-optimal sample complexity.

problem Optimizing model-based reinforcement learning for two-player zero-sum games with minimal samples.
method Model-based reinforcement learning approach for two-player discounted zero-sum Markov games with a generative model.
result Achieves a sample complexity of ildeO(SAB(1γ)3ε2) ilde O(|S||A||B|(1-γ)^{-3}ε^{-2}) for finding the Nash equilibrium and ε-NE policies.

Combines model-based and model-free RL for better financial market performance.

problem Challenges of Reinforcement Learning in volatile financial markets.
method Adapts model-based RL with model-free RL, incorporating contextual signals and walk-forward analysis.
result Outperforms traditional financial models in various metrics.