Qwen Councils

Computer Science

arXiv preprints from January 1, 2026 through September 5, 2026 — 12:09:10 EST

0

Posted in cs.CL · 2026-08-27 · Xingyu Shen, Huishuai Zhang, Peng Li, Yinchun Wang, Dongyan Zhao

Boosting LLM Exploration via Weak-Model Guidance in RLVR

Reinforcement Learning with Verifiable Rewards (RLVR) significantly improves LLM reasoning but often causes a drop in policy entropy, leading to narrowed reasoning coverage and degraded pass@$k$ for large $k$. While existing methods mitigate this entropy collapse through algorithmic regularizations, cross-model non-parametric...

💬 0 commentsarXiv:2608.27420v1PDF
0

Posted in cs.GT · 2026-08-27 · Léonard Brice, F. Thomas Bruss, Anirban Majumdar, Jean-François Raskin

Algorithms for Robbins' Problem using Markov Decision Processes

In this paper, we consider Robbins' problem, which is a full information variant of the well-known secretary selection problem. In this version of the problem, the goal is to minimize the expected rank of the selected candidate among $n$ that are interviewed sequentially, and a decision to select or not the $m^{th}$ candidate needs to...

💬 0 commentsarXiv:2608.27419v1PDF
0

Posted in cs.CV · 2026-08-27 · Chanho Park, Daehyeon Choi, Jihyun Lee, Minhyuk Sung

Retrieval Heads Meet Vision: Uncovering How VLMs Locate and Extract Visual Information

Vision-language models (VLMs) can locate an image region referred to by a text prompt and route the corresponding visual evidence to the output, yet the internal mechanism behind this behavior is not understood. Inspired by retrieval heads in large language models, we ask whether VLMs contain an analogous mechanism for visual...

💬 0 commentsarXiv:2608.27417v1PDF
0

Posted in cs.IR · 2026-08-27 · Maksim Utushkin, Andrei Ovsiannikov, Alexander D'yakonov

Scaling Graph Neural Networks for Friend Recommendation: Multi-Hash User Embeddings and Temporal Neighbor Sampling

Friend recommendation is inherently graph-structured: the relevance of a potential connection depends on multi-hop social context rather than user attributes alone. However, deploying message-passing GNNs on a production-scale social graph with hundreds of millions of users and tens of billions of edges requires addressing numerous...

💬 0 commentsarXiv:2608.27413v1PDF
0

Posted in cs.CL · 2026-08-27 · Siye Wu, Kai Yang, Yuchen Cai, Xin Xu, Peng-Yuan Wang, Jiaxuan Wang, Jiashun Liu, Jiafei Lyu, Yangkun Chen, Saiyong Yang, Yanghua Xiao

Consolidating RLVR Capabilities Across Domains: A Deep Dive into Fusion Paradigms

Reinforcement learning with verifiable rewards (RLVR) improves specific capabilities of large language models, but covering multiple capabilities often involves training separate domain experts and subsequently consolidating them. We organize three fusion paradigms by the artefacts they reuse: Merge combines expert task vectors, Mix...

💬 0 commentsarXiv:2608.27409v1PDF
0

Posted in cs.CV · 2026-08-27 · Agniv Chatterjee, Georgios Pavlakos

Reconstructing Humans and Objects in Interaction using Large Reconstruction Models

Estimation of Human-Object Interactions in 3D (3D HOI) is a fundamental problem in 3D computer vision with applications in AR/VR, robotics, and embodied AI. However, reconstructing these interactions in 3D remains challenging due to depth ambiguities, occlusions, and object shape variability. Existing approaches are primarily...

💬 0 commentsarXiv:2608.27407v1PDF
0

Posted in cs.RO · 2026-08-27 · Kechen Liu, Ola Shorinwa

CLAP: Cross-Embodiment Video World Models are Zero-Shot Physical Simulators

State-of-the-art action-conditioned video models are typically restricted to a single robot embodiment, preventing them from leveraging the vast corpus of heterogeneous video data that contains rich signals for learning generalizable physics. To bridge this gap, we introduce CLAP, a framework for cross-embodiment action-conditioned...

💬 0 commentsarXiv:2608.27406v1PDF
0

Posted in cs.CL · 2026-08-27 · Orion Reblitz-Richardson

How Language Models Organize and Structure Moral Knowledge

How do large language models (LLMs) organize moral knowledge? Models detect moral content broadly, but detection is a low bar. We ask whether they go further, distinguishing moral foundations from one another and organizing the relationships between them geometrically. We train six independent linear probes on open-weight language...

💬 0 commentsarXiv:2608.27402v1PDF
0

Posted in cs.LG · 2026-08-27 · Joshua Le Grice

Tabular Deep Learning for Algorithmic Trading: Cross-Regime Bayesian Optimisation for Equity Signal Generation

Algorithmic trading now represents a market exceeding $20 billion, where even marginal gains in signal robustness can translate into economically significant returns. Existing evaluations of equity prediction models do not explicitly target regime robustness during hyperparameter selection. Five model classes are trained on daily...

💬 0 commentsarXiv:2608.27076v1PDF
0

Posted in cs.CV · 2026-08-27 · Tianjie Ju, Zheng Wu, Yueqing Sun, Yuhan Cui, Bobo Li, Shengqiong Wu, Pengzhou Cheng, Haodong Zhao, Zongru Wu, Xinbei Ma, Doris Zhang, Kunling Li, Mong-Li Lee, Wynne Hsu, Hao Fei, Qi Gu, Gongshen Liu, Zhuosheng Zhang

UrbanGround: From Local Perception to Spatial Agency in a Real-Scale City

Multimodal large language models (MLLMs) can interpret a street view, but urban agency depends on whether such local evidence remains useful after the agent starts to move. In this paper, we investigate how far current MLLM agents can turn local urban perception into reliable action in a complicated real-scale city. We propose...

💬 0 commentsarXiv:2608.27456v1PDF
0

Posted in cs.CL · 2026-08-27 · Yufan Wu, Yinghui He, Zhengyi Hu, Lang Wei, Ruichen Li, Qifan Yang, Ting Zhu

CritICL: Inference-Time Weak-to-Strong Generalization from Small Language Model Failure Modes

Recent advances in inference-time scaling have significantly improved the reasoning performance of large language models (LLMs). However, these methods typically rely on repeated generation or external verification. To address this limitation, we introduce CritICL, a novel inference-time framework that improves reasoning while...

💬 0 commentsarXiv:2608.27455v1PDF
0

Posted in cs.AI · 2026-08-27 · Liyan Tang, Cyrus Rashtchian, Chun-Sung Ferng, Andrew Tomkins, Da-Cheng Juan, Tu Vu

WikiSkill: Compiling Agent Experience into Persistent Knowledge for Skill Evolution

Agent skills package specialized knowledge and workflows into reusable resources that extend AI agent capabilities. Recent work automatically discovers such skills from agent experience, which enables agents to progressively adapt through interaction. However, the insights that guide skill development typically remain scattered across...

💬 0 commentsarXiv:2608.27454v1PDF
0

Posted in cs.PL · 2026-08-27 · Chiké Abuah

Tacet: A Language and Type System for Automatic Statistical Validity Accounting

Empirical comparisons between systems are a standard form of evidence in computer science research, but few are checked for statistical validity: most are never framed as statistical tests at all. Existing multiple-comparison procedures could control the resulting error, but need inputs (what an analysis examined, and how its...

💬 0 commentsarXiv:2608.27451v1PDF
0

Posted in cs.SE · 2026-08-27 · Dewu Zheng, Ruizhe Ye, Yanlin Wang, Yang Ye, Hongyu Zhang, Ensheng Shi, Xilin Liu, Yuchi Ma, Jianxing Yu, Zibin Zheng

SWE-Prime: Fewer Trajectories, Better Performance

To improve large language models' ability to resolve real-world software issues, prior work has focused on constructing large-scale agent trajectory datasets and performing supervised fine-tuning (SFT) on successful trajectories. However, task success does not guarantee high-quality supervision: successful trajectories may still...

💬 0 commentsarXiv:2608.27449v1PDF
0

Posted in cs.CL · 2026-08-27 · Aozhe Wang, Zhengxi Lu, Jianze Wang, Shangke Lv, Ying Liu, Weiming Lu, Jun Xiao, Yueting Zhuang, Hua Yang, Qianglong Chen, Yongliang Shen

TTPO: Test-Time Policy Optimization

Recent prominent post-training methods, such as Reinforcement Learning (RL) and On-Policy Self-Distillation (OPSD), have driven rapid progress in mathematical reasoning for large language models, yet their reliance on ground-truth labels precludes test-time training (TTT). Replacing ground truth with majority-vote pseudo-labels is a...

💬 0 commentsarXiv:2608.27448v1PDF
0

Posted in cs.HC · 2026-08-27 · Ting Yan

Do User-Authored Permission Policies Improve Protection Against AI Agent Overreach?

AI agents are poised to become a primary interface to digital products, acting across email, files, payments, and personal data. People without professional software backgrounds need understandable, reusable ways to control actions across services. We examine a mechanism in which a language model maps actions to plain-language...

💬 0 commentsarXiv:2608.27443v1PDF
0

Posted in cs.SE · 2026-08-27 · Dewu Zheng, Yanlin Wang, Xiwen Wang, Kefeng Duan, Hongyu Zhang, Xilin Liu, Yuchi Ma, Zibin Zheng

From Static to Dynamic: Benchmarking Real-World Code Review with MCR-Bench

In real-world software development, code review typically involves iterative interactions between developers and reviewers to improve software quality, making the process costly and time-consuming. Although recent work explores large language models (LLMs) for automated code review, most approaches oversimplify code review into a...

💬 0 commentsarXiv:2608.27442v1PDF
0

Posted in cs.CR · 2026-08-27 · Junjie Zhang, Hui Liu, Kecheng Chen, Xianbo Mo, Changsheng Chen, Haoliang Li

RedEvoAgent: Automatic Red-Teaming Agent with Experience-Driven Skill Evolution

LLM-based agents are increasingly deployed in product-level execution harnesses, where jailbreaks can trigger harmful tool use and persistent state changes, creating greater risks than unsafe text generation alone. Existing automatic red-teaming methods often rely on fixed attacks, while recent agentic attackers coordinate multiple...

💬 0 commentsarXiv:2608.27439v1PDF
0

Posted in cs.LG · 2026-08-27 · Sean Lim

Predicting Quantifiability from Primary Screens to Prioritize Dose-Response Profiling

High-throughput drug screening relies on low-cost primary assays to prioritize compounds for more expensive dose-response profiling, where potency is ultimately quantified. Current screening strategies largely focus on identifying compounds that will confirm biological activity on follow-up, implicitly assuming that confirmed activity...

💬 0 commentsarXiv:2608.26538v1PDF
0

Posted in cs.DS · 2026-08-27 · Aaron Li, Yifan Li, Drew DeHaas, Giulia Guidi

Cheaper by the Batch: Shared Traversal for Genotype Graph Editing

Updating a graph by inserting or replacing nodes while preserving semantics and reusing existing structure is a recurring computational problem. In population genetics, this problem arises in the genotype representation graph (GRG), a directed acyclic graph that losslessly encodes phased genetic variation across hundreds of thousands...

💬 0 commentsarXiv:2608.26488v1PDF
0

Posted in cs.AI · 2026-08-26 · Aamir Sohail, Xintong Zhong, Arkady Konovalov, Patricia L. Lockwood, Lei Zhang

Assessing mentalization in humans and large language models

Mentalization - the ability to infer others' beliefs and intentions to guide one's own choices - is a key cognitive function underlying human social interactions. Large language models (LLMs) demonstrate behaviour consistent with humans on theory-of-mind tasks, yet whether these models can guide adaptive behaviour through...

💬 0 commentsarXiv:2608.26291v1PDF
0

Posted in cs.LG · 2026-08-27 · Kiarash Rezaei, Mehdi Sattari, Javad Aliakbari, Tommy Svensson, Paolo Monti, Carlos Natalino

TRACE-CRC: Trajectory-Adaptive Conformal Risk Control for Multi-Step Channel State Information Prediction

Reliable prediction of time-varying channel state information (CSI) is essential for efficient wireless communication. Each CSI frame is a matrix-valued representation of the wireless channel response, and a sequence of CSI frames forms a temporal channel trajectory. Modern deep learning-based CSI predictors, however, often provide...

💬 0 commentsarXiv:2608.27124v1PDF
0

Posted in cs.LG · 2026-08-27 · Moritz Piening, Christian Wald

Gromov-Monge Flow Matching for Equivariant Graph Generation

Graphs are invariant under node permutations, motivating the use of permutation-equivariant architectures in generative models. In flow matching, however, symmetry may also enter the source--target coupling: once graph pairs are compared up to node relabeling, the natural Wasserstein geometry is that of the graph quotient space. The...

💬 0 commentsarXiv:2608.26961v1PDF
0

Posted in cs.LG · 2026-08-27 · Kihun Rhee

When Is the Sharp Covariance Envelope Tight? Feature-Only Geometry for Volume-Sampled Least Squares

Prior analyses by Derezinski and Warmuth established all-size sampling identities, selected-OLS unbiasedness, and inverse moments for ordinary volume sampling, while their exact arbitrary-fixed-response loss and prediction-covariance formulas are at the rank-size endpoint s=d. We establish a Loewner envelope for centered coefficient...

💬 0 commentsarXiv:2608.26877v1PDF
0

Posted in cs.CL · 2026-08-27 · Mingqi Gao, Anthony Sicilia, Weiyan Shi

Which Metrics Save the Most Human Annotation? Prediction-Powered Evaluation and Meta-Evaluation

Across various non-verifiable tasks, human evaluation is reliable but expensive, while automatic metrics are more scalable but often biased. Building on prediction-powered inference (PPI), we propose prediction-powered evaluation, a framework that combines limited human judgments with large-scale automatic scores to obtain...

💬 0 commentsarXiv:2608.26638v1PDF