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

1.0%2.0%3.0%4.0% · Jul 201819922001200920172026
48 results for atari games

Model-free reinforcement learning (RL) can be used to learn effective policies for complex tasks, such as Atari games, even from image observations. However, this typically requires very large amounts of interaction -- substantially more, in fact, than a human would need to learn the same games. How can people learn so…

2019-03-01abs ↗pdf ↗

Despite significant advances in the field of deep Reinforcement Learning (RL), today's algorithms still fail to learn human-level policies consistently over a set of diverse tasks such as Atari 2600 games. We identify three key challenges that any algorithm needs to master in order to perform well on all games: process…

2018-05-29abs ↗pdf ↗

Do you remember your first video game console? We remember ours. Decades ago, they provided hours of entertainment. Now, we have repurposed them to solve dynamic and stochastic optimization problems. With deep reinforcement learning methods posting superhuman performance on a wide range of Atari games, we consider the …

2019-11-14abs ↗pdf ↗

To solve complex real-world problems with reinforcement learning, we cannot rely on manually specified reward functions. Instead, we can have humans communicate an objective to the agent directly. In this work, we combine two approaches to learning from human feedback: expert demonstrations and trajectory preferences. …

2018-11-15abs ↗pdf ↗

Paper presents a new method for Bayesian deep learning that scales to Atari games.

problem Training neural networks on complex environments like Atari games is challenging.
method Adapted temporal difference Q-learning to work with Bayesian inference.
result TAGI allows for analytical inference of neural network parameters, achieving performance comparable to gradient-based methods.

Bayesian REX learns Atari games from demonstrations efficiently.

problem Bayesian reward learning for complex control problems is computationally intractable.
method Bayesian Reward Extrapolation (Bayesian REX) pre-trains a low-dimensional feature encoding and uses preferences to perform fast Bayesian inference.
result Bayesian REX learns Atari games from demonstrations in 5 minutes, competitive with state-of-the-art methods.

Paper proposes an RL algorithm to ensure policy performance guarantees.

problem Lack of performance guarantees for RL policies compared to baselines.
method Online model-free algorithm that ensures conservative exploration.
result Regret bound of ildeO(T) ilde{\mathcal{O}}(\sqrt{T}) for both discrete and continuous spaces.

Deep reinforcement learning has become popular over recent years, showing superiority on different visual-input tasks such as playing Atari games and robot navigation. Although objects are important image elements, few work considers enhancing deep reinforcement learning with object characteristics. In this paper, we p…

2018-09-17abs ↗pdf ↗

In this work, we build on recent advances in distributional reinforcement learning to give a generally applicable, flexible, and state-of-the-art distributional variant of DQN. We achieve this by using quantile regression to approximate the full quantile function for the state-action return distribution. By reparameter…

2018-06-14abs ↗pdf ↗

Study finds reinforcement learning performance plateaus due to environmental interference.

problem Catastrophic interference hinders sample efficiency in reinforcement learning.
method Empirical study in ALE, controlled experiments, analysis of prediction errors.
result Interference causes performance plateaus and degrades policies used to reach them.

Currently, many applications in Machine Learning are based on define new models to extract more information about data, In this case Deep Reinforcement Learning with the most common application in video games like Atari, Mario, and others causes an impact in how to computers can learning by himself with only informatio…

2019-08-16abs ↗pdf ↗

Scaling up model and data size improves imitation learning in single-agent games.

problem Limited recovery of expert behavior in single-agent games using imitation learning.
method Investigate the effect of scaling model and data size on imitation learning performance.
result IL loss and mean return scale with compute budget, resulting in power laws.

Due to the capability of deep learning to perform well in high dimensional problems, deep reinforcement learning agents perform well in challenging tasks such as Atari 2600 games. However, clearly explaining why a certain action is taken by the agent can be as important as the decision itself. Deep reinforcement learni…

2019-02-01abs ↗pdf ↗

Large-scale public datasets have been shown to benefit research in multiple areas of modern artificial intelligence. For decision-making research that requires human data, high-quality datasets serve as important benchmarks to facilitate the development of new methods by providing a common reproducible standard. Many h…

2019-03-15abs ↗pdf ↗

CURL uses contrastive learning to improve reinforcement learning performance.

problem Improving reinforcement learning performance on complex tasks.
method Contrastive learning to extract high-level features from raw pixels, followed by off-policy control.
result CURL outperforms prior methods on DeepMind Control Suite and Atari Games.

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.

Constructing agents with planning capabilities has long been one of the main challenges in the pursuit of artificial intelligence. Tree-based planning methods have enjoyed huge success in challenging domains, such as chess and Go, where a perfect simulator is available. However, in real-world problems the dynamics gove…

2019-11-19abs ↗pdf ↗

Method learns statistics of return distributions via neural networks and maximum mean discrepancy.

problem Learning probability distributions in reinforcement learning.
method Maximum mean discrepancy (MMD) for learning unrestricted statistics of return distributions.
result Method outperforms standard distributional RL baselines on Atari games.

Deep reinforcement learning, applied to vision-based problems like Atari games, maps pixels directly to actions; internally, the deep neural network bears the responsibility of both extracting useful information and making decisions based on it. By separating the image processing from decision-making, one could better …

2018-06-04abs ↗pdf ↗

State representation learning, or the ability to capture latent generative factors of an environment, is crucial for building intelligent agents that can perform a wide variety of tasks. Learning such representations without supervision from rewards is a challenging open problem. We introduce a method that learns state…

2019-06-19abs ↗pdf ↗

A new method prioritizes and recycles experiences for better reinforcement learning.

problem Improving reinforcement learning efficiency by prioritizing and recycling experiences.
method Double-prioritized state-recycled (DPSR) experience replay.
result DPSR achieved state-of-the-art results in Atari games, outperforming original and prioritized methods.

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.

Paper proposes SinkhornDRL for distributional RL using Sinkhorn divergence and regularized Wasserstein loss.

problem Improving distributional reinforcement learning by minimizing Bellman return distribution differences.
method Introduces SinkhornDRL, a distributional RL algorithm using Sinkhorn divergence and regularized Wasserstein loss.
result SinkhornDRL consistently outperforms or matches existing algorithms on Atari games, especially in multi-dimensional reward settings.

New RL approach tackles non-linear MDPs without linear assumptions.

problem Sample efficiency in RL for complex, nonlinear MDPs with continuous states.
method Introduces EPW condition to relax linear structure requirements; provides sample-efficient RL algorithm.
result EPW condition allows solving MDPs without linear assumptions, including Atari games.

Stabilizes policy optimization with off-policy data using divergence augmentation.

problem Premature convergence and instability in policy optimization with off-policy data.
method Incorporates Bregman divergence between behavior and current policies to ensure safe policy updates.
result Empirically shows better performance in data-scarce scenarios compared to other algorithms.

Agent learns directed exploration policies to improve performance in hard games.

problem Improving exploration in complex games.
method Episodic memory-based intrinsic reward, self-supervised inverse dynamics, UVFA framework.
result Doubles performance in hard exploration games, achieves non-zero rewards in Pitfall!.

Model-free reinforcement learning methods such as the Proximal Policy Optimization algorithm (PPO) have successfully applied in complex decision-making problems such as Atari games. However, these methods suffer from high variances and high sample complexity. On the other hand, model-based reinforcement learning method…

2018-11-18abs ↗pdf ↗

Despite the notable successes in video games such as Atari 2600, current AI is yet to defeat human champions in the domain of real-time strategy (RTS) games. One of the reasons is that an RTS game is a multi-agent game, in which single-agent reinforcement learning methods cannot simply be applied because the environmen…

2019-02-06abs ↗pdf ↗

New algorithms improve reinforcement learning stability and performance.

problem Stability issues in TD learning algorithms with function approximation and off-policy sampling.
method Developed and adapted emphatic temporal difference (ETD(λλ)) algorithms for deep reinforcement learning.
result Demonstrated improved performance in Atari games and small problems.