paper-with-me

홈 › Papers

Generalized Orders of Magnitude for Scalable, Parallel, High-Dynamic-Range Computation

2025-10-03 · Franz A. Heinsen, Leo Kozachkov arxiv

Many domains, from deep learning to finance, require compounding real numbers over long sequences, often leading to catastrophic numerical underflow or overflow. We introduce generalized orders of magnitude (GOOMs), a principled extension of traditional orders of magnitude that incorporates floating-point numbers as a special case, and which in practice enables stable computation over significantly larger dynamic ranges of real numbers than previously possible. We implement GOOMs, along with an efficient custom parallel prefix scan, to support native execution on parallel hardware such as GPUs. We demonstrate that our implementation of GOOMs outperforms traditional approaches with three representative experiments, all of which were previously considered impractical or impossible, and now become possible and practical: (1) compounding real matrix products far beyond standard floating-point limits; (2) estimating spectra of Lyapunov exponents in parallel, orders of magnitude faster than with previous methods, applying a novel selective-resetting method to prevent state colinearity; and (3) capturing long-range dependencies in deep recurrent neural networks with non-diagonal recurrent states, computed in parallel via a prefix scan, without requiring any form of stabilization. Our results show that our implementation of GOOMs, combined with efficient parallel scanning, offers a scalable and numerically robust alternative to conventional floating-point numbers for high-dynamic-range applications.

📄 PDF Abstract BibTeX arXiv:2510.03426

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Scalable Community Detection via Parallel Correlation Clustering

2021-07-27 · Jessica Shi, Laxman Dhulipala, David Eisenstat, Jakub Łącki 외

Graph clustering and community detection are central problems in modern data mining. The increasing need for analyzing billion-scale data calls for faster and more scalable algorithms for these problems. There are certai…

ClusteringCommunity DetectionGraph Clustering

Accurate, Efficient and Scalable Training of Graph Neural Networks

2020-10-05 · Hanqing Zeng, Hongkuan Zhou, Ajitesh Srivastava, Rajgopal Kannan 외

Graph Neural Networks (GNNs) are powerful deep learning models to generate node embeddings on graphs. When applying deep GNNs on large graphs, it is still challenging to perform training in an efficient and scalable way.…

Graph Sampling

Parallelizing Counterfactual Regret Minimization

2026-05-14 · Juho Kim, Tuomas Sandholm arxiv

Parallelization has played an instrumental role in the field of artificial intelligence (AI), drastically reducing the time taken to train and evaluate large AI models. In contrast to its impact in the broader field of A…

Taurus: A Data Plane Architecture for Per-Packet ML

2020-02-12 · Tushar Swamy, Alexander Rucker, Muhammad Shahbaz, Ishan Gaur 외

Emerging applications -- cloud computing, the internet of things, and augmented/virtual reality -- demand responsive, secure, and scalable datacenter networks. These networks currently implement simple, per-packet, data-…

Anomaly DetectionBIG-bench Machine LearningCloud ComputingDecision Making

Scalable High-Fidelity Macromolecular Docking for GPU-Accelerated Supercomputers

2026-08-07 · Xiangyu Meng, Peng Chen, Mingzhen Li, Jianmin Wang 외 arxiv

Flexible macromolecular docking offers high-fidelity predictions of biomolecular interactions, but remains prohibitively expensive at scale. Among existing approaches, LightDock leverages Glowworm Swarm Optimization (GSO…