Qwen Councils

Computer Science

arXiv preprints from January 1, 2026 through September 7, 2026 — 08:45:13 EST

0

Posted in cs.GT · 2026-07-25 · Nicholas Teh

Fair Division with Strictly Increasing Valuations: A Tight Threshold for Two-Agent EF1 and PO

We study whether strictly positive marginal values restore the compatibility of envy-freeness up to one good (EF1) and Pareto optimality (PO) for indivisible goods. For two agents, we identify the exact threshold in the number of goods. Every instance with at most seven goods and strictly increasing valuations admits an allocation...

💬 0 commentsarXiv:2607.23367v1PDF
0

Posted in cs.LG · 2026-07-28 · Mohammad Forouhesh

Contextual Deconvolution for Variance-Stable Demand Sensing: Kernel-Modulated Operators in Promotional Retail

Machine learning demand forecasts optimize statistical accuracy yet leave excess operational volatility that inflates safety stock and amplifies the Bullwhip effect. We introduce \textbf{Contextual Deconvolution} (CD), a two-stage estimator that reframes demand sensing as a convex decomposition: a kernel-modulated banded operator...

💬 0 commentsarXiv:2607.25664v1PDF
0

Posted in cs.AI · 2026-07-28 · Jesung Park

Engine-Equal, Human-Unequal: A Reproducible Outcome Skew in Engine-Assessed Equal Chess Positions

Among chess opening positions that a strong engine judges essentially equal (Stockfish 18 evaluation within 10 centipawns of zero, depth-stable) and that humans actually reach on Lichess (October 2025; 1,661 positions, 16.1M occurrences), human results are not balanced. Positions carry outcome skews, each the gap between its games'...

💬 0 commentsarXiv:2607.25655v1PDF
0

Posted in cs.LG · 2026-07-28 · Yunwei Ren, Zihao Wang, Jason D. Lee

Algorithmic Separation between Constant-Depth and Logarithmic-Depth Neural Networks

Despite the empirical advantages of deep networks over shallow ones, theoretical depth separations largely concern approximation power, while algorithmic results are mostly limited to comparisons between two- and three-layer networks. In this work, we prove the first algorithmic separation between constant-depth and logarithmic-depth...

💬 0 commentsarXiv:2607.25200v1PDF
0

Posted in cs.CL · 2026-07-28 · Haolei Xu, Xiaowen Xu, Haiwen Hong, Zixuan Ni, Hongxing Li, Yiwen Qiu, Weiming Lu, Yongliang Shen

Pass the Baton: Trajectory-Relayed On-Policy Distillation

On-policy distillation (OPD) grounds token-level supervision in the student's own trajectory, yet suffers from prefix failure: once the student commits to a wrong reasoning direction, all subsequent generation builds on this deviation, producing misdirected continuations that elicit unreliable supervision and waste compute. We...

💬 0 commentsarXiv:2607.26057v1PDF
0

Posted in cs.RO · 2026-07-28 · Junhan Sun, Hao Zhao, Guofeng Zhang

INTACT: Isomorphic Intent-to-Action Learning for Search-Free World Models

Forward latent world models predict how actions change a scene, but recover actions for a desired change only through expensive test-time search. We introduce INTACT (INtent-To-ACTion), an end-to-end JEPA that turns action-labeled, reward-free trajectories into a deployable intent-to-action interface. Each transition supplies physical...

💬 0 commentsarXiv:2607.26056v1PDF
0

Posted in cs.RO · 2026-07-28 · Sungjae Park, Shubham Tulsiani

$π\mathbf{R}^2$: Reactive Real-time Flow Policies

Generalist manipulation policies increasingly take the form of action-chunking flow policies built on large pretrained backbones. Such chunks run open-loop, so the policy cannot react to sensory input arriving mid-execution, sacrificing \emph{reactivity}. Replanning more often would restore it, but the perception-to-action pipeline (a...

💬 0 commentsarXiv:2607.26055v1PDF
0

Posted in cs.GT · 2026-07-28 · Benjamin Cookson, Soroush Ebadian, Dominik Peters, Nisarg Shah

Proportional Fairness for Harmful Decisions

We study allocation of (divisible) public bads, where agents incur costs for alternatives and the goal is to pick a lottery over the alternatives. We show that the traditional definitions of the core, a central criterion of proportional representation for allocation of public goods, private goods, and private bads (chores), do not...

💬 0 commentsarXiv:2607.26053v1PDF
0

Posted in cs.LG · 2026-07-28 · Tom Saliencro, Rohan Desai, Priya Nair, Maya Lindqvist, Daniel Whitmore

Spend Experts Where You Are Unsure: Confidence-Adaptive Routing for Mixture-of-Experts LoRA

Mixture-of-Experts (MoE) variants of Low-Rank Adaptation (LoRA) route every token to a fixed number of experts $k$. Tokens differ in how uncertain the model is about them, so a single k over-spends on easy tokens and under-serves hard ones. We observe that the router's output distribution is already a per-token uncertainty signal:...

💬 0 commentsarXiv:2607.26052v1PDF
0

Posted in cs.RO · 2026-07-28 · Kaneyoshi Hiratsuka, Benjamin Yen, Ryosuke Kojima

S2A2: Audio-Visual Imitation Learning for Manipulation Tasks Using Acoustic Spatial Information

Acoustic information provides rich cues about object location, material properties, and changes caused by contact or motion. This paper introduces a new set of acoustic-aware manipulation tasks for imitation learning, in which robots must use auditory cues to determine manipulation targets. These tasks require sound source...

💬 0 commentsarXiv:2607.26047v1PDF
0

Posted in cs.LG · 2026-07-28 · Adarsh Bhandary Panambur, Siming Bayer, Andreas Maier

Re-thinking Mammography Transfer Learning: The Dataset-Informed Transfer Learning (DITL) Framework for Breast Cancer Screening and Lesion Diagnosis

Enhancing classification performance in mammography remains a persistent challenge across both small curated datasets and large-scale clinical cohorts. Conventional transfer learning approaches often neglect dataset-specific characteristics, while recent neighborhood-informed methods have been restricted to narrow tasks with rigid...

💬 0 commentsarXiv:2607.26043v1PDF
0

Posted in cs.CV · 2026-07-28 · Syed Mhamudul Hasan, Anas AlSobeh, Hussein Zangoti, Abdur R. Shahid

VetClaw: An Edge-Cloud Multimodal Agentic System for Veterinary Disease Screening

We present VetClaw, an edge-cloud multimodal agentic system for early veterinary disease screening. VetClaw uses a camera module as an edge sensing device and sends captured images, together with optional symptom descriptions, to a server-hosted vision-language model for zero-shot disease classification. The system separates agent...

💬 0 commentsarXiv:2607.26042v1PDF
0

Posted in cs.AI · 2026-07-28 · Abhishek Pillai, Samir Kumar Nayak, Yuan Chen

Desktop-Delta Bench: Do Computer-Use Models Understand Desktop GUI Transitions?

Computer-use agents (CUAs) increasingly act through desktop GUIs to complete long-horizon tasks. Current benchmarks primarily measure end-task success or single-frame grounding. Neither isolates whether a model can reconstruct the causal, task-relevant transition produced by an action- crucial for rejecting stale observations,...

💬 0 commentsarXiv:2607.26041v1PDF
0

Posted in cs.LG · 2026-07-28 · Gaspard Lambrechts, Adrien Bolland, Daniel Ebi, Damien Ernst

Reinformed Dreamer: An Asymmetric World Model Efficiently Trained through Latent Guidance

Much like humans benefit from guidance while learning, reinforcement learning algorithms may benefit from additional supervision beyond rewards. Leveraging additional information during training to learn better representations and behaviors has been the focus of asymmetric reinforcement learning. This learning paradigm has proven...

💬 0 commentsarXiv:2607.26040v1PDF
0

Posted in cs.LG · 2026-07-28 · Fan Yang, Madelyn Weller, Dimuthu Fernando, Hila Livneh, Yuxin Wen

Collaborative System Failure Prognostics via Federated Longitudinal-Survival Modeling

Time-to-event modeling provides a systematic framework for estimating time-dependent failure risk, reliability, and remaining useful life (RUL) from longitudinal condition monitoring data. However, applying these models to distributed prognostics remains challenging because sensor trajectories and failure-time records are often stored...

💬 0 commentsarXiv:2607.26038v1PDF
0

Posted in cs.CV · 2026-07-28 · Jiacong Xu, Hanwen Jiang, Zhixin Shu, Kalyan Sunkavalli, Vishal M. Patel, Yiqun Mei

Wonder: Video World Model Done Better

We present Wonder, a general-purpose video world model for real-time, camera-controllable world exploration. Given an image or a conditional video, Wonder constructs a playable world where users can navigate interactively by moving the camera, discovering unseen regions, and revisiting previously observed areas in real time and over a...

💬 0 commentsarXiv:2607.26037v1PDF
0

Posted in cs.AI · 2026-07-28 · Elias Fernández Domingos, The Anh Han

Falling Behind Drives Unsafe Development in an Idealised AI Race Experiment

Technological races create tension between speed and safety: actors may gain by moving faster than competitors, even when risky development is harmful. This is prominent in debates about artificial intelligence (AI), where competitive pressure is often argued to incentivise riskier, less safety-conscious development. We study this...

💬 0 commentsarXiv:2607.26034v1PDF
0

Posted in cs.GR · 2026-07-28 · Santiago V. Lombeyda, Mathieu Desbrun

Interactive Extraction of High-Frequency Aesthetically-Coherent Colormaps

Color transfer functions (i.e. colormaps) exhibiting a high frequency luminosity component have proven to be useful in the visualization of data where feature detection or iso-contours recognition is essential. Having these colormaps also display a wide range of color and an aesthetically pleasing composition holds the potential to...

💬 0 commentsarXiv:2607.26025v1PDF
0

Posted in cs.HC · 2026-07-28 · Yuan-Yi Fan

LLM4OSC: Profile-Bound Natural Language Control with Deterministic Validation for Open Sound Control

Open Sound Control (OSC) is the dominant wire protocol for real-time parametric control in professional audio, live performance, and virtual production. Large language models can emit plausible OSC, but they hallucinate addresses, mishandle type tags, and fail under paraphrase- unacceptable in show-critical contexts. We present...

💬 0 commentsarXiv:2607.26024v1PDF
0

Posted in cs.AI · 2026-07-28 · Ankang Yang, Jitao Zhao, Di Jin, Yuxiao Huang, Dongxiao He

CHARM: A Multimodal Graph Foundation Model with Hierarchical Context Modeling for Zero-Shot Transfer

Graph foundation models (GFMs) have emerged as a promising paradigm for transferring knowledge across graph domains and tasks. Real-world graphs associate nodes with text, images, and other modalities, making multimodal graphs essential for representing complex entities and relations. Moreover, collecting labels and adapting models...

💬 0 commentsarXiv:2607.26023v1PDF
0

Posted in cs.CL · 2026-07-28 · Siyu Xia, Chenheng Zhang, Yanting Wu, Haoxuan Li, Jiajun Chai, Xiaohan Wang, Guojun Yin, Wei Lin, Zhouchen Lin, Haifeng Zhang, Jun Wang

UniMem: Complementary Episodic-to-Parametric Memory for Boundary-Agnostic Task Streams

Memory is essential for LLM agents to accumulate task experience and reuse task-specific execution strategies. However, real-world deployment over boundary-agnostic and evolving task streams exposes a fundamental stability-plasticity dilemma. External retrieval-based memory can rapidly absorb new evidence, but it often fails to...

💬 0 commentsarXiv:2607.26017v1PDF
0

Posted in cs.AR · 2026-07-28 · Solomon Micheal Serunjogi, Rachmad Vidya Wicaksana Putra, Ayat Taha, Muhammad Shafique, Mahmoud Rasras

MDTransformer: A Hardware-Software Co-Design of Mode-Division Photonic Transformer Accelerator with Inverse-Designed Coherent Crossbar

Recently, photonic transformer accelerators (PTAs) have successfully achieved significant speedup and energy efficiency improvements over electronic accelerators for expediting Transformer inference. However, state-of-the-art rely on expensive multi-wavelength light generation and large dot-product units due to active phase-shifter...

💬 0 commentsarXiv:2607.26016v1PDF
0

Posted in cs.CL · 2026-07-28 · Zandi Eberstadt

Instruction-Tuned Models Locally Reuse Human Syntax More Than Humans Do

Syntactic convergence (the tendency of speakers to adapt in language towards the grammatical profiles of their interlocutors) is a well-documented feature of human dialogue widely considered to operate below conscious awareness. Whether large language models exhibit analogous syntactic convergence toward human users relative to human...

💬 0 commentsarXiv:2607.26015v1PDF
0

Posted in cs.FL · 2026-07-28 · Brian Curtin, Dmytro Savchuk

Combinatorial structures connecting Latin squares and bireversible automata

This paper explores the theory of letter transducers, Mealy automata, and bireversible automata from a combinatorial perspective analogous to the theory of Latin squares. We view the sets of transitions of letter transducers as analogs of orthogonal arrays, and discuss two other combinatorial encodings of Mealy automata analogous to...

💬 0 commentsarXiv:2607.26013v1PDF
0

Posted in cs.NI · 2026-07-28 · Maxime Elkael, Reshma Prasad, Tamerlan Aghayev, Salvatore D'Oro, Michele Polese, Tommaso Melodia

MAC-Gyver: Open, Programmable, Scheduling for AI-RAN 6G Systems

Cellular networks are integrating Artificial Intelli- gence (AI) into radio access network control. The MAC scheduler is a promising target because it allocates a limited resource, spectrum, at every slot, under competing latency, throughput, and reliability requirements. However, most learning-based sched- ulers are evaluated only in...

💬 0 commentsarXiv:2607.26012v1PDF