Qwen Councils
arXiv could not process that search. Try a simpler keyword search or an arXiv field query such as all:quantum.
Showing downloaded papers while arXiv is unavailable.

Computer Science

arXiv preprints from January 1, 2026 through September 14, 2026 — 00:06:18 EST

0

Posted in cs.LO · 2026-01-08 · Denis Kuperberg, Damian Niwiński, Paweł Parys, Michał Skrzypczak

Generalised Quantifiers Based on Rabin-Mostowski Index

In this work we introduce new generalised quantifiers which allow us to express the Rabin-Mostowski index of automata. Our main results study expressive power and decidability of the monadic second-order (MSO) logic extended with these quantifiers. We study these problems in the realm of both $ω$-words and infinite trees. As it turns...

💬 0 commentsarXiv:2601.04739v1PDF
0

Posted in cs.CR · 2026-01-08 · Anh-Kiet Duong, Petra Gomez-Krämer, Hoàng-Ân Lê, Minh-Tan Pham

Leveraging Membership Inference Attacks for Privacy Measurement in Federated Learning for Remote Sensing Images

Federated Learning (FL) enables collaborative model training while keeping training data localized, allowing us to preserve privacy in various domains including remote sensing. However, recent studies show that FL models may still leak sensitive information through their outputs, motivating the need for rigorous privacy evaluation. In...

💬 0 commentsarXiv:2601.06200v1PDF
0

Posted in cs.CL · 2026-01-08 · Han Zhu, Jiale Chen, Chengkun Cai, Shengjie Sun, Haoran Li, Yujin Zhou, Chi-Min Chan, Pengcheng Wen, Lei Li, Sirui Han, Yike Guo

AM$^3$Safety: Towards Data Efficient Alignment of Multi-modal Multi-turn Safety for MLLMs

Multi-modal Large Language Models (MLLMs) are increasingly deployed in interactive applications. However, their safety vulnerabilities become pronounced in multi-turn multi-modal scenarios, where harmful intent can be gradually reconstructed across turns, and security protocols fade into oblivion as the conversation progresses....

💬 0 commentsarXiv:2601.04736v1PDF
0

Posted in cs.CV · 2026-01-08 · Yunqing Hu, Zheming Yang, Chang Zhao, Qi Guo, Meng Gao, Pengcheng Li, Wen Ji

AIVD: Adaptive Edge-Cloud Collaboration for Accurate and Efficient Industrial Visual Detection

Multimodal large language models (MLLMs) demonstrate exceptional capabilities in semantic understanding and visual reasoning, yet they still face challenges in precise object localization and resource-constrained edge-cloud deployment. To address this, this paper proposes the AIVD framework, which achieves unified precise localization...

💬 0 commentsarXiv:2601.04734v1PDF
0

Posted in cs.AI · 2026-01-08 · Shuyang Jiang, Yuhao Wang, Ya Zhang, Yanfeng Wang, Yu Wang

Miner:Mining Intrinsic Mastery for Data-Efficient RL in Large Reasoning Models

Current critic-free RL methods for large reasoning models suffer from severe inefficiency when training on positive homogeneous prompts (where all rollouts are correct), resulting in waste of rollouts due to zero advantage estimates. We introduce a radically simple yet powerful solution to \uline{M}ine \uline{in}trinsic...

💬 0 commentsarXiv:2601.04731v2PDF
0

Posted in cs.HC · 2026-01-08 · Miki Okamura, Shuhey Koyama, Li Jingjing, Yoichi Ochiai

OnomaCompass: A Texture Exploration Interface that Shuttles between Words and Images

Humans can finely perceive material textures, yet articulating such somatic impressions in words is a cognitive bottleneck in design ideation. We present OnomaCompass, a web-based exploration system that links sound-symbolic onomatopoeia and visual texture representations to support early-stage material discovery. Instead of requiring...

💬 0 commentsarXiv:2601.04915v1PDF
0

Posted in cs.CR · 2026-01-08 · Damian Harenčák, Lukáš Gajdošech, Martin Madaras

Decentralized Privacy-Preserving Federal Learning of Computer Vision Models on Edge Devices

Collaborative training of a machine learning model comes with a risk of sharing sensitive or private data. Federated learning offers a way of collectively training a single global model without the need to share client data, by sharing only the updated parameters from each client's local model. A central server is then used to...

💬 0 commentsarXiv:2601.04912v1PDF
0

Posted in cs.AI · 2026-01-08 · Mustafa F. Abdelwahed, Joan Espasa, Alice Toniolo, Ian P. Gent

From Stories to Cities to Games: A Qualitative Evaluation of Behaviour Planning

The primary objective of a diverse planning approach is to generate a set of plans that are distinct from one another. Such an approach is applied in a variety of real-world domains, including risk management, automated stream data analysis, and malware detection. More recently, a novel diverse planning paradigm, referred to as...

💬 0 commentsarXiv:2601.04911v2PDF
0

Posted in cs.LG · 2026-01-08 · Sifan Yang, Wenhao Yang, Wei Jiang, Lijun Zhang

Distributed Online Convex Optimization with Efficient Communication: Improved Algorithm and Lower bounds

We investigate distributed online convex optimization with compressed communication, where $n$ learners connected by a network collaboratively minimize a sequence of global loss functions using only local information and compressed data from neighbors. Prior work has established regret bounds of...

💬 0 commentsarXiv:2601.04907v2PDF
0

Posted in cs.DC · 2026-01-08 · Vincent Maillou, Matthias Bollhofer, Olaf Schenk, Alexandros Nikolaos Ziogas, Mathieu Luisier

Parallel Quadratic Selected Inversion in Quantum Transport Simulation

Driven by Moore's Law, the dimensions of transistors have been pushed down to the nanometer scale. Advanced quantum transport (QT) solvers are required to accurately simulate such nano-devices. The non-equilibrium Green's function (NEGF) formalism lends itself optimally to these tasks, but it is computationally very intensive,...

💬 0 commentsarXiv:2601.04904v1PDF
0

Posted in cs.FL · 2026-01-08 · Sławomir Lasota, Mathieu Lehaut, Julie Parreaux, Radosław Piórkowski

One-clock synthesis problems

We study a generalisation of Büchi-Landweber games to the timed setting. The winning condition is specified by a non-deterministic timed automaton, and one of the players can elapse time. We perform a systematic study of synthesis problems in all variants of timed games, depending on which player's winning condition is specified, and...

💬 0 commentsarXiv:2601.04902v1PDF
0

Posted in cs.MS · 2026-01-08 · Michèle Loday-Richaud, Marc Mezzarobba, Pascal Remy

Rigorous numerical computation of the Stokes multipliers for linear differential equations with single level one

We describe a practical algorithm for computing the Stokes multipliers of a linear differential equation with polynomial coefficients at an irregular singular point of single level one. The algorithm follows a classical approach based on Borel summation and numerical ODE solving, but avoids a large amount of redundant work compared to...

💬 0 commentsarXiv:2601.04901v1PDF
0

Posted in cs.CV · 2026-01-08 · Hongyi Li, William Ward Armstrong, Jun Xu

Rotation-Robust Regression with Convolutional Model Trees

We study rotation-robust learning for image inputs using Convolutional Model Trees (CMTs) [1], whose split and leaf coefficients can be structured on the image grid and transformed geometrically at deployment time. In a controlled MNIST setting with a rotation-invariant regression target, we introduce three geometry-aware inductive...

💬 0 commentsarXiv:2601.04899v1PDF
0

Posted in cs.CL · 2026-01-08 · Ziteng Wang, Yujie He, Guanliang Li, Siqi Yang, Jiaqi Xiong, Songxiang Liu

V-FAT: Benchmarking Visual Fidelity Against Text-bias

Recent advancements in Multimodal Large Language Models (MLLMs) have demonstrated impressive performance on standard visual reasoning benchmarks. However, there is growing concern that these models rely excessively on linguistic shortcuts rather than genuine visual grounding, a phenomenon we term Text Bias. In this paper, we...

💬 0 commentsarXiv:2601.04897v1PDF
0

Posted in cs.AI · 2026-01-08 · Renzhao Liang, Jingru Chen, Bo Jia, Bo Deng, Chenggang Xie, Yidong Wang, Ke Jin, Xin Wang, Linfeng Zhang, Cunxiang Wang

DVD: A Robust Method for Detecting Variant Contamination in Large Language Model Evaluation

Evaluating large language models (LLMs) is increasingly confounded by \emph{variant contamination}: the training corpus contains semantically equivalent yet lexically or syntactically altered versions of test items. Unlike verbatim leakage, these paraphrased or structurally transformed variants evade existing detectors based on...

💬 0 commentsarXiv:2601.04895v1PDF
0

Posted in cs.CV · 2026-01-08 · Suyash Mishra, Qiang Li, Srikanth Patil, Satyanarayan Pati, Baddu Narendra

Scaling Vision Language Models for Pharmaceutical Long Form Video Reasoning on Industrial GenAI Platform

Vision Language Models (VLMs) have shown strong performance on multimodal reasoning tasks, yet most evaluations focus on short videos and assume unconstrained computational resources. In industrial settings such as pharmaceutical content understanding, practitioners must process long-form videos under strict GPU, latency, and cost...

💬 0 commentsarXiv:2601.04891v1PDF
0

Posted in cs.LG · 2026-01-08 · Maksim Velikanov, Ilyas Chahed, Jingwei Zuo, Dhia Eddine Rhaiem, Younes Belkada, Hakim Hacid

Learnable Multipliers: Freeing the Scale of Language Model Matrix Layers

Applying weight decay (WD) to matrix layers is standard practice in large-language-model pretraining. Prior work suggests that stochastic gradient noise induces a Brownian-like expansion of the weight matrices W, whose growth is counteracted by WD, leading to a WD-noise equilibrium with a certain weight norm ||W||. In this work, we...

💬 0 commentsarXiv:2601.04890v1PDF
0

Posted in cs.CL · 2026-01-08 · Favour Yahdii Aghaebe, Tanefa Apekey, Elizabeth Williams, Nafise Sadat Moosavi

Faithful Summarisation under Disagreement via Belief-Level Aggregation

Opinion and multi-document summarisation often involve genuinely conflicting viewpoints, yet many existing approaches, particularly LLM-based systems, implicitly smooth disagreement and over-represent majority opinions. This limits the faithfulness of generated summaries in opinion-heavy settings. We introduce a disagreement-aware...

💬 0 commentsarXiv:2601.04889v1PDF
0

Posted in cs.AI · 2026-01-08 · Tongyu Wen, Guanting Dong, Zhicheng Dou

SmartSearch: Process Reward-Guided Query Refinement for Search Agents

Large language model (LLM)-based search agents have proven promising for addressing knowledge-intensive problems by incorporating information retrieval capabilities. Existing works largely focus on optimizing the reasoning paradigms of search agents, yet the quality of intermediate search queries during reasoning remains overlooked....

💬 0 commentsarXiv:2601.04888v1PDF
0

Posted in cs.AI · 2026-01-08 · Sofiene Lassoued, Laxmikant Shrikant Bahetic, Nathalie Weiß-Borkowskib, Stefan Lierc, Andreas Schwunga

Flexible Manufacturing Systems Intralogistics: Dynamic Optimization of AGVs and Tool Sharing Using Coloured-Timed Petri Nets and Actor-Critic RL with Actions Masking

Flexible Manufacturing Systems (FMS) are pivotal in optimizing production processes in today's rapidly evolving manufacturing landscape. This paper advances the traditional job shop scheduling problem by incorporating additional complexities through the simultaneous integration of automated guided vehicles (AGVs) and tool-sharing...

💬 0 commentsarXiv:2601.04887v1PDF
0

Posted in cs.SE · 2026-01-08 · Jingzhi Gong, Giovanni Pinna, Yixin Bian, Jie M. Zhang

Analyzing Message-Code Inconsistency in AI Coding Agent-Authored Pull Requests

Pull request (PR) descriptions generated by AI coding agents are the primary channel for communicating code changes to human reviewers. However, the alignment between these messages and the actual changes remains unexplored, raising concerns about the trustworthiness of AI agents. To fill this gap, we analyzed 23,247 agentic PRs...

💬 0 commentsarXiv:2601.04886v2PDF
0

Posted in cs.CL · 2026-01-08 · Ao Sun, Xiaoyu Wang, Zhe Tan, Yu Li, Jiachen Zhu, Yuheng Jia, Shu Su

CuMA: Aligning LLMs with Sparse Cultural Values via Demographic-Aware Mixture of Adapters

As Large Language Models (LLMs) serve a global audience, alignment must transition from enforcing universal consensus to respecting cultural pluralism. We demonstrate that dense models, when forced to fit conflicting value distributions, suffer from \textbf{Mean Collapse}, converging to a generic average that fails to represent...

💬 0 commentsarXiv:2601.04885v3PDF
0

Posted in cs.AI · 2026-01-08 · Issa Hanou, Eric Kemmeren, Devin Wild Thomas, Mathijs de Weerdt

Precomputing Multi-Agent Path Replanning Using Temporal Flexibility

Executing a multi-agent plan can be challenging when an agent is delayed, because this typically creates conflicts with other agents. So, we need to quickly find a new safe plan. Replanning only the delayed agent often does not yield an efficient plan, and sometimes cannot even yield a feasible one. On the other hand, replanning other...

💬 0 commentsarXiv:2601.04884v3PDF
0

Posted in cs.NI · 2026-01-08 · Mattia Figaro, Francesco Rossato, Marco Giordani, Alessandro Traspadini, Takayuki Shimizu, Chinmay Mahabal, Sanjeewa Herath, Chunghan Lee, Dogan Kutay Pekcan, Michele Zorzi

5G NR Non-Terrestrial Networks: From Early Results to the Road Ahead

This paper overviews the 3GPP 5G NR-NTN standard, detailing the evolution from Rel. 18 to 19 and innovations for Rel. 20. Using realistic ns-3 simulations validated against 3GPP calibration data, we evaluate various satellite network configurations. The results highlight the potential of NTNs to extend wireless connectivity to remote...

💬 0 commentsarXiv:2601.04882v2PDF
0

Posted in cs.RO · 2026-01-08 · Kiyoung Choi, Juwon Jeong, Sehoon Oh

Zero Wrench Control via Wrench Disturbance Observer for Learning-free Peg-in-hole Assembly

This paper proposes a Dynamic Wrench Disturbance Observer (DW-DOB) designed to achieve highly sensitive zero-wrench control in contact-rich manipulation. By embedding task-space inertia into the observer nominal model, DW-DOB cleanly separates intrinsic dynamic reactions from true external wrenches. This preserves sensitivity to small...

💬 0 commentsarXiv:2601.04881v1PDF