Qwen Councils

Computer Science

arXiv preprints from January 1, 2026 through July 28, 2026 — 10:21:19 EST

0

Posted in cs.LG · 2026-01-09 · Ayoub Ajarra, Debabrota Basu

Auditing Fairness under Model Updates: Fundamental Complexity and Property-Preserving Updates

As machine learning models become increasingly embedded in societal infrastructure, auditing them for bias is of growing importance. However, in real-world deployments, auditing is complicated by the fact that model owners may adaptively update their models in response to changing environments, such as financial markets. These updates...

💬 0 commentsarXiv:2601.05909v1PDF
0

Posted in cs.CV · 2026-01-09 · Aya Kaysan Bahjat

A survey of facial recognition techniques

As multimedia content is quickly growing, the field of facial recognition has become one of the major research fields, particularly in the recent years. The most problematic area to researchers in image processing and computer vision is the human face which is a complex object with myriads of distinctive features that can be used to...

💬 0 commentsarXiv:2601.06239v1PDF
0

Posted in cs.CL · 2026-01-09 · Haoming Xu, Ningyuan Zhao, Yunzhi Yao, Weihong Xu, Hongru Wang, Xinle Deng, Shumin Deng, Jeff Z. Pan, Huajun Chen, Ningyu Zhang

Illusions of Confidence? Diagnosing LLM Truthfulness via Neighborhood Consistency

As Large Language Models (LLMs) are increasingly deployed in real-world settings, correctness alone is insufficient. Reliable deployment requires maintaining truthful beliefs under contextual perturbations. Existing evaluations largely rely on point-wise confidence like Self-Consistency, which can mask brittle belief. We show that...

💬 0 commentsarXiv:2601.05905v2PDF
0

Posted in cs.CY · 2026-01-09 · Michael Henry Tessler, Georgina Evans, Michiel A. Bakker, Iason Gabriel, Sophie Bridgers, Rishub Jain, Raphael Koster, Verena Rieser, Anca Dragan, Matthew Botvinick, Christopher Summerfield

Can AI mediation improve democratic deliberation?

The strength of democracy lies in the free and equal exchange of diverse viewpoints. Living up to this ideal at scale faces inherent tensions: broad participation, meaningful deliberation, and political equality often trade off with one another (Fishkin, 2011). We ask whether and how artificial intelligence (AI) could help navigate...

💬 0 commentsarXiv:2601.05904v1PDF
0

Posted in cs.CL · 2026-01-09 · Zihang Tian, Rui Li, Jingsen Zhang, Xiaohe Bo, Wei Huo, Xu Chen

HAPS: Hierarchical LLM Routing with Joint Architecture and Parameter Search

Large language model (LLM) routing aims to exploit the specialized strengths of different LLMs for diverse tasks. However, existing approaches typically focus on selecting LLM architectures while overlooking parameter settings, which are critical for task performance. In this paper, we introduce HAPS, a hierarchical LLM routing...

💬 0 commentsarXiv:2601.05903v1PDF
0

Posted in cs.AI · 2026-01-09 · Dawei Wang, Chengming Zhou, Di Zhao, Xinyuan Liu, Marci Chi Ma, Gary Ushaw, Richard Davison

TowerMind: A Tower Defence Game Learning Environment and Benchmark for LLM as Agents

Recent breakthroughs in Large Language Models (LLMs) have positioned them as a promising paradigm for agents, with long-term planning and decision-making emerging as core general-purpose capabilities for adapting to diverse scenarios and tasks. Real-time strategy (RTS) games serve as an ideal testbed for evaluating these two...

💬 0 commentsarXiv:2601.05899v2PDF
0

Posted in cs.LO · 2026-01-09 · Jakob Piribauer, Vinzent Zschuppe

The Modal Logic of Abstraction Refinement

Iterative abstraction refinement techniques are one of the most prominent paradigms for the analysis and verification of systems with large or infinite state spaces. This paper investigates the changes of truth values of system properties expressible in computation tree logic (CTL) when abstractions of transition systems are refined....

💬 0 commentsarXiv:2601.05897v2PDF
0

Posted in cs.AI · 2026-01-09 · Ruizhe Zhang, Xinke Jiang, Zhibang Yang, Zhixin Zhang, Jiaran Gao, Yuzhen Xiao, Tao Feng, Yue Fang, Yuxuan Liu, Ruiqing Li, Hongbin Lai, Huheng Huang, Xu Chu, Junfeng Zhao, Yasha Wang

StackPlanner: A Centralized Hierarchical Multi-Agent System with Task-Experience Memory Management

Multi-agent systems based on large language models, particularly centralized architectures, have recently shown strong potential for complex and knowledge-intensive tasks. However, central agents often suffer from unstable long-horizon collaboration due to the lack of memory management, leading to context bloat, error accumulation,...

💬 0 commentsarXiv:2601.05890v2PDF
0

Posted in cs.LG · 2026-01-09 · Doyoung Kim, Donghee Lee, Hye-Sung Lee, Jiheon Lee, Jaeok Yi

GlueNN: gluing patchwise analytic solutions with neural networks

In the analysis of complex physical systems, the objective often extends beyond merely computing a numerical solution to capturing the precise crossover between different regimes and extracting parameters containing meaningful information. However, standard numerical solvers and conventional deep learning approaches, such as...

💬 0 commentsarXiv:2601.05889v2PDF
0

Posted in cs.CR · 2026-01-09 · Víctor Mayoral-Vilches, María Sanz-Gómez, Francesco Balassone, Stefan Rass, Lidia Salas-Espejo, Benjamin Jablonski, Luis Javier Navarrete-Lozano, Maite del Mundo de Torres, Cristóbal R. J. Veas Chavez

Cybersecurity AI: A Game-Theoretic AI for Guiding Attack and Defense

AI-driven penetration testing now executes thousands of actions per hour but still lacks the strategic intuition humans apply in competitive security. To build cybersecurity superintelligence --Cybersecurity AI exceeding best human capability-such strategic intuition must be embedded into agentic reasoning processes. We present...

💬 0 commentsarXiv:2601.05887v1PDF
0

Posted in cs.DS · 2026-01-09 · Michael Kapralov, Ekaterina Kochetkova, Weronika Wrzos-Kaminska

Spectral Clustering in Birthday Paradox Time

Given a vertex in a $(k, \varphi, ε)$-clusterable graph, i.e. a graph whose vertex set can be partitioned into a disjoint union of $\varphi$-expanders of size $\approx n/k$ with outer conductance bounded by $ε$, can one quickly tell which cluster it belongs to? This question goes back to the expansion testing problem of Goldreich and...

💬 0 commentsarXiv:2601.05883v1PDF
0

Posted in cs.CL · 2026-01-09 · Constantinos Karouzos, Xingwei Tan, Nikolaos Aletras

An Empirical Study on Preference Tuning Generalization and Diversity Under Domain Shift

Preference tuning aligns pretrained language models to human judgments of quality, helpfulness, or safety by optimizing over explicit preference signals rather than likelihood alone. Prior work has shown that preference-tuning degrades performance and reduces helpfulness when evaluated outside the training domain. However, the extent...

💬 0 commentsarXiv:2601.05882v1PDF
0

Posted in cs.CL · 2026-01-09 · Jakub Harasta, Matej Vasina, Martin Kornel, Tomas Foltynek

Gender Bias in LLMs: Preliminary Evidence from Shared Parenting Scenario in Czech Family Law

Access to justice remains limited for many people, leading laypersons to increasingly rely on Large Language Models (LLMs) for legal self-help. Laypeople use these tools intuitively, which may lead them to form expectations based on incomplete, incorrect, or biased outputs. This study examines whether leading LLMs exhibit gender bias...

💬 0 commentsarXiv:2601.05879v1PDF
0

Posted in cs.CL · 2026-01-09 · Meghana Sunil, Manikandarajan Venmathimaran, Muthu Subash Kavitha

iReasoner: Trajectory-Aware Intrinsic Reasoning Supervision for Self-Evolving Large Multimodal Models

Recent work shows that large multimodal models (LMMs) can self-improve from unlabeled data via self-play and intrinsic feedback. Yet existing self-evolving frameworks mainly reward final outcomes, leaving intermediate reasoning weakly constrained despite its importance for visually grounded decision making. We propose iReasoner, a...

💬 0 commentsarXiv:2601.05877v3PDF
0

Posted in cs.CL · 2026-01-09 · Santosh Srinath K, Mudit Somani, Varun Reddy Padala, Prajna Devi Upadhyay, Abhijit Das

Continual-learning for Modelling Low-Resource Languages from Large Language Models

Modelling a language model for a multi-lingual scenario includes several potential challenges, among which catastrophic forgetting is the major challenge. For example, small language models (SLM) built for low-resource languages by adapting large language models (LLMs) pose the challenge of catastrophic forgetting. This work proposes...

💬 0 commentsarXiv:2601.05874v1PDF
0

Posted in cs.IT · 2026-01-09 · Javad Maheri, K. K. Krishnan Namboodiri, Petros Elia

Universal and Asymptotically Optimal Data and Task Allocation in Distributed Computing

We study the joint minimization of communication and computation costs in distributed computing, where a master node coordinates $N$ workers to evaluate a function over a library of $n$ files. Assuming that the function is decomposed into an arbitrary subfunction set $\mathbf{X}$, with each subfunction depending on $d$ input files,...

💬 0 commentsarXiv:2601.05873v1PDF
0

Posted in cs.LG · 2026-01-09 · Huilin Deng, Hongchen Luo, Yue Zhu, Long Li, Zhuoyue Chen, Xinghao Zhao, Ming Li, Jihai Zhang, Mengchang Wang, Yang Cao, Yu Kang

IIB-LPO: Latent Policy Optimization via Iterative Information Bottleneck

Recent advances in Reinforcement Learning with Verifiable Rewards (RLVR) for Large Language Model (LLM) reasoning have been hindered by a persistent challenge: exploration collapse. The semantic homogeneity of random rollouts often traps models in narrow, over-optimized behaviors. While existing methods leverage policy entropy to...

💬 0 commentsarXiv:2601.05870v1PDF
0

Posted in cs.CL · 2026-01-09 · Maxime Dassen, Rebecca Kotula, Kenton Murray, Andrew Yates, Dawn Lawrie, Efsun Kayi, James Mayfield, Kevin Duh

FACTUM: Mechanistic Detection of Citation Hallucination in Long-Form RAG

Retrieval-Augmented Generation (RAG) models are critically undermined by citation hallucinations, a deceptive failure where a model cites a source that fails to support its claim. While existing work attributes hallucination to a simple over-reliance on parametric knowledge, we reframe this failure as an evolving, scale-dependent...

💬 0 commentsarXiv:2601.05866v4PDF
0

Posted in cs.CR · 2026-01-09 · Federico Mazzone, Giorgio Micali, Massimiliano Pronesti

Secure Change-Point Detection for Time Series under Homomorphic Encryption

We introduce the first method for change-point detection on encrypted time series. Our approach employs the CKKS homomorphic encryption scheme to detect shifts in statistical properties (e.g., mean, variance, frequency) without ever decrypting the data. Unlike solutions based on differential privacy, which degrade accuracy through...

💬 0 commentsarXiv:2601.05865v1PDF
0

Posted in cs.CL · 2026-01-09 · Jonathan Downie, Joss Moorkens

What do the metrics mean? A critical analysis of the use of Automated Evaluation Metrics in Interpreting

With the growth of interpreting technologies, from remote interpreting and Computer-Aided Interpreting to automated speech translation and interpreting avatars, there is now a high demand for ways to quickly and efficiently measure the quality of any interpreting delivered. A range of approaches to fulfil the need for quick and...

💬 0 commentsarXiv:2601.05864v1PDF
0

Posted in cs.SI · 2026-01-09 · Alexandra Dache, Arnaud Vandaele, Nicolas Gillis

Matrix Factorization Framework for Community Detection under the Degree-Corrected Block Model

Community detection is a fundamental task in data analysis, and block models provide an approach for identifying a wide variety of community structures while offering high interpretability. The degree-corrected block model (DCBM) is an established model that accounts for the heterogeneity of node degrees. However, inference methods...

💬 0 commentsarXiv:2601.06262v2PDF
0

Posted in cs.CL · 2026-01-09 · Chengming Cui, Tianxin Wei, Ziyi Chen, Ruizhong Qiu, Zhichen Zeng, Zhining Liu, Xuying Ning, Duo Zhou, Jingrui He

AdaFuse: Adaptive Ensemble Decoding with Test-Time Scaling for LLMs

Large language models (LLMs) exhibit complementary strengths arising from differences in pretraining data, model architectures, and decoding behaviors. Inference-time ensembling provides a practical way to combine these capabilities without retraining. However, existing ensemble approaches suffer from fundamental limitations. Most...

💬 0 commentsarXiv:2601.06022v1PDF
0

Posted in cs.CL · 2026-01-09 · Jiajie Zhang, Xin Lv, Ling Feng, Lei Hou, Juanzi Li

Chaining the Evidence: Robust Reinforcement Learning for Deep Search Agents with Citation-Aware Rubric Rewards

Reinforcement learning (RL) has emerged as a critical technique for enhancing LLM-based deep search agents. However, existing approaches primarily rely on binary outcome rewards, which fail to capture the comprehensiveness and factuality of agents' reasoning process, and often lead to undesirable behaviors such as shortcut...

💬 0 commentsarXiv:2601.06021v1PDF
0

Posted in cs.SI · 2026-01-09 · David A. Meyer, Asif Shakeel

Mobility Trajectories from Network-Driven Markov Dynamics

We present a generative model of human mobility in which trajectories arise as realizations of a prescribed, time-dependent Markov dynamics defined on a spatial interaction network. The model constructs a hierarchical routing structure with hubs, corridors, feeder paths, and metro links, and specifies transition matrices using...

💬 0 commentsarXiv:2601.06020v1PDF