1
Towards Optimal Robustness in Learning-Augmented Paging
探索学习增强分页算法如何实现最优鲁棒性，理论突破值得关注
arXiv:2606.01342v1 Announce Type: cross Abstract: Learning-augmented paging has been extensively studied in recent years. A key advantage over naive M…
2
Envy-Free Allocation of Indivisible Goods via Noisy Queries
噪声查询下公平分配不可分割物品的算法上下界，为真实场景中的公平性保障提供理论支撑。
arXiv:2602.06361v2 Announce Type: replace-cross Abstract: We introduce a problem of fairly allocating indivisible goods (items) in which the agents' v…
3
Lean Meets Theoretical Computer Science: Scalable Synthesis of Theorem Proving Challenges in Formal-Informal Pairs
结合Lean与理论计算机科学，可规模生成形式-非形式配对的定理证明挑战，助力AI数学推理研究。
arXiv:2508.15878v2 Announce Type: replace-cross Abstract: Formal theorem proving (FTP) has emerged as a critical foundation for evaluating the reasoni…
4
Learning How to Cube
arXiv最新预印本，系统探讨如何通过机器学习方法实现立方操作，理论严谨，适合算法研究者深读。
arXiv:2605.16632v1 Announce Type: new Abstract: Despite the effectiveness of Cube-and-Conquer (C&C) for solving challenging Boolean Satisfiability…
5
Prediction-Intervention Games and Invariant Sets
探讨预测与干预博弈中不变集的数学结构，为理解智能体交互提供理论框架。
arXiv:2605.16828v1 Announce Type: cross Abstract: We consider the following two-player game: using observational data, the leader chooses a prediction…