中文
相关论文

相关论文: CIG: Exploration via Conditional Information Gain

200 篇论文

Recent advances in retrieval-augmented generation (RAG) have shown promise in enhancing recommendation systems with external knowledge. However, existing RAG-based recommenders face two critical challenges: (1) vulnerability to distribution…

信息检索 · 计算机科学 2025-12-23 Sebastian Sun

A central challenge in reinforcement learning is discovering effective policies for tasks where rewards are sparsely distributed. We postulate that in the absence of useful reward signals, an effective exploration strategy should seek out…

Current Reinforcement Learning (RL) methods often suffer from sample-inefficiency, resulting from blind exploration strategies that neglect causal relationships among states, actions, and rewards. Although recent causal approaches aim to…

人工智能 · 计算机科学 2025-02-17 Hongye Cao , Fan Feng , Tianpei Yang , Jing Huo , Yang Gao

It is of significance for an agent to learn a widely applicable and general-purpose policy that can achieve diverse goals including images and text descriptions. Considering such perceptually-specific goals, the frontier of deep…

机器学习 · 计算机科学 2021-12-14 Jinxin Liu , Donglin Wang , Qiangxing Tian , Zhengyu Chen

Exploration under sparse reward is a long-standing challenge of model-free reinforcement learning. The state-of-the-art methods address this challenge by introducing intrinsic rewards to encourage exploration in novel states or uncertain…

机器学习 · 计算机科学 2021-02-05 Daochen Zha , Wenye Ma , Lei Yuan , Xia Hu , Ji Liu

Triple-based Iterative Retrieval-Augmented Generation (iRAG) mitigates document-level noise for multi-hop question answering. However, existing methods still face limitations: (i) greedy single-path expansion, which propagates early errors…

计算与语言 · 计算机科学 2026-01-13 Zili Wei , Xiaocui Yang , Yilin Wang , Zihan Wang , Weidong Bao , Shi Feng , Daling Wang , Yifei Zhang

This paper investigates the use of intrinsic reward to guide exploration in multi-agent reinforcement learning. We discuss the challenges in applying intrinsic reward to multiple collaborative agents and demonstrate how unreliable reward…

人工智能 · 计算机科学 2019-06-06 Wendelin Böhmer , Tabish Rashid , Shimon Whiteson

The study of exploration in the domain of decision making has a long history but remains actively debated. From the vast literature that addressed this topic for decades under various points of view (e.g., developmental psychology,…

机器学习 · 计算机科学 2021-01-14 Léonard Hussenot , Robert Dadashi , Matthieu Geist , Olivier Pietquin

Learning about many things can provide numerous benefits to a reinforcement learning system. For example, learning many auxiliary value functions, in addition to optimizing the environmental reward, appears to improve both exploration and…

机器学习 · 计算机科学 2020-08-25 Cam Linke , Nadia M. Ady , Martha White , Thomas Degris , Adam White

Designing rewards for Reinforcement Learning (RL) is challenging because it needs to convey the desired task, be efficient to optimize, and be easy to compute. The latter is particularly problematic when applying RL to robotics, where…

机器学习 · 计算机科学 2020-05-28 Yiming Ding , Carlos Florensa , Mariano Phielipp , Pieter Abbeel

Episodic rewards present a significant challenge in reinforcement learning. While intrinsic reward methods have demonstrated effectiveness in single-agent rein-forcement learning scenarios, their application to multi-agent reinforcement…

人工智能 · 计算机科学 2025-11-24 Kesheng Chen , Wenjian Luo , Bang Zhang , Zeping Yin , Zipeng Ye

This paper introduces a novel method of adding intrinsic bonuses to task-oriented reward function in order to efficiently facilitate reinforcement learning search. While various bonuses have been designed to date, they are analogous to the…

机器学习 · 计算机科学 2023-07-04 Taisuke Kobayashi

In lifelong learning, an agent learns throughout its entire life without resets, in a constantly changing environment, as we humans do. Consequently, lifelong learning comes with a plethora of research problems such as continual domain…

Intrinsic reward shaping has emerged as a prevalent approach to solving hard-exploration and sparse-rewards environments in reinforcement learning (RL). While single intrinsic rewards, such as curiosity-driven or novelty-based methods, have…

机器学习 · 计算机科学 2025-01-23 Mingqi Yuan , Bo Li , Xin Jin , Wenjun Zeng

Reinforcement learning for embodied agents is a challenging problem. The accumulated reward to be optimized is often a very rugged function, and gradient methods are impaired by many local optimizers. We demonstrate, in an experimental…

人工智能 · 计算机科学 2016-06-01 Guido Montufar , Keyan Ghazi-Zahedi , Nihat Ay

We consider the problem of inferring the conditional independence graph (CIG) of a multivariate stationary dicrete-time Gaussian random process based on a finite length observation. Using information-theoretic methods, we derive a lower…

统计理论 · 数学 2014-03-06 Gabor Hannak , Alexander Jung , Norbert Goertz

In-context learning is a promising approach for online policy learning of offline reinforcement learning (RL) methods, which can be achieved at inference time without gradient optimization. However, this method is hindered by significant…

机器学习 · 计算机科学 2024-03-12 Zhenwen Dai , Federico Tomasi , Sina Ghiassian

We address the problem of efficient exploration for transition model learning in the relational model-based reinforcement learning setting without extrinsic goals or rewards. Inspired by human curiosity, we propose goal-literal babbling…

人工智能 · 计算机科学 2020-12-10 Rohan Chitnis , Tom Silver , Joshua Tenenbaum , Leslie Pack Kaelbling , Tomas Lozano-Perez

Exploration in reinforcement learning (RL) remains an open challenge. RL algorithms rely on observing rewards to train the agent, and if informative rewards are sparse the agent learns slowly or may not learn at all. To improve exploration…

机器学习 · 计算机科学 2024-11-12 Simone Parisi , Alireza Kazemipour , Michael Bowling

This paper reviews exploration techniques in deep reinforcement learning. Exploration techniques are of primary importance when solving sparse reward problems. In sparse reward problems, the reward is rare, which means that the agent will…

机器学习 · 计算机科学 2022-05-03 Pawel Ladosz , Lilian Weng , Minwoo Kim , Hyondong Oh