Qwen Councils

Computer Science

arXiv preprints from January 1, 2026 through July 28, 2026 — 03:39:28 EST

0

Posted in cs.DB · 2026-01-09 · Shreya Shankar, Sepanta Zeighami, Aditya Parameswaran

Task Cascades for Efficient Unstructured Data Processing

Modern database systems allow users to query or process unstructured text or document columns using LLM-powered functions. Users can express an operation in natural language (e.g., "identify if this review mentions billing issues"), with the system executing the operation on each document, in a row-by-row fashion. One way to reduce...

💬 0 commentsarXiv:2601.05536v1PDF
0

Posted in cs.CV · 2026-01-09 · Qiwei Yang, Pingping Zhang, Yuhao Wang, Zijing Gong

SAS-VPReID: A Scale-Adaptive Framework with Shape Priors for Video-based Person Re-Identification at Extreme Far Distances

Video-based Person Re-IDentification (VPReID) aims to retrieve the same person from videos captured by non-overlapping cameras. At extreme far distances, VPReID is highly challenging due to severe resolution degradation, drastic viewpoint variation and inevitable appearance noise. To address these issues, we propose a Scale-Adaptive...

💬 0 commentsarXiv:2601.05535v1PDF
0

Posted in cs.CR · 2026-01-09 · Nicholas J. C. Papadopoulos

Blockchain Verifiable Proof of Quantum Supremacy as a Trigger for Quantum-Secure Signatures

Blockchain is a decentralized, distributed ledger technology that ensures transparency, security, and immutability through cryptographic techniques. However, advancements in quantum computing threaten the security of classical cryptographic schemes, jeopardizing blockchain integrity once cryptographic quantum supremacy is achieved....

💬 0 commentsarXiv:2601.05534v2PDF
0

Posted in cs.RO · 2026-01-09 · Kandai Watanabe, Nicholas Renninger, Sriram Sankaranarayanan, Morteza Lahijanian

Learning specifications for reactive synthesis with safety constraints

This paper presents a novel approach to learning from demonstration that enables robots to autonomously execute complex tasks in dynamic environments. We model latent tasks as probabilistic formal languages and introduce a tailored reactive synthesis framework that balances robot costs with user task preferences. Our methodology...

💬 0 commentsarXiv:2601.05533v1PDF
0

Posted in cs.SE · 2026-01-09 · Nafisha Tamanna Nice

Bug Severity Prediction in Software Projects Using Supervised Machine Learning Models

Bug severity prediction is important in software maintenance, because it helps the development teams to prioritize bugs that have a significant impact on the operation, stability and security of the system. In large software projects bug repositories will grow at very rapid rate making classification of severity manual work labourious...

💬 0 commentsarXiv:2603.00004v1PDF
0

Posted in cs.AI · 2026-01-09 · Jua Han, Jaeyoon Seo, Jungbin Min, Sieun Choi, Huichan Seo, Jihie Kim, Jean Oh

Before We Trust Them: Decision-Making Failures in Navigation of Foundation Models

High success rates on navigation-related tasks do not necessarily translate into reliable decision making by foundation models. To examine this gap, we evaluate current models on six diagnostic tasks spanning three settings: reasoning under complete spatial information, reasoning under incomplete spatial information, and reasoning...

💬 0 commentsarXiv:2601.05529v5PDF
0

Posted in cs.LG · 2026-01-09 · Rui An, Haohao Qu, Wenqi Fan, Xuequn Shang, Qing Li

DeMa: Dual-Path Delay-Aware Mamba for Efficient Multivariate Time Series Analysis

Accurate and efficient multivariate time series (MTS) analysis is increasingly critical for a wide range of intelligent applications. Within this realm, Transformers have emerged as the predominant architecture due to their strong ability to capture pairwise dependencies. However, Transformer-based models suffer from quadratic...

💬 0 commentsarXiv:2601.05527v2PDF
0

Posted in cs.CL · 2026-01-09 · Jivnesh Sandhan, Harshit Jaiswal, Fei Cheng, Yugo Murawaki

Can We Trust LLM Detectors?

The rapid adoption of LLMs has increased the need for reliable AI text detection, yet existing detectors often fail outside controlled benchmarks. We systematically evaluate 2 dominant paradigms (training-free and supervised) and show that both are brittle under distribution shift, unseen generators, and simple stylistic...

💬 0 commentsarXiv:2601.15301v2PDF
0

Posted in cs.AI · 2026-01-09 · Ricardo Vinuesa, Steven L. Brunton, Gianmarco Mengaldo

Explainable AI: Learning from the Learners

Artificial intelligence now outperforms humans in several scientific and engineering tasks, yet its internal representations often remain opaque. In this Perspective, we argue that explainable artificial intelligence (XAI), combined with causal reasoning, enables {\it learning from the learners}. Focusing on discovery, optimization...

💬 0 commentsarXiv:2601.05525v2PDF
0

Posted in cs.CL · 2026-01-09 · Yuhao Shen, Tianyu Liu, Junyi Shen, Jinyang Wu, Quan Kong, Li Huan, Cong Wang

Double: Breaking the Acceleration Limit via Double Retrieval Speculative Parallelism

Parallel Speculative Decoding (PSD) accelerates traditional Speculative Decoding (SD) by overlapping draft generation with verification. However, it remains hampered by two fundamental challenges: (1) a theoretical speedup ceiling dictated by the speed ratio between the draft and target models, and (2) high computational waste and...

💬 0 commentsarXiv:2601.05524v3PDF
0

Posted in cs.LG · 2026-01-09 · Jiayu Fang, Zhiqi Shao, Haoning Xi, Boris Choy, Junbin Gao

Toward an Integrated Cross-Urban Accident Prevention System: A Multi-Task Spatial-Temporal Learning Framework for Urban Safety Management

The development of a cross-city accident prevention system is particularly challenging due to the heterogeneity, inconsistent reporting, and inherently clustered, sparse, cyclical, and noisy nature of urban accident data. These intrinsic data properties, combined with fragmented governance and incompatible reporting standards, have...

💬 0 commentsarXiv:2601.05521v1PDF
0

Posted in cs.CL · 2026-01-09 · Xuemei Tang, Chengxi Yan, Jinghang Gu, Chu-Ren Huang

CHisAgent: A Multi-Agent Framework for Event Taxonomy Construction in Ancient Chinese Cultural Systems

Despite strong performance on many tasks, large language models (LLMs) show limited ability in historical and cultural reasoning, particularly in non-English contexts such as Chinese history. Taxonomic structures offer an effective mechanism to organize historical knowledge and improve understanding. However, manual taxonomy...

💬 0 commentsarXiv:2601.05520v1PDF
0

Posted in cs.HC · 2026-01-09 · Yuxuan Huang, Qiao Jin, Tongyu Nie, Victoria Interrante, Evan Suma Rosenberg

Secure Text Entry using a Virtual Radial Keyboard with Dynamically Resized Keys and Non-Intrusive Randomization

As virtual reality (VR) becomes more widely adopted, secure and efficient text entry is an increasingly critical need. In this paper, we identify a vulnerability in a state-of-the-art secure VR text entry method and introduce a novel virtual radial keyboard designed to achieve a balance between security with usability. Keys are...

💬 0 commentsarXiv:2601.05516v1PDF
0

Posted in cs.LG · 2026-01-09 · Cheng Yan, Wuyang Zhang, Zhiyuan Ning, Fan Xu, Ziyang Tao, Lu Zhang, Bing Yin, Yanyong Zhang

Breaking Model Lock-in: Cost-Efficient Zero-Shot LLM Routing via a Universal Latent Space

The rapid proliferation of Large Language Models (LLMs) has led to a fragmented and inefficient ecosystem, a state of ``model lock-in'' where seamlessly integrating novel models remains a significant bottleneck. Current routing frameworks require exhaustive, costly retraining, hindering scalability and adaptability. We introduce...

💬 0 commentsarXiv:2601.06220v1PDF
0

Posted in cs.IR · 2026-01-09 · Lei Wang, Jinhang Wu, Zhibin Wang, Biye Li

LEAPS: An LLM-Empowered Adaptive Plugin in Taobao AI Search

The rapid rise of large language models has shifted user search behavior from discrete keywords to natural-language, multi-constraint queries--a shift existing e-commerce search architectures struggle to accommodate. Users face a dilemma: precise natural-language queries often trigger zero-result scenarios, while forced simplification...

💬 0 commentsarXiv:2601.05513v2PDF
0

Posted in cs.CV · 2026-01-09 · Xuan Cheng, Jiahao Rao, Chengyang Li, Wenhao Wang, Weilin Chen, Lvqing Yang

GaussianSwap: Animatable Video Face Swapping with 3D Gaussian Splatting

We introduce GaussianSwap, a novel video face swapping framework that constructs a 3D Gaussian Splatting based face avatar from a target video while transferring identity from a source image to the avatar. Conventional video swapping frameworks are limited to generating facial representations in pixel-based formats. The resulting...

💬 0 commentsarXiv:2601.05511v1PDF
0

Posted in cs.MA · 2026-01-09 · Yi-Ning Weng, Hsuan-Wei Lee

How Exploration Breaks Cooperation in Shared-Policy Multi-Agent Reinforcement Learning

Multi-agent reinforcement learning in dynamic social dilemmas commonly relies on parameter sharing to enable scalability. We show that in shared-policy Deep Q-Network learning, standard exploration can induce a robust and systematic collapse of cooperation even in environments where fully cooperative equilibria are stable and payoff...

💬 0 commentsarXiv:2601.05509v1PDF
0

Posted in cs.CV · 2026-01-09 · Fuwen Luo, Zihao Wan, Ziyue Wang, Yaluo Liu, Pau Tong Lin Xu, Xuanjia Qiao, Xiaolong Wang, Peng Li, Yang Liu

Enabling Stroke-Level Structural Analysis of Hieroglyphic Scripts without Language-Specific Priors

Hieroglyphs, as logographic writing systems, encode rich semantic and cultural information within their internal structural composition. Yet, current advanced Large Language Models (LLMs) and Multimodal LLMs (MLLMs) usually remain structurally blind to this information. LLMs process characters as textual tokens, while MLLMs...

💬 0 commentsarXiv:2601.05508v2PDF
0

Posted in cs.CL · 2026-01-09 · Yubo Hou, Zhisheng Chen, Tao Wan, Zengchang Qin

FlashMem: Distilling Intrinsic Latent Memory via Computation Reuse

The stateless architecture of Large Language Models inherently lacks the mechanism to preserve dynamic context, compelling agents to redundantly reprocess history to maintain long-horizon autonomy. While latent memory offers a solution, current approaches are hindered by architectural segregation, relying on auxiliary encoders that...

💬 0 commentsarXiv:2601.05505v2PDF
0

Posted in cs.CR · 2026-01-09 · Balachandra Devarangadi Sunil, Isheeta Sinha, Piyush Maheshwari, Shantanu Todmal, Shreyan Mallik, Shuchi Mishra

Memory Poisoning Attack and Defense on Memory Based LLM-Agents

Large language model agents equipped with persistent memory are vulnerable to memory poisoning attacks, where adversaries inject malicious instructions through query only interactions that corrupt the agents long term memory and influence future responses. Recent work demonstrated that the MINJA (Memory Injection Attack) achieves over...

💬 0 commentsarXiv:2601.05504v2PDF
0

Posted in cs.CR · 2026-01-09 · Zhi Yang, Runguo Li, Qiqi Qiang, Jiashun Wang, Fangqi Lou, Mengping Li, Dongpo Cheng, Rui Xu, Heng Lian, Shuo Zhang, Xiaolong Liang, Xiaoming Huang, Zheng Wei, Zhaowei Liu, Xin Guo, Huacan Wang, Ronghao Chen, Liwen Zhang

FinVault: Benchmarking Financial Agent Safety in Execution-Grounded Environments

Financial agents powered by large language models (LLMs) are increasingly deployed for investment analysis, risk assessment, and automated decision-making, where their abilities to plan, invoke tools, and manipulate mutable state introduce new security risks in high-stakes and highly regulated financial environments. However, existing...

💬 0 commentsarXiv:2601.07853v1PDF
0

Posted in cs.LG · 2026-01-09 · Roy Xie, Deepak Gopinath, David Qiu, Dong Lin, Haitian Sun, Saloni Potdar, Bhuwan Dhingra

Over-Searching in Search-Augmented Large Language Models

Search-augmented large language models (LLMs) excel at knowledge-intensive tasks by integrating external retrieval. However, they often over-search -- unnecessarily invoking search tool even when it does not improve response quality, which leads to computational inefficiency and hallucinations by incorporating irrelevant context. In...

💬 0 commentsarXiv:2601.05503v2PDF
0

Posted in cs.SE · 2026-01-09 · Gideon Peters, SayedHassan Khatoonabadi, Emad Shihab

Evaluating the Use of LLMs for Automated DOM-Level Resolution of Web Performance Issues

Users demand fast, seamless webpage experiences, yet developers often struggle to meet these expectations within tight constraints. Performance optimization, while critical, is a time-consuming and often manual process. One of the most complex tasks in this domain is modifying the Document Object Model (DOM), which is why this study...

💬 0 commentsarXiv:2601.05502v1PDF
0

Posted in cs.AI · 2026-01-09 · Bingyi Liu, Jinbo He, Haiyong Shi, Enshu Wang, Weizhen Han, Jingxiang Hao, Peixi Wang, Zhuangzhuang Zhang

CHDP: Cooperative Hybrid Diffusion Policies for Reinforcement Learning in Parameterized Action Space

Hybrid action space, which combines discrete choices and continuous parameters, is prevalent in domains such as robot control and game AI. However, efficiently modeling and optimizing hybrid discrete-continuous action space remains a fundamental challenge, mainly due to limited policy expressiveness and poor scalability in...

💬 0 commentsarXiv:2601.05675v2PDF
0

Posted in cs.IT · 2026-01-09 · Torben Kölle, Alexander Stutz-Tirri, Christoph Studer

On the Complexity of Electromagnetic Far-Field Modeling

Modern wireless systems are envisioned to employ antenna architectures that not only transmit and receive electromagnetic (EM) waves, but also intentionally reflect and possibly transform incident EM waves. In this paper, we propose a mathematically rigorous framework grounded in Maxwell's equations for analyzing the complexity of EM...

💬 0 commentsarXiv:2601.05674v1PDF