如何高效搜索好的假设？这篇论文从理论上探讨假设空间搜索的时间下界与算法效率，对机器学习模型选择有启发。
arXiv:2509.03734v3 Announce Type: replace-cross Abstract: In the hypothesis selection problem, we are given sample and query access to finite set of c…
用Mamba替代Transformer，结合查询式跨模态投影器，大幅降低多模态大模型的计算复杂度
arXiv:2606.04719v1 Announce Type: new Abstract: The Transformer's quadratic complexity with input length imposes an unsustainable computational load o…
研究累积命题依赖逻辑中蕴涵问题的计算复杂度，揭示理论计算机科学前沿进展。
arXiv:2605.21113v1 Announce Type: cross Abstract: This paper establishes and proves complexity results for entailment for cumulative propositional dep…
从参数化复杂度角度揭示了ReLU神经网络验证的困难性，为理解其计算极限提供新视角
arXiv:2509.22849v2 Announce Type: replace-cross Abstract: Neural networks with ReLU activations are a widely used model in machine learning. It is thu…