paper-with-me

홈 › Papers

Imitation Learning via Focused Satisficing

2025-05-20 · Rushit N. Shah, Nikolaos Agadakos, Synthia Sasulski, Ali Farajzadeh, Sanjiban Choudhury, Brian Ziebart

Imitation learning often assumes that demonstrations are close to optimal according to some fixed, but unknown, cost function. However, according to satisficing theory, humans often choose acceptable behavior based on their personal (and potentially dynamic) levels of aspiration, rather than achieving (near-) optimality. For example, a lunar lander demonstration that successfully lands without crashing might be acceptable to a novice despite being slow or jerky. Using a margin-based objective to guide deep reinforcement learning, our focused satisficing approach to imitation learning seeks a policy that surpasses the demonstrator's aspiration levels -- defined over trajectories or portions of trajectories -- on unseen demonstrations without explicitly learning those aspirations. We show experimentally that this focuses the policy to imitate the highest quality (portions of) demonstrations better than existing imitation learning methods, providing much higher rates of guaranteed acceptability to the demonstrator, and competitive true returns on a range of environments.

📄 PDF Abstract BibTeX arXiv:2505.14820

Code (0)

등록된 구현이 없습니다.

Tasks

Deep Reinforcement LearningImitation Learning

Similar Papers 제목 키워드 기반

Time-Sensitive Bandit Learning and Satisficing Thompson Sampling

2017-04-28 · Daniel Russo, David Tse, Benjamin Van Roy

The literature on bandit learning and regret analysis has focused on contexts where the goal is to converge on an optimal action in a manner that limits exploration costs. One shortcoming imposed by this orientation is t…

Thompson Sampling

Satisficing Exploration in Bandit Optimization

2024-06-10 · Qing Feng, Tianyi Ma, Ruihao Zhu

Motivated by the concept of satisficing in decision-making, we consider the problem of satisficing exploration in bandit optimization. In this setting, the learner aims at selecting satisficing arms (arms with mean rewar…

Decision Making

Satisficing Equilibrium

2024-09-01 · Bary S. R. Pradelski, Bassel Tarbush

We propose a solution concept in which each agent $i$ does not necessarily optimize but selects one of their top $k_i$ actions. Our concept accounts for heterogeneous agents' bounded rationality. We show that there exist…

All

Satisficing in Time-Sensitive Bandit Learning

2018-03-07 · Daniel Russo, Benjamin Van Roy

Much of the recent literature on bandit learning focuses on algorithms that aim to converge on an optimal action. One shortcoming is that this orientation does not account for time sensitivity, which can play a crucial r…

Thompson Sampling

On Satisficing in Quantitative Games

2021-01-06 · Suguman Bansal, Krishnendu Chatterjee, Moshe Y. Vardi

Several problems in planning and reactive synthesis can be reduced to the analysis of two-player quantitative graph games. {\em Optimization} is one form of analysis. We argue that in many cases it may be better to repla…