Qwen Councils

All arXiv

arXiv preprints from January 1, 2026 through September 22, 2026 — 17:43:00 EST

0

Posted in cs.LG · 2026-01-13 · Sucheta Ghosh, Felix Dietrich, Zahra Monfared

Contrastive and Multi-Task Learning on Noisy Brain Signals with Nonlinear Dynamical Signatures

We introduce a two-stage multitask learning framework for analyzing Electroencephalography (EEG) signals that integrates denoising, dynamical modeling, and representation learning. In the first stage, a denoising autoencoder is trained to suppress artifacts and stabilize temporal dynamics, providing robust signal representations. In...

💬 0 commentsarXiv:2601.08549v3PDF
0

Posted in math-ph · 2026-01-13 · Almudena del Pilar Márquez, Elena Recio, María Luz Gandarias

Conservation laws and exact solutions of a nonlinear acoustics equation by classical symmetry reduction

Symmetries and conservation laws are studied for a generalized Westervelt equation which is a nonlinear partial differential equation modelling the propagation of sound waves in a compressible medium. This nonlinear wave equation is widely used in nonlinear acoustics and it is especially important in biomedical applications such as...

💬 0 commentsarXiv:2601.08548v2PDF
0

Posted in math.OC · 2026-01-13 · Jona-Maria Diederen, Holger Rauhut, Ulrich Terstiege

Convergence of gradient flow for learning convolutional neural networks

Convolutional neural networks are widely used in imaging and image recognition. Learning such networks from training data leads to the minimization of a non-convex function. This makes the analysis of standard optimization methods such as variants of (stochastic) gradient descent challenging. In this article we study the simplified...

💬 0 commentsarXiv:2601.08547v1PDF
0

Posted in math.RT · 2026-01-13 · M. H. Shahzamanian

Simplicity of Augmentation Submodules in Monoids with 0-Minimal Ideals of Rank Greater than Two

In this paper, we construct explicit families of transformation monoids whose augmentation submodules are simple and whose associated 0-minimal J-classes have rank greater than two. These examples provide new monoids with simple augmentation submodules and non-complete associated graphs. We also establish a connection between the...

💬 0 commentsarXiv:2601.08546v2PDF
0

Posted in cs.AI · 2026-01-13 · Zhenlong Dai, Zhuoluo Zhao, Hengning Wang, Xiu Tang, Sai Wu, Chang Yao, Zhipeng Gao, Jingyuan Chen

Learner-Tailored Program Repair: A Solution Generator with Iterative Edit-Driven Retrieval Enhancement

With the development of large language models (LLMs) in the field of programming, intelligent programming coaching systems have gained widespread attention. However, most research focuses on repairing the buggy code of programming learners without providing the underlying causes of the bugs. To address this gap, we introduce a novel...

💬 0 commentsarXiv:2601.08545v2PDF
0

Posted in cond-mat.soft · 2026-01-13 · Fabrizio Camerin, Marco Polimeni, Letizia Tavagnacco, Jeffrey C. Everts, Szilard Saringer, Alessandro Gulotta, Nicholas Skar-Gislinge, Anna Stradner, Emanuela Zaccarelli, Peter Schurtenberger

Beyond uniform screening: electrostatic heterogeneity dictates solution structure of complex macromolecules

The complexity of biomolecular interactions necessitates advanced methodologies to accurately capture their behavior in solution. In this work, we focus on monoclonal antibodies and adopt a multi-scale coarse-graining strategy for their modeling, with particular emphasis on the role of electrostatic interactions. Using scattering...

💬 0 commentsarXiv:2601.08544v1PDF
0

Posted in hep-th · 2026-01-13 · Atsushi Nakamula, Genki Sumiyama

Topology of Calorons Re-examined

We reconsider the detailed structure of the topological character of the instantons in pure Yang-Mills theory on $S^1\times\mathbb{R}^3$, so-called calorons. The claim is that the standard formula for the topological character, the second Chern number, requires some modification through analytic consideration. For concreteness, we...

💬 0 commentsarXiv:2601.08543v1PDF
0

Posted in cs.CV · 2026-01-13 · Hassan Ugail, Jan Ritch-Frel, Irina Matuzava

Handcrafted Feature-Assisted One-Class Learning for Artist Authentication in Historical Drawings

Authentication and attribution of works on paper remain persistent challenges in cultural heritage, particularly when the available reference corpus is small and stylistic cues are primarily expressed through line and limited tonal variation. We present a verification-based computational framework for historical drawing authentication...

💬 0 commentsarXiv:2601.11627v1PDF
0

Posted in astro-ph.HE · 2026-01-13 · D. S. Pillay, V. Venkatraman Krishnan, David J. Champion, P. C. C. Freire, M. Kramer, L. Guillemot, M. Bailes, A. Corongiu, M. Geyer, J. Singha, R. M. Shannon, G. Theureau, I. Cognard, M. J. Keith, B. W. Stappers, J. Antoniadis, K. Liu, G. M. Shaifullah

Radio timing constraints on the orbital orientation and component masses of PSR J1455$-$3330

PSR J1455$-$3330 is a $\sim$7.98 ms pulsar in a $\sim$76.17 day nearly circular orbit with a white dwarf companion. In this work, we combine the available Lovell, Nançay decimetric Radio Telescope, Green Bank, and MeerKAT pulsar timing data spanning $\sim$ 30 years to measure the kinematic and relativistic effects of PSR J1455$-$3330...

💬 0 commentsarXiv:2601.08541v1PDF
0

Posted in q-fin.RM · 2026-01-13 · Shiyu Zhang, Zining Wang, Jin Zheng, John Cartlidge

Systemic Risk in DeFi: A Network-Based Fragility Analysis of TVL Dynamics

Systemic risk refers to the overall vulnerability arising from the high degree of interconnectedness and interdependence within the financial system. In the rapidly developing decentralized finance (DeFi) ecosystem, numerous studies have analyzed systemic risk through specific channels such as liquidity pressures, leverage mechanisms,...

💬 0 commentsarXiv:2601.08540v1PDF
0

Posted in cs.PF · 2026-01-13 · Jeffrey Spaan, Kuan-Hsun Chen, Ana-Lucia Varbanescu

Reducing Compute Waste in LLMs through Kernel-Level DVFS

The rapid growth of AI has fueled the expansion of accelerator- or GPU-based data centers. However, the rising operational energy consumption has emerged as a critical bottleneck and a major sustainability concern. Dynamic Voltage and Frequency Scaling (DVFS) is a well-known technique used to reduce energy consumption, and thus...

💬 0 commentsarXiv:2601.08539v1PDF
0

Posted in q-bio.PE · 2026-01-13 · Jonathan A Chetwynd-Diggle, Bjarki Eldon

Beta-coalescents when sample size is large

Sweepstakes reproduction refers to a highly skewed individual recruitment success without involving natural selection and may apply to individuals in broadcast spawning populations characterised by Type III survivorship. We consider an extension of the model of sweepstakes reproduction for a haploid panmictic population of constant...

💬 0 commentsarXiv:2601.08538v1PDF
0

Posted in eess.AS · 2026-01-13 · Rahul Bapusaheb Kodag, Vipul Arora

Weakly Supervised Tabla Stroke Transcription via TI-SDRM: A Rhythm-Aware Lattice Rescoring Framework

Tabla Stroke Transcription (TST) is central to the analysis of rhythmic structure in Hindustani classical music, yet remains challenging due to complex rhythmic organization and the scarcity of strongly annotated data. Existing approaches largely rely on fully supervised learning with onset-level annotations, which are costly and...

💬 0 commentsarXiv:2601.08537v1PDF
0

Posted in cs.CV · 2026-01-13 · Christos Tsourveloudis

Do Open-Vocabulary Detectors Transfer to Aerial Imagery? A Comparative Evaluation

Open-vocabulary object detection (OVD) enables zero-shot recognition of novel categories through vision-language models, achieving strong performance on natural images. However, transferability to aerial imagery remains unexplored. We present the first systematic benchmark evaluating five state-of-the-art OVD models on the LAE-80C...

💬 0 commentsarXiv:2601.22164v1PDF
0

Posted in cs.CL · 2026-01-13 · Ruizhe Li, Mingxuan Du, Benfeng Xu, Chiwei Zhu, Xiaorui Wang, Zhendong Mao

DeepResearch Bench II: Diagnosing Deep Research Agents via Rubrics from Expert Report

Deep Research Systems (DRS) aim to help users search the web, synthesize information, and deliver comprehensive investigative reports. However, how to rigorously evaluate these systems remains under-explored. Existing deep-research benchmarks often fall into two failure modes. Some do not adequately test a system's ability to analyze...

💬 0 commentsarXiv:2601.08536v2PDF
0

Posted in cs.IT · 2026-01-13 · Haricharan Balasundaram, Andrew Thangaraj

Distribution Estimation with Side Information

We consider the classical problem of discrete distribution estimation using i.i.d. samples in a novel scenario where additional side information is available on the distribution. In large alphabet datasets such as text corpora, such side information arises naturally through word semantics/similarities that can be inferred by closeness...

💬 0 commentsarXiv:2601.08535v2PDF
0

Posted in eess.SP · 2026-01-13 · Fatih Merdan, Ozgur B. Akan

Airborne Particle Communication Through Time-varying Diffusion-Advection Channels

Particle-based communication using diffusion and advection has emerged as an alternative signaling paradigm recently. While most existing studies assume constant flow conditions, real macro-scale environments such as atmospheric winds exhibit time-varying behavior. In this work, airborne particle communication under time-varying...

💬 0 commentsarXiv:2601.08534v3PDF
0

Posted in quant-ph · 2026-01-13 · Viktor Khinevich, Wataru Mizukami

Symmetry-Adapted State Preparation for Quantum Chemistry on Fault-Tolerant Quantum Computers

We present systematic and resource-efficient constructions of continuous symmetry projectors, particularly $U(1)$ particle number and $SU(2)$ total spin, tailored for fault-tolerant quantum computations. Our approach employs a linear combination of unitaries (LCU) as well as generalized quantum signal processing (GQSP and GQSVT) to...

💬 0 commentsarXiv:2601.08533v1PDF
0

Posted in physics.ins-det · 2026-01-13 · Leonardo Pesce, Alessio Ludovico De Santis, Martino Calvo, Matteo Cappelli, Usasi Chowdhury, Angelo Cruciani, Giorgio Del Castello, Daniele Delicato, Matteo Folcarelli, Matteo del Gallo Roccagiovine, Alessandro Monfardini, Davide Quaranta, Marco Vignati

Enhanced Athermal Phonon Responsivity in a Kinetic Inductance Detector with Integrated Phonon Collectors

Cryogenic phonon detectors are adopted in light dark matter searches and coherent elastic neutrino-nucleus scattering experiments as they can achieve low energy thresholds. The phonon mediated sensing of silicon particle absorbers has already been proved with Kinetic Inductance Detectors (KIDs), acting both as sensors and athermal...

💬 0 commentsarXiv:2601.08532v3PDF
0

Posted in cs.AI · 2026-01-13 · Warissara Booranamaitree, Xusheng Du, Yushu Cai, Zhengyang Wang, Ye Zhang, Haoran Xie

Sketch-Based Facade Renovation With Generative AI: A Streamlined Framework for Bypassing As-Built Modelling in Industrial Adaptive Reuse

Facade renovation offers a more sustainable alternative to full demolition, yet producing design proposals that preserve existing structures while expressing new intent remains challenging. Current workflows typically require detailed as-built modelling before design, which is time-consuming, labour-intensive, and often involves...

💬 0 commentsarXiv:2601.08531v1PDF
0

Posted in cs.GT · 2026-01-13 · Zhonghao Wang, Junqiang Peng, Yuxi Liu, Mingyu Xiao

How Hard Is It to Rig a Tournament When Few Players Can Beat or Be Beaten by the Favorite?

In knockout tournaments, players compete in successive rounds, with losers eliminated and winners advancing until a single champion remains. Given a tournament digraph $D$, which encodes the outcomes of all possible matches, and a designated player $v^* \in V(D)$, the \textsc{Tournament Fixing} problem (TFP) asks whether the...

💬 0 commentsarXiv:2601.08530v1PDF
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 math.NA · 2026-01-13 · Chenguang Duan, Yuling Jiao, Gabriele Steidl, Christian Wald, Jerry Zhijian Yang, Ruizhe Zhang

Sampling via Stochastic Interpolants by Langevin-based Velocity and Initialization Estimation in Flow ODEs

We propose a novel method for sampling from unnormalized Boltzmann densities based on a probability flow ordinary differential equation (ODE) derived from linear stochastic interpolants. The key innovation of our approach is the use of a sequence of Langevin samplers to enable efficient simulation of the flow. Specifically, these...

💬 0 commentsarXiv:2601.08527v2PDF