arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2603.00517cs.LGcs.AI
收藏

FastBUS: 一种用于统一弱监督学习的高效贝叶斯框架

FastBUS: A Fast Bayesian Framework for Unified Weakly-Supervised Learning

School of Software Technology, Zhejiang University(浙江大学软件学院);State Key Laboratory of Blockchain and Data Security, Zhejiang University(浙江大学区块链与数据安全国家重点实验室);School of Computer Science and Engineering, Southeast University(东南大学计算机科学与工程学院);College of Computer Science and Technology, Zhejiang University(浙江大学计算机科学与技术学院)

Ziquan Wang, Haobo Wang, Ke Chen, Lei Feng, Gang Chen

AI总结:

FastBUS提出了一种高效贝叶斯框架,通过概率转移和低秩假设加速弱监督学习,实现多类别批量处理和显著提升运行效率。

摘要:

机器学习常常涉及各种不精确的标签,导致多样化的弱监督设置。尽管近期方法旨在实现通用处理,但通常面临复杂的手动预处理工作,忽略相关标签之间的关系,或由于计算设计缺陷无法批量处理,导致运行时间长。为解决这些限制,我们提出了一种新的通用框架,能够高效地推断出各种弱监督下的潜在真实标签分布。我们的关键思想是将标签的穷举搜索过程表示为标签变量的概率转移,将多样化的弱监督DFS树结构压缩成共享的贝叶斯网络。从这里,我们推导出基于广义信念传播的潜在概率计算算法,并提出两种联合加速策略:1)引入低秩假设来近似转移矩阵,降低时间复杂度;2)设计一个端到端的状态演化模块来学习批量规模的转移矩阵,促进多类别的批量处理。此外,我们的方法在大多数情况下与EM算法的等价性也进一步得到验证。大量实验表明,我们的方法在大多数弱监督设置下实现了SOTA结果,并在运行时间上比其他通用方法快了数百倍。

英文摘要:

Machine Learning often involves various imprecise labels, leading to diverse weakly supervised settings. While recent methods aim for universal handling, they usually suffer from complex manual pre-work, ignore the relationships between associated labels, or are unable to batch process due to computational design flaws, resulting in long running times. To address these limitations, we propose a novel general framework that efficiently infers latent true label distributions across various weak supervisions. Our key idea is to express the label brute-force search process as a probabilistic transition of label variables, compressing diverse weakly supervised DFS tree structures into a shared Bayesian network. From this, we derived a latent probability calculation algorithm based on generalized belief propagation and proposed two joint acceleration strategies: 1) introducing a low-rank assumption to approximate the transition matrix, reducing time complexity; 2) designing an end-to-end state evolution module to learn batch-scale transition matrices, facilitating multi-category batch processing. In addition, the equivalence of our method with the EM algorithm in most scenarios is further demonstrated. Extensive experiments show that our method achieves SOTA results under most weakly supervised settings, and achieves up to hundreds of times faster acceleration in running time compared to other general methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑