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

Trend · papers per month

4018021,2021,603 · Jun 202019922001200920172026
48 results for Adversarial Reinforcement Learning

Adversarial attacks on probabilistic state-space models affect latent state and policy decisions.

problem Robust reinforcement learning under adversarial observability.
method Analyzing adversarial attacks on linear probabilistic state-space models.
result Demonstrating the influence of adversarial observations on latent state and policy decisions.

Improves imitation learning in RL by learning reward function efficiently.

problem Lack of effective reward function approximation in AIRL for imitation tasks.
method Proposes Off-Policy AIRL that combines adversarial learning with efficient reward function approximation.
result Shows superior imitation performance and efficiency compared to state-of-the-art AIL algorithms.

Robust RL with learned optimal adversary improves agent performance under adversarial state observations.

problem Ensuring reinforcement learning agents' robustness against adversarial perturbations of state observations.
method Proposed a framework of alternating training with learned adversaries (ATLA) to find optimal adversarial policies and enhance agent robustness.
result ATLA achieves state-of-the-art performance under strong adversaries in continuous control environments.

Deep RL policies are vulnerable to adversarial perturbations, but vanilla training yields more robust policies.

problem Vulnerability of deep reinforcement learning policies to adversarial perturbations.
method Analysis of deep reinforcement learning policy landscape and comparison of vanilla vs. adversarial training.
result Vanilla training yields more robust policies compared to adversarial training.

Adversarial attacks have exposed a significant security vulnerability in state-of-the-art machine learning models. Among these models include deep reinforcement learning agents. The existing methods for attacking reinforcement learning agents assume the adversary either has access to the target agent's learned paramete…

2019-05-28abs ↗pdf ↗

AIRL learns robust, generalizable reward functions from demonstrations.

problem Learning robust reward functions from demonstrations for changing environments.
method Adversarial Inverse Reinforcement Learning (AIRL) with hierarchical disentangled rewards.
result Generalizable policies and comparable results to state-of-the-art methods.

RADIAL-RL improves deep RL agents' robustness against adversarial attacks.

problem Vulnerability of deep reinforcement learning agents to small adversarial perturbations.
method RADIAL-RL, a principled framework for training robust reinforcement learning agents.
result RADIAL-RL-trained agents consistently outperform prior methods in robustness tests.

Attackers can significantly reduce team rewards in cooperative multi-agent reinforcement learning.

problem Robustness of cooperative multi-agent reinforcement learning to adversaries.
method Novel attack method involving training a policy network and using targeted adversarial examples.
result Reduces team reward from 20 to 9.4 by attacking a single agent, reducing winning rate from 98.9% to 0%.

Deep RL policies share adversarial features across different MDPs.

problem Understanding decision boundaries and loss landscapes in neural policies.
method Investigating similarities in high sensitivity directions across MDPs using Arcade Learning Environment.
result High sensitivity directions for neural policies are correlated across MDPs, suggesting shared non-robust features.

Detects adversarial directions to make reinforcement learning policies more robust.

problem Adversarial attacks exploit non-robust directions in reinforcement learning policies, leading to instability.
method Local quadratic approximation of deep neural policy loss to identify non-robust directions.
result Provides a theoretical basis for distinguishing safe from adversarial observations.

Study on adversarial training's impact on deep neural reinforcement learning policies.

problem Vulnerability of deep neural reinforcement learning policies to imperceptible adversarial perturbations.
method Two parallel approaches: Fourier spectrum analysis and feature sensitivity measurement.
result Adversarially trained policies are more sensitive to low frequency perturbations.

Adversarial examples have been shown to exist for a variety of deep learning architectures. Deep reinforcement learning has shown promising results on training agent policies directly on raw inputs such as image pixels. In this paper we present a novel study into adversarial attacks on deep reinforcement learning polic…

2017-05-18abs ↗pdf ↗

Paper introduces timing-based adversarial attacks on DRL-based navigation systems.

problem Vulnerability of DRL-based navigation systems to adversarial attacks.
method Timing-based adversarial strategies using physical noise patterns.
result Adversarial timing attacks significantly degrade DRL-based navigation performance.

Generative model solves financial market equilibria with stable reinforcement learning.

problem Financial market equilibria under realistic frictions and multiple agents.
method Generative adversarial reinforcement learning with decoupling feedback.
result Algorithm learns and predicts asset returns and volatilities.

New approach makes deep reinforcement learning robust without assuming adversary knowledge.

problem Deep reinforcement learning policies are vulnerable to state observation perturbations.
method Proposes an adversary agnostic robust DRL paradigm using policy distillation with two terms: prescription gap maximization and Jacobian regularization.
result Boosts adversarial robustness on five Atari games compared to state-of-the-art methods.

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.

In several reinforcement learning (RL) scenarios, mainly in security settings, there may be adversaries trying to interfere with the reward generating process. In this paper, we introduce Threatened Markov Decision Processes (TMDPs), which provide a framework to support a decision maker against a potential adversary in…

2018-09-05abs ↗pdf ↗

We propose a reinforcement learning solution to the \emph{soccer dribbling task}, a scenario in which a soccer agent has to go from the beginning to the end of a region keeping possession of the ball, as an adversary attempts to gain possession. While the adversary uses a stationary policy, the dribbler learns the best…

2013-05-28abs ↗pdf ↗

New bounds show complexity of adversarial decision making.

problem Understanding sample efficiency in adversarial decision making.
method New upper and lower bounds on Decision-Estimation Coefficient.
result Decision-Estimation Coefficient is necessary and sufficient for low regret in adversarial decision making.

This paper analyzes generalization issues in deep reinforcement learning.

problem Understanding and improving generalization capabilities of deep reinforcement learning policies.
method Formalizing and categorizing solutions to address overfitting in deep reinforcement learning.
result A comprehensive analysis of generalization challenges and solutions in deep reinforcement learning.

I describe an optimal control view of adversarial machine learning, where the dynamical system is the machine learner, the input are adversarial actions, and the control costs are defined by the adversary's goals to do harm and be hard to detect. This view encompasses many types of adversarial machine learning, includi…

2018-11-11abs ↗pdf ↗

This work improves deep reinforcement learning robustness to adversarial state uncertainty.

problem Robustness of deep reinforcement learning to adversarial state uncertainty.
method Certified adversarial robustness techniques are applied to deep reinforcement learning algorithms to compute guaranteed lower bounds on state-action values.
result The approach increases robustness to noise and adversaries in pedestrian collision avoidance and classic control tasks.

New algorithm identifies near-optimal policies in adversarial distributed RL settings.

problem Adversarial agents in distributed RL settings that can collude and report arbitrary data.
method Weighted-Clique algorithm for robust mean estimation from batches, combined with novel distributed algorithms.
result Achieves superior robustness guarantees and near-optimal sample complexities in both offline and online settings.

New framework for robust reinforcement learning policies in uncertain environments.

problem Robust reinforcement learning policies in environments with distributional shifts.
method Comprehensive modeling framework centered around robust Markov decision processes (RMDPs).
result Existence and conditions for the dynamic programming principle (DPP) in RMDPs.

SAIL improves AIL by weighting adversarial rewards with support estimation.

problem Training instability and reward bias in AIL.
method Support-weighted Adversarial Imitation Learning (SAIL) extends AIL with support estimation to improve reinforcement signals.
result SAIL achieves better performance and stability on benchmark tasks.

New method improves DRL robustness against adversarial state observations.

problem Adversarial attacks on deep reinforcement learning agents observing state data.
method State-adversarial Markov decision process (SA-MDP) and policy regularization.
result Significant improvement in robustness of DRL algorithms under adversarial attacks.

Adversarial attacks degrade DRL-based EV energy management systems.

problem Adversarial attacks on DRL-based energy management systems of electric vehicles.
method Generated adversarial examples to degrade DRL performance using low-dimensional state representations.
result Adversarial attacks can significantly degrade DRL-based EV energy management systems.

The paper evaluates machine learning cyber defenses using log data against adversarial attacks.

problem Evaluating the robustness of machine learning cyber defenses against adversarial attacks.
method Developed a testing framework using deep reinforcement learning and adversarial natural language processing.
result Higher dropout levels increase robustness, with 90% dropout probability showing the highest robustness.

Paper robustifies reinforcement learning agents against action space perturbations.

problem Vulnerability of reinforcement learning agents to action space perturbations (e.g. actuator attacks).
method Adversarial training to robustify DRL agents against perturbations.
result DRL agents can be robustified against action space perturbations through adversarial training.

AdMRL improves meta-reinforcement learning by minimizing worst-case sub-optimality gap.

problem Meta-reinforcement learning's sensitivity to task distribution shift.
method Model-based adversarial approach with minimax objective and alternating optimization.
result Efficacy in worst-case performance, generalization to out-of-distribution tasks, and sample efficiency.

New RL algorithm tackles adversarial RMAB with unknown transitions and bandit feedback.

problem Learning in episodic RMAB with unknown transition functions and adversarial rewards.
method Developed a novel RL algorithm with a biased reward estimator and an index policy.
result Achieved ildeO(HT) ilde{\mathcal{O}}(H\sqrt{T}) regret bound for adversarial RMAB.

We consider a problem of learning the reward and policy from expert examples under unknown dynamics. Our proposed method builds on the framework of generative adversarial networks and introduces the empowerment-regularized maximum-entropy inverse reinforcement learning to learn near-optimal rewards and policies. Empowe…

2018-09-17abs ↗pdf ↗

In deep reinforcement learning (RL), adversarial attacks can trick an agent into unwanted states and disrupt training. We propose a system called Robust Student-DQN (RS-DQN), which permits online robustness training alongside Q networks, while preserving competitive performance. We show that RS-DQN can be combined with…

2019-11-03abs ↗pdf ↗

Regularized policies are robust to adversarial rewards.

problem Understanding the effects of regularization on policy exploration and robustness.
method Using Fenchel duality to derive the dual problem of the regularized RL objective, showing the optimal policy is robust to adversarial rewards.
result Regularized policies are optimal for a reinforcement learning problem under adversarial reward conditions.

The paper shows how policy regularization acts like an adversary to improve robustness.

problem Improving robustness of learned policies in reinforcement learning.
method Using convex duality, the paper characterizes adversarial reward perturbations and provides generalization guarantees.
result Policy regularization acts as an adversary to improve robustness against worst-case reward perturbations.

Study efficient reinforcement learning for partially observed systems with linear structure.

problem Efficient reinforcement learning for partially observed Markov decision processes with linear structure.
method Proposes OP-TENET algorithm using a Bellman operator with finite memory, adversarial integral equation, and optimistic exploration.
result Achieves ε-optimal policy within O(1/ε^2) episodes with polynomial sample complexity in intrinsic dimension.

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.

Deep reinforcement learning (RL) policies are known to be vulnerable to adversarial perturbations to their observations, similar to adversarial examples for classifiers. However, an attacker is not usually able to directly modify another agent's observations. This might lead one to wonder: is it possible to attack an R…

2019-05-25abs ↗pdf ↗