AX·NEWS
Sign in

Research Papers

Research Papers news — Wednesday 21 October 2026

24 stories from 1 source, every one in English. Each links to its publisher.

Open in the live feedRSS feedOn a TV

  1. Online Continual Learning on Intel Loihi 2 via a Co-designed Spiking Neural Network
    USarXiv cs.DC (Distributed)

    arXiv:2511.01553v3 Announce Type: replace-cross Abstract: Edge AI must adapt to new classes and shifting data within a tight power budget, but online continual learning (learning from each sample before the next arrives) is where…

  2. Budgeted Admission from Timestamped Capacity Records in Shared Clusters
    USarXiv cs.DC (Distributed)

    arXiv:2610.28392v1 Announce Type: new Abstract: A cluster admission gate can receive a capacity record that no longer matches current schedulability. We study one exogenous binary schedulability unit under a bound on the joint probability…

  3. Weight Placement Is Not Enough: Synchronization in Multi-Node CPU Decoding of Ternary LLMs
    USarXiv cs.DC (Distributed)

    arXiv:2610.28620v1 Announce Type: new Abstract: Ternary LLMs read only a few gigabytes per decoded token, yet on dual-socket servers with four NUMA nodes the fastest ternary runtime we found uses less than half of the memory bandwidth…

  4. Execution-Time Validation of Context-Carrying Action Intents in Industrial Cyber-Physical Systems
    USarXiv cs.DC (Distributed)

    arXiv:2610.27971v1 Announce Type: cross Abstract: In industrial cells, commands from learned policies, operators and schedulers reach the controller after inference, confirmation and transport, and the plant may have changed meanwhile, for…

  5. Benchmarking CPU, GPU, and ML Power-Flow Solvers from 14 to 70,000 Buses
    USarXiv cs.DC (Distributed)

    arXiv:2610.27930v1 Announce Type: new Abstract: Learned surrogates for power-flow (PF) computation are usually motivated by speed, compared against a single CPU-based baseline. We show this comparison is fragile: across 7 open-source…

  6. The Token-Energy Law of LLM Decode: Active Bytes and Realized Time Account for Joules per Token
    USarXiv cs.DC (Distributed)

    arXiv:2610.28576v1 Announce Type: cross Abstract: Energy-efficient deployment of large language models requires understanding how model architecture, hardware, and serving settings shape energy per generated token. We introduce the…

  7. Specter: Fast MoE Inference via Quantization-Enabled Multi-Step Speculative Offloading
    USarXiv cs.DC (Distributed)

    arXiv:2511.14102v2 Announce Type: replace-cross Abstract: Mixture-of-experts (MoE) models often exceed a single accelerator's memory capacity. Offloading experts to host memory creates a severe PCIe I/O bottleneck because data-dependent…

  8. Learning-Theoretic Foundation for General Coded Computing: The Adversarial Setting
    USarXiv cs.DC (Distributed)

    arXiv:2610.27440v1 Announce Type: cross Abstract: Adversarial workers pose a severe challenge in distributed computing systems by returning corrupted outputs that can substantially distort the recovered computations. Coded computing…

  9. Fault Tolerance for Stream Processing Engines
    USarXiv cs.DC (Distributed)

    arXiv:1605.00928v4 Announce Type: replace Abstract: Distributed Stream Processing Engines (DSPEs) target applications related to continuous computation, online machine learning and real-time query processing. DSPEs operate on high volume…

  10. From Last-Layer to Cross-Layer: One-Shot Joint Classifier Reconstruction for Federated Learning
    USarXiv cs.DC (Distributed)

    arXiv:2610.26953v1 Announce Type: new Abstract: Federated learning (FL) enables collaborative model training while preserving data privacy. However, non-independent and identically distributed (non-IID) data inevitably introduces…

  11. Emulating DGEMM and ZGEMM with INT8 Matrix Engines on Intel Arc GPUs: Ozaki Scheme II on the Xe2 Architecture
    USarXiv cs.DC (Distributed)

    arXiv:2610.26945v1 Announce Type: cross Abstract: Double-precision matrix multiplication, real (DGEMM) and complex (ZGEMM), dominates the run time of dense linear algebra and electronic-structure codes. On affordable GPUs, however, FP64…

  12. BitMTP: When Multi-Token Prediction Meets Low-Bit Large Language Models
    USarXiv cs.DC (Distributed)

    arXiv:2610.28500v1 Announce Type: cross Abstract: For efficient deployment of large language models (LLMs), methods of ultra-low-bit backbones reduce weight storage, memory traffic, and linear-layer execution cost, while multi-token…

  13. A mechanism for collective foraging: percolating recruitment cascades coupled to a maximum-entropy
    USarXiv cs.DC (Distributed)

    arXiv:2610.24865v2 Announce Type: replace-cross Abstract: Foraging recruitment is a contagion: an agent that finds a resource triggers a linear-threshold cascade, the model built for rumour and adoption spread on social networks, now…

  14. Discount Yourself: Self-inclusive Freshness-weighted Gossip for Decentralised Learning under Client Outages
    USarXiv cs.DC (Distributed)

    arXiv:2610.28545v1 Announce Type: cross Abstract: Decentralised federated learning (DFL) trains personalised models on devices that average with their neighbours rather than with a central server. Real devices, however, are often offline…

  15. Evaluating Runtime Prediction and Conservative Walltime Policies in HPC Systems
    USarXiv cs.DC (Distributed)

    arXiv:2610.27755v1 Announce Type: new Abstract: Efficient use of large-scale supercomputing systems depends on accurate runtime estimation and walltime selection. To avoid premature termination, users often overestimate walltime, leading…

  16. Magneton: Optimizing Energy Efficiency of ML Systems via Differential Energy Debugging
    USarXiv cs.DC (Distributed)

    arXiv:2512.08365v2 Announce Type: replace Abstract: The training and deployment of machine learning (ML) models have become extremely energy-intensive. While existing optimization efforts focus primarily on hardware energy efficiency, a…

  17. KPage: Cross-Block Page Compaction for Hardware-Efficient Sparse Attention
    USarXiv cs.DC (Distributed)

    arXiv:2610.28096v1 Announce Type: new Abstract: Sparse attention reduces the computational cost of long-sequence video Transformers, but three-dimensional token layouts often leave selected blocks partially occupied, wasting physical tile…

  18. VS-Flash: Harnessing Vector Search with Computational Memory-Semantic Flash
    USarXiv cs.DC (Distributed)

    arXiv:2610.26960v1 Announce Type: cross Abstract: As generative AI continues to evolve, retrieval-augmented generation (RAG) systems are driving rapid growth in vector database capacity requirements. As datasets outgrow host DRAM, vector…

  19. 3D-MoE: Complementarity-Guided Hardware-Software Co-Design for MoE Decode on 3D-Stacked NMP
    USarXiv cs.DC (Distributed)

    arXiv:2610.26991v1 Announce Type: cross Abstract: Mixture-of-Experts (MoE) have become a mainstream way to scale Large Language Models (LLMs), because each token activates only a small subset of experts, reducing inference cost. However…

  20. NVIDIA Spectrum-X: Hardware-Accelerated Multiplane Networking for Large-Scale AI Training
    USarXiv cs.DC (Distributed)

    arXiv:2605.21187v2 Announce Type: replace-cross Abstract: As distributed model training scales to span hundreds of thousands of GPUs, scale-out networks face unprecedented performance and efficiency demands. NVIDIA Spectrum-X Ethernet has…

  21. SweepANN: A GPU-Accelerated Large-K Approximate Vector Search for Drug Discovery
    USarXiv cs.DC (Distributed)

    arXiv:2610.27306v1 Announce Type: cross Abstract: DrugCLIP places small molecules and protein pockets in one space, turning genome-wide drug discovery into large-K retrieval by vector proximity. A campaign fixes over 20K pockets in advance…

  22. Constrained Federated Reinforcement Learning for Secure Offloading in Vehicular Edge Computing
    USarXiv cs.DC (Distributed)

    arXiv:2610.27651v1 Announce Type: new Abstract: Vehicular Edge Computing (VEC) reduces latency for computation-intensive vehicular applications by offloading tasks to roadside edge servers. Real vehicular workloads, however, consist of…

  23. Unsupervised Head Network Personalization for Split Computing via Federated Learning
    USarXiv cs.DC (Distributed)

    arXiv:2610.27952v1 Announce Type: cross Abstract: Split Computing (SC) is a distributed inference method designed for balancing computational load and reducing latency by partitioning a neural network into head and tail networks and…

  24. PULSE: Personalized Opportunistic Learning for Wearable Devices
    USarXiv cs.DC (Distributed)

    arXiv:2610.28081v1 Announce Type: cross Abstract: Wearable devices increasingly support personalized health and well-being applications, but post-deployment data can differ substantially from those used for training, while purely local…