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

4068121,2171,623 · Jun 202019922001200920172026
48 results for deep imitation learning

Paper uses deep imitation learning to predict aircraft trajectories accurately.

problem Inefficient and costly Air Traffic Management system limits predictability.
method Generative Adversarial Imitation Learning framework with trajectory clustering and classification.
result Accurate predictions for entire trajectory stages, pre- and tactical.

A new imitation learning method uses random search for simple policies, outperforming complex models.

problem Complexity and reward dependency issues in imitation learning.
method Derivative-free optimization with simple linear policies and random search.
result The proposed method achieves competitive performance on MuJoCo locomotion tasks without a direct reward signal.

This study compares 6 imitation learning algorithms using a common dataset and hyperparameter budget.

problem Difficulty in comparing different imitation learning algorithms due to varying datasets, base RL algorithms, and evaluation settings.
method Reimplemented and updated 6 different imitation learning algorithms, using a common off-policy algorithm (SAC) and a widely-used dataset (D4RL). Evaluated on a range of expert trajectories.
result GAIL consistently performs well across different sample sizes, while AdRIL performs well with one important hyperparameter to tune and behavioral cloning remains a strong baseline when data is plentiful.

Bayesian inverse reinforcement learning (IRL) methods are ideal for safe imitation learning, as they allow a learning agent to reason about reward uncertainty and the safety of a learned policy. However, Bayesian IRL is computationally intractable for high-dimensional problems because each sample from the posterior req…

2019-12-10abs ↗pdf ↗

AutoOD automates outlier detection using curiosity-guided search and self-imitation learning.

problem Automated outlier detection for complex tasks with big data.
method Curiosity-guided search strategy and self-imitation learning.
result AutoOD identifies optimal neural network models with superior performance.

The paper uses a novel framework to learn option prices by imitating principal investor behavior.

problem Challenges in modeling stock price changes and decision making in equity markets.
method Non-deterministic Markov decision process, Bayesian deep neural network, reinforcement learning.
result Optimal option prices learned through imitation of principal investor behavior.

Consider an imitation learning problem that the imitator and the expert have different dynamics models. Most of the current imitation learning methods fail because they focus on imitating actions. We propose a novel state alignment-based imitation learning method to train the imitator to follow the state sequences in e…

2019-11-21abs ↗pdf ↗

This paper proposes Self-Imitation Learning (SIL), a simple off-policy actor-critic algorithm that learns to reproduce the agent's past good decisions. This algorithm is designed to verify our hypothesis that exploiting past good experiences can indirectly drive deep exploration. Our empirical results show that SIL sig…

2018-06-14abs ↗pdf ↗

NDPs embed dynamical systems into neural networks for efficient sensorimotor learning.

problem Training policies directly in raw action spaces limits scalability for continuous tasks.
method Embed dynamical systems into neural networks to learn robot behaviors via demonstrations.
result NDPs outperform prior methods in both imitation and reinforcement learning setups.

Imitation Learning (IL) is an appealing approach to learn desirable autonomous behavior. However, directing IL to achieve arbitrary goals is difficult. In contrast, planning-based algorithms use dynamics models and reward functions to achieve goals. Yet, reward functions that evoke desirable behavior are often difficul…

2018-10-15abs ↗pdf ↗

QTNet uses deep reinforcement learning to automate trading strategies.

problem Handling noisy and high-frequency financial data, balancing exploration and exploitation.
method QTNet employs deep reinforcement learning (DRL) with imitative learning to autonomously formulate trading strategies.
result QTNet demonstrates proficiency in extracting robust market features and adaptability to diverse conditions.

ADVISOR dynamically balances imitation and reinforcement learning to overcome the imitation gap.

problem The gap between imitation learning and reinforcement learning when teaching agents have privileged information.
method Adaptive Insubordination (ADVISOR) dynamically weights imitation and reward-based reinforcement learning losses.
result On-the-fly switching with ADVISOR outperforms pure imitation, pure reinforcement learning, and their combinations.

Compared to reinforcement learning, imitation learning (IL) is a powerful paradigm for training agents to learn control policies efficiently from expert demonstrations. However, in most cases, obtaining demonstration data is costly and laborious, which poses a significant challenge in some scenarios. A promising altern…

2019-03-19abs ↗pdf ↗

MineRL Competition reduced reinforcement learning sample needs.

problem Sample inefficiency in reinforcement learning.
method Human demonstrations and imitation learning integrated into reinforcement learning algorithms.
result Top solutions used deep reinforcement learning and imitation learning.

Researchers improved Minecraft game performance using imitation learning.

problem Achieving state-of-the-art performance in immersive environments like Minecraft.
method Applied imitation learning to Minecraft, optimizing network architecture, loss function, and data augmentation.
result Reported stronger results than previous experiments, reaching second place in a competition.

New self-imitation learning method improves performance in continuous control tasks.

problem Improving off-policy learning in continuous control tasks.
method Proposes a n-step lower bound to generalize lower-bound Q-learning and introduces a new family of self-imitation learning algorithms.
result n-step lower bound Q-learning achieves a better trade-off between bias and contraction rate, leading to improved performance.

Paper uses Sinkhorn distances to improve imitation learning effectiveness.

problem Improving imitation learning algorithms by comparing occupancy measures.
method Formulates imitation learning as Sinkhorn distance minimization, combining optimal transport and cosine distances.
result Proposes a new critic network and transport plan that guide imitation learning.

Proof shows imitation of expert's reward and solutions in multi-objective optimization.

problem Multi-objective optimization with reward and solution imitation.
method Wasserstein inverse reinforcement learning.
result Wasserstein inverse reinforcement learning enables imitation of expert's reward and solutions in multi-objective optimization.

We show that a critical vulnerability in adversarial imitation is the tendency of discriminator networks to learn spurious associations between visual features and expert labels. When the discriminator focuses on task-irrelevant features, it does not provide an informative reward signal, leading to poor task performanc…

2019-10-02abs ↗pdf ↗

GWIL uses Gromov-Wasserstein distance to align expert and imitation agent states.

problem Cross-domain imitation learning challenges due to different system dimensions and stationary distributions.
method Gromov-Wasserstein Imitation Learning (GWIL) using Gromov-Wasserstein distance.
result GWIL effectively aligns expert and imitation agent states in various continuous control domains.

Imitation from observation is the framework of learning tasks by observing demonstrated state-only trajectories. Recently, adversarial approaches have achieved significant performance improvements over other methods for imitating complex behaviors. However, these adversarial imitation algorithms often require many demo…

2019-06-18abs ↗pdf ↗

Behavior cloning can achieve horizon-independent sample complexity in offline imitation learning.

problem Sample complexity in imitation learning increases with problem horizon.
method New analysis of behavior cloning with logarithmic loss.
result Behavior cloning can achieve linear dependence on horizon in offline IL under dense rewards.

New method simplifies and improves imitation learning without adversarial techniques.

problem Stable optimization and convergence issues in adversarial imitation learning methods.
method Proposes a non-adversarial framework for imitation learning, providing stronger convergence guarantees.
result Shows AIRL as a special case and derives new algorithms for offline imitation learning.

MetaTrader combines diverse expert strategies to optimize portfolio performance.

problem Optimizing portfolio performance in changing financial markets.
method Two-stage RL approach: imitation learning followed by a meta-policy.
result MetaTrader significantly outperforms state-of-the-art baselines in balancing profits and risks.

We study risk-sensitive imitation learning where the agent's goal is to perform at least as well as the expert in terms of a risk profile. We first formulate our risk-sensitive imitation learning setting. We consider the generative adversarial approach to imitation learning (GAIL) and derive an optimization problem for…

2018-08-13abs ↗pdf ↗

A new method removes policy optimization in adversarial imitation learning.

problem Adversarial imitation learning's delicate alternated optimization.
method Explicitly condition discriminator on two policies, solving generator's optimization problem directly.
result Simpler approach competitive to prevalent methods.

A new algorithm trains experts to safely guide agents in partially observed environments.

problem Existing imitation learning methods for POMDPs can lead to sub-optimal or unsafe policies.
method Derive an objective to encourage the expert to maximize the agent's reward, then use it to train both expert and agent.
result The algorithm produces an expert policy that the agent can safely imitate, outperforming fixed expert policies.

In this paper, we demonstrate how to do automated theorem proving in the presence of a large knowledge base of potential premises without learning from human proofs. We suggest an exploration mechanism that mixes in additional premises selected by a tf-idf (term frequency-inverse document frequency) based lookup in a d…

2019-05-25abs ↗pdf ↗

Imitation learning trains a policy from expert demonstrations. Imitation learning approaches have been designed from various principles, such as behavioral cloning via supervised learning, apprenticeship learning via inverse reinforcement learning, and GAIL via generative adversarial learning. In this paper, we propose…

2019-11-16abs ↗pdf ↗

Domain adaptation in imitation learning represents an essential step towards improving generalizability. However, even in the restricted setting of third-person imitation where transfer is between isomorphic Markov Decision Processes, there are no strong guarantees on the performance of transferred policies. We present…

2020-02-27abs ↗pdf ↗

This paper investigates a class of attacks targeting the confidentiality aspect of security in Deep Reinforcement Learning (DRL) policies. Recent research have established the vulnerability of supervised machine learning models (e.g., classifiers) to model extraction attacks. Such attacks leverage the loosely-restricte…

2019-06-03abs ↗pdf ↗

Curriculum learning and imitation learning improve control over financial time-series data.

problem Improving control performance over complex financial time-series data.
method Data augmentation for curriculum learning and policy distillation for imitation learning.
result Curriculum learning shows significant improvement over time-series control tasks.

FINs enhance performance in diverse datasets like finance, speech, and health.

problem Improving neural network performance across various domains.
method Feature Imitating Networks (FINs) initialize weights to approximate specific statistical features.
result FINs significantly improve performance in Bitcoin price prediction, speech emotion recognition, and chronic neck pain detection.