ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “datacenter networks, ZCube topology, Braess's paradox, large model training, inference”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.NIEmpiricalRecentJul 24, 2026

Fewer Paths, Better Performance: Understanding the ZCube Topology through Braess's Paradox

Li Chen

The ZCube topology, which eliminates path multiplicity and reduces switching hardware, delivers better performance for large model training and inference than traditional multipath datacenter networks…

View →
cs.LGcs.AIcs.CRRecentApr 21, 2026

When Graph Structure Becomes a Liability: A Critical Re-Evaluation of Graph Neural Networks for Bitcoin Fraud Detection under Temporal Distribution Shift

Saket Maganti

This paper critically re-evaluates the use of Graph Neural Networks (GNNs) for Bitcoin fraud detection, demonstrating that under strict, leakage-free temporal evaluation, simple feature-only models si…

View →
cs.DCcs.LGEmpiricalRecentJul 19, 2026

Taurus: Accelerating Out-of-Core Graph Neural Network Inference on Billion-Scale Graphs

Pranjal Naman, Yogesh Simmhan

Taurus is a single-machine system for efficient Graph Neural Network (GNN) inference on large-scale graphs that do not fit in RAM, using source-centric broadcasts and a pipelined GPU-CPU-SSD hierarchy…

View →
cs.DSTheoreticalRecentJun 15, 2026

Approximation Preserving Coresets

Milind Prabhu, Chris Schwiegelshohn, Sudarshan Shyam

This paper introduces approximation-preserving coresets, which provide weaker guarantees than strong coresets but stronger guarantees than weak coresets for preserving the costs of good solutions in b…

View →
cs.DCcs.ITcs.NITheoreticalRecentJun 19, 2026

Re-Rooting-Assisted Edge-Minimum Runtime Repair for Node and Link Failures in Dense Gaussian Broadcast Networks

Bader Albader

This paper develops a runtime recovery framework for broadcasting in dense Gaussian networks under static and dynamic faults, proving necessary and sufficient repair edges and providing efficient repa…

View →
cs.DCcs.AIEmpiricalRecentJul 15, 2026

The Cost and Network Limits of Space-Based AI Compute

Kees van Berkel

This paper evaluates the feasibility and cost-effectiveness of large-scale AI data centers in low-Earth orbit (LEO) versus terrestrial facilities, considering factors like launch cost, power generatio…

View →
cs.CCcs.DMcs.DSRecentJun 1, 2026

$O(n +f(k))$: Truly Linear FPT

Benjamin Merlin Bumpus, Rod Downey, Tala Eagling-Vose, Jessica Enright +6 more

The paper introduces and explores Truly Linear FPT (TLFPT), a complexity class defined by $O(n) + f(k)$, demonstrating that it is a strict subset of standard Linear FPT and providing new algorithms fo…

View →
cs.DCcs.AIcs.LGEmpiricalRecentJun 26, 2026

Optimizing Teacher-Student Partitioning for Scalable Knowledge Distillation on HPC Systems

Adrian P. Dieguez, Victor Conchello Vendrell, Alex Batlle, Vinnam Kim +2 more

This paper proposes an HPC-aware methodology for Knowledge Distillation (KD) that decouples teacher and student partitioning efficiently, achieving up to 67% higher samples-per-second than the widely…

View →
cs.NIcs.AIcs.DCEmpiricalRecentJun 29, 2026

Budget-Adaptive Routing: Skipping the Weak When the Strong Answers Anyway

Wei Geng, Nitinder Mohan, Jörg Ott

This paper proposes a budget-adaptive routing method for edge-cloud inference collaborations, which selects between weak-skipping and weak-conditioned placement based on offload budget.

View →
cs.LGcs.CRcs.DCRecentApr 21, 2026

Federated Learning over Blockchain-Enabled Cloud Infrastructure

Saloni Garg, Amit Sagtani, Kamal Kant Hiran

This paper proposes and evaluates the integration of Federated Learning and blockchain technology over cloud-edge infrastructure to enhance data privacy and security for decentralized AI applications.

View →
cs.LGcs.PLEmpiricalRecentJul 1, 2026

Fixed-Set Robustness in Programming by Example: Example Corruption and Semantic Partition Recovery

Yuan Si, Jialu Zhang

This paper studies adversarial attacks on programming-by-example systems and introduces a defense method called version-space partition aggregation (VPA).

View →
cs.LGcs.AIRecentMay 30, 2026

Extending Causal Metamodeling to a non-Markovian Queue

Pracheta Amaranath, Anant Bhide, David Jensen, Peter Haas

The paper extends modular dynamic Bayesian networks (MDBNs) to model non-Markovian queues, providing the first causal metamodeling technique for such systems with significant speedup.

View →
cs.SEcs.CLSurveyRecentJun 18, 2026

Token-Operations-Oriented Inference Optimization Techniques for Large Models

Shiguo Lian, Kai Wang, Zhaoxiang Liu, Wen Liu +21 more

This paper proposes a four-layer technical architecture for large model inference optimization, including Multi-model Fusion, Model Optimization, Compute-Model Fusion, and Compute-Network-Model Fusion…

View →
cs.LGcs.CLRecentJun 1, 2026

On the Scaling of PEFT: Towards Million Personal Models of Trillion Parameters

Mind Lab, :, Song Cao, Vic Cao +51 more

The paper reframes Parameter-Efficient Fine-Tuning (PEFT) from a mere cost-saving alternative to a robust architecture for creating persistent, personalized models that layer specific behaviors onto l…

View →
cs.PFcs.ARcs.DCRecentMay 27, 2026

Rotary GPU: Exploring Local Execution Paths for Large Mixture-of-Experts Models Under Limited GPU Memory

Myeong Jun Jo

The paper introduces Rotary GPU, an exploratory execution approach demonstrating that large Mixture-of-Experts models can be run locally on consumer GPUs with limited VRAM, achieving usable decode thr…

View →
quant-phcs.CRRecentApr 2, 2026

Topology-Hiding Path Validation for Large-Scale Quantum Key Distribution Networks

Stephan Krenn, Omid Mir, Thomas Lorünser, Sebastian Ramacher +1 more

The paper proposes a provably secure path validation protocol for large-scale Quantum Key Distribution (QKD) networks that allows receivers to verify network compliance without revealing sensitive top…

View →
math.PRstat.MLTheoreticalRecentJul 8, 2026

Local large deviations for linear-region growth in random piecewise-linear networks

Recep Özkan, Christian Hirsch

This paper studies a random compositional model for the growth of affine regions in deep piecewise-linear networks and proves the existence of a submultiplicative pressure for the number of affine pie…

View →