Representative Action Selection for Large Action-Space Meta-Bandits
We study the problem of selecting a subset from a large action space shared by a family of bandits, with the goal of achieving performance nearly matching that of using the full action space. We assume that similar actions tend to have related payoffs, modeled by a Gaussian process. To exploit this structure, we propose a simple epsilon-net algorithm to select a representative subset. We provide theoretical guarantees for its performance and compare it empirically to Thompson Sampling and Upper Confidence Bound.
Code (1)
Tasks
Thompson SamplingSimilar Papers 제목 키워드 기반
Representative Action Selection for Large Action Space: From Bandits to MDPs
We study the problem of selecting a small, representative action subset from an extremely large action space shared across a family of reinforcement learning (RL) environments -- a fundamental challenge in applications l…
Reinforcement LearningRecommendation SystemsWeakly-Supervised Action Segmentation and Alignment via Transcript-Aware Union-of-Subspaces Learning
We address the problem of learning to segment actions from weakly-annotated videos, i.e., videos accompanied by transcripts (ordered list of actions). We propose a framework in which we model actions with a union of …
Action SegmentationWeakly Supervised Action Segmentation (Transcript)Self-Representation Based Unsupervised Exemplar Selection in a Union of Subspaces
Finding a small set of representatives from an unlabeled dataset is a core problem in a broad range of applications such as dataset summarization and information extraction. Classical exemplar selection methods such as $…
ClusteringInformative Sample Selection Model for Skeleton-based Action Recognition with Limited Training Samples
Skeleton-based human action recognition aims to classify human skeletal sequences, which are spatiotemporal representations of actions, into predefined categories. To reduce the reliance on costly annotations of skeletal…
3D Action RecognitionActive LearningIterative Projection and Matching: Finding Structure-preserving Representatives and Its Application to Computer Vision
The goal of data selection is to capture the most structural information from a set of data. This paper presents a fast and accurate data selection method, in which the selected samples are optimized to span the subspace…
Action RecognitionActive LearningComputational EfficiencyData Summarization+3