arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2601.20157cs.LGcs.ET
收藏

PASS:经典和量子配对约束聚类的认证子集修复

PASS: Certified Subset Repair for Classical and Quantum Pairwise Constrained Clustering

University of South Florida(南佛罗里达大学);Fordham University(福特汉姆大学)

Pedro Chumpitaz-Flores, My Duong, Ying Mao, Kaixun Hua

AI总结:

PASS通过认证子集修复技术,在经典和量子配对约束聚类中实现高效优化,减少计算资源消耗并提升聚类性能。

摘要:

配对约束聚类通过样本之间的必须链接(ML)和不能链接(CL)关系引入侧信息。虽然这些约束可以提高聚类质量,但它们在大规模优化中复杂化,并通过编码问题的大小限制了量子和混合方法。PASS是一种可扩展的配对约束k-means框架,它在小的工作子集上集中优化,同时通过重新中心化更新剩余分配。在子集受限更新下,不能链接可行性被形式化为诱导约束子图上的列表着色问题,从而产生可检查的修复证书和可验证的结果。相同的子集限制产生了更小的经典子问题和更小的量子公式,使混合评估在模拟协议下得以减少。不可行的约束集通过显式处理:该流程在给定条件下返回可验证的修复或在相同评估协议下报告残余冲突。在多样化的基准测试中,PASS在较低的运行时间和竞争的SSE上返回解决方案,在强基线方法无法在固定时间预算内完成的实例上也是如此。

英文摘要:

Pairwise-constrained clustering incorporates side information through must-link (ML) and cannot-link (CL) relations between samples. While these constraints can improve cluster quality, they complicate optimization at scale and limit quantum and hybrid approaches through the size of the encoded problem. PASS is a scalable framework for pairwise-constrained k-means that concentrates optimization on a small working subset while updating remaining assignments through re-centering. Cannot-link feasibility under subset-restricted updates is formalized as a list-coloring problem on the induced constraint subgraph, yielding a checkable repair certificate with verifiable outcomes. The same subset restriction produces reduced classical subproblems and smaller quantum formulations, enabling a reduction-based hybrid evaluation under a simulation protocol. Infeasible constraint sets are handled explicitly: the pipeline returns a verifiable repair under stated conditions or reports residual conflicts under the same evaluation protocol. Across diverse benchmarks, PASS attains competitive SSE with lower runtime and returns solutions on instances where strong baselines do not finish within a fixed time budget.

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

↑