Qwen Councils

Computer Science

arXiv preprints from January 1, 2026 through September 11, 2026 — 20:51:21 EST

0

Posted in cs.DL · 2026-01-15 · Andreas Florath

Aletheia-Probe: A Tool for Automated Journal Assessment

Assessing journal legitimacy during literature reviews, publication venue selection, and citation verification requires consulting information scattered across multiple incompatible data-sets. This paper introduces Aletheia-Probe, an open-source tool that systematically aggregates curated databases and pattern analysis from multiple...

💬 0 commentsarXiv:2601.10431v1PDF
0

Posted in cs.IT · 2026-01-15 · Yifei Huang, Kai Wan, Minquan Cheng, Jinyan Wang, Giuseppe Caire

Placement Delivery Array for Cache-Aided MIMO Systems

We consider a $(G,L,K,M,N)$ cache-aided multiple-input multiple-output (MIMO) network, where a server equipped with $L$ antennas and a library of $N$ equal-size files communicates with $K$ users, each equipped with $G$ antennas and a cache of size $M$ files, over a wireless interference channel. Each user requests an arbitrary file...

💬 0 commentsarXiv:2601.10422v1PDF
0

Posted in cs.CL · 2026-01-15 · Philip Resnik

Are Language Models Models?

Futrell and Mahowald claim LMs "serve as model systems", but an assessment at each of Marr's three levels suggests the claim is clearly not true at the implementation level, poorly motivated at the algorithmic-representational level, and problematic at the computational theory level. LMs are good candidates as tools; calling them...

💬 0 commentsarXiv:2601.10421v1PDF
0

Posted in cs.LG · 2026-01-15 · Nadav Merlis

Reinforcement Learning with Multi-Step Lookahead Information Via Adaptive Batching

We study tabular reinforcement learning problems with multiple steps of lookahead information. Before acting, the learner observes $\ell$ steps of future transition and reward realizations: the exact state the agent would reach and the rewards it would collect under any possible course of action. While it has been shown that such...

💬 0 commentsarXiv:2601.10418v1PDF
0

Posted in cs.HC · 2026-01-15 · Ruiyong Zhang

EmoTrack: An application to Facilitate User Reflection on Their Online Behaviours

With the rapid growth of the internet, all online activities can have both positive and negative effects on human mental health. Online engagement is complex and efforts to regulate online use face challenges in distinguishing between beneficial and harmful content and behaviours. An alternative approach is to help young people...

💬 0 commentsarXiv:2602.15839v1PDF
0

Posted in cs.AI · 2026-01-15 · Tiesunlong Shen, Rui Mao, Jin Wang, Heming Sun, Jian Zhang, Xuejie Zhang, Erik Cambria

LLMdoctor: Token-Level Flow-Guided Preference Optimization for Efficient Test-Time Alignment of Large Language Models

Aligning Large Language Models (LLMs) with human preferences is critical, yet traditional fine-tuning methods are computationally expensive and inflexible. While test-time alignment offers a promising alternative, existing approaches often rely on distorted trajectory-level signals or inefficient sampling, fundamentally capping...

💬 0 commentsarXiv:2601.10416v1PDF
0

Posted in cs.AI · 2026-01-15 · Haiyue Yuan, Nikolay Matyunin, Ali Raza, Shujun Li

LADFA: A Framework of Using Large Language Models and Retrieval-Augmented Generation for Personal Data Flow Analysis in Privacy Policies

Privacy policies help inform people about organisations' personal data processing practices, covering different aspects such as data collection, data storage, and sharing of personal data with third parties. Privacy policies are often difficult for people to fully comprehend due to the lengthy and complex legal language used and...

💬 0 commentsarXiv:2601.10413v1PDF
0

Posted in cs.CL · 2026-01-15 · Mihai Dan Nadas, Laura Diosan, Andreea Tomescu, Andrei Piscoran

TF3-RO-50M: Training Compact Romanian Language Models from Scratch on Synthetic Moral Microfiction

Recent advances in synthetic data generation have shown that compact language models can be trained effectively when the underlying corpus is structurally controlled and linguistically coherent. However, for morphologically rich and computationally under-resourced languages such as Romanian, there is still no openly documented,...

💬 0 commentsarXiv:2601.10410v1PDF
0

Posted in cs.LG · 2026-01-15 · Yuanjie Zhao, Junnan Qiu, Yue Ding, Jie Li

CS-GBA: A Critical Sample-based Gradient-guided Backdoor Attack for Offline Reinforcement Learning

Offline Reinforcement Learning (RL) enables policy optimization from static datasets but is inherently vulnerable to backdoor attacks. Existing attack strategies typically struggle against safety-constrained algorithms (e.g., CQL) due to inefficient random poisoning and the use of easily detectable Out-of-Distribution (OOD) triggers....

💬 0 commentsarXiv:2601.10407v1PDF
0

Posted in cs.AI · 2026-01-15 · Weiping Fu, Bifan Wei, Jingyi Hao, Yushun Zhang, Jian Zhang, Jiaxin Wang, Bo Li, Yu He, Lingling Zhang, Jun Liu

ErrEval: Error-Aware Evaluation for Question Generation through Explicit Diagnostics

Automatic Question Generation (QG) often produces outputs with critical defects, such as factual hallucinations and answer mismatches. However, existing evaluation methods, including LLM-based evaluators, mainly adopt a black-box and holistic paradigm without explicit error modeling, leading to the neglect of such defects and...

💬 0 commentsarXiv:2601.10406v1PDF
0

Posted in cs.LG · 2026-01-15 · Mohsin Hasan, Viktor Ohanesian, Artem Gazizov, Yoshua Bengio, Alán Aspuru-Guzik, Roberto Bondesan, Marta Skreta, Kirill Neklyudov

Discrete Feynman-Kac Correctors

Discrete diffusion models have recently emerged as a promising alternative to the autoregressive approach for generating discrete sequences. Sample generation via gradual denoising or demasking processes allows them to capture hierarchical non-sequential interdependencies in the data. These custom processes, however, do not assume a...

💬 0 commentsarXiv:2601.10403v1PDF
0

Posted in cs.AI · 2026-01-15 · Xinyu Zhu, Yuzhu Cai, Zexi Liu, Bingyang Zheng, Cheng Wang, Rui Ye, Yuzhi Zhang, Linfeng Zhang, Weinan E, Siheng Chen, Yanfeng Wang

Toward Ultra-Long-Horizon Agentic Science: Cognitive Accumulation for Machine Learning Engineering

The advancement of artificial intelligence toward agentic science is currently bottlenecked by the challenge of ultra-long-horizon autonomy, the ability to sustain strategic coherence and iterative correction over experimental cycles spanning days or weeks. While Large Language Models (LLMs) have demonstrated prowess in short-horizon...

💬 0 commentsarXiv:2601.10402v5PDF
0

Posted in cs.AI · 2026-01-15 · Xuancheng Ren, Shijing Hu, Zhihui Lu, Jiangqi Huang, Qiang Duan

LatentRefusal: Latent-Signal Refusal for Unanswerable Text-to-SQL Queries

In LLM-based text-to-SQL systems, unanswerable and underspecified user queries may generate not only incorrect text but also executable programs that yield misleading results or violate safety constraints, posing a major barrier to safe deployment. Existing refusal strategies for such queries either rely on output-level instruction...

💬 0 commentsarXiv:2601.10398v3PDF
0

Posted in cs.SD · 2026-01-15 · Runyuan Cai, Yu Lin, Yiming Wang, Chunlin Fu, Xiaodong Zeng

Unifying Speech Recognition, Synthesis and Conversion with Autoregressive Transformers

Traditional speech systems typically rely on separate, task-specific models for text-to-speech (TTS), automatic speech recognition (ASR), and voice conversion (VC), resulting in fragmented pipelines that limit scalability, efficiency, and cross-task generalization. In this paper, we present General-Purpose Audio (GPA), a unified audio...

💬 0 commentsarXiv:2601.10770v1PDF
0

Posted in cs.IT · 2026-01-15 · Wenbo Huang, Minquan Cheng, Kai Wan, Xiaojun Li, Robert Caiming Qiu, Giuseppe Caire

Multiaccess Coded Caching with Heterogeneous Retrieval Costs

The multiaccess coded caching (MACC) system, as formulated by Hachem {\it et al.}, consists of a central server with a library of $N$ files, connected to $K$ cache-less users via an error-free shared link, and $K$ cache nodes, each equipped with cache memory of size $M$ files. Each user can access $L$ neighboring cache nodes under a...

💬 0 commentsarXiv:2601.10394v2PDF
0

Posted in cs.CV · 2026-01-15 · Hassan Eshkiki, Sarah Costa, Mostafa Mohammadpour, Farinaz Tanhaei, Christopher H. George, Fabio Caraffini

Multi-Temporal Frames Projection for Dynamic Processes Fusion in Fluorescence Microscopy

Fluorescence microscopy is widely employed for the analysis of living biological samples; however, the utility of the resulting recordings is frequently constrained by noise, temporal variability, and inconsistent visualisation of signals that oscillate over time. We present a unique computational framework that integrates information...

💬 0 commentsarXiv:2601.10392v1PDF
0

Posted in cs.IT · 2026-01-15 · Liujia Yao, Changsheng You, Zixuan Huang, Chao Zhou, Zhaohui Yang, Xiaoyang Li

Codebook Design for Limited Feedback in Near-Field XL-MIMO Systems

In this paper, we study efficient codebook design for limited feedback in extremely large-scale multiple-input-multiple-output (XL-MIMO) frequency division duplexing (FDD) systems. It is worth noting that existing codebook designs for XL-MIMO, such as polar-domain codebook, have not well taken into account user (location) distribution...

💬 0 commentsarXiv:2601.10391v1PDF
0

Posted in cs.CL · 2026-01-15 · Tarun Sharma, Manikandan Ravikiran, Sourava Kumar Behera, Pramit Bhattacharya, Arnab Bhattacharya, Rohit Saluja

INDIC DIALECT: A Multi Task Benchmark to Evaluate and Translate in Indian Language Dialects

Recent NLP advances focus primarily on standardized languages, leaving most low-resource dialects under-served especially in Indian scenarios. In India, the issue is particularly important: despite Hindi being the third most spoken language globally (over 600 million speakers), its numerous dialects remain underrepresented. The...

💬 0 commentsarXiv:2601.10388v1PDF
0

Posted in cs.DC · 2026-01-15 · Xiangchen Li, Jiakun Fan, Qingyuan Wang, Dimitrios Spatharakis, Saeid Ghafouri, Hans Vandierendonck, Deepu John, Bo Ji, Ali R. Butt, Dimitrios S. Nikolopoulos

WISP: Waste- and Interference-Suppressed Distributed Speculative LLM Serving at the Edge via Dynamic Drafting and SLO-Aware Batching

As Large Language Models (LLMs) become increasingly accessible to end users, an ever-growing number of inference requests are initiated from edge devices and computed on centralized GPU clusters. However, the resulting exponential growth in computation workload is placing significant strain on data centers, while edge devices remain...

💬 0 commentsarXiv:2601.11652v2PDF
0

Posted in cs.PF · 2026-01-15 · Fang Zhou, Yuyang Huang, Miao Yu, Sixiang Ma, Tongping Liu, Yang Wang

Long-term Monitoring of Kernel and Hardware Events to Understand Latency Variance

This paper presents our experience to understand latency variance caused by kernel and hardware events, which are often invisible at the application level. For this purpose, we have built VarMRI, a tool chain to monitor and analyze those events in the long term. To mitigate the "big data" problem caused by long-term monitoring, VarMRI...

💬 0 commentsarXiv:2601.10572v1PDF
0

Posted in cs.CL · 2026-01-15 · Tommaso Felice Banfi, Sashenka Gamage

LLMs for Game Theory: Entropy-Guided In-Context Learning and Adaptive CoT Reasoning

We propose a novel LLM-based framework for reasoning in discrete, game-theoretic tasks, illustrated with \emph{Tic-Tac-Toe}. The method integrates in-context learning with entropy-guided chain-of-thought (CoT) reasoning and adaptive context retrieval. The model dynamically adjusts both the number of retrieved examples and reasoning...

💬 0 commentsarXiv:2601.10775v2PDF
0

Posted in cs.IT · 2026-01-15 · Man Ting Wong, Siu-Wing Cheng

Sparse Signal Recovery from Random Measurements

Given the compressed sensing measurements of an unknown vector $z \in \mathbb{R}^n$ using random matrices, we present a simple method to determine $z$ without solving any optimization problem or linear system. Our method uses $Θ(\log n)$ random sensing matrices in $\mathbb{R}^{k \times n}$ and runs in $O(kn\log n)$ time, where $k =...

💬 0 commentsarXiv:2601.10569v2PDF
0

Posted in cs.AI · 2026-01-15 · Laura Ferrarotti, Gian Maria Campedelli, Roberto Dessì, Andrea Baronchelli, Giovanni Iacca, Kathleen M. Carley, Alex Pentland, Joel Z. Leibo, James Evans, Bruno Lepri

Generative AI collective behavior needs an interactionist paradigm

In this article, we argue that understanding the collective behavior of agents based on large language models (LLMs) is an essential area of inquiry, with important implications in terms of risks and benefits, impacting us as a society at many levels. We claim that the distinctive nature of LLMs--namely, their initialization with...

💬 0 commentsarXiv:2601.10567v1PDF
0

Posted in cs.CL · 2026-01-15 · Syed Naveed Mahmood, Md. Rezaur Rahman Bhuiyan, Tasfia Zaman, Jareen Tasneem Khondaker, Md. Sameer Sakib, K. M. Shadman Wadith, Nazia Tasnim, Farig Sadeque

Representation-Aware Unlearning via Activation Signatures: From Suppression to Entity-Signature Erasure

Entity-level unlearning is usually evaluated by what a model says: whether it stops naming the target, refuses a query, or shifts a Truth Ratio distribution. These output-level tests, however, do not show whether a subject's internal representation has been attenuated. We introduce the Entity Representation Unlearning Framework...

💬 0 commentsarXiv:2601.10566v5PDF
0

Posted in cs.SI · 2026-01-15 · Dávid Ferenczi, Jean-Gabriel Young, Leto Peel

Inferring signed social networks from contact patterns

Social networks are typically inferred from indirect observations, such as proximity data; yet, most methods cannot distinguish between absent relationships and actual negative ties, as both can result in few or no interactions. We address the challenge of inferring signed networks from contact patterns while accounting for whether...

💬 0 commentsarXiv:2601.10565v2PDF