arXiv:2608. 14557v1 Announce Type: cross Abstract: Low Earth Orbit (LEO) computing is emerging for low-latency, globally distributed AI services, enabled by advances in satellite constellations and reusable launch systems.
By Nisha Sarwar, Lei Jiang, Fan Chen
arXiv:2607. 14172v1 Announce Type: cross Abstract: This paper evaluates whether large-scale AI data centers deployed in low-Earth orbit (LEO) could become a cost-effective alternative to terrestrial facilities.
By Kees van Berkel
arXiv:2608.24516v1 Announce Type: cross
Abstract: Satellite-based distributed learning promises to train machine-learning models directly in orbit using massive, globally dispersed sensor data, there...
By Hao Wu, Kin Whye Chew, Yizhan Han, Han Li, Jingxian Wang
arXiv:2605.19892v2 Announce Type: replace-cross
Abstract: Dramatic cost reductions driven by private sector innovations have led to a rapid increase in the number of satellites in orbit and a corresp...
By Jonas Weiss, Patricia Sagmeister, Gabriel Maiolini Capez, Dinesh Verma, Roberto Garello, Alberto Perotti, Dawid Lazaj, Alicja Musial, Jakub Nalepa, Thomas Morf, Martin Schmatz, Marek Krawczyk, Mateusz Przeliorz, Kevin Roche, Sagar Tayal, Mahalakshmi Lakshminarayanan, Nicolas Long\'ep\'e, Pierre-Philippe Mathieu, Agata Wijata
Satellite-based distributed learning promises to train machine-learning models directly in orbit using massive, globally dispersed sensor data, thereby avoiding large-scale data downloads to ground se...
ShardMeter is a lightweight analytical performance model that predicts end-to-end runtime for transformer-based workloads across sharded, distributed, and decentralized training setups. By taking a model’s characteristics and a target hardware topology as input, it estimates per-GPU and per-island throughput, training cost, total wall-clock time, and pinpoints performance bottlenecks. The model reveals diminishing-return regimes with increasing island size, quantifies compute- versus communication-bound scaling, evaluates hyperparameter trade-offs, and models cost-throughput for large-scale decentralized training, enabling rapid exploration of configuration space and near-optimal deployment plans.
By Tim Beringer (Technical University of Darmstadt), Patrick Diem (Technical University of Darmstadt), Felix Wolf (Technical University of Darmstadt), Arya Mazaheri (Technical University of Darmstadt, PanocularAI)
The paper introduces OrbitALIF, a federated learning framework that performs cloud removal on low‑earth‑orbit satellites. It uses a compact 2.30 M‑parameter spiking neural network with adaptive gated fusion and spectral‑spatial hybrid attention modules, enabling both training and inference onboard. The approach achieves competitive cloud‑removal quality while consuming only 0.287 mJ per inference on neuromorphic hardware, a 72.3‑fold energy reduction compared to an equivalent ANN.
By Bohan Zhang, Chenyu Xu, Yijie Mao, Yuanming Shi
arXiv:2607. 09084v1 Announce Type: new Abstract: The rapid expansion of large-scale AI models has led to significant performance breakthroughs across diverse domains, yet it has also raised critical concerns regarding computational costs, energy consumption, and environmental sustainability.
By Linhui Xiao, Guiping Cao, Mingyue Guo, Xianchao Guan, Fan Yang, Ming Tao, Xin Li, Yuxin Peng, Yaowei Wang
The paper introduces a heterogeneous federated learning approach using the FractalNet architecture tailored for satellite mega‑constellations. It formalizes contact‑window‑constrained, depth‑heterogeneous optimization and proposes a distributed path scheduler that assigns model depth based on satellite SWAP‑C constraints, predicted contacts, and training statistics. The framework includes periodic update pooling and a three‑tier agentic control plane, and is validated through a wildfire detection case study across LEO, MEO, and GEO/HEO shells, demonstrating improvements in convergence, communication efficiency, energy adaptation, and robustness.
By Sai Puppala, Koushik Sinha
The paper introduces TELGEN, a traffic engineering algorithm that uses graph neural networks to predict an optimal TE algorithm rather than a direct solution. TELGEN generalizes across diverse network topologies and traffic patterns, achieving less than a 3% optimality gap on networks up to 5,000 nodes and 3.6 million links, while reducing solving time by up to 84% and training time by up to 79.6% compared to existing methods.
By Fangtong Zhou, Xiaorui Liu, Ruozhou Yu, Guoliang Xue
The paper introduces the Universal Observatory Graph (UOG), an AI‑driven framework that models autonomous observatories at L2 Lagrange points as nodes in a weighted graph, with edges defined by interplanetary distance, latency, transmission power, and reliability. Using a six‑observatory Solar System configuration (Earth, Mars, Jupiter, Saturn, Uranus, Neptune), the authors evaluate instantaneous sky coverage with three methods, all showing complete network union coverage and modest overlap. They formulate communication routing as a finite‑horizon Markov decision process solved via tabular Q‑learning, identifying the Earth‑Saturn‑Uranus‑Neptune path as the highest‑return route among 41 feasible simple paths under a four‑hop constraint.
By Mohammed Abdel Razek
arXiv:2504. 16173v3 Announce Type: replace-cross Abstract: Space missions are becoming increasingly ambitious, necessitating high-performance onboard spacecraft computing systems.
By Pedro Antunes, Artur Podobas