AX·NEWS
Sign in

Research Papers

Research Papers news — Monday 02 November 2026

17 stories from 2 sources, every one in English. Each links to its publisher.

Open in the live feedRSS feedOn a TV

  1. How Much Reconstruction Does Quantum Machine Learning Need? Late Fusion of Uncoupled Quantum Subcircuits
    USarXiv cs.DC (Distributed)

    arXiv:2608.05595v2 Announce Type: replace-cross Abstract: Circuit cutting lets a large quantum neural network (QNN) run as independent subcircuits on small devices, but rebuilding its outputs by quasiprobability reconstruction carries a…

  2. Resource Locks and Fast Unlock for Shared Balances in Certificate-Based Payment Systems
    USarXiv cs.DC (Distributed)

    arXiv:2610.41207v1 Announce Type: new Abstract: Certificate-based payment systems such as FastPay settle a payment with one round of signatures from a quorum of validators and avoid global ordering. The client collects the signatures, and…

  3. LLM Fine-Tuning Workloads: Characterization, Challenges, and Opportunities for Serverless AI
    USarXiv cs.DC (Distributed)

    arXiv:2610.40983v1 Announce Type: new Abstract: Serverless execution of Large Language Models (LLMs) is becoming important, reflecting their wide societal use. An increasingly present stage in LLM pipelines is fine-tuning, which…

  4. TileMaxSim: Roofline Regimes and Compression Limits for Fused GPU MaxSim Scoring
    USarXiv cs.DC (Distributed)

    arXiv:2606.26439v2 Announce Type: replace-cross Abstract: MaxSim scoring dominates the cost of multi-vector retrieval. Several groups built fused GPU kernels for it independently during 2026, and all report one measure of success: the…

  5. ZenKO: Guided and Iterative Quantum-Classical Method for Molecular Electronic Structure using Sample-Based Quantum Diagonalization
    USarXiv cs.DC (Distributed)

    arXiv:2610.41146v1 Announce Type: cross Abstract: The electronic structure of molecules is foundational for scientific advancement, however determining it remains challenging due to the growth of the molecular Hilbert space with system…

  6. A Deterministic Commitment Rule over Unstructured DAGs for Optimistic Replication
    USarXiv cs.DC (Distributed)

    arXiv:2610.41837v1 Announce Type: new Abstract: In optimistic replication protocols, each replica uses the local state to execute requests from its clients in a wait-free manner, without synchronizing with other replicas. The outcomes may…

  7. HiState: Hierarchical Prefix Cache Management for Hybrid LLM Serving in Agentic Workloads
    USarXiv cs.DC (Distributed)

    arXiv:2610.41508v1 Announce Type: new Abstract: Hybrid large language models combine full-attention and recurrent linear layers to reduce inference costs. Prefix caching can further reduce redundant computation across requests, but a…

  8. RecIS: Unifying Sparse and Dense Computation for Efficient Recommendation Training
    USarXiv cs.DC (Distributed)

    arXiv:2610.41457v1 Announce Type: new Abstract: Modern recommender models scale sparse representations and dense computation together. They process thousands of heterogeneous feature fields, long user-behavior sequences, and trillion-scale…

  9. Migrating a Legacy Scientific Application with an AI Coding Agent: NICAM from Fortran to Kokkos
    USarXiv cs.DC (Distributed)

    arXiv:2610.41313v1 Announce Type: new Abstract: Migrating from Fortran to C++/Kokkos broadens access to hardware accelerators through backends such as CUDA and HIP while offering greater flexibility in software design. However, legacy…

  10. GPUSparse: Fast and Exact Learned Sparse Retrieval on a GPU-Resident Inverted Index
    USarXiv cs.DC (Distributed)

    arXiv:2606.26441v2 Announce Type: replace-cross Abstract: Learned sparse models such as SPLADE match the quality of dense bi-encoders and keep the exact-match behavior of lexical retrieval. They are served on CPUs, using inverted-index…

  11. Decentralized Dynamic Stable Matching
    USarXiv cs.DC (Distributed)

    arXiv:2610.41912v1 Announce Type: new Abstract: We study decentralized computation of the player-optimal stable matching (POSM) with unannounced player arrivals and departures. Without a common clock, event information, or direct…

  12. Layered Reproducibility for High-Performance Computing Applications: The Feel++ and Ktirio Urban Buildings Case Study
    USarXiv cs.DC (Distributed)

    arXiv:2610.41861v1 Announce Type: new Abstract: The High-Performance Computing (HPC) community struggles with reproducibility due to complex software stacks, heterogeneous hardware, and expensive validation cycles. This contribution…

  13. Where KV-Cache Error Lives in Looped Language Models: A Diagnostic Study of Ouro and Huginn
    USarXiv cs.DC (Distributed)

    arXiv:2610.41825v1 Announce Type: new Abstract: A looped language model applies one block of layers 4 times per token and keeps a key/value (KV) plane for each loop. We study where storage error changes the next-token distribution and how…

  14. MemX: Memory-Aware Automatic Parallelism for Cross-Vendor Heterogeneous GPU Training
    USarXiv cs.DC (Distributed)

    arXiv:2610.41525v1 Announce Type: new Abstract: Cross-vendor heterogeneous GPU clusters are increasingly used for large-scale model training. However, their GPUs differ substantially in compute power, memory capacity, and interconnect…

  15. Falcons: Pushing the Speed-Ratio Limits of Lossy Compression for Parallel Scientific Applications
    USarXiv cs.DC (Distributed)

    arXiv:2610.41209v1 Announce Type: new Abstract: The extreme volume of scientific data has become a critical challenge for modern exa-scale scientific computing applications, and error-bounded lossy compression remains indispensable for…

  16. Meet Neuropixels: how probes that track hundreds of brain cells at once are revolutionizing neuroscience
    GBNature Technology
  17. Techno-economic and environmental assessment of next-generation battery-powered farming robots
    GBNature Technology