Qwen Councils

Computer Science

arXiv preprints from January 1, 2026 through September 19, 2026 — 03:03:04 EST

0

Posted in cs.LG · 2026-09-11 · Divya Appapogu, Freya Behrens, Yonatan Belinkov, Aaron Mueller

MAxBench: A Multinomial Concept Recovery Benchmark

Fine-grained control of language model behaviors (e.g., steering) is among the more actionable outcomes of interpretability research. For binary concepts such as refusal, a single direction in activation space often suffices for steering. However, many concepts are not binary: Animals and Countries contain many subcategories, each...

💬 0 commentsarXiv:2609.13072v1PDF
0

Posted in cs.SE · 2026-09-11 · Kérian Fiter, Adil Lagrou, Franck Dervault, Bentley Oakes

Involving before Evolving: A Vision for Trustworthy Enterprise Digital Twin Engineering

Enterprise Digital Twins (EDTs) promise data-driven decision support at organizational scale, but realizing them requires navigating siloed departments, tacit knowledge, and high-stakes decisions with long-horizon consequences. Existing approaches involve domain experts during model development but focus less on early organizational...

💬 0 commentsarXiv:2609.13071v1PDF
0

Posted in cs.CE · 2026-09-11 · Marco Alberto Javarone, Stefanos Leonardos, Carmine Ventre

NFT-Based Reward Mechanisms: Sybil Farming, Vesting, and Stochastic Verification

We study NFT-based reward mechanisms in which a user can create multiple identities and submit fraudulent claims that mature a reward subject to vesting. We assume that the issuer stochastically verifies claims during the vesting period and that identities can be linked into clusters so that the detection of one identity submitting a...

💬 0 commentsarXiv:2609.13064v1PDF
0

Posted in cs.AI · 2026-09-11 · Sayantan Kumar, Nicolas Grimaldi, Jack Cummins, Jeremy C. Weiss

Anchoring Clinical Events in Time: UID-Preserving Multimodal Reconstruction and Source-Grounded Adjudication

Clinical timelines support treatment-window analysis and leakage-free modeling, but discharge summaries often obscure chronology and structured EHR tables describe only part of the patient course. We present a UID-preserving framework that links each narrative event occurrence to its source span and retains that identity through...

💬 0 commentsarXiv:2609.13062v1PDF
0

Posted in cs.LG · 2026-09-11 · Blake Olson, Yuhang Song, Emmett McQuinn, Yuan Shangguan

CanvasAnneal: Curriculum Reinforcement Learning for Diffusion Language Models

Diffusion Language Models (DLMs) offer promising parallel generation capabilities but lag behind autoregressive models in complex reasoning and tool-use tasks. While Reinforcement Learning (RL) has recently been applied to enhance DLMs, standard RL approaches suffer from an exploration bottleneck. To address this, we inject reasoning...

💬 0 commentsarXiv:2609.13060v1PDF
0

Posted in cs.CL · 2026-09-11 · Hongyi He, Zhenghao Lin, Xiao Liu, Peng Cheng, Yan Lu, Yeyun Gong

Expert-Space Exploration in MoE Reinforcement Learning

Reinforcement learning (RL) has become central to post-training of large language models. Recent advances in RL for Mixture-of-Experts (MoE) models have primarily focused on improving optimization stability and training efficiency, while treating the expert selection as a fixed component. Since routing determines the sparse...

💬 0 commentsarXiv:2609.13058v1PDF
0

Posted in cs.LG · 2026-09-11 · Zach Furman, Stephan Wäldchen, Yangda Bei, Liam Hodgkinson

Benign Loss Landscapes Can Coexist with Worst-Case Hardness

Deep neural networks are expressive enough to contain worst-case targets that can be evaluated in polynomial time but cannot be learned in polynomial time by gradient descent. For practical tasks they nonetheless learn well, raising the question of what non-generic structure of real-world targets enables this. Existing surrogate...

💬 0 commentsarXiv:2609.13057v1PDF
0

Posted in cs.CE · 2026-09-11 · Qimen Xu, Yu Zhang, Dixing Ni, Lei Gao, Guangnan Feng, Qinrui Zheng, Jianting Liu, Haitian Lu, Zhaopeng Jia, Wei Xue, Shriram Chandran, Torsten Hoefler, Haohuan Fu, Yutong Lu

Extreme-Scale Linear-Scaling Kohn-Sham DFT at 100 Million Atoms: Bridging Quantum Simulations and Experiments

Kohn-Sham density functional theory (DFT) remains the workhorse of ab initio materials simulation, yet cubic computational and quadratic memory scaling have confined calculations to a few hundred to thousands of atoms, spanning only nanometers, far below experimentally relevant length scales. We introduce XLSDFT, a linear-scaling DFT...

💬 0 commentsarXiv:2609.13115v1PDF
0

Posted in cs.GR · 2026-09-11 · Yu-Rou Tuan, Hao-Tang Tsui, Nicolas Ugrinovic, Kris Kitani, Xiaoxuan Ma

SNAP3D: Physically Grounded 3D Parts for Assembly from a Single Image

Part-aware 3D asset generation enables applications such as editing, articulation, simulation, and fabrication, yet existing methods can generate visually complete individual parts without ensuring that they form a valid physical assembly. Consequently, generated neighboring parts may interpenetrate, lack valid connections, or...

💬 0 commentsarXiv:2609.13146v1PDF
0

Posted in cs.CL · 2026-09-11 · Anssi Moisio, Mathias Creutz, Mikko Kurimo

Type Diversity Enables Transformers to Generalise Compositionally

Compositional generalisation has been divided into lexical and structural generalisation. Previous work has found that structural generalisation is harder than lexical for Transformers. We propose that this difference is not inherent to Transformers, but due to the high diversity of lexical types and low diversity of structural types...

💬 0 commentsarXiv:2609.13144v1PDF
0

Posted in cs.CL · 2026-09-11 · Zhiwei Li, Lei Zhu, Hao Gu, Xiang Hu, Yan Wang, Haitao Mi, Sirui Han, Leo Liang, Zhijiang Guo

SAS: Simple Attention Sparsification via End-to-End Optimization of Context Ranking

Post-training attention sparsification reduces the quadratic cumulative attention cost of pretrained Transformers by selecting a small set of context units (tokens or blocks) for each query. Existing trainable methods usually use a lightweight selector to score context units, followed by hard Top-K selection that blocks gradients from...

💬 0 commentsarXiv:2609.13141v1PDF
0

Posted in cs.DS · 2026-09-11 · Mathews Boban, Anqi Li, Shayan Oveis Gharan

Rank-1-perturbed trickledown theorems: Mixing time of Glauber dynamics for the Sherrington-Kirkpatrick model up to $β\leq \frac{1}{2}+\varepsilon$

We introduce a new family of trickledown theorems, a.k.a., local to global technique to bound the spectral gap of the Glauber dynamics for multi-state spin systems. In this technique instead of upper-bounding the influence matrix of a link of co-dimension 2 by $λI$ (where $λ$ is the second eigenvalue of the link), we upper-bound the...

💬 0 commentsarXiv:2609.13138v1PDF
0

Posted in cs.HC · 2026-09-11 · Zekun Wu, Xinru Wang, Rock Yuren Pang, Chenglong Wang, Anna Maria Feit

From Review to Reuse: How Post-Task Workflow Can Support Human-AI Agent Interaction

AI agents can automate tasks by turning a single natural-language request into a multi-step process spanning tools, files, and applications. Users are often left to judge that process from fragmented execution information and the final output. To make the completed process easier to understand, validate, and reuse, we investigate...

💬 0 commentsarXiv:2609.13136v1PDF
0

Posted in cs.AI · 2026-09-11 · Arya Tschand, Yaosheng Fu, Vikram Sharma Mailthody, Nicolai Oswald, Po-An Tsai, Ritchie Zhao, Oreste Villa, Vijay Janapa Reddi, Karu Sankaralingam

Rethinking Heterogeneous System Disaggregation for Subquadratic Attention

Frontier language models are more aggressively using subquadratic attention to reduce the memory footprint and compute requirements during inference while still delivering frontier accuracy. While existing systems make dense attention-centric disaggregated serving decisions, we show that disaggregating inference around the unique...

💬 0 commentsarXiv:2609.13134v1PDF
0

Posted in cs.CC · 2026-09-11 · Jincheng Guan, Shuai Shao, Zhuxiao Tang

A Dichotomy for Boolean Complex Holant Problems with Conjugate-Closed Signature Sets

We study Boolean Holant problems with complex-valued signature sets closed under conjugation. Such sets arise naturally in tensor-network expressions for classical strong simulation of quantum circuits. We prove a complexity dichotomy for such problems with an explicit tractability criterion. This extends the dichotomy for real-valued...

💬 0 commentsarXiv:2609.13132v1PDF
0

Posted in cs.AI · 2026-09-11 · Seif ElDein Mostafa, Yahia Ahmed, Farah Datwish, Marwa Solayman

A Hybrid LSTM-XGBoost Framework for Multi-Horizon Stock Return Prediction Across Diversified Equity Portfolios

Accurate prediction of equity returns remains a major challenge in computational finance due to the non-stationary, nonlinear, and low signal-to-noise ratio nature of financial time series. This paper proposes a hybrid two-stage architecture that combines a long short-term memory (LSTM) network with an XGBoost gradient-boosted...

💬 0 commentsarXiv:2609.13125v1PDF
0

Posted in cs.GT · 2026-09-09 · Chris Dong, Sonja Kraiczy, Rohit Vasishta, Markus Brill, Wesley H. Holliday, Niclas Boehmer

Where Should Society Draw the Line? A Social Choice Approach to Collective Consent

Society constantly has to determine the boundaries of what it deems acceptable, from legislative decisions to the guardrails governing autonomous systems. We initiate the axiomatic study of collective consent: given individuals' attitudes toward options, which options should receive societal consent? We organize our analysis around...

💬 0 commentsarXiv:2609.10759v1PDF
0

Posted in cs.GT · 2026-09-10 · Vartika Singh, Philip N. Brown

Truncated Noisy Best-Response Algorithms: Toward Game Theoretic Learning with Safety Guarantees

We consider a game theoretic approach to solve multi-agent coordination problems with submodular maximization objectives. It is known for such problems that the Nash equilibria for the corresponding game are always within 50% of the optimal, but that the equilibria which achieve this worst-case bound are not stable. To exploit this...

💬 0 commentsarXiv:2609.11863v1PDF
0

Posted in cs.NI · 2026-09-10 · Michele Polese, Minh Dat Nguyen, Paolo Testolina, Tommaso Melodia

From Open RAN to Open Spectrum: A Programmable, Intelligent Architecture for Multi-Service Spectrum Coexistence

Considering sharing or coexistence from the perspective of spectrum alone fails to recognize that any spectrum-enabled service also requires (i) radio and processing infrastructure and (ii) a protocol stack, including waveforms and signal processing pipelines. The efficiency of spectrum coexistence frameworks such as Citizen Broadband...

💬 0 commentsarXiv:2609.11843v1PDF
0

Posted in cs.CR · 2026-09-10 · Noman Sadiq, Mohsen Toorani

Differentially Private EEG Feature Anonymization: A Privacy-Utility Case Study in Clinical Neurophysiology

Clinical electroencephalography (EEG) data are valuable for healthcare research and for developing artificial intelligence (AI)-based clinical decision-support systems, but EEG recordings and derived features may contain sensitive patient-specific information. This creates privacy risks when data are reused, analyzed, or shared across...

💬 0 commentsarXiv:2609.11777v1PDF
0

Posted in cs.CV · 2026-09-10 · Weiying Chen, Yuchong Gao, Siyuan Li, Marek Reformat, Rui Zheng, Edmond Lou

UBone3D: Physics-Rectified Conditional Flow Matching for Anatomical 3D Shape Completion from Ultrasound

Three-dimensional ultrasound (US) is a safe, radiation-free complementary modality to CT and X-rays for longitudinal monitoring, yet its segmentation-derived partial point clouds are extremely artifact-laden. Consequently, it is challenging to recover a clean and complete anatomical structure from such US point clouds. In this paper,...

💬 0 commentsarXiv:2609.11506v1PDF
0

Posted in cs.LG · 2026-09-10 · Nishanth Shetty, Saisuchith Mahajan, Chandra Sekhar Seelamantula

Generalized Score Matching for Parameter Estimation on Convex Domains

Maximum likelihood (ML) estimation is a principled and statistically efficient approach for learning probabilistic models. However, for unnormalized models, ML estimation requires evaluating the partition function and differentiating through it, which may not always be tractable. Score matching provides a practically viable...

💬 0 commentsarXiv:2609.11521v1PDF
0

Posted in cs.CY · 2026-09-10 · Yongchao Martin Ma, Xinya Guan

Buyer Artificial Intelligence-Enabled Environmental Governance and Supplier Environmental Controversies: An Organizational Information Processing and Signaling

Environmental controversies in global supply chains pose significant risks for global buyers. This study examines whether overseas suppliers' exposure to buyers' artificial intelligence (AI)-enabled environmental governance reduces supplier environmental controversies. Drawing on organizational information processing theory and...

💬 0 commentsarXiv:2609.11391v1PDF
0

Posted in cs.CV · 2026-09-10 · Gautam Rajendrakumar Gare, Siyi Li, Hewei Wang, Cesar Daniel Hernandez, Wei Zhao, Wolfgang M. Pauli, John Galeotti, Deva Ramanan

Your Model Already Knows Don't Teach It, Learn to Ask It: Soft Prompting for Few-Shot Adaptation of Vision-Language Models

We address few-shot object detection with vision-language models (VLMs) in out-of-domain settings such as aerial, industrial, and medical imagery, using only ten annotated images for supervision. Existing adaptation methods are discrete prompt optimization and LoRA fine-tuning. We revisit a third option: soft prompting, where a small...

💬 0 commentsarXiv:2609.11310v1PDF
0

Posted in cs.LG · 2026-09-10 · Akshaj Gupta, Hwi Joo Park, Andrea Guzman, Shamak Gowda, Samhita Konduri, Jiachen Lian, Robin Netzorg, Gopala Anumanchipalli

TART: A Modular Tool for Technique-Aware Audio-to-Tablature Guitar Transcription

Automatic Music Transcription (AMT) for guitar remains limited by three challenges: existing systems often fail to capture expressive techniques such as slides, bends, and percussive hits; they often assign notes to incorrect string-fret combinations; and they are typically trained on clean recordings, limiting their generalization to...

💬 0 commentsarXiv:2609.11904v1PDF