paper-with-me

홈 › Papers

The Paradox of Choice: Using Attention in Hierarchical Reinforcement Learning

2022-01-24 · Andrei Nica, Khimya Khetarpal, Doina Precup

Decision-making AI agents are often faced with two important challenges: the depth of the planning horizon, and the branching factor due to having many choices. Hierarchical reinforcement learning methods aim to solve the first problem, by providing shortcuts that skip over multiple time steps. To cope with the breadth, it is desirable to restrict the agent's attention at each step to a reasonable number of possible choices. The concept of affordances (Gibson, 1977) suggests that only certain actions are feasible in certain states. In this work, we model "affordances" through an attention mechanism that limits the available choices of temporally extended options. We present an online, model-free algorithm to learn affordances that can be used to further learn subgoal options. We investigate the role of hard versus soft attention in training data collection, abstract value learning in long-horizon tasks, and handling a growing number of choices. We identify and empirically illustrate the settings in which the paradox of choice arises, i.e. when having fewer but more meaningful choices improves the learning speed and performance of a reinforcement learning agent.

📄 PDF Abstract BibTeX arXiv:2201.09653

Code (1)

andreicnica/hrl_attention 공식 구현 pytorch

Tasks

Decision MakingHierarchical Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)

Methods 이 논문이 사용한 방법론

SPEED The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene…

Similar Papers 제목 키워드 기반

Condorcet-Consistent Choice Among Three Candidates

2024-11-29 · Felix Brandt, Chris Dong, Dominik Peters

A voting rule is a Condorcet extension if it returns a candidate that beats every other candidate in pairwise majority comparisons whenever one exists. Condorcet extensions have faced criticism due to their susceptibilit…

The Smoothed Possibility of Social Choice

2020-06-11 · NeurIPS 2020 12 · Lirong Xia

We develop a framework that leverages the smoothed complexity analysis by Spielman and Teng to circumvent paradoxes and impossibility theorems in social choice, motivated by modern applications of social choice powered b…

A Mathematical Analysis of the 2022 Alaska Special Election for US House

2022-09-11 · Adam Graham-Squire, David McCune

The August 2022 Alaska Special Election for US House contained many interesting features from the perspective of social choice theory. This election used instant runoff voting (often referred to as ranked choice voting) …

Paradoxical Oddities in Two Multiwinner Elections from Scotland

2023-05-31 · Adam Graham-Squire, David McCune

Ranked-choice voting anomalies such as monotonicity paradoxes have been extensively studied through creating hypothetical examples and generating elections under various models of voter behavior. However, very few real-w…

Finer is Better (with the Right Scaling)

2026-05-08 · Clemens Schaefer, Gil Tabak arxiv

Microscaling is a critical technique for preserving the quality of Large Language Models (LLMs) quantized to ultra-low precision formats. Intuitively, finer block sizes should yield lower quantization error; however, a p…