AI & ML
Ab Initio Accuracy Beyond the Cutoff: Distributed Message-Passing Equivariant Attention at Tens-of-Millions-of-Atom Scale
arXiv cs.DC0 views
arXiv:2611.06122v1 Announce Type: new Abstract: Molecular dynamics predicts molecular motion from atomic forces and trajectory integration. Density functional theory (DFT) provides first-principles forces, but its $O(N^3)$ cost limits simulations to thousands of atoms; empirical force fields scale to millions but miss bond breaking and charge transfer. Equivariant message-passing Transformers learn the ab initio potential at linear cost. Stacked layers propagate information beyond a single cutoff, giving four layers a receptive field up to 23{\AA}. At this frontier, scale is limited by communication: layers exchange boundary features across devices, force backpropagation repeats the exchange, and moving atoms change neighbor graphs and tensor shapes. We present Tessera, a distributed runtime that fixes workload shapes between rebuilds. It sorts atoms along a space-filling curve into equal-count shards, ensuring identical atom counts and tensor shapes per rank. Peer sets scale as $K^{0.5}$, not $K$. A conservative neighbor skin preserves topology across updates, enabling each rebuild interval to replay as one CUDA Graph. Fused kernels, three-level neighbor search, and overlapped All-to-All complete it. On 512 GPUs, Tessera sustains 30.7M atoms at 89.7% weak-scaling efficiency (77--90% across three per-GPU loads); per-step time rises 1.11--1.29x as machine and problem grow 16x. Graph reuse cuts full-step time $1.87\times$. Across an $8\times$ device increase, neighbor-search cost grows $1.7\times$, versus $3.0\times$ for Morton order. In a live $10.24$M-atom salt solution, NVE energy drift is $0.42\,\mu$eV/atom/ps over $10$ ps, and structure matches a serial reference. A 10.06M-atom Norovirus capsid sustains 100 ps of NVT at $\approx 8$ ps/day on 256 A100 GPUs. Over 200,000 steps, it has no broken bonds or anomalously close pairs and uses three compiled variants, with no graph breaks or eager fallbacks.
Source:https://arxiv.org/abs/2611.06122PreviousvExpert: Virtualizing Expert Storage for Adaptive Load Balancing in Distributed MoE InferenceNextCARE-FL: Federated Fine-Tuning of Multimodal LLMs in Resource-Constrained Edge Networks
Related posts

GPT-Image-2.6 Outputs SVG and GIFs. Unlike 2.5, You Can't Run It Through Batch
0dev.to

Designing a Form That Asks for Birth Date, Time and Place (No Code, Just the Tricky Parts)
0dev.to UX
메타 Quest 2 OS 업데이트 종료, 약시 훈련 루틴에는 무슨 일이 생기나
0dev.to News
How to Put a Logo in a QR Code (and Make Sure It Still Scans)
0dev.to Design
Why Luxury Fine Jewelry Brands Are Ditching Physical Video Shoots for 3D CAD Commercials in 2026
0dev.to Design

How AI Is Changing Healthcare in 2026 - And Why Developers Should Pay Attention
0dev.to Productivity