Qwen Councils

All arXiv

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

0

Posted in math.AP · 2026-01-19 · Minh Le

A Sharp Global Boundedness Result for Keller--Segel--(Navier--)Stokes Systems with Rapid Diffusion and Saturated Sensitivities

We investigate the Keller--Segel--(Navier--)Stokes system posed in a smooth bounded domain \(Ω\subset \mathbb{R}^N\) with \(N = 2,3\): \begin{equation*} \begin{cases} n_t + u \cdot \nabla n = Δn - \nabla \cdot \big( n S(n)\nabla c \big), \\[2mm] u \cdot \nabla c = Δc - c + n, \\[2mm] u_t + κ(u \cdot \nabla) u = Δu - \nabla P + n...

💬 0 commentsarXiv:2601.12733v1PDF
0

Posted in math.AP · 2026-01-19 · Chen Huang, Zhipeng Yang

On a class of logarithmic Schrödinger equations via perturbation method

In this paper, we consider the following logarithmic Schrödinger equation \[ -Δu + V(x)u = u \log u^{2},\quad x\in\mathbb{R}^{N}. \] Assuming that \(V\in C(\mathbb{R}^{N},\mathbb R)\), \(V\) is bounded away from zero, and \(V(x)\to+\infty\) as \(|x|\to\infty\), we develop a new perturbative variational approach to overcome the...

💬 0 commentsarXiv:2601.12732v2PDF
0

Posted in cs.CL · 2026-01-19 · Stefano Civelli, Pietro Bernardelle, Nicolò Brunello, Gianluca Demartini

A Shared Geometry of Difficulty in Multilingual Language Models

Predicting problem-difficulty in large language models (LLMs) refers to estimating how difficult a task is according to the model itself, typically by training linear probes on its internal representations. In this work, we study the multilingual geometry of problem-difficulty in LLMs by training linear probes using the AMC subset of...

💬 0 commentsarXiv:2601.12731v1PDF
0

Posted in cs.LG · 2026-01-19 · Zhaochun Li, Chen Wang, Jionghao Bai, Shisheng Cui, Ge Lan, Zhou Zhao, Yue Wang

Distribution-Centric Policy Optimization Dominates Exploration-Exploitation Trade-off

The exploration-exploitation (EE) trade-off is a central challenge in reinforcement learning (RL) for large language models (LLMs). With Group Relative Policy Optimization (GRPO), training tends to be exploitation driven: entropy decreases monotonically, samples convergence, and exploration fades. Most existing fixes are...

💬 0 commentsarXiv:2601.12730v1PDF
0

Posted in cs.CV · 2026-01-19 · Hanyu Zhu, Zhihao Zhan, Yuhang Ming, Liang Li, Dibo Hou, Javier Civera, Wanzeng Kong

DC-VLAQ: Query-Residual Aggregation for Robust Visual Place Recognition

One of the central challenges in visual place recognition (VPR) is learning a robust global representation that remains discriminative under large viewpoint changes, illumination variations, and severe domain shifts. While visual foundation models (VFMs) provide strong local features, most existing methods rely on a single model,...

💬 0 commentsarXiv:2601.12729v1PDF
0

Posted in astro-ph.GA · 2026-01-19 · Momoko Makita, Tomoharu Oka, Shiho Tsujimoto, Tatsuya Kotani

Discovery of Multiple Ultra-Broad-Velocity Molecular Features Associated with the W44 Molecular Cloud

We report the discovery of multiple compact molecular features exhibiting extremely broad velocity widths toward the W44 molecular cloud. ALMA CO $J$=3--2 data reveal eight ``Petit--Bullets'' surrounding the previously known ``Bullet.'' Each Petit--Bullet shows a distinct V-shaped structure in position--velocity space, reminiscent of...

💬 0 commentsarXiv:2601.12728v1PDF
0

Posted in math.HO · 2026-01-19 · Chloé Brismontier

Gender and assessment in mathematics: a comparative study of managing assessment episodes

The article focuses on the differences in mathematics performance between girls and boys visible from the first four months of compulsory schooling in the French education system. The influence of gender stereotypes in the evaluation practices of teachers and the threat of the gender stereotype on student performance are questioned....

💬 0 commentsarXiv:2601.12908v1PDF
0

Posted in math.NA · 2026-01-19 · Maxime Bouchereau

Machine Learning for highly oscillatory differential equations

Highly oscillatory differential equations, commonly encountered in multi-scale problems, are often too complex to solve analytically. However, several numerical methods have been developed to approximate their solutions. Although these methods have shown their efficiency, the first part of the strategy often involves heavy...

💬 0 commentsarXiv:2601.12907v1PDF
0

Posted in cs.CL · 2026-01-19 · Lingrui Mei, Shenghua Liu, Yiwei Wang, Yuyao Ge, Baolong Bi, Jiayu Yao, Jun Wan, Ziling Yin, Jiafeng Guo, Xueqi Cheng

Gated Differentiable Working Memory for Long-Context Language Modeling

Long contexts challenge transformers: attention scores dilute across thousands of tokens, critical information is often lost in the middle, and models struggle to adapt to novel patterns at inference time. Recent work on test-time adaptation addresses this by maintaining a form of working memory -- transient parameters updated on the...

💬 0 commentsarXiv:2601.12906v1PDF
0

Posted in cond-mat.supr-con · 2026-01-19 · Hui Hu, Zhao Liu, Jia Wang, Xia-Ji Liu

Finite-momentum bound pairs of two electrons in an altermagnetic metal

We solve the two-electron problem on a square lattice with d-wave altermagnetism, considering both on-site and nearest-neighbor attractive interactions. The altermagnetic spin-splitting in the single-particle dispersion naturally gives rise to a ground state of two-electron bound pairs with nonzero center-of-mass momentum. The...

💬 0 commentsarXiv:2601.12905v2PDF
0

Posted in cs.CL · 2026-01-19 · Jiahao Wang, Weiyu Xie, Mingxing Zhang, Boxing Zhang, Jianwei Dong, Yuening Zhu, Chen Lin, Jinqi Tang, Yaochen Han, Zhiyuan Ai, Xianglin Chen, Yongwei Wu, Congfeng Jiang

From Prefix Cache to Fusion RAG Cache: Accelerating LLM Inference in Retrieval-Augmented Generation

Retrieval-Augmented Generation enhances Large Language Models by integrating external knowledge, which reduces hallucinations but increases prompt length. This increase leads to higher computational costs and longer Time to First Token (TTFT). To mitigate this issue, existing solutions aim to reuse the preprocessed KV cache of each...

💬 0 commentsarXiv:2601.12904v1PDF
0

Posted in cs.LG · 2026-01-19 · Meng Liu, Ke Liang, Siwei Wang, Xingchen Hu, Sihang Zhou, Xinwang Liu

Deep Temporal Graph Clustering: A Comprehensive Benchmark and Datasets

Temporal Graph Clustering (TGC) is a new task with little attention, focusing on node clustering in temporal graphs. Compared with existing static graph clustering, it can find the balance between time requirement and space requirement (Time-Space Balance) through the interaction sequence-based batch-processing pattern. However, there...

💬 0 commentsarXiv:2601.12903v1PDF
0

Posted in cs.DL · 2026-01-19 · Mokhtar Ben Henda

Audit du syst{è}me d'information et du mod{è}le de gouvernance de la Biblioth{è}que Num{é}rique de l'Espace universitaire Francophone (BNEUF) du projet Initiative pour le D{é}veloppement du Num{é}rique dans l'Espace Universitaire Francophone (IDNEUF)

This document provides an assessment of the overall structure of the BNEUF system and how it operates within the framework of the Initiative for Digital Development in French speaking Universities (IDNEUF). This report aims to support the AUF's new strategy for 2021-2025, with its new structural and governance foundations for the...

💬 0 commentsarXiv:2601.12902v1PDF
0

Posted in cs.RO · 2026-01-19 · Hongchen Li, Tianyu Li, Jiazhi Yang, Haochen Tian, Caojun Wang, Lei Shi, Mingyang Shang, Zengrong Lin, Gaoqiang Wu, Zhihui Hao, Xianpeng Lang, Jia Hu, Hongyang Li

PlannerRFT: Reinforcing Diffusion Planners through Closed-Loop and Sample-Efficient Fine-Tuning

Diffusion-based planners have emerged as a promising approach for human-like trajectory generation in autonomous driving. Recent works incorporate reinforcement fine-tuning to enhance the robustness of diffusion planners through reward-oriented optimization in a generation-evaluation loop. However, they struggle to generate...

💬 0 commentsarXiv:2601.12901v1PDF
0

Posted in cs.LG · 2026-01-19 · Eliran Sherzer, Yonit Barron

Supervised Learning for the (s,S) Inventory Model with General Interarrival Demands and General Lead Times

The continuous-review (s,S) inventory model is a cornerstone of stochastic inventory theory, yet its analysis becomes analytically intractable when dealing with non-Markovian systems. In such systems, evaluating long-run performance measures typically relies on costly simulation. This paper proposes a supervised learning framework...

💬 0 commentsarXiv:2601.12900v1PDF
0

Posted in cond-mat.str-el · 2026-01-19 · Jiahao Yang, Hao Tian, Si-Yu Pan, Gang v. Chen

Emergent gauge flux and spin ordering in magnetized triangular spin liquids: applications to Hofstadter-Hubbard model

Motivated by the recent progress in the moiré superlattice systems and spin-1/2 triangular lattice antiferromagnets, we revisit the triangular-lattice spin liquids and study their magnetic responses. While the magnetic responses on the ordered phases can be mundane, the orbital magnetic flux and the Zeeman coupling have synergetic...

💬 0 commentsarXiv:2601.12898v1PDF
0

Posted in math.CO · 2026-01-19 · Jing Yang, Fangming Xian

On the number of spanning trees of bicirculant graphs

A bi-Cayley graph over a cyclic group $\mathbb{Z}_n$ is called a bicirculant graph. Let $Γ=BC(\mathbb{Z}_n; R,T,S)$ be a bicirculant graph with $R=R^{-1}\subseteq \mathbb{Z}_n\setminus \{0\}$ and $T=T^{-1}\subseteq \mathbb{Z}_n\setminus \{0\}$ and $S\subseteq \mathbb{Z}_n$. In this paper, using Chebyshev polynomials, we obtain a...

💬 0 commentsarXiv:2601.12899v2PDF
0

Posted in math.CV · 2026-01-19 · Piotr Migus, Laurenţiu Păunescu, Mihai Tibăr

Bi-Lipschitz invariance of Newton polygons along gradient canyons

We study bi-Lipschitz right-equivalence of holomorphic function germs $f:(\mathbb{C}^2,0)\to(\mathbb{C},0)$ via polar arcs and gradient canyons. For a polar arc $γ$ we consider the Newton polygon of $f_x(X+γ(Y),Y)$ and define its augmentation by adjoining the point $(0,\operatorname{ord} f(γ(y),y)-1)$. We prove that the resulting...

💬 0 commentsarXiv:2601.12897v2PDF
0

Posted in econ.EM · 2026-01-19 · Eric Vansteenberghe

Quantitative Methods in Finance

These lecture notes provide a comprehensive introduction to Quantitative Methods in Finance (QMF), designed for graduate students in finance and economics with heterogeneous programming backgrounds. The material develops a unified toolkit combining probability theory, statistics, numerical methods, and empirical modeling, with a...

💬 0 commentsarXiv:2601.12896v2PDF
0

Posted in cs.CV · 2026-01-19 · Chan Naseeb, Adeel Ashraf Cheema, Hassan Sami, Tayyab Afzal, Muhammad Omair, Usman Habib

TwoHead-SwinFPN: A Unified DL Architecture for Synthetic Manipulation, Detection and Localization in Identity Documents

The proliferation of sophisticated generative AI models has significantly escalated the threat of synthetic manipulations in identity documents, particularly through face swapping and text inpainting attacks. This paper presents TwoHead-SwinFPN, a unified deep learning architecture that simultaneously performs binary classification...

💬 0 commentsarXiv:2601.12895v1PDF
0

Posted in cs.RO · 2026-01-19 · Kangye Ji, Jianbo Zhou, Yuan Meng, Ye Li, Hanyun Cui, Zhi Wang

Sparse ActionGen: Accelerating Diffusion Policy with Real-time Pruning

Diffusion Policy has dominated action generation due to its strong capabilities for modeling multi-modal action distributions, but its multi-step denoising processes make it impractical for real-time visuomotor control. Existing caching-based acceleration methods typically rely on $\textit{static}$ schedules that fail to adapt to the...

💬 0 commentsarXiv:2601.12894v2PDF
0

Posted in hep-th · 2026-01-19 · Di Wu, Shuang-Qing Wu

Static four-charge squashed black hole in five-dimensional $STU-W^2U$ supergravity and its thermodynamics

In this paper, we present a remarkably simple expression for the exact solution to the $D = 5$, $\mathcal{N} = 2$ supergravity coupled to three vector multiplets with the prepotential $\mathcal{V} = STU -W^2U \equiv 1$, which represents a five-dimensional static Kaluza-Klein black hole with squashed $S^3$ horizons and four independent...

💬 0 commentsarXiv:2601.14315v2PDF
0

Posted in cs.LG · 2026-01-19 · Ting Dang, Soumyajit Chatterjee, Hong Jia, Yu Wu, Flora Salim, Fahim Kawsar

AdaNODEs: Test Time Adaptation for Time Series Forecasting Using Neural ODEs

Test time adaptation (TTA) has emerged as a promising solution to adapt pre-trained models to new, unseen data distributions using unlabeled target domain data. However, most TTA methods are designed for independent data, often overlooking the time series data and rarely addressing forecasting tasks. This paper presents AdaNODEs, an...

💬 0 commentsarXiv:2601.12893v1PDF
0

Posted in cond-mat.mtrl-sci · 2026-01-19 · Weilun Li, Qimu Yuan, Michael B. Johnston, Joanne Etheridge

Discovery of Ferroelectric Twin Boundaries in a Photoactive Halide Perovskite

Halide perovskites have emerged as promising materials for next-generation photovoltaics, laser sources and X-ray detectors. There is intense debate as to whether some photoactive halide perovskites exhibit ferroelectric behaviour and whether it might be possible to utilise the bulk photovoltaic effect to enhance the performance of...

💬 0 commentsarXiv:2601.12892v1PDF
0

Posted in cond-mat.mes-hall · 2026-01-19 · Wietze D. Huisman, Sebastiaan L. D. ten Haaf, Chun-Xiao Liu, Qingzhen Wang, Alberto Bordin, Florian J. Bennebroek Evertsz', Bart Roovers, Michael Wimmer, Srijit Goswami

Using Andreev bound states and spin to remove domain walls in a Kitaev chain

Quantum dot-superconductor hybrids have been established as a suitable platform for realizing Kitaev chains hosting Majorana bound states. Implementing these structures in a qubit architecture is expected to result in coherence times that scale exponentially with the lengths of the chains. To scale to longer systems, the phase...

💬 0 commentsarXiv:2601.12891v1PDF