中文
相关论文

相关论文: Optimistic Task Inference for Behavior Foundation …

200 篇论文

Zero-shot inference is a powerful paradigm that enables the use of large pretrained models for downstream classification tasks without further training. However, these models are vulnerable to inherited biases that can impact their…

机器学习 · 计算机科学 2024-02-13 Dyah Adila , Changho Shin , Linrong Cai , Frederic Sala

In-context learning enables large language models (LLMs) to perform a variety of tasks, including learning to make reward-maximizing choices in simple bandit tasks. Given their potential use as (autonomous) decision-making agents, it is…

计算与语言 · 计算机科学 2024-05-21 William M. Hayes , Nicolas Yax , Stefano Palminteri

Contextual dueling bandit is used to model the bandit problems, where a learner's goal is to find the best arm for a given context using observed noisy human preference feedback over the selected arms for the past contexts. However,…

机器学习 · 计算机科学 2025-04-17 Arun Verma , Zhongxiang Dai , Xiaoqiang Lin , Patrick Jaillet , Bryan Kian Hsiang Low

Active inference is a probabilistic framework for modelling the behaviour of biological and artificial agents, which derives from the principle of minimising free energy. In recent years, this framework has successfully been applied to a…

人工智能 · 计算机科学 2022-07-13 Lancelot Da Costa , Noor Sajid , Thomas Parr , Karl Friston , Ryan Smith

Recent work has shown that, under certain assumptions, zero-shot reinforcement learning (RL) methods can generalise to any unseen task in an environment after reward-free pre-training. Access to Markov states is one such assumption, yet, in…

机器学习 · 计算机科学 2025-06-19 Scott Jeen , Tom Bewley , Jonathan M. Cullen

Reinforcement learning (RL) requires access to a reward function that incentivizes the right behavior, but these are notoriously hard to specify for complex tasks. Preference-based RL provides an alternative: learning policies using a…

机器学习 · 计算机科学 2021-11-05 Kimin Lee , Laura Smith , Anca Dragan , Pieter Abbeel

This paper studies reward-agnostic exploration in reinforcement learning (RL) -- a scenario where the learner is unware of the reward functions during the exploration stage -- and designs an algorithm that improves over the state of the…

机器学习 · 计算机科学 2024-05-24 Gen Li , Yuling Yan , Yuxin Chen , Jianqing Fan

Reinforcement learning (RL) is a popular approach for robotic path planning in uncertain environments. However, the control policies trained for an RL agent crucially depend on user-defined, state-based reward functions. Poorly designed…

Reward models trained on human preference data have demonstrated strong effectiveness in aligning Large Language Models (LLMs) with human intent under the framework of Reinforcement Learning from Human Feedback (RLHF). However, RLHF remains…

Reinforcement learning (RL) algorithms struggle with learning optimal policies for tasks where reward feedback is sparse and depends on a complex sequence of events in the environment. Probabilistic reward machines (PRMs) are finite-state…

机器学习 · 计算机科学 2025-10-20 Jan Corazza , Hadi Partovi Aria , Daniel Neider , Zhe Xu

In offline reinforcement learning (offline RL), one of the main challenges is to deal with the distributional shift between the learning policy and the given dataset. To address this problem, recent offline RL methods attempt to introduce…

机器学习 · 计算机科学 2021-11-16 Jianhao Wang , Wenzhe Li , Haozhe Jiang , Guangxiang Zhu , Siyuan Li , Chongjie Zhang

In toxicology research, experiments are often conducted to determine the effect of toxicant exposure on the behavior of mice, where mice are randomized to receive the toxicant or not. In particular, in fixed interval experiments, one…

Exploration is widely regarded as one of the most challenging aspects of reinforcement learning (RL), with many naive approaches succumbing to exponential sample complexity. To isolate the challenges of exploration, we propose a new…

机器学习 · 计算机科学 2020-02-10 Chi Jin , Akshay Krishnamurthy , Max Simchowitz , Tiancheng Yu

We study the constrained reinforcement learning problem, in which an agent aims to maximize the expected cumulative reward subject to a constraint on the expected total value of a utility function. In contrast to existing model-based…

机器学习 · 计算机科学 2023-01-10 Arnob Ghosh , Xingyu Zhou , Ness Shroff

In this paper, we propose Belief Behavior Trees (BBTs), an extension to Behavior Trees (BTs) that allows to automatically create a policy that controls a robot in partially observable environments. We extend the semantic of BTs to account…

机器人学 · 计算机科学 2020-08-24 Evgenii Safronov , Michele Colledanchise , Lorenzo Natale

Safe reinforcement learning is a promising path toward applying reinforcement learning algorithms to real-world problems, where suboptimal behaviors may lead to actual negative consequences. In this work, we focus on the setting where…

机器学习 · 计算机科学 2022-02-17 Garrett Thomas , Yuping Luo , Tengyu Ma

Offline reinforcement learning (RL) is suitable for safety-critical domains where online exploration is too costly or dangerous. In such safety-critical settings, decision-making should take into consideration the risk of catastrophic…

机器学习 · 计算机科学 2023-10-31 Marc Rigter , Bruno Lacerda , Nick Hawes

Reinforcement Learning with Human Feedback (RLHF) and Reinforcement Learning with Verifiable Rewards (RLVR) are the main RL paradigms used in LLM post-training, each offering distinct advantages. However, RLHF struggles with…

Deep reinforcement learning (RL) is a powerful approach to complex decision making. However, one issue that limits its practical application is its brittleness, sometimes failing to train in the presence of small changes in the environment.…

机器学习 · 计算机科学 2025-01-27 Jung-Hoon Cho , Vindula Jayawardana , Sirui Li , Cathy Wu

In the dynamic and uncertain environments where reinforcement learning (RL) operates, risk management becomes a crucial factor in ensuring reliable decision-making. Traditional RL approaches, while effective in reward optimization, often…

机器学习 · 计算机科学 2023-09-13 Ali Baheri