atlas

Research map / Label-efficient and robust learning / Recognition and long-tail

Composite Active Learning: Towards Multi-Domain Active Learning with Theoretical Guarantees

AAAI 2024 · Label-efficient and robust learning › Recognition and long-tail · approach: Deep active learning · 4 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes Composite Active Learning (CAL), a multi-domain active learning method that uses learned similarity weights and a conditional discriminator to allocate labeling budget across domains, with a theoretical error bound.

Problem

Active learning under a fixed labeling budget has been studied only in the single-domain setting; many real tasks involve multiple domains, and it is unclear how to allocate labeling budget across them.

Approach

Uses similarity weights between domains, learned end-to-end with an encoder, classifier and conditional discriminator in a min-max procedure, to guide the optimal labeling budget per domain and select informative instances; the paper claims a better error bound than current active learning methods.

Key results

Limitations

Experimental setup

Baselines: single-domain active learning methods current active learning methods

Builds on: adversarial domain adaptation single-domain active learning

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy