中文
相关论文

相关论文: APS: Active Pretraining with Successor Features

200 篇论文

In a conventional supervised learning setting, a machine learning model has access to examples of all object classes that are desired to be recognized during the inference stage. This results in a fixed model that lacks the flexibility to…

计算机视觉与模式识别 · 计算机科学 2020-01-27 Jathushan Rajasegaran , Munawar Hayat , Salman Khan , Fahad Shahbaz Khan , Ling Shao , Ming-Hsuan Yang

Exploration is essential in reinforcement learning, particularly in environments where external rewards are sparse. Here we focus on exploration with intrinsic rewards, where the agent transiently augments the external rewards with…

机器学习 · 计算机科学 2024-01-26 Changmin Yu , Neil Burgess , Maneesh Sahani , Samuel J. Gershman

Marginalized importance sampling (MIS), which measures the density ratio between the state-action occupancy of a target policy and that of a sampling distribution, is a promising approach for off-policy evaluation. However, current…

机器学习 · 计算机科学 2023-11-15 Scott Fujimoto , David Meger , Doina Precup

Large and diverse datasets have been the cornerstones of many impressive advancements in artificial intelligence. Intelligent creatures, however, learn by interacting with the environment, which changes the input sensory signals and the…

机器学习 · 计算机科学 2022-10-25 Hao Liu , Tom Zahavy , Volodymyr Mnih , Satinder Singh

Data efficiency is a key challenge for deep reinforcement learning. We address this problem by using unlabeled data to pretrain an encoder which is then finetuned on a small amount of task-specific data. To encourage learning…

Unsupervised reinforcement learning aims at learning a generalist policy in a reward-free manner for fast adaptation to downstream tasks. Most of the existing methods propose to provide an intrinsic reward based on surprise. Maximizing or…

机器学习 · 计算机科学 2022-10-14 Andrew Zhao , Matthieu Gaetan Lin , Yangguang Li , Yong-Jin Liu , Gao Huang

Data representations that contain all the information about target variables but are invariant to nuisance factors benefit supervised learning algorithms by preventing them from learning associations between these factors and the targets,…

机器学习 · 计算机科学 2018-09-27 Ayush Jaiswal , Yue Wu , Wael AbdAlmageed , Premkumar Natarajan

Both entropy-minimizing and entropy-maximizing (curiosity) objectives for unsupervised reinforcement learning (RL) have been shown to be effective in different environments, depending on the environment's level of natural entropy. However,…

机器学习 · 计算机科学 2024-08-19 Adriana Hugessen , Roger Creus Castanyer , Faisal Mohamed , Glen Berseth

Prioritized Experience Replay (PER) is a technical means of deep reinforcement learning by selecting experience samples with more knowledge quantity to improve the training rate of neural network. However, the non-uniform sampling used in…

机器学习 · 计算机科学 2023-10-10 Zhuoying Chen , Huiping Li , Rizhong Wang

Learning auxiliary tasks, such as multiple predictions about the world, can provide many benefits to reinforcement learning systems. A variety of off-policy learning algorithms have been developed to learn such predictions, but as yet there…

We propose a new sample-efficient methodology, called Supervised Policy Update (SPU), for deep reinforcement learning. Starting with data generated by the current policy, SPU formulates and solves a constrained optimization problem in the…

机器学习 · 计算机科学 2018-12-27 Quan Vuong , Yiming Zhang , Keith W. Ross

We seek to align agent policy with human expert behavior in a reinforcement learning (RL) setting, without any prior knowledge about dynamics, reward function, and unsafe states. There is a human expert knowing the rewards and unsafe states…

机器学习 · 计算机科学 2020-01-01 Daniel Hsu

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…

机器学习 · 计算机科学 2019-02-26 Ahmed H. Qureshi , Byron Boots , Michael C. Yip

While deep reinforcement learning excels at solving tasks where large amounts of data can be collected through virtually unlimited interaction with the environment, learning from limited interaction remains a key challenge. We posit that an…

机器学习 · 计算机科学 2021-05-21 Max Schwarzer , Ankesh Anand , Rishab Goel , R Devon Hjelm , Aaron Courville , Philip Bachman

Unsupervised reinforcement learning (RL) studies how to leverage environment statistics to learn useful behaviors without the cost of reward engineering. However, a central challenge in unsupervised RL is to extract behaviors that…

We pose an active perception problem where an autonomous agent actively interacts with a second agent with potentially adversarial behaviors. Given the uncertainty in the intent of the other agent, the objective is to collect further…

人工智能 · 计算机科学 2019-09-20 Macheng Shen , Jonathan P How

Posterior sampling for reinforcement learning (PSRL) is an effective method for balancing exploration and exploitation in reinforcement learning. Randomised value functions (RVF) can be viewed as a promising approach to scaling PSRL.…

Meta-reinforcement learning enables artificial agents to learn from related training tasks and adapt to new tasks efficiently with minimal interaction data. However, most existing research is still limited to narrow task distributions that…

机器学习 · 计算机科学 2023-05-02 Mingyang Wang , Zhenshan Bing , Xiangtong Yao , Shuai Wang , Hang Su , Chenguang Yang , Kai Huang , Alois Knoll

In many real-world scenarios, reward signal for agents are exceedingly sparse, making it challenging to learn an effective reward function for reward shaping. To address this issue, the proposed approach in this paper performs reward…

机器学习 · 计算机科学 2026-05-18 Wenyun Li , Wenjie Huang , Chen Sun

We propose Strategy-aware Surprise (SuS), a novel intrinsic motivation framework that uses pre-post prediction mismatch as a novelty signal for exploration in reinforcement learning. Unlike traditional curiosity-driven methods that rely…

机器学习 · 计算机科学 2026-01-16 Mark Kashirskiy , Ilya Makarov