arXiv:2606. 03199v1 Announce Type: new Abstract: Organic crystal structure prediction (CSP) is a requirement for computational modelling of organic solids, but traditionally costs several CPU-years per molecule.
By Alston Lo, Luka Mucko, Austin H. Cheng, Andy Cai, Alastair J. A. Price, Wojciech Matusik, Al\'an Aspuru-Guzik
arXiv:2608. 13057v1 Announce Type: cross Abstract: In expert-parallel (EP) MoE serving, every layer synchronizes at the slowest GPU.
By Jie Li, Chenxin Jia, Jinliang Shen, Cunzhuang Liu, Ruiyi Ding, Jianwen Xian, Kang He, Chengru Song
ASPIRE (Atomistic Saddle-Point Inference with Refinement for Events) is a new framework that predicts multiple saddle-point candidates from a single atomic environment and refines them using Dimer searches on the original interatomic potential. Its equivariant set predictor, Ev-Quiformer, generates proposals via geometry-conditioned scalar‑vector event slots and decodes them into full atomic displacement fields. The authors provide two new datasets—BCCFE4VACAV‑4000 and BCCFE‑1TO4VAC—and demonstrate that ASPIRE achieves 77.20 % reference‑event coverage, outperforming a conventional Dimer baseline while halving the number of force evaluations and reducing wall‑time per configuration from 478.8 s to 176.3 s.
By Yucheng Zhao, Quanyou Zhang, Shaoxiang Qin, Haixuan Xu, Xiongye Xiao
arXiv:2610.02395v1 Announce Type: new
Abstract: Streaming GPU solvers for entropic optimal transport (EOT), such as FlashSinkhorn, avoid storing the dense kernel but still evaluate all $n\times m$ po...
By Felix X. -F. Ye, Yu Chin Fabian Lim, Naigang Wang, Davis Wertheimer
arXiv:2604.09107v2 Announce Type: replace-cross
Abstract: Modern LLM reinforcement learning (RL) workloads require a high-performance weight transfer system to scale training across heterogeneous com...
By Chenhao Ye, Huaizheng Zhang, Mingcong Han, Baoquan Zhong, Xiang Li, Qixiang Chen, Xinyi Zhang, Weidong Zhang, Kaihua Jiang, Wang Zhang, He Sun, Wencong Xiao, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau
The paper examines the commonly used structure‑disjoint split for evaluating molecular machine learning models, which relies on single‑linkage clustering with the Maximum Common Edge Subgraph (MCES) distance at a threshold of 10. The authors show that this criterion, originally calibrated on 29,000 molecules, has never been tested on the current public libraries of 227,690 molecules due to its NP‑hard complexity. They propose an optimized algorithm that reduces the number of required integer programs from $2.6 imes10^{10}$ to $1.15 imes10^{7}$, enabling lossless partitioning at scale, and reveal that the resulting graph percolates—over 95 % of the library lies in a single component, making held‑out compounds systematically larger and more complex than training ones.
"whyItMatters":"The study highlights that large‑library benchmarks using the traditional split conflate structural novelty with extrapolation to larger, more complex chemistry, potentially misleading assessments of model generalization."
By Tomo Oga, Devesh Shah, Cailum M. K. Stienstra, Gabriel Asher, Antonio H. de O. Fonseca, Niall O'Connor, Michael Widrich