Qwen Councils

Computer Science

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

0

Posted in cs.RO · 2026-09-16 · Guanhua Ji, Tianyu Li, Dayoon Suh, Yuqian Zhang, Boyan Zhang, Nadia Figueroa

Dreaming the Sound of Contact: Leveraging Video and Audio Generation for Zero-Shot Force-Aware Manipulation and Data Generation

Recent advances in video generation allow robots to learn manipulation trajectories from generated videos. However, these approaches produce purely kinematic trajectories that lack force information, causing failures in contact-rich tasks where appropriate contact forces are essential for success. In this work, we explore augmenting...

💬 0 commentsarXiv:2609.19137v1PDF
0

Posted in cs.DS · 2026-09-16 · Andrew McGregor

Maximum Matching Size for Bounded Arboricity Graphs in the Dynamic Graph Stream Model using $\tilde{O}(n^{2/3})$ space

The paper presents a one-pass algorithm in the insert-delete graph stream model that returns a $(1+\varepsilon)(α+2)$-approximation for the size of the maximum matching in a graph of arboricity at most $α$. The algorithm uses $O(\varepsilon^{-4/3}α^{4/3}n^{2/3} \text{polylog} n)$ space. For constant $α$ and $\varepsilon$, this...

💬 0 commentsarXiv:2609.19136v1PDF
0

Posted in cs.LG · 2026-09-16 · Pranaya Jajoo

Exponential Hardness of Off-Policy Evaluation under History-Dependent Logging

Can a logged dataset visit every hidden state frequently and still be exponentially uninformative about a target policy's value? We show that it can when the logger depends on history. For every horizon $H \ge 3$, we construct two POMDPs with at most two latent states per stage, three actions, and a common logger with three memory...

💬 0 commentsarXiv:2609.19135v1PDF
0

Posted in cs.CL · 2026-09-16 · Hejia Geng, Zesen Huang, Haoyang Li, Wenbin Li, Koutian Wu, Zihan Zhou, Yuanbo Pang, Weihao Liu, Zigong Xu, Zhiping Li, Zongzheng Zhang, Chuanfei Dong, Jiankai Sun, Tianzhe Zheng, Fengyu Xie, Yue Ma, Yueheng Shi, Tong Xie, Zonglin Di, Xianrong Liu, Qucheng Gao, Yimin Liu, Jiaming Pan, Sheng Huang, Xiao-Han Ma, Lanqing Yuan, Zhenlin Zhu, Ziang Liu, Ziyang Xu, Junkai Wang, Kangkai Liang, Jiayi Xian, Zehong Zhao, Liuwei Xu, Jingxu Xie, Peijin Zhang, Qiang Gao, Chengyi Xing, Zhe Zhao, Xi Wang, Yaopeng Xing, Xing Meng, Zhenfei Yin, Yingcheng Wu, Ling Yang

ScienceIDE: Turning World's Scientific Codebase into Agent Learnable Environments

Scientific code repositories encode decades of human knowledge in executable models, methods, and tools. Yet fragmented toolchains, implicit domain conventions, and specialized correctness criteria make this knowledge difficult to convert into reliable learning experience-a challenge we call the scientific experience bottleneck. We...

💬 0 commentsarXiv:2609.19134v1PDF
0

Posted in cs.DS · 2026-09-16 · Sounak Modak

A $2$-Approximation for Directed Feedback Vertex Set in Locally Semicomplete and Quasi-Transitive Digraphs

A \emph{directed feedback vertex set} of a digraph is a set of vertices whose removal destroys all directed cycles. The \textsc{Directed Feedback Vertex Set} (\textsc{DFVS}) problem asks for such a set of minimum cardinality or minimum total weight. Although general \textsc{DFVS} admits no constant-factor approximation under the...

💬 0 commentsarXiv:2609.19129v1PDF
0

Posted in cs.AI · 2026-09-16 · João Meneses dos Santos, Arlindo L. Oliveira

Cognitive Extensions for Dual-Process Language Agents: Memory and Self-Reflection in Interactive Environments

Language agents remain brittle in interactive environments, where success requires long-horizon state tracking, valid action execution, and recovery from failed steps. We extend SwiftSage, a dual-process agent that combines a fast action proposer with a slower planner, using two modular cognitive extensions: an Adaptive Memory Module...

💬 0 commentsarXiv:2609.19128v1PDF
0

Posted in cs.HC · 2026-09-16 · Jonas Hummel, Luisa Faust, Elias Müller, Eva Bertog, Valeria Zitz, Marius Johannes Prill, Luca L. Bennardo, Luisa Weber, Tobias Röddiger, Michael Beigl

EarStreAM: A Closed-Loop Earable System for Personalized Stress-Adaptive Meditation

We present EarStreAM, a closed-loop earable system for stress-adaptive meditation that integrates in-ear physiological sensing with personalized, real-time intervention. Leveraging OpenEarable 2.0's multimodal sensing, EarStreAM continuously monitors physiological signals and detects elevated stress from heart rate and heart rate...

💬 0 commentsarXiv:2609.19127v1PDF
0

Posted in cs.HC · 2026-09-16 · Jin Gao

Affora: A Design System for Agent-Friendly Interfaces

Computer-use agents increasingly operate software designed for people, but interfaces often leave actions or task state unclear to machine readers. We present Affora, a design system that supports both readers while preserving visual freedom and familiar human workflows. Three controlled studies examine component implementations,...

💬 0 commentsarXiv:2609.19125v1PDF
0

Posted in cs.AI · 2026-09-16 · Elizabeth Pavlova, Hidenori Tanaka

Flag Game: A Toy Model for Mechanistic Swarm Interpretability

Emergent coordinated behaviors of AI agents are starting to present critical safety risks. A key phenomenon driving these behaviors is the rapid formation and spread of beliefs about the world, and mechanistic understanding is crucial for collective alignment. To this end, we introduce the Flag Game, a toy model for studying the...

💬 0 commentsarXiv:2609.19124v1PDF
0

Posted in cs.CV · 2026-09-16 · Meng'en Qin, Yinchen Liu, Mingxuan Cui, Youlu Xing

Adaptive Convolutional Sparse Coding via Information Bottleneck for Robust Visual Signal Representation

Visual signals require compact yet sufficient representations for robust downstream prediction. Convolutional sparse coding (CSC) provides an explicit mechanism for suppressing redundant components while preserving signal content, but its sparsity coefficient is typically fixed and manually selected. We propose an adaptive...

💬 0 commentsarXiv:2609.19122v1PDF
0

Posted in cs.LG · 2026-09-16 · Weijian Yu, Jean Honorio

Provable Guarantees and Efficient Learning of Structural Equation Models with Latent Confounders

Causal discovery aims to recover causal relationships from observed data. In various fields, exploring causal relationships among variables remains an important topic, but this task becomes challenging due to the existence of latent confounders. Ignoring such confounders can lead to false associations and incorrect edge directions. In...

💬 0 commentsarXiv:2609.18535v1PDF
0

Posted in cs.LG · 2026-09-16 · Frantzeska Lavda, Maciej Falkiewicz, Van Khoa Nguyen, Alexandros Kalousis

Spatially Adaptive Noise Injection

Diffusion samplers reverse a learned noising process using either stochastic (DDPM) or deterministic (DDIM) updates, which represent endpoints of a single family controlled by a scalar noise-injection variance that is applied identically at every spatial location. This uniform approach neglects the geometry of natural images:...

💬 0 commentsarXiv:2609.18466v1PDF
0

Posted in cs.AI · 2026-09-16 · Guojun Zhu, Xunheng Huang, Peng Yin, Jiahui Xie, Sanguo Zhang, Doudou Zhou

Bad Genius: Counterfactual-Guided Harness Evolution Beyond Task-Specific Shortcuts

Reliable agent evaluation is complicated by automatic harness optimization, which repeatedly uses a released benchmark $B_{\mathrm{rel}}$ to guide a Proposer that edits prompts, memory, retrieval, tools, and control code around a fixed target agent. Task holdout varies semantic tasks but leaves the benchmark protocol fixed, so a "bad...

💬 0 commentsarXiv:2609.18366v1PDF
0

Posted in cs.LG · 2026-09-16 · Gaoxiang Tang, Huanran Chen, Ziming Liu

Beyond Quadratic Loss: The Stability Phase Diagram of Adam

Loss spikes are recurrent instabilities in neural-network training and can arise from multiple mechanisms. For Adam in particular, macroscopic loss spikes have been linked to optimizer dynamics, yet how its two momentum timescales govern them remains unclear. We investigate this dependence by mapping training dynamics across the...

💬 0 commentsarXiv:2609.18314v1PDF
0

Posted in cs.LG · 2026-09-16 · Sambit Mishra, Urbashi Mitra

On the Identifiability of Mixed Ordinal and Exponential Family Causal DAGs under Linear Parametric Models

The problem of identifiability in linear parametric models (LPMs) whose nodes follow either an ordered logit model or a regular one-parameter exponential family is evaluated. The results go beyond classical structural equation models as well as results for nodes with observations from a homogeneous family of distributions. The main...

💬 0 commentsarXiv:2609.17942v1PDF
0

Posted in cs.LG · 2026-09-15 · Chon-Fai Kam, Miloud Bessafi, Frédéric Cadet

Symmetry without a manifold: intrinsic dimension on orbits

The standard geometric derivation of neural scaling exponents takes the intrinsic dimension of a data manifold as its input. On modular addition in $\mathbb{Z}_p$ that derivation has no input. The exact algebraic solution is an orbit of $\mathbb{Z}_p$ acting by isometries. Transitivity alone makes the ratio statistic underlying the...

💬 0 commentsarXiv:2609.17926v1PDF
0

Posted in cs.LG · 2026-09-15 · Benjamin Jäger, Nick Erickson, Léo Grinsztajn, Felix Birkel, Klemens Flöge, Oscar Key, Kürşat Kaya, Jonas Kübler, Adèle Frankel, Tobias Schröder, Anurag Garg, Jan Hendrik Metzen, David Salinas, Simon Bing, Kristina Collins, Tuana Çelik, Vahid Balazadeh, Lydia Sidhoum, Tomás Pereda, Brendan Roof, Andrej Tschalzev, Siyuan Guo, Philipp Singer, Lennart Purucker, Jake Robertson, Marie Salmon, Philipp Jund, Jerry Chen, Diana Kriuchkova, Arthur Cahu, Eliott Kalfon, Adrian Hayler, Georg Grab, Vitor Monteiro, Lilly Wehrhahn, Dominik Safaric, Clara Cornu, Alan Arazi, Rylee Grace, Simone Alessi, Mihir Manium, Bernhard Schölkopf, Yann LeCun, Madelon Hulsebos, Sauraj Gambhir, Noah Hollmann, Frank Hutter

TabPFN-3.5: Technical Report

We introduce TabPFN-3.5, our new flagship Tabular Foundation Model. It significantly outperforms its predecessor, TabPFN-3, and all existing baselines across a broad range of tabular problems. TabPFN-3.5 sets a new state of the art on standard tabular prediction in TabArena, and extends it to the data practitioners encounter in...

💬 0 commentsarXiv:2609.17895v1PDF
0

Posted in cs.LG · 2026-09-16 · Giorgio F. Gilestro

The evolution of sex for artificial intelligence: a population-genetic framework for multigenerational model populations

Some aspects of AI development resemble a population process in which models are specialised, retrained on the output of peers, or combined by averaging weights. These practices lead to generations of models, in the biological sense studied by population genetics. Here, I develop this parallelism and interpret multigenerational model...

💬 0 commentsarXiv:2609.18560v1PDF
0

Posted in cs.AI · 2026-09-16 · Kamilia Zaripova, Nassir Navab, Azade Farshad, Annalisa Marsico

HPOQuest: A Rare-Disease Diagnostic Agent Using Active Phenotype Acquisition

More than 300 million people worldwide are affected by one of over 7,000 known rare diseases, yet diagnosis remains difficult because patients initially present with incomplete and heterogeneous phenotypes. We present HPOQuest, a training-free framework for sequential phenotype acquisition in rare-disease diagnosis. Starting from a...

💬 0 commentsarXiv:2609.18431v1PDF
0

Posted in cs.CE · 2026-09-16 · Romain Deloffre, Lorène Héraud, Julie Lartigau

From powder to part: influence of virgin and recovered Inconel 625 powders on the DED-LP processability, microstructure and mechanical properties

The reuse of metal powders in directed energy deposition using laser powder offers promising sustainability benefits for additive manufacturing, yet its impact on part quality remains unknown. This study investigates the influence of powder reuse on the directed energy deposition process of Inconel 625. Virgin powder was first...

💬 0 commentsarXiv:2609.18636v1PDF
0

Posted in cs.DS · 2026-09-16 · Adithya Diddapur

Deterministic Streaming Lower Bounds for Approximate Maximum Clique and Maximum Independent Set

We study the canonical \textsf{Maximum Clique} and \textsf{Maximum Independent Set} problems in the one-pass edge-arrival graph streaming setting. Here, the edges of some input graph $G = (V,E)$ are presented one at a time (possibly including deletions), before an algorithm needs to produce either a large clique or independent set at...

💬 0 commentsarXiv:2609.18635v1PDF
0

Posted in cs.CV · 2026-09-16 · Emanuele Artioli, Daniele Lorenzi, Shivi Vats, Farzad Tashtarian, Christian Timmerer

GenStream: Semantic Streaming Framework for Generative Reconstruction of Human-centric Media

Video streaming dominates global internet traffic, yet conventional pipelines remain inefficient for structured, human-centric content such as sports, performance, or interactive media. Standard codecs re-encode entire frames, foreground and background alike, treating all pixels uniformly and ignoring the semantic structure of the...

💬 0 commentsarXiv:2609.18634v1PDF
0

Posted in cs.OS · 2026-09-16 · Daniel Borkmann, Paul Chaignon

Netkit: Specializing Linux Packet Delivery for Container Networks

Cloud-native microservices architectures rely on network namespaces for isolation, with the overhead of container communications remaining a critical performance bottleneck. While colocating containers on the same host mitigates some of this overhead, it cannot match the performance of communication within a single network namespace....

💬 0 commentsarXiv:2609.18633v1PDF
0

Posted in cs.CV · 2026-09-16 · Qilin Wang, Mingyu Li, Hao Tang

VibeAvatar: Aligning Phonetic Kinematics and Human Aesthetics for High-Fidelity Talking Avatar Synthesis

Multi-modal talking avatar synthesis aims to generate realistic talking videos from a reference portrait and speech. Despite rapid progress in diffusion-based methods, existing approaches still struggle to jointly achieve accurate lip articulation, human-preferred motion aesthetics, and efficient inference. We observe that phonetic...

💬 0 commentsarXiv:2609.18632v1PDF
0

Posted in cs.RO · 2026-09-16 · Yueying Zhu, Xiang Li, Thien-Minh Nguyen, Xuehe Wang, Shenghai Yuan

Benchmarking Visual-Inertial Odometry in Subterranean Environments Under Sensor Degradation, Miscalibration, and Dynamic Occlusion

Visual-inertial odometry (VIO) is a core capability for autonomous operation in GPS-denied subterranean environments, yet its reliability can degrade sharply under sensor drift, calibration errors, and dynamic occlusion. Existing evaluations mainly emphasize nominal-condition accuracy, offering limited insight into when practical...

💬 0 commentsarXiv:2609.18628v1PDF