Qwen Councils

All arXiv

arXiv preprints from January 1, 2026 through July 28, 2026 — 16:05:30 EST

0

Posted in math.AP · 2026-01-14 · Guillermo García-Sáez

Asymptotics of variational eigenvalues for a general nonlocal $p$-Laplacian with varying horizon

From the recent developing of nonlocal gradients with finite horizon $δ>0$ based on general kernels, we introduce a new nonlocal $p$-Laplacian and study the eigenvalue problem associated with it. Furthermore, by virtue of $Γ$-convergence arguments, we establish stability results of the solutions for varying horizon in the extreme...

💬 0 commentsarXiv:2601.09700v2PDF
0

Posted in cs.CV · 2026-01-14 · Ruiqi Shen, Chang Liu, Henghui Ding

SAM3-DMS: Decoupled Memory Selection for Multi-target Video Segmentation of SAM3

Segment Anything 3 (SAM3) has established a powerful foundation that robustly detects, segments, and tracks specified targets in videos. However, in its original implementation, its group-level collective memory selection is suboptimal for complex multi-object scenarios, as it employs a synchronized decision across all concurrent...

💬 0 commentsarXiv:2601.09699v1PDF
0

Posted in cs.CV · 2026-01-14 · Tony Danjun Wang, Tolga Birdal, Nassir Navab, Lennart Bastian

COMPOSE: Hypergraph Cover Optimization for Multi-view 3D Human Pose Estimation

3D human pose estimation from sparse multi-view camera rigs is an essential task for numerous applications, including action recognition, sports analysis, and human-robot interaction. While learned methods dominate the field on benchmarks, they require large annotated datasets; training-free optimization-based methods remain promising...

💬 0 commentsarXiv:2601.09698v2PDF
0

Posted in cs.CV · 2026-01-14 · Jieying Chen, Jeffrey Hu, Joan Lasenby, Ayush Tewari

Efficient Camera-Controlled Video Generation of Static Scenes via Sparse Diffusion and 3D Rendering

Modern video generative models based on diffusion models can produce very realistic clips, but they are computationally inefficient, often requiring minutes of GPU time for just a few seconds of video. This inefficiency poses a critical barrier to deploying generative video in applications that require real-time interactions, such as...

💬 0 commentsarXiv:2601.09697v1PDF
0

Posted in cs.CL · 2026-01-14 · Shan Randhawa, Agha Ali Raza, Kentaro Toyama, Julie Hui, Mustafa Naseem

Empathy Applicability Modeling for General Health Queries

LLMs are increasingly being integrated into clinical workflows, yet they often lack clinical empathy, an essential aspect of effective doctor-patient communication. Existing NLP frameworks focus on reactively labeling empathy in doctors' responses but offer limited support for anticipatory modeling of empathy needs, especially in...

💬 0 commentsarXiv:2601.09696v2PDF
0

Posted in cs.SE · 2026-01-14 · Michael Konstantinou, Renzo Degiovanni, Mike Papadakis

How well LLM-based test generation techniques perform with newer LLM versions?

The rapid evolution of Large Language Models (LLMs) has strongly impacted software engineering, leading to a growing number of studies on automated unit test generation. However, the standalone use of LLMs without post-processing has proven insufficient, often producing tests that fail to compile or achieve high coverage. Several...

💬 0 commentsarXiv:2601.09695v1PDF
0

Posted in cs.CL · 2026-01-14 · Sai Varun Kodathala, Rakesh Vunnam

LLMs can Compress LLMs: Adaptive Pruning by Agents

As Large Language Models (LLMs) continue to scale, post-training pruning has emerged as a promising approach to reduce computational costs while preserving performance. Existing methods such as SparseGPT and Wanda achieve high sparsity through layer-wise weight reconstruction or activation-aware magnitude pruning, but rely on uniform...

💬 0 commentsarXiv:2601.09694v1PDF
0

Posted in cs.LG · 2026-01-14 · Lisa Schneckenreiter, Sohvi Luukkonen, Lukas Friedrich, Daniel Kuhn, Günter Klambauer

Contrastive Geometric Learning Unlocks Unified Structure- and Ligand-Based Drug Design

Structure-based and ligand-based computational drug design have traditionally relied on disjoint data sources and modeling assumptions, limiting their joint use at scale. In this work, we introduce Contrastive Geometric Learning for Unified Computational Drug Design (ConGLUDe), a single contrastive geometric model that unifies...

💬 0 commentsarXiv:2601.09693v3PDF
0

Posted in cs.CV · 2026-01-14 · S M Rayeed, Mridul Khurana, Alyson East, Isadora E. Fluck, Elizabeth G. Campolongo, Samuel Stevens, Iuliia Zarubiieva, Scott C. Lowe, Michael W. Denslow, Evan D. Donoso, Jiaman Wu, Michelle Ramirez, Benjamin Baiser, Charles V. Stewart, Paula Mabee, Tanya Berger-Wolf, Anuj Karpatne, Hilmar Lapp, Robert P. Guralnick, Graham W. Taylor, Sydne Record

A continental-scale dataset of ground beetles with high-resolution images and validated morphological trait measurements

Despite the ecological significance of invertebrates, global trait databases remain heavily biased toward vertebrates and plants, limiting comprehensive ecological analyses of high-diversity groups like ground beetles. Ground beetles (Coleoptera: Carabidae) serve as critical bioindicators of ecosystem health, providing valuable...

💬 0 commentsarXiv:2601.10687v1PDF
0

Posted in cs.CL · 2026-01-14 · Tianyi Niu, Justin Chih-Yao Chen, Genta Indra Winata, Shi-Xiong Zhang, Supriyo Chakraborty, Sambit Sahu, Yue Zhang, Elias Stengel-Eskin, Mohit Bansal

Routing with Generated Data: Annotation-Free LLM Skill Estimation and Expert Selection

Large Language Model (LLM) routers dynamically select optimal models for given inputs. Existing approaches typically assume access to ground-truth labeled data, which is often unavailable in practice, especially when user request distributions are heterogeneous and unknown. We introduce Routing with Generated Data (RGD), a challenging...

💬 0 commentsarXiv:2601.09692v1PDF
0

Posted in astro-ph.HE · 2026-01-14 · Sébastien Le Stum, Floriane Cangemi, Alexis Coleiro, Sébastien Guillot, Jérôme Chenevez, Philippe Bacon, Nicolas Bellemont, Laurent Bouchet, Tristan Bouchet, Cécile Cavet, Bertrand Cordier, Antoine Foisseau, Olivier Godet, Andrea Goldwurm, Xu-Hui Han, Cyril Lachaud, Zhaosheng Li, Hua-Li Li, Yu-Lei Qiu, Jérôme Rodriguez, Wen-Jun Tan, L. Tao, Lauryne Verwaerde, Chen-Wei Wang, Jing Wang, Jianyan Wei, Chao Wu, Wen-Jin Xie, Li-Ping Xin, Shaolin Xiong, Shuang-Nan Zhang, S. J. Zheng

Detection of Oscillations in a Type I X-Ray Burst of 4U 0614+091 with SVOM/ECLAIRs

On 2025 January 10, a thermonuclear (Type I) X-ray burst from the neutron star low-mass X-ray binary \textit{4U~0614+091} was detected with the ECLAIRs instrument on board the \textit{SVOM} mission. We present here a time-resolved spectroscopic analysis of the burst, along with the detection of burst oscillations within a 51-second...

💬 0 commentsarXiv:2601.09691v1PDF
0

Posted in cond-mat.mtrl-sci · 2026-01-14 · Kareem Abdelmaqsoud, John R. Kitchin, Michael Widom

Electronic structure and elasticity of the Ta-W solid solution

The brittleness or ductility of metals has long been attributed to their elastic constants, with high Poisson ratio, or equivalently high Pugh ratio, favoring greater ductility. Growing evidence links ductility with their electronic structure. Consequently, it is desirable to understand how the electronic structure affects the elastic...

💬 0 commentsarXiv:2601.09690v1PDF
0

Posted in math.CO · 2026-01-14 · Víctor H. Gómez Martínez, César Hernández-Vélez, Jesús Leaños

The 3-symmetric Pseudolinear Crossing Number of $K_{33}$

We show that the 3-symmetric rectilinear and the 3-symmetric pseudolinear crossing numbers of $K_{33}$ are equal. Specifically, we prove that $\operatorname{sym}-\overline{\operatorname{cr}}_3(K_{33}) = 14 634 = \operatorname{sym}-\widetilde{\operatorname{cr}}_3(K_{33})$.

💬 0 commentsarXiv:2601.09689v1PDF
0

Posted in cs.CL · 2026-01-14 · Yibo Wang, Lei Wang, Yue Deng, Keming Wu, Yao Xiao, Huanjin Yao, Liwei Kang, Hai Ye, Yongcheng Jing, Lidong Bing

DeepResearchEval: An Automated Framework for Deep Research Task Construction and Agentic Evaluation

Deep research systems are widely used for multi-step web research, analysis, and cross-source synthesis, yet their evaluation remains challenging. Existing benchmarks often require annotation-intensive task construction, rely on static evaluation dimensions, or fail to reliably verify facts when citations are missing. To bridge these...

💬 0 commentsarXiv:2601.09688v1PDF
0

Posted in cond-mat.mes-hall · 2026-01-14 · Yi Huang, Sankar Das Sarma

Disorder-induced strong-field strong-localization in 2D systems

A recent STM experiment in 2D bilayer graphene [Y.-C. Tsui, et al., Nature 628, 287 (2024)], under a strong perpendicular magnetic field, has made a direct observation of the existence of three distinct filling-factor-dependent quantum phases in the lowest Landau level: the incompressible fractional quantum Hall liquid, a crystalline...

💬 0 commentsarXiv:2601.09687v2PDF
0

Posted in stat.ME · 2026-01-14 · Ha Nguyen, Sumanta Basu

LARGE: A Locally Adaptive Regularization Approach for Estimating Gaussian Graphical Models

The graphical Lasso (GLASSO) is a widely used algorithm for learning high-dimensional undirected Gaussian graphical models (GGM). Given i.i.d. observations from a multivariate normal distribution, GLASSO estimates the precision matrix by maximizing the log-likelihood with an \ell_1-penalty on the off-diagonal entries. However,...

💬 0 commentsarXiv:2601.09686v1PDF
0

Posted in quant-ph · 2026-01-14 · Andre Kornell, Bert Lindenhovius

Quantum graphs of homomorphisms

We introduce a category $\mathsf{qGph}$ of quantum graphs, whose definition is motivated entirely from noncommutative geometry. For all quantum graphs $G$ and $H$ in $\mathsf{qGph}$, we then construct a quantum graph $[G,H]$ of homomorphisms from $G$ to $H$, making $\mathsf{qGph}$ a closed symmetric monoidal category. We prove that...

💬 0 commentsarXiv:2601.09685v3PDF
0

Posted in cs.LG · 2026-01-14 · Ziyu Yang, Guibin Chen, Yuxin Yang, Aoxiong Zeng, Xiangquan Yang

Disentangling Task Conflicts in Multi-Task LoRA via Orthogonal Gradient Projection

Multi-Task Learning (MTL) combined with Low-Rank Adaptation (LoRA) has emerged as a promising direction for parameter-efficient deployment of Large Language Models (LLMs). By sharing a single adapter across multiple tasks, one can significantly reduce storage overhead. However, this approach suffers from negative transfer, where...

💬 0 commentsarXiv:2601.09684v1PDF
0

Posted in cond-mat.stat-mech · 2026-01-14 · I. F. Herrera-González

Controlling thermal conductivity in harmonic chains with correlated mass and bond disorder: Analytical approach

We investigate heat transport in one-dimensional harmonic chains with mass disorder and weak bond disorder, coupled at both ends to oscillator heat baths through weak impedance mismatches. The model incorporates correlations in mass disorder, in bond disorder, and between the two. We find that the scaling of thermal conductivity $κ$...

💬 0 commentsarXiv:2601.09683v1PDF
0

Posted in cs.CY · 2026-01-14 · Christine Ine

The Digital Divide in Geriatric Care: Why Usability, Not Access, is the Real Problem

The rapid increase in the world's aging population to 16% by the year 2050 spurs the need for the application of digital health solutions to enhance older individuals' independence, accessibility, and well-being. While digital health technologies such as telemedicine, wearables, and mobile health applications can transform geriatric...

💬 0 commentsarXiv:2601.17012v1PDF
0

Posted in astro-ph.IM · 2026-01-14 · Christopher J. R. Clark, Roberto J. Avila, Alyssa Guzman, Norman A. Grogin

Using 23 Years of ACS/SBC Data to Understand Backgrounds: Explaining & Predicting Background Variations

Recent analysis of 23 years of Hubble Space Telescope ACS/SBC data has shown that background levels can vary considerably between observations, with most filters showing over an order of magnitude variation. For the shorter-wavelength filters, the background is understood to be dominated by airglow; however, what precisely drives...

💬 0 commentsarXiv:2601.09682v2PDF
0

Posted in cs.CC · 2026-01-14 · Davide Bilò, Stefano Leucci, Andrea Martinelli

Complexity Thresholds for the Constrained Colored Token Swapping Problem

Consider the following puzzle: a farmland consists of several fields, each occupied by either a farmer, a fox, a chicken, or a caterpillar. Creatures in neighboring fields can swap positions as long as the fox avoids the farmer, the chicken avoids the fox, and the caterpillar avoids the chicken. The objective is to decide whether...

💬 0 commentsarXiv:2601.09681v1PDF
0

Posted in stat.ME · 2026-01-14 · Jacob A. Turner, Monnie McGee, Bianca A. Luedeker

Tree Estimation and Saddlepoint-Based Diagnostics for the Nested Dirichlet Distribution: Application to Compositional Behavioral Data

The Nested Dirichlet Distribution (NDD) provides a flexible alternative to the Dirichlet distribution for modeling compositional data, relaxing constraints on component variances and correlations through a hierarchical tree structure. While theoretically appealing, the NDD is underused in practice due to two main limitations: the need...

💬 0 commentsarXiv:2601.09941v1PDF
0

Posted in math.GR · 2026-01-14 · Joseph E. Marrow, Andrew Misseldine

On Schur Rings Over Semigroups

We generalize the idea of a Schur ring of a group to the category of semigroups. Fundamental results of Schur rings over groups are shown to be true for Schur rings over semigroups. Examples where Schur rings differ between the two categories are provided. We prove some results for Schur rings over specific families of semigroups. We...

💬 0 commentsarXiv:2601.09940v1PDF
0

Posted in physics.comp-ph · 2026-01-14 · Jinjin He, Taiyuan Zhang, Zhiqi Li, Junwei Zhou, Duowen Chen, Bo Zhu

A Level Set Method on Particle Flow Maps

This paper introduces a Particle Flow Map Level Set (PFM-LS) method for high-fidelity interface tracking. We store level-set values, gradients, and Hessians on particles concentrated in a narrow band around the interface, advecting them via bidirectional flow maps while using a conventional grid-based representation elsewhere. By...

💬 0 commentsarXiv:2601.09939v1PDF