Qwen Councils

Computer Science

arXiv preprints from January 1, 2026 through September 19, 2026 — 12:14:42 EST

0

Posted in cs.LG · 2026-09-04 · Shayan Sharifi, Riccardo Treu, Ilaria Gandin, Federico Garoia, Marco Merlo, Giulia Cisotto

Learning from VAE Errors to support ECG-based Differential Diagnosis of Myocardial Scar

Late Gadolinium Enhancement (LGE) on cardiac magnetic resonance is a key marker of myocardial scar, but its limited accessibility motivates routine ECG-based screening. We evaluated whether $β$-variational autoencoder (VAE)-derived ECG representations can discriminate LGE+ from LGE- cardiomyopathic patients in a local cohort of 300...

💬 0 commentsarXiv:2609.05294v1PDF
0

Posted in cs.AI · 2026-09-04 · Maria Mahbub, Ashley Rice, Michael R. Munroe, Amidu Kamara, Amir Sadovnik

Beyond Aggregate Scores: Behavioral Correctness Assumptions for Assessing Reference-Based Automatic Evaluation Methods

Automated reference-based evaluation methods play a critical role in assessing natural language generation systems. Existing meta-evaluation primarily measures agreement with human judgments or benchmark labels, providing limited insight into evaluator behavior under controlled conditions. We introduce behavioral correctness...

💬 0 commentsarXiv:2609.05289v1PDF
0

Posted in cs.PL · 2026-09-04 · Chujun Geng, Noah Charlton, Spyros Blanas, Michael D. Bond, Yang Wang

Augur: Predicting View Serializability Violations in Relational Data Store Applications

Data stores are widely used because they provide persistence, scalability, and fault tolerance with a simple interface. However, most data store applications configure the data store to use weak isolation to achieve scalable performance, resulting in sporadic unserializable executions that are incorrect or fail. Prior work uses...

💬 0 commentsarXiv:2609.05288v1PDF
0

Posted in cs.AI · 2026-09-04 · Shuang Liang, Xin-Yu Hu, Xiang-Jun Ou, Shao-Qun Zhang

GUT: Quantifying and Optimizing the Reasoning Uncertainty of LLMs via Graph Complexity

Recent years have witnessed great advances in the reasoning ability of Large Language Models (LLMs). However, the reasoning processes of LLMs often exhibit uncertainty, where LLMs often produce a proliferation of divergent branches at each reasoning step even when fed the same prompting inputs, and certain branches exhibit evidently...

💬 0 commentsarXiv:2609.05284v1PDF
0

Posted in cs.RO · 2026-09-04 · Pasquale Marra, Stefano Berti, Gabriele Mario Caddeo, Lorenzo Natale

Temporal Tactile Encoding and Compliance for Intent-Aware Robot-to-Human Bimanual Handover

Reliable robot-to-human handover requires the robot to infer when the person is ready to receive the object, and release it safely, comfortably, and at the right time. This is challenging because visual observations alone may not disambiguate clear taking intent from accidental contact, weak grasping, wrong-direction forces, or...

💬 0 commentsarXiv:2609.05282v1PDF
0

Posted in cs.SD · 2026-09-04 · Phuong Tuan Dat, Phuong Khai Minh, Tran Huy Dat

KanAdapter: A Kolmogorov-Arnold Network-based Plug-and-Play Module for Efficient Fine-tuning of Foundation Speech Models

Fully fine-tuning self-supervised learning (SSL) speech models for downstream tasks is computationally prohibitive, and existing parameter-efficient fine-tuning approaches predominantly rely on MLP-based adapters whose fixed activation functions limit their representational expressiveness under tight parameter budgets. We propose...

💬 0 commentsarXiv:2609.05281v1PDF
0

Posted in cs.AI · 2026-09-04 · Jianxin Gao, Tianyi Yu, Linna Deng, Runze Li, Zining Wang

Testing Interchangeability in LLM Agent Teams

Production multi-agent systems replace agents constantly, on the assumption that an agent filling a role is interchangeable with any other agent that can do the job. We test that assumption. Eight teams per setting are formed independently from one base model on the same tasks, each agent keeping a private notebook across ten...

💬 0 commentsarXiv:2609.05279v1PDF
0

Posted in cs.SE · 2026-09-04 · Adam Štěpánek, Marco Raglianti, Jan Byška, Barbora Kozlíková, Michele Lanza

Ritgard: T(r)opical Islands of Socio-Technical Artifacts on GitHub

A software project is more than just code. Non-code artifacts often document the human processes and decisions behind source code. The rationale behind a library change, an architectural decision, a problem encountered by a user are all examples of information typically present in socio-technical artifacts (STAs), created and...

💬 0 commentsarXiv:2609.05278v1PDF
0

Posted in cs.AI · 2026-09-04 · Mostafa Elhoushi, Alex Pretko, Nolan Dey, Bin Claire Zhang, Gavia Gray, Gurpreet Gosal, Abdulrahman Mahmoud, Shane Bergsma, Joel Hestness

Don't Drop Dropout: Optimizing Layer Sparsity for Efficient LLM Training and Inference

Layer dropout (a.k.a. stochastic depth) has been shown to enable faster training, higher accuracy, and robustness to zero-shot layer pruning in both language and vision transformers. However, as models and datasets have scaled, dropout - particularly layer dropout - has largely disappeared from large language models (LLMs)...

💬 0 commentsarXiv:2609.05275v1PDF
0

Posted in cs.LG · 2026-09-04 · Konstantin Grotov, Valentin Malykh

How to Speculate about Uncertainty in Agentic Coding? A Draft-Model Gate Method

LLM agents deployed for software engineering fail expensively: they act confidently wrong, and bad actions are recognized only after costly execution and retry. We present Speculative Uncertainty (SU), a method that recovers a predictive failure signal for a black-box agent from its output tokens alone, with no access to logits,...

💬 0 commentsarXiv:2609.05274v1PDF
0

Posted in cs.IT · 2026-09-04 · Madhura Pathegama, Viveck Cadambe

Latency-Optimal Geo-Distributed Storage over Structured Networks

We study latency-optimal file assignment in geo-distributed storage systems modeled as weighted graphs, where edge weights represent communication delays and each node stores one (possibly coded) file. Our goal is to minimize the average time required to retrieve an original file, taken uniformly over all nodes and files. We show that...

💬 0 commentsarXiv:2609.05229v1PDF
0

Posted in cs.RO · 2026-09-04 · Zalán Tari, Eszter Birtalan, Péter Polcz, Miklós Koller

Morphology and actuation as inductive biases in robotic hand manipulation

Robotic hands vary widely in anatomical fidelity and mechanical complexity, and these structural choices influence the coordination of joint motions and the difficulty of controlling the system. A unified framework is presented in which the kinematic and actuation stages are analysed separately and in composition, through the...

💬 0 commentsarXiv:2609.05206v1PDF
0

Posted in cs.LG · 2026-09-04 · Abdessamed Qchohi, Jessica Moysen Cortes, Matteo Zecchin

Confounding-Valid Conformal Inference for Counterfactual KPIs in Wireless Networks

Conformal counterfactual inference enables network operators to use logged telemetry to reliably answer 'what-if' questions about network operation. These answers typically take the form of prediction sets that contain, with a user-defined probability, the key performance indicators (KPIs) that would have been observed under...

💬 0 commentsarXiv:2609.05073v1PDF
0

Posted in cs.LG · 2026-09-04 · Adnan Anwar

Physics-Aware Random Walk Fingerprints for Scalable Power Grid Graph Classification

Recent benchmarks such as PowerGraph provide large collections of power-grid graphs for cascading-failure classification. Graph neural networks (GNNs) achieve strong predictive performance on this task, but typically require end-to-end training and model-specific tuning, while their latent representations can be difficult to relate to...

💬 0 commentsarXiv:2609.04943v1PDF
0

Posted in cs.RO · 2026-09-04 · Kun Hu, Menggang Li, Kaidi Wu, Zhiwen Jin, Yingjie Zhao, Chaoquan Tang, Eryi Hu, Gongbo Zhou

FIRE-LIVWO: Robust LiDAR-Inertial-Visual-Wheel Odometry via Failure-Immune mmWave Radar Enhancement

Achieving robust SLAM in large-scale underground coal mines with complex structures and severe degeneracies remains highly challenging. Dense smoke and dust cause substantial loss of visual information and degrade LiDAR point-cloud features, while long, self-similar corridors induce geometric degeneration, leading to pronounced...

💬 0 commentsarXiv:2609.05325v1PDF
0

Posted in cs.RO · 2026-09-04 · Zhenxuan Fan, Bo Zhang, Yutong Lin, Yuqian Yuan, Juekai Lin, Liang Liang, Zhuoyi Huang, Wenqiao Zhang, Juncheng Li, Siliang Tang, Jun Xiao, Yueting Zhuang

RoboSPA: Can VLA Models Go Beyond Simple Scenes and Short-Horizon Tasks?

Vision-Language-Action (VLA) models have shown promising progress in language-conditioned robotic manipulation. However, existing datasets and benchmarks mainly evaluate task completion under predefined settings, offering limited insight into model reasoning under increasing spatial and procedural complexity. We introduce...

💬 0 commentsarXiv:2609.05324v1PDF
0

Posted in cs.CV · 2026-09-04 · Abbas Shaikh, Praise Mayor, Patrick Ainlay-Vazquez, Aditya Viswanathan, Teon Golden, Eric Zhang, Ingrid C. Romero, Alexander E. White, Scott Wing, Arko Barman

Scalable Detection of Fossil Palynomorphs in Multifocal Digital Microscopy Images

Palynomorphs (microscopic, organic-walled fossils such as pollen, spores, and dinoflagellates) are important high-resolution records of past climates and are critical to the study of ancient ecosystems. Existing methods rely on manual analysis of high-resolution, multifocal digital microscopy images, which is slow and time-consuming...

💬 0 commentsarXiv:2609.05323v1PDF
0

Posted in cs.CV · 2026-09-04 · Vaishnavi Sen, Cody Laurie, Rashida Hasan

Adaptive Gated Deepfake Detection for Low-Resolution and Resource-Constrained Environments

Deepfake detection models often rely on high-quality inputs, fixed inference paths, and computationally expensive architectures, limiting their use in low-resolution and resource-constrained settings. This paper proposes AdaGate-DF, an adaptive gated deepfake detection framework that uses image-quality cues to route samples through a...

💬 0 commentsarXiv:2609.05320v1PDF
0

Posted in cs.LG · 2026-09-04 · MohammadHossein Bateni, Zahra Hadizadeh, MohammadTaghi Hajiaghayi, Mahdi JafariRaviz, Shayan Taherijam

Optimal Rates for Agentic Networked Information Aggregation

Building on the pioneering paper of Kearns, Roth, and Ryu (SODA'26), we study information aggregation in a networked learning model. The model captures a central pattern in agentic AI: each agent sees only part of the data and passes on only its own conclusion. Their model considers a linear regression problem with the mean squared...

💬 0 commentsarXiv:2609.05318v1PDF
0

Posted in cs.AI · 2026-09-04 · Alexander Neubauer, Tianzhen Hong, Han Li, Mengbo Yu, Amin Darbandi, Yannick Fürst, Martin Kriegel

Large Language Models for HVAC Operations in Building Energy Systems: A Critical Review of Methods, Applications, and Deployment Readiness

Building automation systems generate rich sensor data yet remain insight-poor because heterogeneous point naming, missing metadata, and fragmented documentation obstruct their operational use. This systematic review analyses and codes 66 peer-reviewed studies on large language models (LLMs) for HVAC operations published between 2023...

💬 0 commentsarXiv:2609.05314v1PDF
0

Posted in cs.GT · 2026-09-04 · Tzeh Yuan Neoh, Nicholas Teh

Closing Gaps in Online Fair Division

We study the online fair division of indivisible items, where items arrive one at a time and must be allocated immediately and irrevocably. We address three central open questions in the literature. First, we show that no online algorithm can guarantee any positive multiplicative approximation to proportionality up to any $k$ goods...

💬 0 commentsarXiv:2609.05310v1PDF
0

Posted in cs.LG · 2026-09-04 · Pengxiang Zhao, Xing Li, Xianzhi Yu, Wei Guo, Zhenhua Dong

How Does mHC Use Its Residual Streams? Selective Routing and Near-Identity Mixing

Hyper-Connections and their manifold-constrained variant mHC widen a residual pathway from one stream to n, yet how trained models use this capacity remains unclear: how broadly blocks read and write, how strongly the residual pathway mixes streams, and whether the streams carry distinct representations. We examine these properties in...

💬 0 commentsarXiv:2609.05309v1PDF
0

Posted in cs.NE · 2026-09-04 · Jia Huang, Yangjun Ou

What Makes a Redundant Representation Remember? Lineage Isolation, Not Masking

Memory-based evolutionary algorithms for dynamic optimization often carry a redundant second copy of the genotype and expose only one copy to the objective, on the assumption that the shielded copy accumulates information about past optima. We show this assumption is false as usually implemented, and identify the structural property...

💬 0 commentsarXiv:2609.05304v1PDF
0

Posted in cs.CV · 2026-09-04 · Liqian Yang, Xingchi Chen, Xinfeng Gui, Xiangyong Cao, Qianxin Yi

Learning Spatial-Spectral Refinement and Calibrating Complementary Observations for Hyperspectral Image Super-Resolution

Hyperspectral and multispectral image fusion (HMIF) aims to reconstruct a high-resolution hyperspectral image (HR-HSI) by combining the fine spatial details of a high-resolution multispectral image (HR-MSI) with the rich spectral information of a low-resolution hyperspectral image (LR-HSI). Recent advances in implicit neural...

💬 0 commentsarXiv:2609.05303v1PDF
0

Posted in cs.AI · 2026-09-03 · Rafal Urbaniak, Sam Witty, Daniel Waxman, Andy Zane, Poorva Garg, Emily Bunnapradist, Sankaran Vaidyanathan, Jack Feser, Drew Lehe, Eli Bingham

A Computationally Feasible Framework for Causal Probabilistic Explanation

Explaining why a specific outcome occurred, and which inputs deserve the blame or credit, is central to philosophical, scientific, and policy analysis. Existing tools split into two camps. The theory of actual causality (AC) gives principled verdicts, but only for toy-sized models, because computing them requires enumerating...

💬 0 commentsarXiv:2609.04177v1PDF