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.

169,051 papers · 148 categories

Trend · papers per month

3570105140 · Jun 202019922001200920182026
48 results for end-to-end RL

Proposes deep-RL with GANs for ultra-reliable low-latency communication.

problem Resource allocation for URLLC with high reliability and low latency.
method Experienced deep-RL framework using GANs to pre-train and optimize resource allocation.
result Deep-RL framework achieves near-optimal reliability and latency under URLLC constraints.

A new EM framework for goal-conditioned RL improves performance on sparse reward tasks.

problem Handling sparse rewards in goal-conditioned reinforcement learning.
method A graphical model framework with an EM algorithm that includes a learning-in-hindsight E-step and a supervised M-step.
result hEM significantly outperforms model-free baselines on goal-conditioned benchmarks with sparse rewards.

Low precision RL distillation enables real-time game play on neuromorphic hardware.

problem Limited use of low precision networks in reinforcement learning.
method Policy distillation from high precision to low precision networks.
result Low precision distillation enables real-time game play on low-power hardware.

Paper proposes a Hellinger distance regularizer to disentangle options in reinforcement learning.

problem Temporal abstraction in reinforcement learning, specifically the mutual exclusivity of learned options.
method Introduces a Hellinger distance regularizer to disentangle options.
result Demonstrates the effectiveness of the Hellinger distance regularizer in disentangling options.

New unsupervised learning task improves RL performance.

problem Reward-driven feature learning limitations in RL from images.
method Introduce Augmented Temporal Contrast (ATC) for unsupervised learning of image representations.
result Training encoders using ATC matches or outperforms end-to-end RL in most environments.

SRL embeds combinatorial optimization into RL for better decision-making.

problem Challenges of standard RL in complex, structured decision-making problems.
method Structured Reinforcement Learning (SRL) with combinatorial optimization layers in actor neural network.
result SRL outperforms unstructured RL and imitation learning by up to 92% on dynamic problems.

A framework disentangles controllable objects from visual signals for improved RL.

problem Improving sample efficiency and game performance in vision-based RL.
method Action-conditioned video prediction to disentangle controllable objects.
result Improved sample efficiency and game performance in Atari games.

FOCAL tackles offline meta-reinforcement learning with efficient task inference and behavior regularization.

problem Efficiently adapt RL algorithms to unseen tasks without interactions, addressing bootstrapping errors and robust task inference.
method FOCAL combines behavior regularization, a deterministic context encoder, and a negative-power distance metric for efficient task inference.
result FOCAL outperforms prior algorithms on meta-RL benchmarks, demonstrating computational efficiency.

Safe RL for safety-critical tasks using CBFs and model-free RL.

problem Limited safety guarantees in RL for real-world applications.
method Combines model-free RL with CBFs and GP dynamics modeling.
result Demonstrates greater sample efficiency and safety in learning.

The paper shows how continuous attention can lead to better object representations.

problem Learning good representations from data without labeled examples.
method Integrating unsupervised learning and reinforcement learning with intrinsic motivation.
result The proposed algorithm improves object recognition in few-shot settings.

Proposes a deep RL framework for optimizing task allocation in crowdsourcing platforms.

problem Optimizing task allocation in crowdsourcing platforms for both workers and requesters.
method Uses Deep Q-Network (DQN) to estimate long-term rewards, considering immediate and future rewards simultaneously.
result Demonstrates superior performance in synthetic and real datasets.

End-to-end training of neural networks with black-box functions.

problem Training neural networks for tasks that require precise, non-differentiable functions.
method Approximate black-box functions with differentiable neural networks and integrate them into neural network training.
result Neural network trained to compute inputs for black-box functions, generalizing better and learning more efficiently.

Paper tackles overfitting in RL for trade execution.

problem Overfitting in reinforcement learning methods for optimized trade execution.
method Modeling trade execution as offline RL with dynamic context (ORDC), deriving generalization bound, proposing compact context representations.
result Proposed methods effectively alleviate overfitting and improve performance.

New approach decouples skill learning and language grounding for autonomous agents.

problem Autonomous acquisition of skills without external instructions and feedback.
method Language-Goal-Behavior (LGB) architecture with semantic representation.
result Decouples skill learning and language grounding, enabling diversity and strategy switching.

The broad set of deep generative models (DGMs) has achieved remarkable advances. However, it is often difficult to incorporate rich structured domain knowledge with the end-to-end DGMs. Posterior regularization (PR) offers a principled framework to impose structured constraints on probabilistic models, but has limited …

2018-06-26abs ↗pdf ↗

BCRL learns a Bellman complete representation for offline RL policy evaluation.

problem Learning a Q-function efficiently from offline data.
method BCRL learns a linear Bellman complete representation directly from data, enabling efficient OPE.
result BCRL achieves competitive OPE error and outperforms FQE in certain scenarios.

CryptoRLPM uses on-chain data to improve crypto portfolio management performance.

problem Lack of effective use of on-chain data in RL-based crypto portfolio management.
method Developed CryptoRLPM, an RL-based system that incorporates on-chain data for crypto PM, consisting of five units.
result CryptoRLPM outperforms baselines in ARR, DRR, and SR, especially for Bitcoin.

Neural-Kernel CME tackles scalability and expressiveness challenges in conditional distribution representation.

problem Scalability and expressiveness challenges in kernel conditional mean embeddings.
method Combines deep learning with CMEs using a neural network optimization framework.
result Achieves competitive and often superior performance in conditional density estimation and RL.

DPFRL uses particle filters for decision making with complex visual observations.

problem Decision making with partial complex visual observations.
method Discriminative Particle Filter Reinforcement Learning (DPFRL) with a differentiable particle filter in the neural network policy.
result DPFRL outperforms state-of-the-art POMDP RL models in complex visual observation tasks.

Proves error bounds for state representation in RL using graph spectral features.

problem Addressing the curse of dimensionality in RL with unknown transition graphs.
method Proves upper bounds on approximation error of linear value function approximation using learned spectral features of the state-graph.
result Error bounds scale with algebraic connectivity and eigenvector estimation error.

New insights into state representations in RL help design better learning rules.

problem Lack of automatic feature learning in RL for large or continuous state spaces.
method Bootstrapping methods and theoretical analysis of temporal difference learning.
result State representations differ from other auxiliary-task-based approaches.

Activities in reinforcement learning (RL) revolve around learning the Markov decision process (MDP) model, in particular, the following parameters: state values, V; state-action values, Q; and policy, pi. These parameters are commonly implemented as an array. Scaling up the problem means scaling up the size of the arra…

2018-07-23abs ↗pdf ↗

Recently, deep reinforcement learning (RL) methods have been applied successfully to multi-agent scenarios. Typically, these methods rely on a concatenation of agent states to represent the information content required for decentralized decision making. However, concatenation scales poorly to swarm systems with a large…

2018-07-17abs ↗pdf ↗

Improved cooperation between levels boosts reinforcement learning performance.

problem Training multi-level policies in hierarchical reinforcement learning.
method Modeling policy optimization as a multi-agent process and inducing cooperation between sub-policies.
result Inducing cooperation between sub-policies leads to stronger and more sample-efficient policies.

Deep RL learns effective job shop scheduling rules from raw features.

problem Designing effective priority dispatching rules for job shop scheduling is challenging.
method End-to-end deep reinforcement learning using Graph Neural Networks.
result Agent learns high-quality dispatching rules from raw features and generalizes well to unseen instances.

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.