arXivDaily arXiv每日学术速递 周一至周五更新

期刊&会议

NeurIPS

Conference on Neural Information Processing Systems · 会议 · Machine Learning

2026-01-12 至 2026-01-12 共收录 5
2509.20234 2026-01-12 cs.CV cs.AI cs.LG

ImageNet-trained CNNs are not biased towards texture: Revisiting feature reliance through controlled suppression

训练于ImageNet的CNN并非倾向于纹理:通过受控抑制重新审视特征依赖

Tom Burgert, Oliver Stoll, Paolo Rota, Begüm Demir

机构 * BIFOLD TU Berlin(柏林工业大学) University of Trento(特伦托大学)

AI总结 研究发现训练于ImageNet的CNN并非天生偏向纹理,但主要依赖局部形状特征,且可通过现代训练策略减少这种依赖。

Comments Accepted at NeurIPS 2025 (oral)

详情

展开后加载摘要…

URL PDF HTML 收藏
2505.21825 2026-01-12 cs.LG cs.AI cs.CL

Let Me Think! A Long Chain-of-Thought Can Be Worth Exponentially Many Short Ones

让我思考!一个长的推理链可能比许多短的链多出指数倍

Parsa Mirtaheri, Ezra Edelman, Samy Jelassi, Eran Malach, Enric Boix-Adsera

机构 * UC San Diego(UC圣地亚哥大学) University of Pennsylvania(宾夕法尼亚大学) Harvard University(哈佛大学)

AI总结 本文探讨了推理链扩展策略,证明在特定图连通性问题中顺序扩展比并行扩展更有效。

Comments Published at NeurIPS 2025

详情

展开后加载摘要…

URL PDF HTML 收藏
2601.05573 2026-01-12 cs.CV

Orient Anything V2: Unifying Orientation and Rotation Understanding

Orient Anything V2:统一物体3D方向和旋转理解

Zehan Wang, Ziang Zhang, Jiayang Xu, Jialei Wang, Tianyu Pang, Chao Du, HengShuang Zhao, Zhou Zhao

机构 * Zhejiang University(浙江大学) Shanghai AI Lab(上海人工智能实验室) Sea AI Lab(海思人工智能实验室) The University of Hong Kong(香港大学)

AI总结 Orient Anything V2通过四个创新提升,实现了对物体3D方向和旋转的统一理解,显著提升了零样本性能和泛化能力。

Comments NeurIPS 2025 Spotlight, Repo: https://github.com/SpatialVision/Orient-Anything-V2

详情

展开后加载摘要…

URL PDF HTML 收藏
2508.08012 2026-01-12 physics.comp-ph astro-ph.IM

Adaptive Online Emulation for Accelerating Complex Physical Simulations

自适应在线模拟用于加速复杂物理模拟

Tara P. A. Tahseen, Nikolaos Nikolaou, Luís F. Simões, Kai Hou Yip, João M. Mendonça, Ingo P. Waldmann

AI总结 本文提出自适应在线模拟方法AOE,通过动态学习神经网络替代模型,显著加速复杂物理模拟,实现在高保真度模拟中的高效计算。

Comments Accepted to NeurIPS 2025 workshop on Machine Learning and the Physical Sciences

详情

展开后加载摘要…

URL PDF HTML 收藏
2505.16716 2026-01-12 cs.CC cs.DM cs.LG cs.NE math.CO

The Computational Complexity of Counting Linear Regions in ReLU Neural Networks

ReLU神经网络中计算线性区域的计算复杂性

Moritz Stargalla, Christoph Hertrich, Daniel Reichman

机构 * University of Technology Nuremberg(图恩堡技术大学) Worcester Polytechnic Institute(沃思菲技术学院)

AI总结 本文研究了ReLU神经网络中线性区域计数的计算复杂性,证明了该问题在不同隐藏层结构下的NP-和#P难性,并展示了某些定义下的多项式空间算法。

Comments 26 pages, 6 figures, paper accepted at NeurIPS 2025. v3: Update to Fig. 1

详情

展开后加载摘要…

URL PDF HTML 收藏