中文
相关论文

相关论文: Exploration by Random Distribution Distillation

200 篇论文

This work studies knowledge distillation (KD) for large language models (LLMs) through preference optimization. We propose a reward-guided imitation learning framework for sequential KD, formulating a min-max optimization problem between…

机器学习 · 计算机科学 2025-05-27 Chen Jia

Current knowledge distillation (KD) methods primarily focus on transferring various structured knowledge and designing corresponding optimization goals to encourage the student network to imitate the output of the teacher network. However,…

计算机视觉与模式识别 · 计算机科学 2024-07-08 Dong Liang , Yue Sun , Yun Du , Songcan Chen , Sheng-Jun Huang

We introduce Random Latent Exploration (RLE), a simple yet effective exploration strategy in reinforcement learning (RL). On average, RLE outperforms noise-based methods, which perturb the agent's actions, and bonus-based exploration, which…

机器学习 · 计算机科学 2025-02-28 Srinath Mahankali , Zhang-Wei Hong , Ayush Sekhari , Alexander Rakhlin , Pulkit Agrawal

Our work is a simple extension of the paper "Exploration by Random Network Distillation". More in detail, we show how to efficiently combine Intrinsic Rewards with Experience Replay in order to achieve more efficient and robust exploration…

机器学习 · 计算机科学 2019-12-03 Francesco Sovrano

Offline reinforcement learning (RL) faces a critical challenge of overestimating the value of out-of-distribution (OOD) actions. Existing methods mitigate this issue by penalizing unseen samples, yet they fail to accurately identify OOD…

机器学习 · 计算机科学 2026-05-12 Qingjun Wang , Hongtu Zhou , Hang Yu , Junqiao Zhao , Yanping Zhao , Chen Ye , Ziqiao Wang , Guang Chen

Uncertainty quantification is central to safe and efficient deployments of deep learning models, yet many computationally practical methods lack lacking rigorous theoretical motivation. Random network distillation (RND) is a lightweight…

机器学习 · 计算机科学 2026-02-27 Moritz A. Zanger , Yijun Wu , Pascal R. Van der Vaart , Wendelin Böhmer , Matthijs T. J. Spaan

While a powerful and promising approach, deep reinforcement learning (DRL) still suffers from sample inefficiency, which can be notably improved by resorting to more sophisticated techniques to address the exploration-exploitation dilemma.…

机器学习 · 计算机科学 2024-09-10 Jianshu Hu , Paul Weng , Yutong Ban

Exploration is a key problem in reinforcement learning, since agents can only learn from data they acquire in the environment. With that in mind, maintaining a population of agents is an attractive method, as it allows data be collected…

机器学习 · 计算机科学 2020-10-08 Jack Parker-Holder , Aldo Pacchiano , Krzysztof Choromanski , Stephen Roberts

Existing approaches for improving generalization in deep reinforcement learning (RL) have mostly focused on representation learning, neglecting RL-specific aspects such as exploration. We hypothesize that the agent's exploration strategy…

机器学习 · 计算机科学 2023-06-12 Yiding Jiang , J. Zico Kolter , Roberta Raileanu

One of the most critical challenges in deep reinforcement learning is to maintain the long-term exploration capability of the agent. To tackle this problem, it has been recently proposed to provide intrinsic rewards for the agent to…

机器学习 · 计算机科学 2022-06-02 Mingqi Yuan , Man-on Pun , Dong Wang

Distributional reinforcement learning demonstrates state-of-the-art performance in continuous and discrete control settings with the features of variance and risk, which can be used to explore. However, the exploration method employing the…

机器学习 · 计算机科学 2022-07-04 Jihwan Oh , Joonkee Kim , Se-Young Yun

The exploration-exploitation dilemma in reinforcement learning (RL) is a fundamental challenge to efficient RL algorithms. Existing algorithms for finite state and action discounted RL problems address this by assuming sufficient…

机器学习 · 计算机科学 2025-12-09 Caleb Ju , Guanghui Lan

Language model (LM) post-training (or alignment) involves maximizing a reward function that is derived from preference annotations. Direct Preference Optimization (DPO) is a popular offline alignment method that trains a policy directly on…

Deep reinforcement learning (DRL) has been proven its efficiency in capturing users' dynamic interests in recent literature. However, training a DRL agent is challenging, because of the sparse environment in recommender systems (RS), DRL…

信息检索 · 计算机科学 2022-09-20 Xiaocong Chen , Siyu Wang , Lina Yao , Lianyong Qi , Yong Li

Efficient exploration remains a challenging research problem in reinforcement learning, especially when an environment contains large state spaces, deceptive local optima, or sparse rewards. To tackle this problem, we present a…

人工智能 · 计算机科学 2018-10-30 Zhang-Wei Hong , Tzu-Yun Shann , Shih-Yang Su , Yi-Hsiang Chang , Chun-Yi Lee

Exploration in complex domains is a key challenge in reinforcement learning, especially for tasks with very sparse rewards. Recent successes in deep reinforcement learning have been achieved mostly using simple heuristic exploration…

机器学习 · 计算机科学 2017-03-07 Joshua Achiam , Shankar Sastry

Many reinforcement learning (RL) tasks have specific properties that can be leveraged to modify existing RL algorithms to adapt to those tasks and further improve performance, and a general class of such properties is the multiple reward…

机器学习 · 计算机科学 2019-11-07 Zichuan Lin , Li Zhao , Derek Yang , Tao Qin , Guangwen Yang , Tie-Yan Liu

Exploration in multi-task reinforcement learning is critical in training agents to deduce the underlying MDP. Many of the existing exploration frameworks such as $E^3$, $R_{max}$, Thompson sampling assume a single stationary MDP and are not…

人工智能 · 计算机科学 2016-12-04 Sai Praveen Bangaru , JS Suhas , Balaraman Ravindran

Deep reinforcement learning (DRL) is a booming area of artificial intelligence. Many practical applications of DRL naturally involve more than one collaborative learners, making it important to study DRL in a multi-agent context. Previous…

机器学习 · 计算机科学 2019-10-22 Gang Chen

Balancing exploration and exploitation is a fundamental part of reinforcement learning, yet most state-of-the-art algorithms use a naive exploration protocol like $\epsilon$-greedy. This contributes to the problem of high sample complexity,…

机器学习 · 计算机科学 2019-11-21 Tom Blau , Lionel Ott , Fabio Ramos