English(EN) AFA-BANDIT: Provably Near-Optimal Online Multi-Feature Classification Under Budget Constraints

新的AFA-BANDIT框架提供了可证明的近乎最优在线分类

作者 PulseAugur 编辑部 · [1 个来源] · 2026-10-07 04:00

研究人员推出了一种新颖的在线多特征分类框架AFA-BANDIT，该框架解决了预算约束问题。与以前的方法不同，AFA-BANDIT将问题表述为组合式背包式土匪（BwK）问题，提供了一种可证明的近乎最优的方法。提出的LP-Chain变体能够有效地搜索特征子集，在合成数据上与现有的基于深度强化学习和HEDGE的基线相比，表现出更优越的性能和可扩展性。 AI

影响为具有预算约束的在线分类问题引入了新的理论框架，有可能提高机器学习任务中数据采集的效率。

排序理由这是一篇详细介绍新算法框架的研究论文。[lever_c_demoted from research: ic=1 ai=1.0]

在 arXiv cs.LG 阅读 →

AI 生成摘要 · Google Gemini · 来自 1 个来源。我们如何撰写摘要 →

本文如何被排名

Signal score: 15 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 这是一篇详细介绍新算法框架的研究论文。[lever_c_demoted from research: ic=1 ai=1.0]
Source corroboration: Single-source cluster; Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics: paper, other; Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance: High; Clearly on-topic for AI-industry coverage.
Story freshness: Breaking (< 6h); Fresh story with cross-source coverage still developing. Ranking may shift as more sources report.

完整方法见我们的编辑标准。

报道来源 [1]

arXiv cs.LG TIER_1 English(EN) · AbdAlRahman Odeh, Teng-Hui Huang, Hesham El Gamal · 2026-10-07 04:00

AFA-BANDIT：在预算约束下可证明接近最优的在线多特征分类

arXiv:2610.07615v1 Announce Type: new Abstract: Active Feature Acquisition (AFA) is a classification problem in which an agent decides which costly features to acquire before predicting each sample's label. Unlike batch AFA, which trains a fixed policy and classifier offline on f…

本文如何被排名

报道来源 [1]

AFA-BANDIT：在预算约束下可证明接近最优的在线多特征分类

相关实体

相关话题