paper-with-me

Papers

Ensemble Active Learning by Contextual Bandits for AI Incubation in Manufacturing

2023-10-10 · Yingyan Zeng, Xiaoyu Chen, Ran Jin

It is challenging but important to save annotation efforts in streaming data acquisition to maintain data quality for supervised learning base learners. We propose an ensemble active learning method to actively acquire samples for annotation by contextual bandits, which is will enforce the exploration-exploitation balance and leading to improved AI modeling performance.

📄 PDF Abstract BibTeX arXiv:2310.06306

Code (0)

등록된 구현이 없습니다.

Tasks

Active LearningDecision MakingMulti-Armed Bandits

Methods 이 논문이 사용한 방법론

BASE 설명 없음

Similar Papers 제목 키워드 기반

Provable Anytime Ensemble Sampling Algorithms in Nonlinear Contextual Bandits

2025-10-12 · Jiazheng Sun, Weixin Wang, Pan Xu arxiv

We provide a unified algorithmic framework for ensemble sampling in nonlinear contextual bandits and develop corresponding regret bounds for two most common nonlinear contextual bandit settings: Generalized Linear Ensemb…

Tree Ensembles for Contextual Bandits

2024-02-10 · Hannes Nilsson, Rikard Johansson, Niklas Åkerblom, Morteza Haghir Chehreghani

We propose a new framework for contextual multi-armed bandits based on tree ensembles. Our framework adapts two widely used bandit methods, Upper Confidence Bound and Thompson Sampling, for both standard and combinatoria…

Multi-Armed BanditsThompson Sampling

BanditSum: Extractive Summarization as a Contextual Bandit

2018-09-25 · EMNLP 2018 10 · Yue Dong, Yikang Shen, Eric Crawford, Herke van Hoof 외

In this work, we propose a novel method for training neural networks to perform single-document extractive summarization without heuristically-generated extractive labels. We call our approach BanditSum as it treats extr…

Extractive SummarizationExtractive Text SummarizationReinforcement Learning

Locally Differentially Private (Contextual) Bandits Learning

2020-06-01 · NeurIPS 2020 12 · Kai Zheng, Tianle Cai, Weiran Huang, Zhenguo Li 외

We study locally differentially private (LDP) bandits learning in this paper. First, we propose simple black-box reduction frameworks that can solve a large family of context-free bandits learning problems with LDP guara…

Multi-Armed BanditsPrivacy Preserving Deep Learning

Active Learning for Stochastic Contextual Linear Bandits

2026-05-24 · Emma Brunskill, Ishani Karmarkar, Zhaoqi Li arxiv

A key goal in stochastic contextual linear bandits is to efficiently learn a near-optimal policy. Prior algorithms for this problem learn a policy by strategically sampling actions but naively (passively) sampling contex…

Active Learning