.png){kind=icon}
返回
Combining active learning suggestions
.png){kind=icon}
OA
AI
DOI：10.7717/peerj-cs.157.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study the problem of combining active learning suggestions to identify informative training examples by empirically comparing methods on benchmark datasets. Many active learning heuristics for classification problems have been proposed to help us pick which instance to annotate next. But what is the optimal heuristic for a particular source of data? Motivated by the success of methods that combine predictors, we combine active learners with bandit algorithms and rank aggregation methods. We demonstrate that a combination of active learners outperforms passive learning in large benchmark datasets and removes the need to pick a particular active learner a priori. We discuss challenges to finding good rewards for bandit approaches and show that rank aggregation performs well.
Keyword:
Active learning
Bandit
Rank aggregation
Benchmark
Multiclass classification
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.5
论文数:
3.4K
被引数:
6.9K
机构
引用论文
Cognitive Processing in Migraine: A Failure To Find Facilitation in Patients with Aura.png)
Cephalalgia
CephalalgiaIF0
PREAI
分享收藏Evolutionary Strategy to Perform Batch-Mode Active Learning on Multi-Label Data多标签数据批处理模式主动学习的进化策略
PREAI
分享收藏KULLBACK-LEIBLER UPPER CONFIDENCE BOUNDS FOR OPTIMAL SEQUENTIAL ALLOCATIONANNALS OF STATISTICSOAAI
ANNALS OF STATISTICSIF3.7
OAAI分享收藏分享收藏
查看更多内容