arXiv subjects

Jian Wang

Publications and source records attributed to Jian Wang.

At least 361 records · Page 20Linked to original sources

arXiv2025

Exceedingly large in-plane critical field of finite-momentum pairing state in bulk superlattices

Magnetic flux profoundly influences the phase factor of charge particles, leading to exotic quantum phenomena. A recent example is that the orbital effect of magnetic field could induce finite-momentum pairing state in nanoflakes, which offers a new pathway to realize the spatially modulated superconductivity distinct from the Fulde-Ferrell-Larkin-Ovchinnikov (FFLO) state induced by Zeeman effect. However, whether such intriguing state can exist in the bulk materials under extremely large magnetic field remains elusive. Here we report the orbital effect induced finite-momentum pairing state with exceedingly large in-plane critical field in a bulk superconducting superlattice. Remarkably, the in-plane critical field shows a pronounced upturn behavior, exceeding eight times the Pauli limit which is comparable to monolayer Ising superconductor. Under high in-plane magnetic fields, significant anisotropic transport behavior between the interlayer and intralayer directions is detected, highlighting the critical role of suppressed interlayer coherence in the orbital effect induced finite-momentum pairing state. Crucially, this finite-momentum pairing state remains robust against moderate disorder. Our findings suggest that van der Waals superlattices, with strong Ising spin-orbit coupling and tunable interlayer coherence, offer new avenues for constructing and modulating unconventional superconducting states.

cond-mat.supr-con↗

arXiv2025

FauForensics: Boosting Audio-Visual Deepfake Detection with Facial Action Units

The rapid evolution of generative AI has increased the threat of realistic audio-visual deepfakes, demanding robust detection methods. Existing solutions primarily address unimodal (audio or visual) forgeries but struggle with multimodal manipulations due to inadequate handling of heterogeneous modality features and poor generalization across datasets. To this end, we propose a novel framework called FauForensics by introducing biologically invariant facial action units (FAUs), which is a quantitative descriptor of facial muscle activity linked to emotion physiology. It serves as forgery-resistant representations that reduce domain dependency while capturing subtle dynamics often disrupted in synthetic content. Besides, instead of comparing entire video clips as in prior works, our method computes fine-grained frame-wise audiovisual similarities via a dedicated fusion module augmented with learnable cross-modal queries. It dynamically aligns temporal-spatial lip-audio relationships while mitigating multi-modal feature heterogeneity issues. Experiments on FakeAVCeleb and LAV-DF show state-of-the-art (SOTA) performance and superior cross-dataset generalizability with up to an average of 4.83\% than existing methods.

cs.CV↗

arXiv2025

CF-VLM:CounterFactual Vision-Language Fine-tuning

Recent advances in vision-language models (VLMs) have greatly improved cross-modal semantic understanding, yet significant limitations remain in fine-grained discrimination and deep causal reasoning tasks. Existing VLMs often rely on superficial statistical correlations, lacking the ability to capture the underlying causal logic between visual and textual content. To address this, we propose CounterFactual Vision-Language Fine-tuning (CF-VLM), a novel framework that enhances the causal reasoning capabilities of VLMs through the targeted use of counterfactual samples. CF-VLM introduces three complementary training objectives: maintaining foundational cross-modal alignment, reinforcing the uniqueness and stability of factual scene representations against coherent counterfactuals, and sharpening the model's sensitivity to minimal but critical causal edits. Extensive experiments demonstrate that CF-VLM consistently outperforms strong baselines and state-of-the-art methods on compositional reasoning and generalization benchmarks. Furthermore, it shows promise in mitigating visual hallucinations, indicating improved factual consistency. Our CF-VLM provides a robust foundation for deploying VLMs in high-stakes, real-world scenarios requiring reliable reasoning and interpretability.

cs.LG↗

arXiv2025

Scaling over Scaling: Exploring Test-Time Scaling Plateau in Large Reasoning Models

Large reasoning models (LRMs) have exhibited the capacity of enhancing reasoning performance via internal test-time scaling. Building upon this, a promising direction is to further scale test-time compute to unlock even greater reasoning capabilities. However, as we push these scaling boundaries, systematically understanding the practical limits and achieving optimal resource allocation becomes a critical challenge. In this paper, we investigate the scaling plateau of test-time scaling and introduce the Test-Time Scaling Performance Model (TTSPM). We theoretically analyze two fundamental paradigms for such extended scaling, parallel scaling and sequential scaling, from a probabilistic modeling perspective. Our primary contribution is the derivation of the saturation point on the scaling budget for both strategies, identifying thresholds beyond which additional computation yields diminishing returns. Remarkably, despite their distinct mechanisms, both paradigms converge to a unified mathematical structure in their upper bounds. We empirically validate our theoretical findings on challenging reasoning benchmarks, including AIME, MATH-500, and GPQA, demonstrating the practical utility of these bounds for test-time resource allocation. We hope that this work provides insights into the cost-benefit trade-offs of test-time scaling, guiding the development of more resource-efficient inference strategies for large reasoning models.

cs.AI↗

arXiv2025

Inner fluctuations and the spectral Einstein functional

The spectral metric and Einstein functionals defined by two vector fields and Laplace-type operators over vector bundles, giving an interesting example of the spinor connection and square of the Dirac operator. Motivated by the spectral functionals and Dirac operators with inner fluctuations, we give some new spectral functionals which is the extension of spectral functionals for Dirac operators, and compute the spectral Einstein functional for the Dirac operator with inner fluctuations on even-dimensional spin manifolds without boundary.

math.DG↗

arXiv2025

The overflow in the Katona Theorem

Let $n>2r>0$ be integers. We consider families $\mathcal{F}$ of subsets of an $n$-element set, in which the union of any two members has size at most $2r$. One of our results states that for $n\geq 6r$ the number of members of size exceeding $r$ in $\mathcal{F}$ is at most $\binom{n-2}{r-1}$. Another result shows that for $n>3.5r$ the number of sets of size at least $r$ is at most $\binom{n}{r}$. Both bounds are best possible and the latter sharpens the classical Katona Theorem. Similar results are proved for the odd case of the Katona Theorem as well.

math.CO↗

arXiv2025

Why Safeguarded Ships Run Aground? Aligned Large Language Models' Safety Mechanisms Tend to Be Anchored in The Template Region

The safety alignment of large language models (LLMs) remains vulnerable, as their initial behavior can be easily jailbroken by even relatively simple attacks. Since infilling a fixed template between the input instruction and initial model output is a common practice for existing LLMs, we hypothesize that this template is a key factor behind their vulnerabilities: LLMs' safety-related decision-making overly relies on the aggregated information from the template region, which largely influences these models' safety behavior. We refer to this issue as template-anchored safety alignment. In this paper, we conduct extensive experiments and verify that template-anchored safety alignment is widespread across various aligned LLMs. Our mechanistic analyses demonstrate how it leads to models' susceptibility when encountering inference-time jailbreak attacks. Furthermore, we show that detaching safety mechanisms from the template region is promising in mitigating vulnerabilities to jailbreak attacks. We encourage future research to develop more robust safety alignment techniques that reduce reliance on the template region.

cs.CL↗

arXiv2025

A highly sensitive SF$_6$-based leak test system for JUNO 3-inch PMT underwater electronics boxes

A total of 25600 3-inch photomultiplier tubes (PMTs), along with their corresponding frontend electronics, have been installed at the Jiangmen Underground Neutrino Observatory (JUNO). These electronics are housed in 200 stainless steel boxes that operate underwater. To verify the sealing integrity of the underwater boxes following integration, we developed an SF$_6$-based leak test system, opting against the typical helium-based system due to helium's ability to penetrate the PMT glass. After a few hours of accumulating leaking SF$_6$ from the underwater boxes, a leak rate detection limit of $2.3\times{10}^{-9}$~Pa$\cdot$m$^3$/s in terms of SF$_6$ was achieved, corresponding to $1.65\times{10}^{-8}$~Pa$\cdot$ m$^3$/s helium equivalent. This meets the sensitivity requirement of 1$\times$10$^{-7}$~Pa$\cdot$m$^3$/s. This system was critical in identifying and replacing a few cases of leaking underwater boxes before installation.

physics.ins-det↗

arXiv2025

STeCa: Step-level Trajectory Calibration for LLM Agent Learning

Large language model (LLM)-based agents have shown promise in tackling complex tasks by interacting dynamically with the environment. Existing work primarily focuses on behavior cloning from expert demonstrations or preference learning through exploratory trajectory sampling. However, these methods often struggle to address long-horizon tasks, where suboptimal actions accumulate step by step, causing agents to deviate from correct task trajectories. To address this, we highlight the importance of timely calibration and the need to automatically construct calibration trajectories for training agents. We propose Step-Level Trajectory Calibration (STeCa), a novel framework for LLM agent learning. Specifically, STeCa identifies suboptimal actions through a step-level reward comparison during exploration. It constructs calibrated trajectories using LLM-driven reflection, enabling agents to learn from improved decision-making processes. We finally leverage these calibrated trajectories with successful trajectories for reinforced training. Extensive experiments demonstrate that STeCa significantly outperforms existing methods. Further analysis highlights that timely calibration enables agents to complete tasks with greater robustness. Our code and data are available at https://github.com/WangHanLinHenry/STeCa.

cs.LG↗

arXiv2025

Unconventional Hall Effect in Gapless Superconductors: Transverse Supercurrent Converted from Normal Current

A normal metallic system proximitized by a superconductor can exhibit a gapless superconducting state characterized by segmented Fermi surfaces, as confirmed experimentally. In such a state, quasiparticle states remain gapless along one direction, while a superconducting gap opens in the perpendicular direction. This anisotropy enables a novel Hall effect in gapless superconductors, termed the superconducting Hall effect (ScHE), where a longitudinal normal current carried by quasiparticles is converted into a dissipationless transverse supercurrent. Employing both the thermodynamic approach for bulk systems and quantum transport theory for a four-probe setup, we demonstrate the existence of this effect and reveal its intrinsic origin as the quasiparticle Berry curvature. The predicted ScHE can be experimentally verified via the standard angular-dependent Hall measurements performed on gapless superconductors.

cond-mat.mes-hall↗

arXiv2025

The spectral torsion for the one form rescaled Dirac operator

The spectral torsion is defined by three vector fields and Dirac operators and the noncommutative residue. Motivated by the spectral torsion and the one form rescaled Dirac operator, we give some new spectral torsion which is the extension of spectral torsion for Dirac operators, and compute the spectral torsion for the one form rescaled Dirac operator on even-dimensional spin manifolds without boundary.

math.DG↗

arXiv2025

From Motion to Behavior: Hierarchical Modeling of Humanoid Generative Behavior Control

Human motion generative modeling or synthesis aims to characterize complicated human motions of daily activities in diverse real-world environments. However, current research predominantly focuses on either low-level, short-period motions or high-level action planning, without taking into account the hierarchical goal-oriented nature of human activities. In this work, we take a step forward from human motion generation to human behavior modeling, which is inspired by cognitive science. We present a unified framework, dubbed Generative Behavior Control (GBC), to model diverse human motions driven by various high-level intentions by aligning motions with hierarchical behavior plans generated by large language models (LLMs). Our insight is that human motions can be jointly controlled by task and motion planning in robotics, but guided by LLMs to achieve improved motion diversity and physical fidelity. Meanwhile, to overcome the limitations of existing benchmarks, i.e., lack of behavioral plans, we propose GBC-100K dataset annotated with a hierarchical granularity of semantic and motion plans driven by target goals. Our experiments demonstrate that GBC can generate more diverse and purposeful high-quality human motions with 10* longer horizons compared with existing methods when trained on GBC-100K, laying a foundation for future research on behavioral modeling of human motions. Our dataset and source code will be made publicly available.

cs.RO↗

arXiv2025

SPA-RL: Reinforcing LLM Agents via Stepwise Progress Attribution

Reinforcement learning (RL) holds significant promise for training LLM agents to handle complex, goal-oriented tasks that require multi-step interactions with external environments. However, a critical challenge when applying RL to these agentic tasks arises from delayed rewards: feedback signals are typically available only after the entire task is completed. This makes it non-trivial to assign delayed rewards to earlier actions, providing insufficient guidance regarding environmental constraints and hindering agent training. In this work, we draw on the insight that the ultimate completion of a task emerges from the cumulative progress an agent makes across individual steps. We propose Stepwise Progress Attribution (SPA), a general reward redistribution framework that decomposes the final reward into stepwise contributions, each reflecting its incremental progress toward overall task completion. To achieve this, we train a progress estimator that accumulates stepwise contributions over a trajectory to match the task completion. During policy optimization, we combine the estimated per-step contribution with a grounding signal for actions executed in the environment as the fine-grained, intermediate reward for effective agent training. Extensive experiments on common agent benchmarks (including Webshop, ALFWorld, and VirtualHome) demonstrate that SPA consistently outperforms the state-of-the-art method in both success rate (+2.5\% on average) and grounding accuracy (+1.9\% on average). Further analyses demonstrate that our method remarkably provides more effective intermediate rewards for RL training. Our code is available at https://github.com/WangHanLinHenry/SPA-RL-Agent.

cs.CL↗

arXiv2025

Irreducibility and ergodicity of SPDEs driven by pure jump noise

The irreducibility is fundamental for the study of ergodicity of stochastic dynamical systems. The existing methods on the irreducibility of stochastic partial differential equations (SPDEs) and stochastic differential equations (SDEs) driven by pure jump noise are basically along the same lines as that for the Gaussian case, which are not particularly suitable for jump noise. As a result, restrictive conditions are usually placed on the driving jump noise. Basically the driving noises are additive type and more or less in the class of stable processes. In this paper, we develop a new and effective method to obtain the irreducibility of SPDEs and SDEs driven by multiplicative pure jump noise. The conditions placed on the coefficients and the driving noise are very mild, and in some sense they are necessary and sufficient. As an application of our main results, we remove all the restrictive conditions on the driving noises in the literature,and derive new irreducibility results of a large class of equations driven by pure jump noise, including SPDEs with locally monotone coefficients, SPDEs/SDEs with singular coefficients, nonlinear Schrödinger equations, etc. We emphasize that under our setting the driving noises could be compound Poisson processes, even allowed to be infinite dimensional. As further applications of the main results, we obtain the ergodicity of multi-valued, singular stochastic evolution inclusions such as stochastic 1-Laplacian evolution (total variation flow), stochastic sign fast diffusion equation, stochastic minimal surface flow, stochastic curve shortening flow, etc.

math.PR↗

arXiv2025

Training Turn-by-Turn Verifiers for Dialogue Tutoring Agents: The Curious Case of LLMs as Your Coding Tutors

Intelligent tutoring agents powered by large language models (LLMs) have been increasingly explored to deliver personalized knowledge in areas such as language learning and science education. However, their capabilities in guiding users to solve complex real-world tasks remain underexplored. To address this limitation, in this work, we focus on coding tutoring, a challenging problem that requires tutors to proactively guide students towards completing predefined coding tasks. We propose a novel agent workflow, Trace-and-Verify (TRAVER), which combines knowledge tracing to estimate a student's knowledge state and turn-by-turn verification to ensure effective guidance toward task completion. We introduce DICT, an automatic evaluation protocol that assesses tutor agents using controlled student simulation and code generation tests. Extensive experiments reveal the challenges of coding tutoring and demonstrate that TRAVER achieves a significantly higher success rate. Although we use code tutoring as an example in this paper, our approach can be extended beyond coding, providing valuable insights into advancing tutoring agents for human task learning.

cs.CL↗

arXiv2025

Orr-Sommerfeld equation and complex deformation

For shear flows in a 2D channel, we define resonances near regular values of the shear profile for the Rayleigh equation under an analyticity assumption. This is done via complex deformation of the interval on which Rayleigh equation is considered. We show such resonances are inviscid limits of the eigenvalues of the corresponding Orr--Sommerfeld equation.

math.AP↗

arXiv2025

Auto-Prompting SAM for Weakly Supervised Landslide Extraction

Weakly supervised landslide extraction aims to identify landslide regions from remote sensing data using models trained with weak labels, particularly image-level labels. However, it is often challenged by the imprecise boundaries of the extracted objects due to the lack of pixel-wise supervision and the properties of landslide objects. To tackle these issues, we propose a simple yet effective method by auto-prompting the Segment Anything Model (SAM), i.e., APSAM. Instead of depending on high-quality class activation maps (CAMs) for pseudo-labeling or fine-tuning SAM, our method directly yields fine-grained segmentation masks from SAM inference through prompt engineering. Specifically, it adaptively generates hybrid prompts from the CAMs obtained by an object localization network. To provide sufficient information for SAM prompting, an adaptive prompt generation (APG) algorithm is designed to fully leverage the visual patterns of CAMs, enabling the efficient generation of pseudo-masks for landslide extraction. These informative prompts are able to identify the extent of landslide areas (box prompts) and denote the centers of landslide objects (point prompts), guiding SAM in landslide segmentation. Experimental results on high-resolution aerial and satellite datasets demonstrate the effectiveness of our method, achieving improvements of at least 3.0\% in F1 score and 3.69\% in IoU compared to other state-of-the-art methods. The source codes and datasets will be available at https://github.com/zxk688.

cs.CV↗

arXiv2025

Automated Quality Evaluation of Cervical Cytopathology Whole Slide Images Based on Content Analysis

The ThinPrep Cytologic Test (TCT) is the most widely used method for cervical cancer screening, and the sample quality directly impacts the accuracy of the diagnosis. Traditional manual evaluation methods rely on the observation of pathologist under microscopes. These methods exhibit high subjectivity, high cost, long duration, and low reliability. With the development of computer-aided diagnosis (CAD), an automated quality assessment system that performs at the level of a professional pathologist is necessary. To address this need, we propose a fully automated quality assessment method for Cervical Cytopathology Whole Slide Images (WSIs) based on The Bethesda System (TBS) diagnostic standards, artificial intelligence algorithms, and the characteristics of clinical data. The method analysis the context of WSIs to quantify quality evaluation metrics which are focused by TBS such as staining quality, cell counts and cell mass proportion through multiple models including object detection, classification and segmentation. Subsequently, the XGBoost model is used to mine the attention paid by pathologists to different quality evaluation metrics when evaluating samples, thereby obtaining a comprehensive WSI sample score calculation model. Experimental results on 100 WSIs demonstrate that the proposed evaluation method has significant advantages in terms of speed and consistency.

eess.IV↗