中文
相关论文

相关论文: The Behavioral Credibility Trilemma: When Calibrat…

200 篇论文

In reinforcement learning (RL), an autonomous agent learns to perform complex tasks by maximizing an exogenous reward signal while interacting with its environment. In real-world applications, test conditions may differ substantially from…

机器人学 · 计算机科学 2019-10-30 Matteo Turchetta , Andreas Krause , Sebastian Trimpe

Many interventions, such as vaccines in clinical trials or coupons in online marketplaces, must be assigned sequentially without full knowledge of their effects. Multi-armed bandit algorithms have proven successful in such settings.…

机器学习 · 统计学 2026-05-07 Aidan Gleich , Eric Laber , Alexander Volfovsky

A core element in decision-making under uncertainty is the feedback on the quality of the performed actions. However, in many applications, such feedback is restricted. For example, in recommendation systems, repeatedly asking the user to…

机器学习 · 计算机科学 2021-07-13 Yonathan Efroni , Nadav Merlis , Aadirupa Saha , Shie Mannor

We consider the problem of learning control policies that optimize a reward function while satisfying constraints due to considerations of safety, fairness, or other costs. We propose a new algorithm, Projection-Based Constrained Policy…

机器学习 · 计算机科学 2020-10-08 Tsung-Yen Yang , Justinian Rosca , Karthik Narasimhan , Peter J. Ramadge

In reinforcement learning, we typically refer to unsupervised pre-training when we aim to pre-train a policy without a priori access to the task specification, i.e. rewards, to be later employed for efficient learning of downstream tasks.…

机器学习 · 计算机科学 2025-10-21 Riccardo Zamboni , Mirco Mutti , Marcello Restelli

We study algorithms for average-cost reinforcement learning problems with value function approximation. Our starting point is the recently proposed POLITEX algorithm, a version of policy iteration where the policy produced in each iteration…

机器学习 · 计算机科学 2019-08-29 Yasin Abbasi-Yadkori , Nevena Lazic , Csaba Szepesvari , Gellert Weisz

In this paper, we present a novel algorithm named synchronous integral Q-learning, which is based on synchronous policy iteration, to solve the continuous-time infinite horizon optimal control problems of input-affine system dynamics. The…

系统与控制 · 电气工程与系统科学 2021-05-20 Lei Guo , Han Zhao

This work explores a social learning problem with agents having nonidentical noise variances and mismatched beliefs. We consider an $N$-agent binary hypothesis test in which each agent sequentially makes a decision based not only on a…

计算机科学与博弈论 · 计算机科学 2019-10-02 Daewon Seo , Ravi Kiran Raman , Joong Bum Rhim , Vivek K Goyal , Lav R Varshney

We investigate the possibility of an incentive-compatible (IC, a.k.a. strategy-proof) mechanism for the classification of agents in a network according to their reviews of each other. In the $ \alpha $-classification problem we are…

计算机科学与博弈论 · 计算机科学 2019-11-21 Yakov Babichenko , Oren Dean , Moshe Tennenholtz

Learning to control an environment without hand-crafted rewards or expert data remains challenging and is at the frontier of reinforcement learning research. We present an unsupervised learning algorithm to train agents to achieve…

机器学习 · 计算机科学 2018-11-29 David Warde-Farley , Tom Van de Wiele , Tejas Kulkarni , Catalin Ionescu , Steven Hansen , Volodymyr Mnih

In practice, incentive providers (i.e., principals) often cannot observe the reward realizations of incentivized agents, which is in contrast to many principal-agent models that have been previously studied. This information asymmetry…

机器学习 · 计算机科学 2023-08-15 Ilgin Dogan , Zuo-Jun Max Shen , Anil Aswani

Direct policy gradient methods for reinforcement learning and continuous control problems are a popular approach for a variety of reasons: 1) they are easy to implement without explicit knowledge of the underlying model 2) they are an…

机器学习 · 计算机科学 2019-03-26 Maryam Fazel , Rong Ge , Sham M. Kakade , Mehran Mesbahi

Learning near-optimal behaviour from an expert's demonstrations typically relies on the assumption that the learner knows the features that the true reward function depends on. In this paper, we study the problem of learning from…

机器学习 · 计算机科学 2019-03-28 Luis Haug , Sebastian Tschiatschek , Adish Singla

Artificial agents now generate behavior rich enough to invite trust, surprise, and concern, yet our evaluation tools still privilege capability scores over psychological structure. This paper argues that the philosophical impasse between…

人工智能 · 计算机科学 2026-05-26 Alex Bogdan , Adrian de Valois-Franklin

We consider the problem of tabular infinite horizon concave utility reinforcement learning (CURL) with convex constraints. For this, we propose a model-based learning algorithm that also achieves zero constraint violations. Assuming that…

机器学习 · 计算机科学 2023-11-20 Mridul Agarwal , Qinbo Bai , Vaneet Aggarwal

Reinforcement learning significantly enhances LLM capabilities but suffers from a critical issue: length inflation, where models adopt verbosity or inefficient reasoning to maximize rewards. Prior approaches struggle to address this…

机器学习 · 计算机科学 2026-03-12 Zichao Li , Jie Lou , Fangchen Dong , Zhiyuan Fan , Mengjie Ren , Hongyu Lin , Xianpei Han , Debing Zhang , Le Sun , Yaojie Lu , Xing Yu

In Reinforcement Learning, the optimal action at a given state is dependent on policy decisions at subsequent states. As a consequence, the learning targets evolve with time and the policy optimization process must be efficient at…

机器学习 · 计算机科学 2022-02-16 Romain Laroche , Remi Tachet

We introduce the framework of performative reinforcement learning where the policy chosen by the learner affects the underlying reward and transition dynamics of the environment. Following the recent literature on performative…

机器学习 · 计算机科学 2023-06-08 Debmalya Mandal , Stelios Triantafyllou , Goran Radanovic

We investigate the important problem of certifying stability of reinforcement learning policies when interconnected with nonlinear dynamical systems. We show that by regulating the input-output gradients of policies, strong guarantees of…

系统与控制 · 计算机科学 2018-10-30 Ming Jin , Javad Lavaei

We consider the fair division of indivisible items among $n$ agents with additive non-negative normalized valuations, with the goal of obtaining high value guarantees, that is, close to the proportional share for each agent. We prove that…

计算机科学与博弈论 · 计算机科学 2026-02-13 Sushmita Gupta , Pallavi Jain , Sanjay Seetharaman , Meirav Zehavi