Searcharxiv⌕ Search

arXiv subjects

Yan Liu

Publications and source records attributed to Yan Liu.

At least 55 records · Page 3Linked to original sources
arXiv2026

HCSU: A Dataset and Benchmark for Fine-Grained Historical Calligraphy Style Understanding

Automated fine-grained perception of calligraphy styles--a task vital to cultural heritage preservation--remains a critical challenge for Large Vision-Language Models (LVLMs), largely constrained by existing datasets that suffer from modal mixture and flattened labels. To bridge this gap, we introduce HCSU, the first comprehensive dataset tailored for fine-grained Historical Calligraphy Style Understanding. HCSU comprises 39,307 meticulously curated character images from 49 historically prominent calligraphers across 10 dynasties, systematically decoupling authentic ink manuscripts (Tie) from stone rubbings (Bei) to resolve the long-standing modal mixture problem. Moving beyond conventional flattened labels, HCSU provides hierarchical expert-written aesthetic descriptions, enabling two rigorous evaluation protocols: fine-grained style discrimination and interpretable aesthetic reasoning. Extensive evaluations reveal a persistent gap between calligraphy-related knowledge and visually grounded style perception: state-of-the-art LVLMs show non-trivial performance but remain sensitive to script-level, textual, and source-specific cues, and often struggle to ground aesthetic judgments in fine-grained brushwork evidence. Ultimately, the HCSU benchmark exposes fundamental limitations in current multimodal architectures, aiming to inspire the evolution of expert-level visual reasoning for cultural heritage preservation. The dataset is available at https://huggingface.co/datasets/Tongji209/HCSU.

cs.CV↗
arXiv2026

AirZoo: A Unified Large-Scale Dataset for Grounding Aerial Geometric 3D Vision

Despite the rapid progress in data-driven 3D vision, aerial geometric 3D vision remains a formidable challenge due to the severe scarcity of large-scale, high-fidelity training data. Existing benchmarks, predominantly biased toward ground-level or object-centric views, do not account for complex viewpoint transformations and diverse environmental conditions in UAV-based sensing. To bridge this critical gap, we propose AirZoo, a unified large-scale dataset and benchmark for grounding aerial geometric 3D vision. AirZoo possesses three appealing properties: 1) Scalable Generation Pipeline: Leveraging freely available, world-scale photogrammetric 3D meshes, it renders vast outdoor environments with customizable UAV flight trajectories and configurable weather/illumination. 2) Comprehensive Scene Diversity: It provides the most extensive coverage of region types to date (spanning 378 regions across 22 countries), systematically encompassing both highly structured urban landscapes and complex unstructured natural environments. 3) Rich Geometric Annotations: Each frame provides synchronized, pixel-level metric depth and precise 6-DoF geo-referenced poses, essential for geometry-aware learning. Through three rigorous evaluation tracks -- aerial image retrieval, cross-view matching, and multi-view 3D reconstruction -- we demonstrate that AirZoo serves as a powerful pre-training engine. Extensive experiments on both public and newly collected real-world benchmarks reveal that fine-tuning on AirZoo yields substantial performance gains for SoTA models (e.g., MegaLoc, RoMa, VGGT, and Depth Anything 3), establishing a new performance upper bound for aerial spatial intelligence.

cs.CV↗
arXiv2026

Nonlinear nature of near-equilibrium viscous fluids

We study the late-time relaxation of a neutral relativistic viscous fluid in $d+1$ dimensions. In the long-wavelength regime, linearized hydrodynamics predicts that the sound mode at momentum $nk$ decays as $e^{-n^2ω_I t}$. However, nonlinear analysis gives a decay of $e^{-nω_I t}$. We derive a closed asymptotic attractor solution in which the frequency of the $n$-th harmonic locks to $n$ times the complex frequency of the fundamental mode. The amplitude envelopes for energy current $J$ obey a simple cascading relation, $J_n=α_J^{\,n-1}J_1^n$, with $α_J$ fixed by the equation of state, the longitudinal viscosity, and the fundamental wavenumber. For conformal fluids, $α_J=1/(8ηk)$, in agreement with the holographic result of arXiv:2512.07242. The existence of the attractor shows that, even near equilibrium, field powers are not equivalent to amplitude order.

hep-th↗
arXiv2026

Winding-Sector Transitions and Thermodynamic Incommensurability in Helical Valence Bond Phase under Tilted Boundary Conditions

We investigate the ground states of the $S = 1/2$ staircase $J$-$Q_3$ model in the maximally anisotropic limit by employing projector quantum Monte Carlo simulations. To overcome boundary-induced finite-size ambiguities inherent in the study of spatially modulated structures, we implement a $45^{\circ}$ tilted periodic boundary condition that eliminates intermediate phases and provides direct access to winding-sector transitions of the system. By defining a domain wall density to quantify the spatial modulation of the helical valence bond phase, we perform thermodynamic extrapolations and demonstrate that both the domain wall density and the characteristic wavevector evolve continuously with the coupling ratio, exhibiting no commensurate lock-in behavior. Our results establish that the helical valence bond phase is a genuine two-dimensional incommensurate phase with long-range bond-bond order in the thermodynamic limit, clarifying that winding-sector transitions are finite-size effects enforced by boundary commensurability. Furthermore, we determine the phase transition point between columnar valence bond solid phase and helical valence bond phase to be $g_c = 0.046(2)$.

cond-mat.str-el↗
arXiv2026

NGSE-Corr: A technique for objective clinical evaluation of quantitative-imaging methods without a gold standard

Objective evaluation of quantitative-imaging (QI) methods based on how reliably they measure true values is important for clinical translation. Performing such evaluation with patient data is highly desirable but hindered by the lack of gold standards. To address this challenge, advancing on previous studies, we propose a no-gold-standard evaluation technique, NGSE-Corr, that objectively evaluates QI methods without true values. The technique assumes a linear stochastic relationship between true and measured values, characterized by a slope, bias, and multivariate Gaussian-distributed noise term that models correlated noise across QI methods. We derive a maximum-likelihood approach to estimate these parameters using only measured values. From the estimates, we compute noise-to-slope ratio (NSR) to rank QI methods based on precision. Numerical experiments showed that NGSE-Corr reliably estimated the NSR, accurately ranked methods, and maintained performance even when assumptions made by the technique were partially violated. We also validated NGSE-Corr in an in silico imaging trial to rank three quantitative SPECT methods for measuring regional activity uptake in patients with bone metastatic castrate-resistant prostate cancer treated with radium-223. NGSE-Corr correctly identified the most precise QI method and ranked the methods for 95% (95% CI, 89%-98%) and 91% (95% CI, 84%-95%) of trials, respectively, with data from 50 patients. Performance further improved with larger cohorts. With 200 patients, NGSE-Corr yielded same rankings as those obtained with true values across all trial instances. These findings demonstrate the ability of NGSE-Corr to accurately rank QI methods without gold standards and motivate clinical validation and broader applications.

physics.med-ph↗
arXiv2026

Speaking Numbers to LLMs: Multi-Wavelet Number Embeddings for Time Series Forecasting

Large language models (LLMs) are attractive for context-aware time series forecasting because they can integrate heterogeneous textual signals, yet their discrete, language-oriented tokenization and embedding interfaces are misaligned with continuous numerical values, often harming numerical ordering and forecasting reliability. We propose TempoWave, a plug-and-play temporal wavelet digit interface that maps each scalar observation into digit-wise embeddings constructed from multi-wavelet, multi-scale coefficients. By directly overriding standard token representations, TempoWave seamlessly exposes both fine-grained local fluctuations and macro global structures in a transformer-compatible form, ensuring that precise numerical formatting, distinct digit identity, and robustness to common normalization operations are maintained throughout the LLM pipeline. Experiments across five context-enriched forecasting benchmarks demonstrate that TempoWave consistently improves LLM-based forecasters over standard numeric tokenization and alternative embedding interfaces, achieving a new state-of-the-art. These results highlight the numeric interface as a key bottleneck and suggest that principled multi-resolution embeddings can better couple LLMs' contextual reasoning with precise forecasting. Our code is available at https://github.com/DC-research/TempoWAVE and our model can be accessed at https://huggingface.co/Melady/TempoWAVE.

cs.CL↗
arXiv2026

Wigner-Negative Magnon Steady States from Incoherent Qubit Pumping

We show that incoherently pumped qubits can realize a cascaded dissipative mechanism for stabilizing Wigner-negative magnon steady states. The mechanism combines qubit pumping with dispersive magnon-number selectivity to direct the steady-state population toward selected magnon Fock states. In the single-qubit case, the single-magnon population can approach unity, accompanied by strong antibunching and pronounced Wigner negativity. Extending the same principle to multiple qubits yields Wigner-negative steady states dominated by higher magnon Fock components. We further derive an analytical birth--death model that captures the mechanism and agrees with numerical results. These results establish incoherent qubit pumping as a controllable dissipative resource for generating nonclassical magnon states in hybrid quantum systems.

quant-ph↗
arXiv2026

Continual Test-Time Adaptation for Object Detection with Adaptive Monitoring and Randomized Restoration

Real-world application models are commonly deployed in dynamic environments, where the target domain distribution undergoes temporal changes. Continual Test-Time Adaptation (CTTA) has recently emerged as a promising technique to gradually adapt a source-trained model to continually changing target domains. Despite recent advancements in addressing CTTA, two critical issues remain: 1) Fixed thresholds for pseudo-labeling in existing methodologies lead to low-quality pseudo-labels, as model confidence varies across categories and domains; 2) Stochastic parameter restoration methods for mitigating catastrophic forgetting fail to preserve critical information effectively, due to their intrinsic randomness. To tackle these challenges for detection models in CTTA scenarios, we present AMROD, featuring three core components. Firstly, the object-level contrastive learning module extracts object-level features for contrastive learning to refine the feature representation in the target domain. Secondly, the adaptive monitoring module dynamically skips unnecessary adaptation and updates the category-specific threshold based on predicted confidence scores to enable efficiency and improve the quality of pseudo-labels. Lastly, the adaptive randomized restoration mechanism selectively reset inactive parameters with higher possibilities, ensuring the retention of essential knowledge. We demonstrate the effectiveness of AMROD on four CTTA object detection tasks, where AMROD outperforms existing methods, especially achieving a 3.2 mAP improvement and a 20% increase in efficiency on the Cityscapes-to-Cityscapes-C CTTA task. The code of this work is available at https://github.com/ShileiCao/AMROD.

cs.CV↗
arXiv2026

ARTSN: Exact and Adaptive Self-triggered Traffic Scheduling for ARTS Networks

Autonomous real-time systems (ARTS), such as self-driving vehicles and robotic assembly lines, are increasingly deployed to improve efficiency, accuracy, and responsiveness with reduced human intervention. In ARTS networks, self-triggered (ST) traffic-initiated by internal decision-making rather than fixed schedules or external events-is becoming prevalent and plays a critical role in enabling timely autonomous actions. However, existing network schedulers do not adequately support ST traffic due to two inherent challenges: volatility, where bounded processing jitter leads to uncertain arrival times, and absence, where reserved network resources remain underutilized when ST traffic does not materialize. To address these challenges, we propose ARTSN, an ST-tailored scheduling paradigm built upon time-sensitive networking (TSN). ARTSN introduces two key techniques: (1) an exact offline scheduling method that leverages the inferable arrival information of ST traffic for precise time-slot reservation, and (2) an adaptive online slot-release mechanism that dynamically reclaims unused reservations when ST traffic is absent. Extensive experiments on both a TSN simulator and a real-world testbed show that ARTSN significantly improves schedulability, scalability, and efficiency over state-of-the-art methods while maintaining reliable transmission guarantees.

cs.NI↗
arXiv2026

A Survey of Reasoning and Agentic Systems in Time Series with Large Language Models

Time series reasoning treats time as a first-class axis and incorporates intermediate evidence directly into the answer. This survey defines the problem and organizes the literature by reasoning topology with three families: direct reasoning in one step, linear chain reasoning with explicit intermediates, and branch-structured reasoning that explores, revises, and aggregates. The topology is crossed with the main objectives of the field, including traditional time series analysis, explanation and understanding, causal inference and decision making, and time series generation, while a compact tag set spans these axes and captures decomposition and verification, ensembling, tool use, knowledge access, multimodality, agent loops, and LLM alignment regimes. Methods and systems are reviewed across domains, showing what each topology enables and where it breaks down in faithfulness or robustness, along with curated datasets, benchmarks, and resources that support study and deployment (https://github.com/blacksnail789521/Time-Series-Reasoning-Survey). Evaluation practices that keep evidence visible and temporally aligned are highlighted, and guidance is distilled on matching topology to uncertainty, grounding with observable artifacts, planning for shift and streaming, and treating cost and latency as design budgets. We emphasize that reasoning structures must balance capacity for grounding and self-correction against computational cost and reproducibility, while future progress will likely depend on benchmarks that tie reasoning quality to utility and on closed-loop testbeds that trade off cost and risk under shift-aware, streaming, and long-horizon settings. Taken together, these directions mark a shift from narrow accuracy toward reliability at scale, enabling systems that not only analyze but also understand, explain, and act on dynamic worlds with traceable evidence and credible outcomes.

cs.AI↗
arXiv2026

GLACIER: A Multimodal Student-Teacher Foundation Model for Molecular Property Prediction

Deep learning models facilitate the discovery of molecules with tailored properties among billions of candidate compounds. However, the computational burden to develop and deploy state-of-the-art models continuously increases, limiting their scalability. Most large-scale models are unimodal in nature and overlook the potential to leverage complementary molecular data modalities. To address these shortcomings, this paper introduces the Graph-Language Alignment for Chemical Inference and Exploration using Representations (GLACIER) model, a student-teacher framework that integrates molecular graphs, SMILES strings, and physicochemical descriptors to learn rich molecular embeddings. Our framework consists of three stages: (1) we pretrain three student encoders on 100,000 drug-like molecules: a message-passing neural network for molecular graphs, a transformer-based encoder for SMILES strings, and a multilayer perceptron for physicochemical descriptors, (2) we fuse these student modalities using a novel Finsler geometry-aware module, and (3) distill complementary knowledge from large teacher models, including MiniMol and MolFormer, into a single lightweight model via contrastive learning. We demonstrate that GLACIER is a robust framework that delivers high predictive performance and computational efficiency in complex molecular property prediction tasks. Our code is publicly available at https://github.com/eemokey/glacier.

cs.LG↗
arXiv2026

Projecting the Emerging Mindset of SWE Agent by Launching a Wild Code Understanding Journey

Software engineering agents (SWE agents) increasingly work through tool-mediated trajectories in real repositories, yet their behavior remains difficult to characterize in concrete, observable terms. These trajectories record tool use, intermediate reasoning, evidence selection, and self-directed stopping, but they do not by themselves explain why particular moves were chosen, what evidence was trusted, or when understanding was judged sufficient. This tension makes trajectory data both limited and valuable: faithful, replayable traces can become an empirical substrate for studying agent behavior when interpreted through disciplined observation. We introduce Ada, a scoped apparatus for repository-level code understanding. Ada enters real codebases through a bounded tool interface, allowing open-ended exploration to remain recordable as finite trajectories. Across this wild-but-bounded setting, Ada chooses where to look, what to read closely, when to consolidate partial understanding, and when to close its account of the repository. We project Ada's think-action chains through observation lenses that make navigation, evidence selection, synthesis, grounding, and stopping visible without reducing behavior to raw tool counts or speculating about hidden intent. Read together, these lenses produce behavioral profiles grounded in recorded movement through software worlds. Across 408 trajectories, spanning multiple models, repositories, task families, and launch conditions, the study shows how faithful digital traces can be transformed into disciplined, comparable projections of emerging SWE-agent mindset. The results expose differences in efficiency, trajectory diversity, epistemic grounding, and the limits of intervention, while providing a methodological foundation for observing SWE agent behavior in real codebases.

cs.SE↗
arXiv2026

An information criterion for detecting periodicities in functional time series

We propose an information criterion for determining an unknown number of periodic components in functional time series. Identifying the number of frequencies in large-scale time series has been a central focus. To achieve this goal, we suggest an iterative procedure, utilizing the residual process obtained through least squares fitting. This iterative approach demonstrates broad applicability. We establish the consistency of the estimated number of periodic components by minimizing the information criterion. The efficacy of the procedure is illustrated through numerical simulations. In real data analysis, we apply this information criterion to temperature data and sunspot data.

stat.ME↗
arXiv2026

Locally Adaptive Conformal Inference for Operator Models

Operator models are regression algorithms between Banach spaces of functions. They have become an increasingly critical tool for spatiotemporal forecasting and physics emulation, especially in high-stakes scenarios where robust, calibrated uncertainty quantification is required. We introduce Local Sliced Conformal Inference (LSCI), a distribution-free framework for generating function-valued, locally adaptive prediction sets for operator models. We prove finite-sample validity and derive a data-dependent upper bound on the coverage gap under local exchangeability. On synthetic Gaussian-process tasks and real applications (air quality monitoring, energy demand forecasting, and weather prediction), LSCI yields tighter sets with stronger adaptivity compared to conformal baselines. We also empirically demonstrate robustness against biased predictions and certain out-of-distribution noise regimes.

stat.ML↗
arXiv2026

Coarse-to-Fine Multi-Resolution Diffusion Models for Trajectory Generation in Urban Systems

Understanding human mobility is critical for a wide range of urban applications, including traffic management, epidemic control, and urban planning. However, due to privacy concerns, the availability of large-scale public trajectory data remains limited, posing challenges for downstream mobility analysis. Existing methods for synthetic trajectory generation primarily focus on matching global distribution similarity, while often overlooking mobility patterns across different spatial and temporal resolutions that are essential for practical utility. To address these challenges, we propose a novel multi-resolution diffusion framework, MR-Traj, for large-scale trajectory generation. MR-Traj explicitly models trajectories as compositions of coarse-grained milestones and fine-grained segments, enabling the capture of complex spatial-temporal dependencies at multiple resolutions. Experimental results demonstrate that MR-Traj achieves comparable performance to state-of-the-art methods in terms of global distribution similarity, while consistently outperforming them in modeling fine-resolution mobility patterns and supporting downstream urban mobility tasks. In addition, by introducing stochasticity at multiple resolution levels, MR-Traj generates more diverse trajectories, which empirically reduces trajectory linkage risk under a seed-guided data release setting. Our code is available at https://github.com/Ray0202/MR-Traj.

cs.LG↗
arXiv2026

Topology Matters: Measuring Memory Leakage in Multi-Agent LLMs

Graph topology is a fundamental determinant of memory leakage in multi-agent LLM systems, yet its effects remain poorly quantified. We introduce MAMA (Multi-Agent Memory Attack), a controlled evaluation framework for comparing topology-conditioned memory leakage in multi-agent LLM systems. MAMA operates on synthetic documents containing labeled Personally Identifiable Information (PII) entities, from which we generate sanitized task instructions. We execute a two-phase protocol: Engram (seeding private information into a target agent's memory) and Resonance (multi-round interaction where an attacker attempts extraction). Over 10 rounds, we measure leakage using a two-stage recovery criterion that combines exact-match extraction with LLM-based inference over the attacker's final output. We evaluate six canonical topologies (complete, circle, chain, tree, star, star-ring) across $n\in\{4,5,6\}$, attacker-target placements, and base models. Results are consistent: denser connectivity, shorter attacker-target distance, and higher target centrality increase leakage; most leakage occurs in early rounds and then plateaus; model choice shifts absolute rates but preserves broad structural trends; spatiotemporal/location attributes leak more readily than identity credentials or regulated identifiers. We distill practical guidance for system design: favor sparse or hierarchical connectivity, maximize attacker-target separation, and restrict hub/shortcut pathways via topology-aware access control. Our code is available at https://github.com/llll121/mama-eval.

cs.CR↗
arXiv2026

SHERLOCK: Towards Dynamic Knowledge Adaptation in LLM-enhanced E-commerce Risk Management

Effective e-commerce risk management requires in-depth case investigations to identify emerging fraud patterns in highly adversarial environments. However, manual investigation typically requires analyzing the associations and couplings among multi-source heterogeneous data, a labor-intensive process that limits efficiency. While Large Language Models (LLMs) show promise in automating these analyses, their deployment is hindered by the complexity of risk scenarios and the sparsity of long-tail domain knowledge. To address these challenges, we propose Sherlock, a framework that integrates structured domain knowledge with LLM-based reasoning through three core modules. First, we construct a domain Knowledge Base (KB) by distilling structured expertise from heterogeneous knowledge sources. Second, we design a two-stage retrieval-augmented generation strategy tailored for case investigation, which combines input contextual augmentation with a Reflect & Refine module to fully leverage the KB for improved analysis quality. Finally, we develop an integrated platform for operations and annotation to drive a self-evolving data flywheel. By combining real-time hotfixes through KB updates with periodic logic alignment via post-training, we facilitate continuous system evolution to counteract adversarial drifts. Online A/B tests at JD dot com demonstrate that Sherlock achieves an 82% Expert Acceptance Rate (EAR) and a 386.7% increase in daily investigation throughput. An additional 90-day evaluation shows that the flywheel successfully recovers from performance decay caused by changing tactics twice, raising the EAR ceiling by around 3.5% through autonomous model updates.

cs.IR↗
arXiv2026

Aligning Shared and Routed Experts for Cross-Subject EEG Generalization

Cross-subject EEG generalization is challenging due to substantial heterogeneity across subjects. Existing methods typically learn either a shared subject-invariant model or multiple subject-specialized experts, but these two paradigms fail in complementary ways: the former may over-reduce subject-specific discriminative signals, while the latter may under-reduce transferable structure. We show that their suitability depends on the reducibility cost of branch-specific functions to branch-invariant ones, and we further provide a theory-to-method mapping that instantiates alignment principles in cross-subject EEG learning. Based on this insight, we propose Shared-Routed Expert Alignment (SREA), a collaborative framework that couples a shared expert for reducible invariant functions with routed experts for irreducible subject-specific functions. SREA trains the shared branch with joint embedding over augmented temporal neighbors, the routed branch with prototype-based sparse routing and expert specialization, and both branches with numerically stable mutual-guided reweighting based on cross-branch learnability gaps. Experiments on seven public EEG benchmarks across different tasks show that SREA consistently outperforms state-of-the-art methods and EEG foundation models.

cs.CE↗