Qwen Councils
arXiv is taking too long to respond. Please try again or narrow your search.
Showing downloaded papers while arXiv is unavailable.

Computer Science

arXiv preprints from January 1, 2026 through September 12, 2026 — 22:50:14 EST

0

Posted in cs.PL · 2026-01-13 · Thomas Bagrel

Formalization and Implementation of Safe Destination Passing in Pure Functional Programming Settings

Destination-passing style programming introduces destinations, which represent the address of a write-once memory cell. These destinations can be passed as function parameters, allowing the caller to control memory management: the callee simply fills the cell instead of allocating space for a return value. While typically used in...

💬 0 commentsarXiv:2601.08529v1PDF
0

Posted in cs.DB · 2026-01-13 · Yuchen Peng, Dingyu Yang, Zhongle Xie, Ji Sun, Lidan Shou, Ke Chen, Gang Chen

SVFusion: A CPU-GPU Co-Processing Architecture for Large-Scale Real-Time Vector Search

Approximate Nearest Neighbor Search (ANNS) underpins modern applications such as information retrieval and recommendation. With the rapid growth of vector data, efficient indexing for real-time vector search has become rudimentary. Existing CPU-based solutions support updates but suffer from low throughput, while GPU-accelerated...

💬 0 commentsarXiv:2601.08528v1PDF
0

Posted in cs.NE · 2026-01-13 · Gouri Lakshmi S, Athira Chandrasekharan, Harshit Kumar, Muhammed Sahad E, Bikas C Das, Saptarshi Bej

Supervised Spike Agreement Dependent Plasticity for Fast Local Learning in Spiking Neural Networks

Spike-Timing-Dependent Plasticity (STDP) provides a biologically grounded learning rule for spiking neural networks (SNNs), but its reliance on precise spike timing and pairwise updates limits fast learning of weights. We introduce a supervised extension of Spike Agreement-Dependent Plasticity (SADP), which replaces pairwise...

💬 0 commentsarXiv:2601.08526v1PDF
0

Posted in cs.RO · 2026-01-13 · Nesserine Laribi, Mohammed Rida Mokhtari, Abdelaziz Benallegue, Abdelhafid El-Hadri, Mehdi Benallegue

QP-Based Control of an Underactuated Aerial Manipulator under Constraints

This paper presents a constraint-aware control framework for underactuated aerial manipulators, enabling accurate end-effector trajectory tracking while explicitly accounting for safety and feasibility constraints. The control problem is formulated as a quadratic program that computes dynamically consistent generalized accelerations...

💬 0 commentsarXiv:2601.08523v1PDF
0

Posted in cs.LG · 2026-01-13 · Fengkai Yang, Zherui Chen, Xiaohan Wang, Xiaodong Lu, Jiajun Chai, Guojun Yin, Wei Lin, Shuai Ma, Fuzhen Zhuang, Deqing Wang, Yaodong Yang, Jianxin Li, Yikun Ban

Your Group-Relative Advantage Is Biased

Reinforcement Learning from Verifier Rewards (RLVR) has emerged as a widely used approach for post-training large language models on reasoning tasks, with group-based methods such as GRPO and its variants gaining broad adoption. These methods rely on group-relative advantage estimation to avoid learned critics, yet its theoretical...

💬 0 commentsarXiv:2601.08521v2PDF
0

Posted in cs.RO · 2026-01-13 · Krzysztof Zielinski, Dominik Belter

Keyframe-based Dense Mapping with the Graph of View-Dependent Local Maps

In this article, we propose a new keyframe-based mapping system. The proposed method updates local Normal Distribution Transform maps (NDT) using data from an RGB-D sensor. The cells of the NDT are stored in 2D view-dependent structures to better utilize the properties and uncertainty model of RGB-D cameras. This method naturally...

💬 0 commentsarXiv:2601.08520v1PDF
0

Posted in cs.CV · 2026-01-13 · Kexin Bao, Daichi Zhang, Hansong Zhang, Yong Li, Yutao Yue, Shiming Ge

CD^2: Constrained Dataset Distillation for Few-Shot Class-Incremental Learning

Few-shot class-incremental learning (FSCIL) receives significant attention from the public to perform classification continuously with a few training samples, which suffers from the key catastrophic forgetting problem. Existing methods usually employ an external memory to store previous knowledge and treat it with incremental classes...

💬 0 commentsarXiv:2601.08519v1PDF
0

Posted in cs.CV · 2026-01-13 · Tolgay Atinc Uzun, Dmitry Ignatov, Radu Timofte

Closed-Loop LLM Discovery of Non-Standard Channel Priors in Vision Models

Channel-configuration search, the optimization of layer specifications such as channel widths in deep neural networks, presents a combinatorial challenge constrained by tensor-shape compatibility and computational budgets. We investigate whether large language models (LLMs) can support neural architecture search (NAS) by reasoning...

💬 0 commentsarXiv:2601.08517v2PDF
0

Posted in cs.SD · 2026-01-13 · Ziqi Ding, Yunfeng Wan, Wei Song, Yi Liu, Gelei Deng, Nan Sun, Huadong Mo, Jingling Xue, Shidong Pan, Yuekang Li

Robust CAPTCHA Using Audio Illusions in the Era of Large Language Models: from Evaluation to Advances

CAPTCHAs are widely used by websites to block bots and spam by presenting challenges that are easy for humans but difficult for automated programs to solve. To improve accessibility, audio CAPTCHAs are designed to complement visual ones. However, the robustness of audio CAPTCHAs against advanced Large Audio Language Models (LALMs) and...

💬 0 commentsarXiv:2601.08516v1PDF
0

Posted in cs.NI · 2026-01-13 · Ana Julia Evangelista Andrade, Flavio Cezar Amate

A decentralized academic certificate issuance system using smart contracts on the tron network

This paper presents the design, implementation, and evaluation of a decentralized system for issuing and verifying academic certificates based on blockchain technology. The proposed solution addresses common limitations of traditional certification models, such as susceptibility to forgery, reliance on centralized infrastructures, and...

💬 0 commentsarXiv:2601.08513v1PDF
0

Posted in cs.RO · 2026-01-13 · Davide Risi, Vincenzo Petrone, Antonio Langella, Lorenzo Pagliara, Enrico Ferrentino, Pasquale Chiacchio

Simplifying ROS2 controllers with a modular architecture for robot-agnostic reference generation

This paper introduces a novel modular architecture for ROS2 that decouples the logic required to acquire, validate, and interpolate references from the control laws that track them. The design includes a dedicated component, named Reference Generator, that receives references, in the form of either single points or trajectories, from...

💬 0 commentsarXiv:2601.08514v2PDF
0

Posted in cs.CL · 2026-01-13 · Przemysław Spyra

Algorithmic Stability in Infinite Dimensions: Characterizing Unconditional Convergence in Banach Spaces

The distinction between conditional, unconditional, and absolute convergence in infinite-dimensional spaces has fundamental implications for computational algorithms. While these concepts coincide in finite dimensions, the Dvoretzky-Rogers theorem establishes their strict separation in general Banach spaces. We present a comprehensive...

💬 0 commentsarXiv:2601.08512v1PDF
0

Posted in cs.CL · 2026-01-13 · Seong-Gyu Park, Sohee Park, Jisu Lee, Hyunsik Na, Daeseon Choi

STAR: Detecting Inference-time Backdoors in LLM Reasoning via State-Transition Amplification Ratio

Recent LLMs increasingly integrate reasoning mechanisms like Chain-of-Thought (CoT). However, this explicit reasoning exposes a new attack surface for inference-time backdoors, which inject malicious reasoning paths without altering model parameters. Because these attacks generate linguistically coherent paths, they effectively evade...

💬 0 commentsarXiv:2601.08511v1PDF
0

Posted in cs.CL · 2026-01-13 · Qiuyu Tian, Zequn Liu, Yiding Li, Fengyi Chen, Zhijing Xie, Jinjing Shen, Fan Guo, Youyong Kong, Yingce Xia, Xin Zhang, Yuyao Li, Ewing Luo

STAGE: A Full-Screenplay Benchmark for Reasoning over Evolving Stories

Movie screenplays are rich long-form narratives that interleave complex character relationships, temporally ordered events, and dialogue-driven interactions. While prior benchmarks target individual subtasks such as question answering or dialogue generation, they rarely evaluate whether models can construct a coherent story world and...

💬 0 commentsarXiv:2601.08510v8PDF
0

Posted in cs.LG · 2026-01-13 · Andrew Kiruluta

Spectral Generative Flow Models: A Physics-Inspired Replacement for Vectorized Large Language Models

We introduce Spectral Generative Flow Models (SGFMs), a physics-inspired alternative to transformer-based large language models. Instead of representing text or video as sequences of discrete tokens processed by attention, SGFMs treat generation as the evolution of a continuous field governed by constrained stochastic dynamics in a...

💬 0 commentsarXiv:2601.08893v2PDF
0

Posted in cs.AI · 2026-01-13 · Jinkwan Jang, Hyunbin Jin, Hyungjin Park, Kyubyung Chae, Taesup Kim

What If TSF: A Benchmark for Reframing Forecasting as Scenario-Guided Multimodal Forecasting

Time series forecasting is critical to real-world decision making, yet most existing approaches remain unimodal and rely on extrapolating historical patterns. While recent progress in large language models (LLMs) highlights the potential for multimodal forecasting, existing benchmarks largely provide retrospective or misaligned raw...

💬 0 commentsarXiv:2601.08509v1PDF
0

Posted in cs.LG · 2026-01-13 · Aditya Kumar, Simon Rauch, Mario Cypko, Marcel Naik, Matthieu-P Schapranow, Aadil Rashid, Fabian Halleck, Bilgin Osmanodja, Roland Roller, Lars Pape, Klemens Budde, Mario Schiffer, Oliver Amft

Temporal Fusion Nexus: A task-agnostic multi-modal embedding model for clinical narratives and irregular time series in post-kidney transplant care

We introduce Temporal Fusion Nexus (TFN), a multi-modal and task-agnostic embedding model to integrate irregular time series and unstructured clinical narratives. We analysed TFN in post-kidney transplant (KTx) care, with a retrospective cohort of 3382 patients, on three key outcomes: graft loss, graft rejection, and mortality....

💬 0 commentsarXiv:2601.08503v1PDF
0

Posted in cs.CL · 2026-01-13 · Cristian Santini, Marieke Van Erp, Mehwish Alam

It's All About the Confidence: An Unsupervised Approach for Multilingual Historical Entity Linking using Large Language Models

Despite the recent advancements in NLP with the advent of Large Language Models (LLMs), Entity Linking (EL) for historical texts remains challenging due to linguistic variation, noisy inputs, and evolving semantic conventions. Existing solutions either require substantial training data or rely on domain-specific rules that limit...

💬 0 commentsarXiv:2601.08500v1PDF
0

Posted in cs.CV · 2026-01-13 · Wenwen Liao, Hang Ruan, Jianbo Yu, Bing Song, YuansongWang, Xiaofeng Yang

EfficientFSL: Enhancing Few-Shot Classification via Query-Only Tuning in Vision Transformers

Large models such as Vision Transformers (ViTs) have demonstrated remarkable superiority over smaller architectures like ResNet in few-shot classification, owing to their powerful representational capacity. However, fine-tuning such large models demands extensive GPU memory and prolonged training time, making them impractical for many...

💬 0 commentsarXiv:2601.08499v2PDF
0

Posted in cs.IR · 2026-01-13 · Jia-Xin He, Hung-Hsuan Chen

GraphFusionSBR: Denoising Multi-Channel Graphs for Session-Based Recommendation

Session-based recommendation systems must capture implicit user intents from sessions. However, existing models suffer from issues such as item interaction dominance and noisy sessions. We propose a multi-channel recommendation model, including a knowledge graph channel, a session hypergraph channel, and a session line graph channel,...

💬 0 commentsarXiv:2601.08497v1PDF
0

Posted in cs.CV · 2026-01-13 · Kexin Baoa, Fanzhao Lin, Zichen Wang, Yong Li, Dan Zeng, Shiming Ge

PKI: Prior Knowledge-Infused Neural Network for Few-Shot Class-Incremental Learning

Few-shot class-incremental learning (FSCIL) aims to continually adapt a model on a limited number of new-class examples, facing two well-known challenges: catastrophic forgetting and overfitting to new classes. Existing methods tend to freeze more parts of network components and finetune others with an extra memory during incremental...

💬 0 commentsarXiv:2601.08493v1PDF
0

Posted in cs.LO · 2026-01-13 · Florian Frohn, Jürgen Giesl, Peter Giesl, Nils Lommen

On Deciding Constant Runtime of Linear Loops

We consider linear single-path loops of the form \[ \textbf{while} \quad \varphi \quad \textbf{do} \quad \vec{x} \gets A \vec{x} + \vec{b} \quad \textbf{end} \] where $\vec{x}$ is a vector of variables, the loop guard $\varphi$ is a conjunction of linear inequations over the variables $\vec{x}$, and the update of the loop is...

💬 0 commentsarXiv:2601.08492v1PDF
0

Posted in cs.CL · 2026-01-13 · Eric Rudolph, Natalie Engert, Jens Albrecht

Evaluating Role-Consistency in LLMs for Counselor Training

The rise of online counseling services has highlighted the need for effective training methods for future counselors. This paper extends research on VirCo, a Virtual Client for Online Counseling, designed to complement traditional role-playing methods in academic training by simulating realistic client interactions. Building on...

💬 0 commentsarXiv:2601.08892v1PDF
0

Posted in cs.RO · 2026-01-13 · Mohamed Afouene Melki, Mohammad Shehab, Mohamed-Slim Alouini

AUV Trajectory Learning for Underwater Acoustic Energy Transfer and Age Minimization

Internet of underwater things (IoUT) is increasingly gathering attention with the aim of monitoring sea life and deep ocean environment, underwater surveillance as well as maintenance of underwater installments. However, conventional IoUT devices, reliant on battery power, face limitations in lifespan and pose environmental hazards...

💬 0 commentsarXiv:2601.08491v1PDF