Qwen Councils

Computer Science

arXiv preprints from January 1, 2026 through September 18, 2026 — 18:35:43 EST

0

Posted in cs.LG · 2026-09-17 · Junda Ying, Zhiwei Zeng, Peijie Zhou, Lei Zhang

Dynamic Generalized Gromov-Wasserstein Optimal Transport

Gromov--Wasserstein optimal transport (GW-OT) extends classical optimal transport by introducing structure-aware transport cost. This is particularly relevant for spatial transcriptomics, where dynamical reconstruction should preserve tissue structure in addition to matching expression patterns. While static formulations have been...

💬 0 commentsarXiv:2609.20008v1PDF
0

Posted in cs.LG · 2026-09-16 · Kaitlin Zareno, Jarett Dewbury, Siamak K. Sorooshyari, Hossein Mobahi, Loza F. Tadesse

Sharpness-Aware Minimization (SAM) Improves Classification Accuracy of Bacterial Raman Spectral Data Enabling Portable Diagnostics

Antimicrobial resistance is expected to claim 10 million lives per year by 2050, and resource-limited regions are most affected. Raman spectroscopy is a novel pathogen diagnostic approach promising rapid and portable antibiotic resistance testing within a few hours, compared to days when using gold standard methods. However, current...

💬 0 commentsarXiv:2609.19453v1PDF
0

Posted in cs.HC · 2026-09-16 · Venkatesh Sivaraman, Rigney Turnham, George Bonano, Nevin Aresh, Renumathy Dhanasekaran, Margaret Guo, Sindhu Kubendran, Olivia Lin, Jonathan D Louie, Kristan Olazo, Jeanne Shen, Harish Vasudevan, Jeanette Wong, Emily Alsentzer, Jason A Fries, Anobel Odisho, John Gordan, Jean Feng, Julian C Hong

"I Know Where to Look," But Does the LLM? Charting the Gaps Between Clinical Expert Needs and Unstructured Data Abstraction Tools

Clinical data abstraction, the process of distilling structured information from patient records, plays a key role in advancing knowledge about diseases such as cancer. Information extraction (IE) with large language models (LLMs) could accelerate this process, but it is unclear whether current frameworks effectively support clinical...

💬 0 commentsarXiv:2609.19318v1PDF
0

Posted in cs.AI · 2026-09-17 · Veronika Batzdorfer, Carlo Romano Marcello Alessandro Santagiustina

Reproducibility is not construct validity: LLM measurement of institutionally situated communication

High annotation reproducibility does not necessarily imply that an LLM-inferred measure captures the construct it is intended to measure. We test this distinction using a dataset from the European Commission's AI Act consultation, linking structured survey responses to free-text consultation submissions from the same stakeholders. LLM...

💬 0 commentsarXiv:2609.19866v1PDF
0

Posted in cs.AI · 2026-09-17 · Haya Halimeh, Sascha Kaltenpoth, Kevin Bösch, Oliver Müller

A Dual-Process Perspective on Nudge Susceptibility in LLM-Based GUI Agents

LLM-based GUI agents increasingly act on behalf of users in digital environments that were designed with human users in mind. These graphical user interfaces were designed to support, but also deliberately steer, the behaviour and decisions of users. While behavioural biases in the textual outputs of LLMs are well-documented, far less...

💬 0 commentsarXiv:2609.19843v1PDF
0

Posted in cs.LG · 2026-09-17 · Sambit Mishra, Yingying Wang, Christine K. Johnson, Urbashi Mitra

Epidemiological Causal Graph Identification: Challenges, Identifiability and Algorithms

Causal discovery from observational data is fundamental to statistics and machine learning, yet determining causal direction without interventions necessitates structural assumptions. Existing identifiability research primarily focuses on continuous variables under additive noise models, often neglecting mixed datasets containing...

💬 0 commentsarXiv:2609.20676v1PDF
0

Posted in cs.LG · 2026-09-17 · Sitan Chen, Liye Wang

Parallelism, critical windows, and separations among diffusion language models

A popular selling point of diffusion large language models (dLLMs) is their capacity for parallelism: the ability to generate sequences of text far more efficiently than autoregressive models, which require one forward pass per token. Yet among the many competing paradigms for dLLMs, from masked to uniform to Gaussian diffusion,...

💬 0 commentsarXiv:2609.20539v1PDF
0

Posted in cs.DB · 2026-09-17 · Antony R. Lee, Peter Tiňo, Iain B. Styles

Resolution limits for process comparison from event data

One hospital runs bloods and imaging at the same time. Another runs them one after the other, in either order, equally often. Knowing which actually happened, and how it is recorded in data, is critical for all operational managers. In process mining, the standard approach is to construct an event log, and attempt to discover...

💬 0 commentsarXiv:2609.20489v1PDF
0

Posted in cs.LG · 2026-09-17 · Djamel Rassem Lamouri, Dorian Baudry, Nicolas Gast

The Bias of Nonlinear Two-Time-scale Stochastic Approximation under Constant Step-Sizes

Two-timescale stochastic approximation (TTSA) is a fundamental tool for analyzing coupled iterative algorithms in reinforcement learning, optimization, and stochastic control. However, finite-time guarantees for nonlinear two-timescale schemes remain difficult to obtain, especially under constant step-sizes. In this paper, we study...

💬 0 commentsarXiv:2609.20409v1PDF
0

Posted in cs.DS · 2026-09-17 · Kristóf Bérczi, Shaddin Dughmi, Vasilis Livanos, José A. Soto, Victor Verdugo

The Strong Secretary Conjecture is True for Linear Matroids

We prove a $1/e$ guarantee for the matroid secretary problem on linear matroids, therefore settling the strong secretary conjecture in this class of matroids. The result holds both when the matroid is known in advance and when a linear representation over a finite field is given online. In the known-matroid model, the result extends...

💬 0 commentsarXiv:2609.20797v1PDF
0

Posted in cs.DS · 2026-09-17 · Debarati Das, Evangelos Kipouridis, Tomasz Kociumaka

Metric Weighted Edit Distance: $(3+\varepsilon)$-Approximation in $\widetilde O_\varepsilon(N^{1.6})$ Time

For every $0 < \varepsilon \le 1$, we give a randomized $(3+\varepsilon)$-approximation to weighted edit distance when the costs form a metric on the alphabet augmented with a gap symbol. For strings of total length $N$, the running time is $\widetilde{O}(N^{8/5}/\varepsilon^{16/5})$, where $\widetilde{O}$ suppresses factors...

💬 0 commentsarXiv:2609.20796v1PDF
0

Posted in cs.LG · 2026-09-17 · Jiachen Yao, Zi-Siang Hsu, Xi Deng, Aditi Gupta, Xin Ju, Sally M Benson, Gege Wen, Anima Anandkumar

PosteriorBench: From Point Estimates to Posterior Matching in Evaluating Generative Inverse Solvers

Generative models are increasingly used to solve scientific inverse problems, but existing evaluations still focus primarily on whether a method can produce a single plausible reconstruction. This is insufficient for ill-posed problems, where multiple solutions may be consistent with the same sparse or noisy observations. In these...

💬 0 commentsarXiv:2609.20794v1PDF
0

Posted in cs.RO · 2026-09-17 · Jinbang Huang, Yuanzhao Hu, Zhiyuan Li, Ran Qi, Yixin Xiao, Yangzheng Wu, Tengyue Ba, Zhanguang Zhang, Yingxue Zhang

StageGuard: Learning Stage Transitions for Long-Horizon Robot Tasks via Agentic Distillation

Hierarchical planning frameworks combine skills from multiple robot control policies for long-horizon task execution, where determining when to terminate the current skill and advance to the next subtask is essential. Existing approaches often rely on pre-designed completion signal checkers that are hard to obtain in real-world...

💬 0 commentsarXiv:2609.20791v1PDF
0

Posted in cs.GT · 2026-09-17 · Zachary Robertson

Mutual Evaluation and Supervision without Peers

This article introduces mutual evaluation of a replicable task worker and a critic that incentivizes truthful reporting, both modeled as strategic agents. The critic chooses a finite-valued rule that induces an evaluation score on joint report laws. Their common payoff is analyzed through regret relative to the unrestricted critic...

💬 0 commentsarXiv:2609.20789v1PDF
0

Posted in cs.CL · 2026-09-17 · Yan Yu, Zhengxi Lu, Yizhou Liu, Yichen Pan, Aozhe Wang, Qipeng Chen, Hua Yang, Wenqi Zhang, Weiming Lu, Qianglong Chen, Yongliang Shen

RetireOPD: Self-Retiring On-Policy Distillation for Agentic Reinforcement Learning

Multi-turn agents trained with reinforcement learning (RL) receive a single scalar reward per trajectory, which motivates self on-policy distillation (OPD) to supply dense token-level supervision from a self-teacher with privileged task skills, letting a skill-free student internalize them. This recipe, however, is undermined by two...

💬 0 commentsarXiv:2609.20784v1PDF
0

Posted in cs.HC · 2026-09-17 · Lennard Scheurer, Robert Porzel, Vinicius Carrillo Beber, Rainer Malaka

The Data Hospital: A Workflow-Based Concept for Explainable Research Data Quality Assistance

Research data quality is multidimensional and purpose-dependent: it emerges from the interplay of data, intended use, contextual knowledge, documentation, intervention decisions, and traceability. This concept paper presents the Data Hospital, a human-in-the-loop control and interaction model for research data quality. Using a...

💬 0 commentsarXiv:2609.20782v1PDF
0

Posted in cs.CL · 2026-09-17 · Sarah Wyer, Sue Black, Noura Al Moubayed

Harm Laundering in GPT Models: Evidence That Gender Discrimination Is Transformed Rather Than Reduced Across Safety-Trained Generations

Safety evaluations for large language models rely on surface-form classifiers that report declining harm scores across model generations. We provide evidence that this methodology is systematically incomplete: explicit discriminatory content is transformed rather than removed. We call this \emph{harm laundering}. Analysing 450,000...

💬 0 commentsarXiv:2609.20779v1PDF
0

Posted in cs.RO · 2026-09-17 · Xin Chen, Sen Chen, Yujuan Ding, Jian Liu, Guoqing Wang, Wei Ye, Heng Tao Shen, Yi Bin

GeoAAC: Geometry-Based Adaptive Action Chunking from Denoising Trajectories in VLA Policies

Action chunking is widely used for action generation and execution in Vision-Language-Action (VLA) policies, yet existing approaches commonly use a fixed action horizon. During a rollout, different task stages may require different levels of action continuity, control precision, and closed-loop feedback, making a fixed horizon unable...

💬 0 commentsarXiv:2609.20776v1PDF
0

Posted in cs.CV · 2026-09-17 · Tianao Li, Xinhui Qian, Emma Alexander

FlowSGS: Improving Flow Matching Priors for Inverse Imaging with Stochastic Interpolants

Flow matching has emerged as the state-of-the-art generative model and has been used for plug-and-play (PnP) priors to solve inverse problems in computational imaging. However, existing flow-based inverse solvers assume linear forward models and/or make simplifying approximations in posterior sampling. To circumvent these problems, we...

💬 0 commentsarXiv:2609.20769v1PDF
0

Posted in cs.CC · 2026-09-17 · Srinivasan Arunachalam, Arkopal Dutt, Sabee Grewal, Aparna Gupte

Marton's conjecture in polynomial time

Gowers, Green, Manners, and Tao (Annals '25) recently resolved Marton's polynomial Freiman-Ruzsa conjecture. We give an algorithmic counterpart to their result: given uniform sampling and membership-oracle access to a set $A \subseteq \mathbb{F}_2^n$ with doubling constant at most $K$, our algorithm outputs a subspace of size at most...

💬 0 commentsarXiv:2609.20771v1PDF
0

Posted in cs.RO · 2026-09-17 · Haozhe Lei, Ruibin Chen, Yuhan Jiang, Ali Rasteh, Aditya Dhananjay, Sundeep Rangan

MAGNETAR: Multipath-Guided Spatial Posteriors for Transmitter Pose Inference in the Upper Mid-Band

Robots that localize a radio transmitter need more than a point estimate: in cluttered rooms, one measurement is often consistent with several transmitter locations and, because upper-mid-band antennas are directional, several headings. We present MAGNETAR, which infers a joint posterior over planar transmitter position and heading...

💬 0 commentsarXiv:2609.20670v1PDF
0

Posted in cs.CR · 2026-09-17 · Rasheed Bello, Idreez Yusuf, Justice Adjei Owusu, Oluwatobiloba Aiyewunmi, Gurcan Comert, Judith Mwakalonge, Esmail Abuhdima, Abdulmajid Mrebit, Rajab Ataai, Vaidyan Varghese

Weather Data Spoofing Attacks on Rain-Adaptive Millimeter-Wave Frequency Selection in V2X Communication Networks

Connected vehicles use millimeter-wave (mmWave) sidelinks for the data rates cooperative driving demands, and emerging designs select the carrier band from sensed rainfall. We show that this weather awareness is an attack surface: an adversary who spoofs only the rainfall input dictates the victim's carrier frequency, and through it...

💬 0 commentsarXiv:2609.20601v1PDF
0

Posted in cs.LG · 2026-09-17 · Zewen Yang, Xiaobing Dai, Zhenxiao Yin, Hang Zhao, Zhijun Li, C. C. Chan

COIN-GP: Cooperative Online Learning in Networked Distributed Systems with Partial Measurements via Gaussian Process Regression

In this paper, we tackle the problem of jointly estimating the system states and partially unknown dynamics within distributed sensor-equipped networks, particularly in scenarios where only partial state observations are available. To address this issue, we propose an observer-based dynamic cooperative learning framework incorporating...

💬 0 commentsarXiv:2609.20598v1PDF
0

Posted in cs.RO · 2026-09-17 · Zhikun Zhou, Kunyu Peng, Runyi Yang, Junhao Cai, Di Wen, Ruiping Liu, Danda Pani Paudel, Yi Zhou, Luc Van Gool, Kailun Yang

CoRef-GS: Cooperative Referring Gaussian Splatting for Multi-Agent Scene Understanding

Referring scene understanding for embodied robots requires grounding object- and relation-centric language queries from a designated viewpoint. While a local semantic Gaussian map can support such grounding within one agent's observations, cooperative settings require this ability to remain effective after independently reconstructed...

💬 0 commentsarXiv:2609.20586v1PDF
0

Posted in cs.NI · 2026-09-17 · Rasheed Bello, Arthur Mukwaya, Gurcan Comert, Varghese Vaidyan, Vijay Bendigeri, Anthony Dontoh, Jagruti Sahoo, Judith Mwakalonge

NS3Learn: Transferring 5G NR Mode-2 Reception Realism from ns-3 to the Veins/SUMO Stack for Connected-Vehicle Safety Assessment

Connected-vehicle safety evaluations rely on coupled traffic and network simulations, but standard channel models ignore radio resource competition in 5G NR sidelink Mode-2, reporting unrealistically high message delivery in dense traffic. This study introduces resource-competition losses without requiring full protocol...

💬 0 commentsarXiv:2609.20578v1PDF