中文
相关论文

相关论文: Solving Rubik's Cube Without Tricky Sampling

200 篇论文

Reinforcement learning (RL) algorithms aim to learn optimal decisions in unknown environments through experience of taking actions and observing the rewards gained. In some cases, the environment is not influenced by the actions of the RL…

In human-in-the-loop reinforcement learning or environments where calculating a reward is expensive, the costly rewards can make learning efficiency challenging to achieve. The cost of obtaining feedback from humans or calculating expensive…

机器学习 · 计算机科学 2025-03-03 Muhammed Yusuf Satici , David L. Roberts

Reinforcement learning (RL) algorithms have proven transformative in a range of domains. To tackle real-world domains, these systems often use neural networks to learn policies directly from pixels or other high-dimensional sensory input.…

机器学习 · 计算机科学 2025-10-02 Nishil Patel , Sebastian Lee , Stefano Sarao Mannelli , Sebastian Goldt , Andrew Saxe

This paper proposes a Deep Reinforcement Learning (DRL) approach for solving knapsack problem. The proposed method consists of a state aggregation step based on tabular reinforcement learning to extract features and construct states. The…

神经与进化计算 · 计算机科学 2020-04-28 Reza Refaei Afshar , Yingqian Zhang , Murat Firat , Uzay Kaymak

Deep Reinforcement Learning has enabled the learning of policies for complex tasks in partially observable environments, without explicitly learning the underlying model of the tasks. While such model-free methods achieve considerable…

机器学习 · 计算机科学 2017-01-11 Tanmay Shankar , Santosha K. Dwivedy , Prithwijit Guha

Robust reinforcement learning (RRL) aims at seeking a robust policy to optimize the worst case performance over an uncertainty set of Markov decision processes (MDPs). This set contains some perturbed MDPs from a nominal MDP (N-MDP) that…

机器学习 · 计算机科学 2023-11-21 Ukjo Hwang , Songnam Hong

Reinforcement Learning with Verifiable Rewards (RLVR) has proven effective for enhancing Large Language Models (LLMs) on complex reasoning tasks. However, existing methods suffer from an exploration dilemma: the sharply peaked initial…

人工智能 · 计算机科学 2025-09-30 Yuhua Jiang , Jiawei Huang , Yufeng Yuan , Xin Mao , Yu Yue , Qianchuan Zhao , Lin Yan

It is a long-standing question to discover causal relations among a set of variables in many empirical sciences. Recently, Reinforcement Learning (RL) has achieved promising results in causal discovery from observational data. However,…

机器学习 · 计算机科学 2021-09-16 Xiaoqiang Wang , Yali Du , Shengyu Zhu , Liangjun Ke , Zhitang Chen , Jianye Hao , Jun Wang

Dealing with environments with sparse rewards has always been crucial for systems developed to operate in autonomous open-ended learning settings. Intrinsic Motivations could be an effective way to help Deep Reinforcement Learning…

机器学习 · 计算机科学 2025-04-07 Gianluca Maselli , Vieri Giuliano Santucci

Constrained decision-making is essential for designing safe policies in real-world control systems, yet simulated environments often fail to capture real-world adversities. We consider the problem of learning a policy that will maximize the…

机器学习 · 计算机科学 2026-02-10 Sourav Ganguly , Kishan Panaganti , Arnob Ghosh , Adam Wierman

The use of reinforcement learning (RL) in scientific applications, such as materials design and automated chemistry, is increasing. A major challenge, however, lies in fact that measuring the state of the system is often costly and time…

机器学习 · 计算机科学 2022-04-08 Colin Bellinger , Andriy Drozdyuk , Mark Crowley , Isaac Tamblyn

We propose an automata-theoretic approach for reinforcement learning (RL) under complex spatio-temporal constraints with time windows. The problem is formulated using a Markov decision process under a bounded temporal logic constraint.…

人工智能 · 计算机科学 2023-08-01 Xiaoshan Lin , Abbasali Koochakzadeh , Yasin Yazicioglu , Derya Aksaray

We propose an algorithm for deterministic continuous Markov Decision Processes with sparse rewards that computes the optimal policy exactly with no dependency on the size of the state space. The algorithm has time complexity of $O( |R|^3…

机器学习 · 计算机科学 2018-05-21 Joshua R. Bertram , Peng Wei

We introduce a new framework that performs decision-making in reinforcement learning (RL) as an iterative reasoning process. We model agent behavior as the steady-state distribution of a parameterized reasoning Markov chain (RMC), optimized…

机器学习 · 计算机科学 2022-10-14 Edoardo Cetin , Oya Celiktutan

Sampling is ubiquitous in machine learning methodologies. Due to the growth of large datasets and model complexity, we want to learn and adapt the sampling process while training a representation. Towards achieving this grand goal, a…

机器学习 · 计算机科学 2022-12-14 Jason Xiaotian Dou , Alvin Qingkai Pan , Runxue Bao , Haiyi Harry Mao , Lei Luo , Zhi-Hong Mao

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

We address the problem of deploying a reinforcement learning (RL) agent on a physical system such as a datacenter cooling unit or robot, where critical constraints must never be violated. We show how to exploit the typically smooth dynamics…

人工智能 · 计算机科学 2018-01-29 Gal Dalal , Krishnamurthy Dvijotham , Matej Vecerik , Todd Hester , Cosmin Paduraru , Yuval Tassa

Reinforcement Learning (RL) enhances LLM reasoning, yet a paradox emerges as models scale: strong base models saturate standard benchmarks (e.g., MATH), yielding correct but homogeneous solutions. In such environments, the lack of failure…

机器学习 · 计算机科学 2026-04-21 Zhenwen Liang , Yujun Zhou , Sidi Lu , Xiangliang Zhang , Haitao Mi , Dong Yu

In many reinforcement learning (RL) applications, we want policies that reach desired states and then keep the controlled system within an acceptable region around the desired states over an indefinite period of time. This latter objective…

机器学习 · 计算机科学 2024-05-28 Brahma S. Pavse , Matthew Zurek , Yudong Chen , Qiaomin Xie , Josiah P. Hanna

A big challenge in branch and bound lies in identifying the optimal node within the search tree from which to proceed. Current state-of-the-art selectors utilize either hand-crafted ensembles that automatically switch between naive sub-node…

机器学习 · 计算机科学 2024-06-06 Alexander Mattick , Christopher Mutschler