arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2510.17153cs.SIcs.LG
收藏

HyperSearch:通过无约束且高效的搜索预测新超边

HyperSearch: Prediction of New Hyperedges through Unconstrained yet Efficient Search

School of Electrical Engineering(电气工程学院);Kim Jaechul Graduate School of AI(Kim Jaechul人工智能研究生院)

Hyunjin Choo, Fanchen Bu, Hyunjin Hwang, Young-Gyu Yoon, Kijung Shin

AI总结:

本文提出 HyperSearch,用经验评分函数及其反单调上界在无约束候选空间中高效剪枝搜索,并在10个真实超图上验证其超边预测准确率优于现有方法。

摘要:

复杂系统中的高阶交互(HOIs),例如科学合作、多蛋白复合物和多用户通信,通常被建模为超图,其中每条超边(即节点的一个子集)表示节点之间的一种高阶交互。给定一个超图,超边预测旨在识别缺失的或未来可能形成的超边,并具有广泛应用,包括推荐基于兴趣的社会群体、预测合作关系以及揭示生物系统中的功能复合物。然而,超边候选的巨大搜索空间(即所有可能的节点子集)带来了重大计算挑战,使朴素的穷举搜索不可行。因此,现有方法要么依赖启发式采样以获得受约束的候选集,要么依赖关于超图结构的缺乏依据的假设来选择有前景的超边。在本研究中,我们提出 HyperSearch,这是一种用于超边预测的基于搜索的算法,通过结合两个关键组件来高效评估无约束候选集:(1)从真实世界超图中的观察得出的、具有经验依据的评分函数;以及(2)一种高效搜索机制,我们在其中推导并使用原始评分函数(该函数不具有反单调性)的反单调上界来剪枝搜索空间。这种剪枝具有理论保证,可确保就原始评分函数而言,被丢弃的候选绝不会优于被保留的候选。在跨越五个领域的 10 个真实世界超图上进行的大量实验中,HyperSearch 始终优于最先进的基线方法,在预测新的(即不在训练集中的)超边方面取得了更高的准确率。

英文摘要:

Higher-order interactions (HOIs) in complex systems, such as scientific collaborations, multi-protein complexes, and multi-user communications, are commonly modeled as hypergraphs, where each hyperedge (i.e., a subset of nodes) represents an HOI among the nodes. Given a hypergraph, hyperedge prediction aims to identify hyperedges that are either missing or likely to form in the future, and it has broad applications, including recommending interest-based social groups, predicting collaborations, and uncovering functional complexes in biological systems. However, the vast search space of hyperedge candidates (i.e., all possible subsets of nodes) poses a significant computational challenge, making naive exhaustive search infeasible. As a result, existing approaches rely on either heuristic sampling to obtain constrained candidate sets or ungrounded assumptions on hypergraph structure to select promising hyperedges. In this work, we propose HyperSearch, a search-based algorithm for hyperedge prediction that efficiently evaluates unconstrained candidate sets, by incorporating two key components: (1) an empirically grounded scoring function derived from observations in real-world hypergraphs and (2) an efficient search mechanism, where we derive and use an anti-monotonic upper bound of the original scoring function (which is not antimonotonic) to prune the search space. This pruning comes with theoretical guarantees, ensuring that discarded candidates are never better than the kept ones w.r.t. the original scoring function. In extensive experiments on 10 real-world hypergraphs across five domains, HyperSearch consistently outperforms state-of-the-art baselines, achieving higher accuracy in predicting new (i.e., not in the training set) hyperedges.

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

↑