Qwen Councils

Computer Science

arXiv preprints from January 1, 2026 through September 11, 2026 — 23:46:16 EST

0

Posted in cs.IT · 2026-01-15 · Siying Luo, Youlong Wu, Mingming Zhang, Minquan Cheng, Dianhua Wu

A Construction Framework of Coded Caching Scheme for Multi-Access MISO Systems via Knapsack Problem

This paper investigates the coded caching problem in a multi-access multiple-input single-output (MAMISO) network with the combinatorial topology. The considered system consists of a server containing $N$ files, $Λ$ cache nodes, and $K$ cache-less users, where each user can access a unique subset of $r$ cache nodes. The server is...

💬 0 commentsarXiv:2601.10484v2PDF
0

Posted in cs.CL · 2026-01-15 · Tiziano Labruna, Arkadiusz Modzelewski, Giorgio Satta, Giovanni Da San Martino

Detecting Winning Arguments with Large Language Models and Persuasion Strategies

Detecting persuasion in argumentative text is a challenging task with important implications for understanding human communication. This work investigates the role of persuasion strategies - such as Attack on reputation, Distraction, and Manipulative wording - in determining the persuasiveness of a text. We conduct experiments on...

💬 0 commentsarXiv:2601.10660v1PDF
0

Posted in cs.NE · 2026-01-15 · Minghao Yan, Bo Peng, Benjamin Coleman, Ziqi Chen, Zhouhang Xie, Shuo Chen, Zhankui He, Noveen Sachdeva, Isabella Ye, Weili Wang, Chi Wang, Ed H. Chi, Fernando Pereira, Wang-Cheng Kang, Derek Zhiyuan Cheng, Beidou Wang

PACEvolve: Enabling Long-Horizon Progress-Aware Consistent Evolution

Large Language Models (LLMs) have emerged as powerful operators for evolutionary search, yet the design of efficient search scaffolds remains ad hoc. While promising, current LLM-in-the-loop systems lack a systematic approach to managing the evolutionary process. We identify three distinct failure modes: Context Pollution, where...

💬 0 commentsarXiv:2601.10657v2PDF
0

Posted in cs.AI · 2026-01-15 · Christoph Weinhuber, Yannik Schnitzer, Alessandro Abate, David Parker, Giuseppe De Giacomo, Moshe Y. Vardi

Multi-Property Synthesis

We study LTLf synthesis with multiple properties, where satisfying all properties may be impossible. Instead of enumerating subsets of properties, we compute in one fixed-point computation the relation between product-game states and the goal sets that are realizable from them, and we synthesize strategies achieving maximal realizable...

💬 0 commentsarXiv:2601.10651v1PDF
0

Posted in cs.CL · 2026-01-15 · Jinghan Cao, Qingyang Ren, Xiangyun Chen, Xinjin Li, Haoxiang Gao, Yu Zhao

Slang Context-based Inference Enhancement via Greedy Search-Guided Chain-of-Thought Prompting

Slang interpretation has been a challenging downstream task for Large Language Models (LLMs) as the expressions are inherently embedded in contextual, cultural, and linguistic frameworks. In the absence of domain-specific training data, it is difficult for LLMs to accurately interpret slang meaning based on lexical information. This...

💬 0 commentsarXiv:2603.13230v1PDF
0

Posted in cs.CV · 2026-01-15 · Darshan Singh, Arsha Nagrani, Kawshik Manikantan, Harman Singh, Dinesh Tewari, Tobias Weyand, Cordelia Schmid, Anelia Angelova, Shachi Dave

MINERVA-Cultural: A Benchmark for Cultural and Multilingual Long Video Reasoning

Recent advancements in video models have shown tremendous progress, particularly in long video understanding. However, current benchmarks predominantly feature western-centric data and English as the dominant language, introducing significant biases in evaluation. To address this, we introduce MINERVA-Cultural, a challenging benchmark...

💬 0 commentsarXiv:2601.10649v2PDF
0

Posted in cs.IT · 2026-01-15 · Joseph Rowan, Buu Phan, Ashish Khisti

One-Shot Broadcast Joint Source-Channel Coding with Codebook Diversity

We study a one-shot joint source-channel coding setting where the source is encoded once and broadcast to $K$ decoders through independent channels. Success is predicated on at least one decoder recovering the source within a maximum distortion constraint. We find that in the one-shot regime, utilizing disjoint codebooks at each...

💬 0 commentsarXiv:2601.10648v3PDF
0

Posted in cs.CV · 2026-01-15 · Kaustubh Shivshankar Shejole, Gaurav Mishra

PSSI-MaxST: An Efficient Pixel-Segment Similarity Index Using Intensity and Smoothness Features for Maximum Spanning Tree Based Segmentation

Interactive graph-based segmentation methods partition an image into foreground and background regions with the aid of user inputs. However, existing approaches often suffer from high computational costs, sensitivity to user interactions, and degraded performance when the foreground and background share similar color distributions. A...

💬 0 commentsarXiv:2601.11654v1PDF
0

Posted in cs.CL · 2026-01-15 · Yuxi Xia, Loris Schoenegger, Benjamin Roth

Influential Training Data Retrieval for Explaining Verbalized Confidence of LLMs

Large language models (LLMs) can increase users' perceived trust by verbalizing confidence in their outputs. However, prior work has shown that LLMs are often overconfident, making their stated confidence unreliable since it does not consistently align with factual accuracy. To better understand the sources of this verbalized...

💬 0 commentsarXiv:2601.10645v1PDF
0

Posted in cs.IR · 2026-01-15 · Eugene Yang, Andrew Yates, Dawn Lawrie, James Mayfield, Trevor Adriaanse

RoutIR: Fast Serving of Retrieval Pipelines for Retrieval-Augmented Generation

Retrieval models are key components of Retrieval-Augmented Generation (RAG) systems, which generate search queries, process the documents returned, and generate a response. RAG systems are often dynamic and may involve multiple rounds of retrieval. While many state-of-the-art retrieval methods are available through academic IR...

💬 0 commentsarXiv:2601.10644v1PDF
0

Posted in cs.IT · 2026-01-15 · Chandan Anand, Jayesh Seshadri, Prasad Krishnan, Gowtham R. Kurri

Converse Bounds for Sun-Jafar-type Weak Private Information Retrieval

Building on the well-established capacity-achieving schemes of Sun-Jafar (for replicated storage) and the closely related scheme of Banawan-Ulukus (for MDS-coded setting), a recent work by Anand et al. proposed new classes of weak private information retrieval (WPIR) schemes for the collusion-free (replication and MDS-coded) setting,...

💬 0 commentsarXiv:2601.10643v2PDF
0

Posted in cs.LG · 2026-01-15 · Ranajoy Sadhukhan, Sheng Cao, Harry Dong, Changsheng Zhao, Attiano Purpura-Pontoniere, Yuandong Tian, Zechun Liu, Beidi Chen

STEM: Scaling Transformers with Embedding Modules

Fine-grained sparsity promises higher parametric capacity without proportional per-token compute, but often suffers from training instability, load balancing, and communication overhead. We introduce STEM (Scaling Transformers with Embedding Modules), a static, token-indexed approach that replaces the FFN up-projection with a...

💬 0 commentsarXiv:2601.10639v1PDF
0

Posted in cs.CV · 2026-01-15 · Chengfeng Zhao, Jiazhi Shu, Yubo Zhao, Tianyu Huang, Jiahao Lu, Zekai Gu, Chengwei Ren, Zhiyang Dou, Qing Shuai, Yuan Liu

CoMoVi: Co-Generation of 3D Human Motions and Realistic Videos

In this paper, we find that the generation of 3D human motions and 2D human videos is intrinsically coupled. 3D motions provide the structural prior for plausibility and consistency in videos, while pre-trained video models offer strong generalization capabilities for motions. Based on this, we present CoMoVi, a co-generative...

💬 0 commentsarXiv:2601.10632v2PDF
0

Posted in cs.GR · 2026-01-15 · Hongyi Liu, Oded Stein, Amir Vaxman, Mirela Ben-Chen, Misha Kazhdan

Phong-Rodrigues Extrinsic Vector-Field Processing

We introduce a new extrinsic discretization of tangent vector fields on triangle meshes that is continuous, with bounded derivatives that are continuous almost everywhere, supporting pointwise evaluation and integration of differential operators. We achieve this by building a continuous normal field over the mesh via Phong...

💬 0 commentsarXiv:2601.10621v2PDF
0

Posted in cs.IT · 2026-01-15 · Rimpi Borah, J. Harshan, V. Lalitha

Basis-Spline Assisted Coded Computing: Strategies and Error Bounds

Coded computing has emerged as a key framework for addressing the impact of stragglers in distributed computation. While polynomial functions often admit exact recovery under existing coded computing schemes, non-polynomial functions require approximate reconstruction from a finite number of evaluations, posing significant challenges....

💬 0 commentsarXiv:2601.10616v2PDF
0

Posted in cs.CV · 2026-01-15 · Christopher Clark, Jieyu Zhang, Zixian Ma, Jae Sung Park, Mohammadreza Salehi, Rohun Tripathi, Sangho Lee, Zhongzheng Ren, Chris Dongjoo Kim, Yinuo Yang, Vincent Shao, Yue Yang, Weikai Huang, Ziqi Gao, Taira Anderson, Jianrui Zhang, Jitesh Jain, George Stoica, Winson Han, Ali Farhadi, Ranjay Krishna

Molmo2: Open Weights and Data for Vision-Language Models with Video Understanding and Grounding

Today's strongest video-language models (VLMs) remain proprietary. The strongest open-weight models either rely on synthetic data from proprietary VLMs, effectively distilling from them, or do not disclose their training data or recipe. As a result, the open-source community lacks the foundations needed to improve on the...

💬 0 commentsarXiv:2601.10611v4PDF
0

Posted in cs.IR · 2026-01-15 · Zhuoxuan Huang, Yunshan Ma, Hongyu Zhang, Hua Ma, Zhu Sun

iTIMO: An LLM-empowered Synthesis Dataset for Travel Itinerary Modification

Addressing itinerary modification is crucial for enhancing the travel experience as it is a frequent requirement during traveling. However, existing research mainly focuses on fixed itinerary planning, leaving modification underexplored due to the scarcity of need-to-modify itinerary data. To bridge this gap, we formally define the...

💬 0 commentsarXiv:2601.10609v5PDF
0

Posted in cs.CV · 2026-01-15 · Peng Chen, Xiaobao Wei, Yi Yang, Naiming Yao, Hui Chen, Feng Tian

RSATalker: Realistic Socially-Aware Talking Head Generation for Multi-Turn Conversation

Talking head generation is increasingly important in virtual reality (VR), especially for social scenarios involving multi-turn conversation. Existing approaches face notable limitations: mesh-based 3D methods can model dual-person dialogue but lack realistic textures, while large-model-based 2D methods produce natural appearances but...

💬 0 commentsarXiv:2601.10606v1PDF
0

Posted in cs.NI · 2026-01-15 · José-Ramón Vidal, Luis Guijarro, Vicent Pla

A user subscription model in mobile radio access networks with network slicing

Network slicing is an architectural enabling technology that logically decouples the current cellular networks into infrastructure providers (InPs) and Network Slice Tenants (NSTs). The network resources (e.g., radio access resources at each cell) are owned by the InP, and are shared by the NSTs to provide a service to their mobile...

💬 0 commentsarXiv:2601.10605v1PDF
0

Posted in cs.DB · 2026-01-15 · Christian Mancas, Diana Christina Mancas

Translating database mathematical schemes into relational database software applications with MatBase

We present a pseudocode algorithm for translating our (Elementary) Mathematical Data Model schemes into relational ones and associated sets of non-relational constraints, used by MatBase, our intelligent data and knowledge base management system prototype. We prove that this algorithm is very fast, solid, complete, and optimal. We...

💬 0 commentsarXiv:2601.10604v4PDF
0

Posted in cs.IT · 2026-01-15 · K. K. Krishnan Namboodiri, Elizabath Peter, Derya Malak, Petros Elia

Fundamental Limits of Multi-User Distributed Computing of Linearly Separable Functions

This work establishes the fundamental limits of the classical problem of multi-user distributed computing of linearly separable functions. In particular, we consider a distributed computing setting involving $L$ users, each requesting a linearly separable function over $K$ basis subfunctions from a master node, who is assisted by $N$...

💬 0 commentsarXiv:2601.10603v1PDF
0

Posted in cs.MA · 2026-01-15 · Joshua Caiata, Carter Blair, Kate Larson

Procedural Fairness in Multi-Agent Bandits

In the context of multi-agent multi-armed bandits (MA-MAB), fairness is often reduced to outcomes: maximizing welfare, reducing inequality, or balancing utilities. However, evidence in psychology, economics, and Rawlsian theory suggests that fairness is also about process and who gets a say in the decisions being made. We introduce a...

💬 0 commentsarXiv:2601.10600v1PDF
0

Posted in cs.CY · 2026-01-15 · Federico Pierucci, Marcello Galisai, Marcantonio Syrnikov Bracale, Matteo Prandi, Piercosma Bisconti, Francesco Giarrusso, Olga Sorokoletova, Vincenzo Suriani, Daniele Nardi

Institutional AI: A Governance Framework for Distributional AGI Safety

As LLM-based systems increasingly operate as agents embedded within human social and technical systems, alignment can no longer be treated as a property of an isolated model, but must be understood in relation to the environments in which these agents act. Even the most sophisticated methods of alignment, such as Reinforcement...

💬 0 commentsarXiv:2601.10599v2PDF
0

Posted in cs.DB · 2026-01-15 · Xueyuan Ren, Frank Li, Yang Wang

Improving Database Performance by Application-side Transaction Merging

This paper explores a new opportunity to improve the performance of transaction processing at the application side by merging structurely similar statements or transactions. Concretely, we re-write transactions to 1) merge similar statements using specific SQL semantics; 2) eliminate redundant reads; and 3) merge contending statements...

💬 0 commentsarXiv:2601.10596v1PDF
0

Posted in cs.CV · 2026-01-15 · Delong Chen, Tejaswi Kasarla, Yejin Bang, Mustafa Shukor, Willy Chung, Jade Yu, Allen Bolourchi, Theo Moutakanni, Pascale Fung

Action100M: A Large-scale Video Action Dataset

Inferring physical actions from visual observations is a fundamental capability for advancing machine intelligence in the physical world. Achieving this requires large-scale, open-vocabulary video action datasets that span broad domains. We introduce Action100M, a large-scale dataset constructed from 1.2M Internet instructional videos...

💬 0 commentsarXiv:2601.10592v1PDF