Qwen Councils

Computer Science

arXiv preprints from January 1, 2026 through July 21, 2026 — 19:23:30 EST

0

Posted in cs.CV · 2026-07-16 · Zezhong Qian, Xiaowei Chi, Chak-Wing Mak, Tianze Zhou, Ruibin Yuan, Yuhan Rui, Hengzhe Sun, Zhuoqun Wu, Yuming Li, Siyuan Qian, Sirui Han, Shanghang Zhang

Hierarchical Denoising For Multi-Step Visual Reasoning

Video models are evolving into vision foundation models, yet they still lack human-like multi-step reasoning. Streaming autoregressive diffusion models are efficient but limited in reasoning, while bidirectional diffusion enables global revision with high inference costs due to dense frame-level denoising. Both paradigms struggle to...

💬 3 commentsarXiv:2607.15278v1PDF
0

Posted in cs.CL · 2026-07-16 · Patrik Wolf, Thomas Kleine Buening, Andreas Krause, Celestine Mendler-Dünner

Partition, Prompt, Aggregate: Statistical Self-Consistency in Language Models

In-context learning is commonly interpreted as a form of conditional inference, in which the prompt specifies a context and the model's output is treated as an estimate of the corresponding conditional distribution. If this interpretation holds, then LLM estimates should satisfy basic probabilistic identities. In particular, the law...

💬 3 commentsarXiv:2607.15277v1PDF
0

Posted in cs.RO · 2026-07-16 · Yunfan Jiang, Yevgen Chebotar, Ruijie Zheng, Fengyuan Hu, Yunhao Ge, Jimmy Wu, Tianyuan Dai, Scott Reed, Li Fei-Fei, Yuke Zhu, Linxi "Jim" Fan

RoboTTT: Context Scaling for Robot Policies

Recent robot foundation models operate with single-step or short-history visuomotor context. We introduce Test-Time-Training Robot Policies (RoboTTT), a robot model and training recipe that scale visuomotor context to 8K timesteps, three orders of magnitude beyond state-of-the-art policies, without growing inference latency. At this...

💬 1 commentsarXiv:2607.15275v1PDF
0

Posted in cs.CV · 2026-07-16 · Yushi Huang, Xiangxin Zhou, Jun Zhang, Liefeng Bo, Tianyu Pang

MeanFlowNFT: Bringing Forward-Process RL to Average-Velocity Generators

MeanFlow generators achieve fast few-step sampling by predicting average velocities over time intervals, making them attractive for efficient generation. Reinforcement learning (RL) has become a powerful way to align diffusion and flow models with human preferences and task-specific objectives. In particular, DiffusionNFT offers an...

💬 0 commentsarXiv:2607.15273v1PDF
0

Posted in cs.CL · 2026-07-16 · Yasheng Sun, Zezi Zeng, Yifan Yang, Chong Luo, Wenyi Wang, Ziwei Liu, Jürgen Schmidhuber

SciDiagramEdit: Learning to Edit Scientific Diagrams from Paper Revisions

Editing the figures in a research paper is a routine and time-consuming part of everyday research practice: authors relabel components, rearrange panels, and restyle visuals as they revise their manuscripts. Automating this editing workflow under a natural-language instruction, however, is challenging, because a scientific figure is a...

💬 0 commentsarXiv:2607.15272v1PDF
0

Posted in cs.CV · 2026-07-16 · Baback Elmieh, Lynn Tsai, Zeman Li, Srinivas Kaza, Tiancheng Sun, Gabor Csapo, Ali Behrouz, Yuan Deng, Stephen Lombardi, Steven M. Seitz, Xuan Luo

Online Neural Space Time Memory for Dynamic Novel View Synthesis

Online novel view synthesis from multi-view streaming videos faces a fundamental trade-off: maintaining a persistent, long-horizon memory to reconstruct temporarily occluded regions while operating under strict real-time constraints. While Test-Time Training (TTT) offers a powerful memory mechanism, standard models mandate...

💬 0 commentsarXiv:2607.15271v1PDF
0

Posted in cs.DM · 2026-07-16 · Paul Orland, Lucas Fagan, Michele Tarquini, Davide Passaro, Maksymilian Manko, Elli Heyes, Angus Gruen, Giorgi Butbaia, Justin Tan, Sergei Gukov

A Census of New Snake-in-the-Box Records

The snake-in-the-box problem, introduced by Kautz in 1958, asks for the longest induced (chordless) path, called a snake, in the hypercube graph $Q_n$. The maximum length $a(n)$ is known in each dimension $n \leq 8$. We give snakes that are longer than the previous best-known in every dimension from $9$ to $13$, improving the lower...

💬 0 commentsarXiv:2607.15270v1PDF
0

Posted in cs.CV · 2026-07-16 · Guang Yang, Wentian Xu, Siyu Wang, Betty Raman, Lei Li, Vicente Grau

Motion-Conditioned Multi-View Fusion for Myocardial Infarction Localization from Echocardiography

Myocardial infarction (MI) remains a leading cause of mortality worldwide. Echocardiography (Echo) is a widely available modality for MI assessment, where regional wall motion abnormality is a key indicator. Prior learning based methods for myocardial motion analysis often use handcrafted descriptors or densely supervised estimation,...

💬 0 commentsarXiv:2607.15268v1PDF
0

Posted in cs.AI · 2026-07-16 · Victoria Graf, Hannaneh Hajishirzi, Noah A. Smith, David Kohlbrenner, Kyle Lo

Pretraining Data Can Be Poisoned through Computational Propaganda

Poisoning pretraining data can introduce harmful behaviors to LMs that are difficult to detect and mitigate. Prior work on poisoning pretraining data has largely exploited established data sources such as Wikipedia, which do not represent the large scale and heterogeneity typical of pretraining corpora, and has ignored the interaction...

💬 0 commentsarXiv:2607.15267v1PDF
0

Posted in cs.CV · 2026-07-16 · Mingfei Chen, Zijun Cui, Ruoke Zhang, Hyeonggon Ryu, Eli Shlizerman

SceneBind: Binding What and Where Across Vision, Audio and Language

We present SceneBind, an omni-modal representation of realistic scenes with joint semantic and 3D spatial understanding across vision, audio and language. Existing omni-modal encoders excel at instance-level semantics (i.e., what is present), but often lack explicit spatial structure (i.e., where it is). SceneBind addresses this gap...

💬 0 commentsarXiv:2607.15265v1PDF
0

Posted in cs.CR · 2026-07-16 · Paul Kassianik, Blaine Nelson, Yaron Singer

Beyond Success Rate: Cost-Aware Evaluation of Offensive and Defensive Security Agents

Security-agent evaluations commonly measure peak offensive capability under generous inference budgets, emphasizing vulnerability discovery, exploit development, penetration testing, and CTF completion. Such measurements are useful but incomplete: in operational security, every reasoning step, tool call, telemetry query, and...

💬 0 commentsarXiv:2607.15263v1PDF
0

Posted in cs.DS · 2026-07-16 · Prantar Ghosh, Sahil Kuchlous, Shravan Mehra, Sagnik Mukhopadhyay

The Power of the Score Sequence of a Tournament

What problems can one solve on a tournament if only its score sequence is known? Tournaments are oriented complete graphs that form an extensively-studied class of directed graphs (digraphs), both from combinatorial and algorithmic perspectives. Over the years, researchers have identified multiple classical digraph problems that can...

💬 0 commentsarXiv:2607.15260v1PDF
0

Posted in cs.LG · 2026-07-16 · Arthur G. Bubolz, Abreu Quevedo, Giancarlo Lucca, Rafael A. Berri, Eduardo Borges, Bruno L. Dalmazo

Decoding Market Emotion from Blockchain Activity: A Data-Driven Sentiment Classifier

The growing use of Bitcoin as a decentralized digital asset and investment tool has sparked strong interest in understanding its market behavior. This study presents a new approach to analyze Bitcoin market sentiment by combining on-chain and financial data with social media posts. Unlike models that aim to predict prices, this work...

💬 0 commentsarXiv:2607.15258v1PDF
0

Posted in cs.AI · 2026-07-16 · Yuyao Zhang, Junjie Gao, Zhengxian Wu, Jiaming Fan, Jin Zhang, Shihan Ma, Yao Yao, Weiran Qi, Chuyan Jin, Guiyu Ma, Xingzhong Xu, Kai Yang, Ji-Rong Wen, Zhicheng Dou

SearchOS-V1: Towards Robust Open-Domain Information-Seeking Agent Collaboration

Recent advances in Tool-Integrated Large Language Models have made web search a core capability of information-seeking agents. However, as interaction histories grow, agents increasingly struggle to track task progress. When search attempts fail to yield useful evidence, current single- and multi-agent systems can become trapped in...

💬 0 commentsarXiv:2607.15257v1PDF
0

Posted in cs.CV · 2026-07-16 · Pengcheng Zhou, Xuanyu Liu, Yanchen Yin, Bobo Li, Shengqiong Wu, Mong-Li Lee, Wynne Hsu

HoloGeo: Mitigating Landmark Bias in Geo-localization via Evidence-Driven Reasoning

Recent advances in Vision-Language Models (VLMs) have significantly improved image geo-localization, yet existing models remain susceptible to landmark bias, causing them to overlook geographical cues or form spurious correlations, ultimately resulting in inaccurate localization. To systematically investigate this issue, we first...

💬 0 commentsarXiv:2607.15255v1PDF
0

Posted in cs.LG · 2026-07-15 · Yang Liu, Yuhao Liu, Yunran Wei

A Noise-Robust Elicit-to-Optimize Framework for Distortion Riskmetrics via Inverse Reinforcement Learning

We propose a noise-robust elicit-to-optimize framework that integrates inverse reinforcement learning (IRL) and reinforcement learning (RL) for eliciting agents' risk preferences and optimizing policies under a broad class of risk objectives characterized by distortion riskmetrics. On the elicitation side, we propose an adaptive...

💬 0 commentsarXiv:2607.14373v1PDF
0

Posted in cs.LG · 2026-07-15 · Yiming Ma, Xinyu Chen

VAIOM: Continuous-Input, Discrete-Output Decoder-Only Financial Sequence Modeling

Financial observations are continuous, heterogeneous, and noisy, whereas decoder-only next-token models are usually built around discrete symbolic inputs. We introduce Vector-Input Autoregressive Inference for Ordinal-Return Modeling (VAIOM), a decoder-only Transformer for probabilistic next-return modeling on one-hour...

💬 0 commentsarXiv:2607.13929v1PDF
0

Posted in cs.LG · 2026-07-15 · Sanggyu Sean Choi

How Much of a 10-K Matters? Aggregation-Dependent Value of Full-Text versus Risk-Factor Sentiment

Financial sentiment extraction has largely relied on news text and supervised extraction against return labels alone, leaving 10-K filings -- and volatility, the target risk disclosure is arguably best suited to informing -- comparatively unexplored. We extend a supervised lexicon-learning approach to 10-K filings and their Item 1A...

💬 0 commentsarXiv:2607.14174v1PDF
0

Posted in cs.LG · 2026-07-12 · Wen-Ting Wang

Reinforcement Learning for Execution under Dynamic Fees in a Closed-Loop DEX Simulator

Trader-facing dynamic fees are increasingly proposed for automated market makers (AMMs), but historical data do not identify how order flow would respond: trader-facing fees do not vary, trader types are latent, and a replayed tape is not a sequential decision environment. We therefore construct a minimal closed-loop simulator in...

💬 0 commentsarXiv:2607.10960v1PDF
0

Posted in cs.LG · 2026-07-12 · Shuning Zhao, Patrick Wong, Leran Zhang, Xiaolin Hu

Diachronic Sample Integration: Robust Tail-Risk Estimation with Generative Models

Deep generative models are increasingly used as simulators for downstream decision-making under data scarcity, but in risk-sensitive applications their usefulness depends on rare adverse scenarios rather than typical samples. Standard generative objectives prioritize bulk distributional fidelity, leaving low-probability tails...

💬 0 commentsarXiv:2607.10810v1PDF
0

Posted in cs.CV · 2026-01-21 · Yingsong Huang, Hui Guo, Jing Huang, Bing Bai, Qi Xiong

Diffusion Epistemic Uncertainty with Asymmetric Learning for Diffusion-Generated Image Detection

The rapid progress of diffusion models highlights the growing need for detecting generated images. Previous research demonstrates that incorporating diffusion-based measurements, such as reconstruction error, can enhance the generalizability of detectors. However, ignoring the differing impacts of aleatoric and epistemic uncertainty...

💬 0 commentsarXiv:2601.14625v1PDF
0

Posted in cs.IT · 2026-01-21 · Canran Wang, Minghui Liwang, Netanel Raviv

Break-Resilient Codes with Loss Tolerance

Emerging applications in manufacturing, wireless communication, and molecular data storage require robust coding schemes that remain effective under physical distortions where codewords may be arbitrarily fragmented and partially missing. To address such challenges, we propose a new family of error-correcting codes, termed...

💬 0 commentsarXiv:2601.14623v1PDF
0

Posted in cs.RO · 2026-01-21 · Jiaqing Chang, Song Gao, Chaowei Dong, zhaobang Li, Yang Liu

Preparation and Motion Study of Magnetically Driven Micro Soft Robot Mimicking the Cownose Ray

In narrow, unstructured underwater environments such as environmental monitoring and minimally invasive medical procedures, micro soft robots exhibit unique advantages due to their flexible movement capabilities and small size. At the same time, applying bionic technology to the structural design of micro soft robots can significantly...

💬 0 commentsarXiv:2601.15349v2PDF
0

Posted in cs.RO · 2026-01-21 · Ling Xiao, Toshihiko Yamasaki

Probing Prompt Design for Socially Compliant Robot Navigation with Vision Language Models

Language models are increasingly used for social robot navigation, yet existing benchmarks largely overlook principled prompt design for socially compliant behavior. This limitation is particularly relevant in practice, as many systems rely on small vision language models (VLMs) for efficiency. Compared to large language models, small...

💬 0 commentsarXiv:2601.14622v1PDF
0

Posted in cs.IT · 2026-01-21 · Keigo Takeuchi

Direct and Converse Theorems in Estimating Signals with Sublinear Sparsity

This paper addresses the estimation of signals with sublinear sparsity sent over the additive white Gaussian noise channel. This fundamental problem arises in designing denoisers used in message-passing algorithms for sublinear sparsity. From a theoretical perspective, the main results are direct and converse theorems in the sublinear...

💬 0 commentsarXiv:2601.14621v3PDF