Qwen Councils

Computer Science

arXiv preprints from January 1, 2026 through September 11, 2026 — 08:06:09 EST

0

Posted in cs.LG · 2026-01-14 · G Dhinesh Chandran, Kota Srinivas Reddy, Srikrishna Bhashyam

Efficient Clustering in Stochastic Bandits

We study the Bandit Clustering (BC) problem under the fixed confidence setting, where the objective is to group a collection of data sequences (arms) into clusters through sequential sampling from adaptively selected arms at each time step while ensuring a fixed error probability at the stopping time. We consider a setting where arms...

💬 0 commentsarXiv:2601.09162v1PDF
0

Posted in cs.IR · 2026-01-14 · Zhibo Zhang, Yang Xu, Kai Ming Ting, Cam-Tu Nguyen

LLMs Meet Isolation Kernel: Lightweight, Learning-free Binary Embeddings for Fast Retrieval

Large language models (LLMs) have recently enabled remarkable progress in text representation. However, their embeddings are typically high-dimensional, leading to substantial storage and retrieval overhead. Although recent approaches such as Matryoshka Representation Learning (MRL) and Contrastive Sparse Representation (CSR)...

💬 0 commentsarXiv:2601.09159v4PDF
0

Posted in cs.CR · 2026-01-14 · Mitchell Petingola

Deep Learning-based Binary Analysis for Vulnerability Detection in x86-64 Machine Code

While much of the current research in deep learning-based vulnerability detection relies on disassembled binaries, this paper explores the feasibility of extracting features directly from raw x86-64 machine code. Although assembly language is more interpretable for humans, it requires more complex models to capture token-level...

💬 0 commentsarXiv:2601.09157v1PDF
0

Posted in cs.LG · 2026-01-14 · Woojin Kim, Changkwon Lee, Hyeoncheol Kim

KTCF: Actionable Recourse in Knowledge Tracing via Counterfactual Explanations for Education

Using Artificial Intelligence to improve teaching and learning benefits greater adaptivity and scalability in education. Knowledge Tracing (KT) is recognized for student modeling task due to its superior performance and application potential in education. To this end, we conceptualize and investigate counterfactual explanation as the...

💬 0 commentsarXiv:2601.09156v1PDF
0

Posted in cs.CV · 2026-01-14 · Josué Martínez-Martínez, Olivia Brown, Giselle Zeno, Pooya Khorrami, Rajmonda Caceres

From Snow to Rain: Evaluating Robustness, Calibration, and Complexity of Model-Based Robust Training

Robustness to natural corruptions remains a critical challenge for reliable deep learning, particularly in safety-sensitive domains. We study a family of model-based training approaches that leverage a learned nuisance variation model to generate realistic corruptions, as well as new hybrid strategies that combine random coverage with...

💬 0 commentsarXiv:2601.09153v1PDF
0

Posted in cs.CV · 2026-01-14 · Laure Ciernik, Marco Morik, Lukas Thede, Luca Eyring, Shinichi Nakajima, Zeynep Akata, Lukas Muttenthaler

Attentive multilayer fusion for vision transformers

With the rise of large-scale foundation models, efficiently adapting them to downstream tasks remains a central challenge. Linear probing, which freezes the backbone and trains a lightweight head, is computationally efficient but often restricted to last-layer representations. We show that task-relevant information is distributed...

💬 0 commentsarXiv:2601.09322v2PDF
0

Posted in cs.CR · 2026-01-14 · Zhiyi Mou, Jingyuan Yang, Zeheng Qian, Wangze Ni, Tianfang Xiao, Ning Liu, Chen Zhang, Zhan Qin, Kui Ren

SpatialJB: How Text Distribution Art Becomes the "Jailbreak Key" for LLM Guardrails

While Large Language Models (LLMs) have powerful capabilities, they remain vulnerable to jailbreak attacks, which is a critical barrier to their safe web real-time application. Current commercial LLM providers deploy output guardrails to filter harmful outputs, yet these defenses are not impenetrable. Due to LLMs' reliance on...

💬 0 commentsarXiv:2601.09321v1PDF
0

Posted in cs.CV · 2026-01-14 · Anil Egin, Andrea Tangherloni, Antitza Dantcheva

Now You See Me, Now You Don't: A Unified Framework for Expression Consistent Anonymization in Talking Head Videos

Face video anonymization is aimed at privacy preservation while allowing for the analysis of videos in a number of computer vision downstream tasks such as expression recognition, people tracking, and action recognition. We propose here a novel unified framework referred to as Anon-NET, streamlined to de-identify facial videos, while...

💬 0 commentsarXiv:2601.11635v1PDF
0

Posted in cs.RO · 2026-01-14 · Ro'i Lang, Elon Rimon

Feedback-Based Mobile Robot Navigation in 3-D Environments Using Artificial Potential Functions Technical Report

This technical report presents the construction and analysis of polynomial navigation functions for motion planning in 3-D workspaces populated by spherical and cylindrical obstacles. The workspace is modeled as a bounded spherical region, and obstacles are encoded using smooth polynomial implicit functions. We establish conditions...

💬 0 commentsarXiv:2601.09318v1PDF
0

Posted in cs.CV · 2026-01-14 · Xinming Fang, Chaoyan Huang, Juncheng Li, Jun Wang, Jun Shi, Guixu Zhang

Frequency Error-Guided Under-sampling Optimization for Multi-Contrast MRI Reconstruction

Magnetic resonance imaging (MRI) plays a vital role in clinical diagnostics, yet it remains hindered by long acquisition times and motion artifacts. Multi-contrast MRI reconstruction has emerged as a promising direction by leveraging complementary information from fully-sampled reference scans. However, existing approaches suffer from...

💬 0 commentsarXiv:2601.09316v1PDF
0

Posted in cs.DS · 2026-01-14 · Arshia Ataee Naeini, Amir-Parsa Mobed, Masoud Seddighin, Saeed Seddighin

Dynamic Pattern Matching with Wildcards

We study the fully dynamic pattern matching problem where the pattern may contain up to kwildcard symbols, each matching any symbol of the alphabet. Both the text and the pattern are subject to updates (insert, delete, change). We design an algorithm with O(nlog^2 n) preprocessing and update/query time O(knk/k+1 + k2 log n). The bound...

💬 0 commentsarXiv:2601.16182v1PDF
0

Posted in cs.CL · 2026-01-14 · Jonathan Drechsel, Erisa Bytyqi, Steffen Herbold

Understanding or Memorizing? A Case Study of German Definite Articles in Language Models

Language models perform well on grammatical agreement, but it is unclear whether this reflects rule-based generalization or memorization. We study this question for German definite singular articles, whose forms depend on gender and case. Using GRADIEND, a gradient-based interpretability method, we learn parameter update directions...

💬 0 commentsarXiv:2601.09313v2PDF
0

Posted in cs.IT · 2026-01-14 · Peter Harremoës

An Information Theoretic Proof of the Radon-Nikodym Theorem

The Radon-Nikodym theorem plays a significant role in the definition of Shannon entropy, f-divergences, and other basic quantities in information theory. The existence of Radon Nikodym derivates appear in many text books in measure theory but in text books on probability or information theory it is often omitted because the proof is...

💬 0 commentsarXiv:2601.09308v2PDF
0

Posted in cs.IR · 2026-01-14 · Xin Xia, Hongzhi Yin, Shane Culpepper

On-Device Large Language Models for Sequential Recommendation

On-device recommendation is critical for a number of real-world applications, especially in scenarios that have agreements on execution latency, user privacy, and robust functionality when internet connectivity is unstable or even impossible. While large language models (LLMs) can now provide exceptional capabilities that model user...

💬 0 commentsarXiv:2601.09306v1PDF
0

Posted in cs.LG · 2026-01-14 · Sota Sugawara, Yuji Kawamata, Akihiro Toyoda, Tomoru Nakayama, Yukihiko Okada

Single-Round Clustered Federated Learning via Data Collaboration Analysis for Non-IID Data

Federated Learning (FL) enables distributed learning across multiple clients without sharing raw data. When statistical heterogeneity across clients is severe, Clustered Federated Learning (CFL) can im-prove performance by grouping similar clients and training cluster-wise models. However, most CFL approaches rely on multiple...

💬 0 commentsarXiv:2601.09304v2PDF
0

Posted in cs.AI · 2026-01-14 · Herman Cappelen, Simon Goldstein, John Hawthorne

AI Survival Stories: a Taxonomic Analysis of AI Existential Risk

Since the release of ChatGPT, there has been a lot of debate about whether AI systems pose an existential risk to humanity. This paper develops a general framework for thinking about the existential risk of AI systems. We analyze a two premise argument that AI systems pose a threat to humanity. Premise one: AI systems will become...

💬 0 commentsarXiv:2601.09765v1PDF
0

Posted in cs.IT · 2026-01-14 · Minhan Gao, Kenneth Shum

Regenerating codes with minimal disk I/O cost achieving optimal tradeoff between storage and repair bandwidth

There are multiple performance metrics in the design of coding schemes for distributed storage systems. The first metric is called repair bandwidth, which measures the network resources required during the repair process. Another critical metric for repair efficiency is disk I/O cost, defined as the amount of data packets accessed at...

💬 0 commentsarXiv:2601.09300v1PDF
0

Posted in cs.GT · 2026-01-14 · Ziheng Chen, Bo Li, Zihan Luo, Jialin Zhang

On the Fair Allocation to Asymmetric Agents with Binary XOS Valuations

We study the problem of allocating $m$ indivisible goods among $n$ agents, where each agent's valuation is fractionally subadditive (XOS). With respect to AnyPrice Share (APS) fairness, Kulkarni et al. (2024) showed that, when agents have binary marginal values, a $0.1222$-APS allocation can be found in polynomial time, and there...

💬 0 commentsarXiv:2601.09299v1PDF
0

Posted in cs.CV · 2026-01-14 · Lianying Chao, Kai Zhang, Haoran Cai, Sijie Wu, Xubin Li, Xin Chen

Multi-Modal LLM based Image Captioning in ICT: Bridging the Gap Between General and Industry Domain

In the information and communications technology (ICT) industry, training a domain-specific large language model (LLM) or constructing a retrieval-augmented generation system requires a substantial amount of high-value domain knowledge. However, the knowledge is not only hidden in the textual modality but also in the image modality....

💬 0 commentsarXiv:2601.09298v2PDF
0

Posted in cs.MA · 2026-01-14 · Handi Chen, Running Zhao, Xiuzhe Wu, Edith C. H. Ngai

MACRO-LLM: LLM-Empowered Multi-Agent Collaborative Reasoning under Spatiotemporal Partial Observability

Large Language Model (LLM) agents deployed in complex real-world scenarios increasingly operate as spatially distributed entities. However, this physical dispersion constrains agents to limited local perception and finite temporal horizons. We characterize this bottleneck as spatiotemporal partial observability, where spatial and...

💬 0 commentsarXiv:2601.09295v2PDF
0

Posted in cs.AI · 2026-01-14 · Sofiene Lassoued, Stefan Lier, Andreas Schwung

Policy-Based Reinforcement Learning with Action Masking for Dynamic Job Shop Scheduling under Uncertainty: Handling Random Arrivals and Machine Failures

We present a novel framework for solving Dynamic Job Shop Scheduling Problems under uncertainty, addressing the challenges introduced by stochastic job arrivals and unexpected machine breakdowns. Our approach follows a model-based paradigm, using Coloured Timed Petri Nets to represent the scheduling environment, and Maskable Proximal...

💬 0 commentsarXiv:2601.09293v1PDF
0

Posted in cs.CR · 2026-01-14 · Greta Dolcetti, Giulio Zizzo, Sergio Maffeis

Blue Teaming Function-Calling Agents

We present an experimental evaluation that assesses the robustness of four open source LLMs claiming function-calling capabilities against three different attacks, and we measure the effectiveness of eight different defences. Our results show how these models are not safe by default, and how the defences are not yet employable in...

💬 0 commentsarXiv:2601.09292v1PDF
0

Posted in cs.GR · 2026-01-14 · Sooyeun Yang, Cheyul Im, Jee Won Lee, Jongseong Brad Choi

TIDI-GS: Floater Suppression in 3D Gaussian Splatting for Enhanced Indoor Scene Fidelity

3D Gaussian Splatting (3DGS) is a technique to create high-quality, real-time 3D scenes from images. This method often produces visual artifacts known as floaters--nearly transparent, disconnected elements that drift in space away from the actual surface. This geometric inaccuracy undermines the reliability of these models for...

💬 0 commentsarXiv:2601.09291v2PDF
0

Posted in cs.DS · 2026-01-14 · Takashi Horiyama, Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Akira Suzuki, Ryuhei Uehara, Yutaro Yamaguchi

Computational Complexity of Swish

Swish is a card game in which players are given cards having symbols (hoops and balls), and find a valid superposition of cards, called a "swish." Dailly, Lafourcade, and Marcadet (FUN 2024) studied a generalized version of Swish and showed that the problem is solvable in polynomial time with one symbol per card, while it is...

💬 0 commentsarXiv:2601.09289v1PDF
0

Posted in cs.CR · 2026-01-14 · Dafne Lozano-Paredes, Luis Bote-Curiel, Juan Ramón Feijóo-Martínez, Ismael Gómez-Talal, José Luis Rojo-Álvarez

Explainable Autoencoder-Based Anomaly Detection in IEC 61850 GOOSE Networks

The IEC 61850 Generic Object-Oriented Substation Event (GOOSE) protocol plays a critical role in real-time protection and automation of digital substations, yet its lack of native security mechanisms can expose power systems to sophisticated cyberattacks. Traditional rule-based and supervised intrusion detection techniques struggle to...

💬 0 commentsarXiv:2601.09287v1PDF