arXiv subjects

Yuxin Liu

Publications and source records attributed to Yuxin Liu.

At least 55 records · Page 3Linked to original sources

arXiv2026

Chiral Magnetic effect as the anomaly in the transverse axial vector Ward Identity

Through analyzing the quark propagator under the magnetic field, we establish that the axial anomaly originates from an additional Dirac structure in quark propagator induced by the magnetic field. This Dirac structure also allows one to connect the axial anomaly with the topological properties of the system by checking the axial vector Ward identity. For the tree level propagator, we reproduce the result of the anomalous axial current as in the Dirac Hamiltonian approach and kinetic theory. Particularly, we confirm that the chiral magnetic effect (CME) comes from the same term that is in charge of the axial anomaly, specifically, as the anomaly of the transversal axial vector Ward Identity. The identity guarantees that the CME conductivity $C_{\rm CME}$ is a constant as $C_{\rm CME}=\frac{1}{2π^2}$, and is robust against the temperature, chemical potential, magnetic field and also interaction. Finally, we verify this numerically by applying the full quark propagator under magnetic field calculated from the functional QCD methods.

hep-th↗

arXiv2026

Multimodal Protein Language Models for Enzyme Kinetic Parameters: From Substrate Recognition to Conformational Adaptation

Predicting enzyme kinetic parameters quantifies how efficiently an enzyme catalyzes a specific substrate under defined biochemical conditions. Canonical parameters such as the turnover number ($k_\text{cat}$), Michaelis constant ($K_\text{m}$), and inhibition constant ($K_\text{i}$) depend jointly on the enzyme sequence, the substrate chemistry, and the conformational adaptation of the active site during binding. Many learning pipelines simplify this process to a static compatibility problem between the enzyme and substrate, fusing their representations through shallow operations and regressing a single value. Such formulations overlook the staged nature of catalysis, which involves both substrate recognition and conformational adaptation. In this regard, we reformulate kinetic prediction as a staged multimodal conditional modeling problem and introduce the Enzyme-Reaction Bridging Adapter (ERBA), which injects cross-modal information via fine-tuning into Protein Language Models (PLMs) while preserving their biochemical priors. ERBA performs conditioning in two stages: Molecular Recognition Cross-Attention (MRCA) first injects substrate information into the enzyme representation to capture specificity; Geometry-aware Mixture-of-Experts (G-MoE) then integrates active-site structure and routes samples to pocket-specialized experts to reflect induced fit. To maintain semantic fidelity, Enzyme-Substrate Distribution Alignment (ESDA) enforces distributional consistency within the PLM manifold in a reproducing kernel Hilbert space. Experiments across three kinetic endpoints and multiple PLM backbones, ERBA delivers consistent gains and stronger out-of-distribution performance compared with sequence-only and shallow-fusion baselines, offering a biologically grounded route to scalable kinetic prediction and a foundation for adding cofactors, mutations, and time-resolved structural cues.

cs.CV↗

arXiv2026

Bulk superconductivity up to 96 K in pressurized nickelate single crystals

Recently, the Ruddlesden-Popper bilayer nickelate $La_3Ni_2O_7$ has emerged as a superconductor with a transition temperature ($T_c$) of approximately 80 K above 14 GPa (Refs. 1-3). Achieving higher $T_c$ in nickelate superconductors, along with the synthesis of reproducible high-quality single crystals without relying on high-oxygen-pressure growth conditions, remains a significant challenge$^{[4-7]}$. Here we report superconductivity up to 96 K under high pressure in bilayer nickelate single crystals synthesized at ambient pressure. Energy-dispersive spectroscopy, single-crystal X-ray diffraction, nuclear quadrupole resonance and scanning transmission electron microscopy evidenced high crystal quality of the flux-grown $La_2SmNi_2O_{7-δ}$ single crystals. $La_2SmNi_2O_7$ exhibits clear bulk superconductivity, including zero resistivity ($T_{c,max}^{onset}$ = 92 K and $T_{c,max}^{zero}$ = 73 K at 21.6 GPa) and the Meissner effect ($T_c$= 60 K at 20.6 GPa). A low-temperature high-pressure structural study indicates that both monoclinic and tetragonal structures can support superconductivity in this bilayer nickelate. Furthermore, we established a correlation between higher $T_c$ under high pressures and larger in-plane lattice distortion under ambient conditions, corroborated by observing even higher $T_c^{onset}$ of 96 K in $La_{1.57}Sm_{1.43}Ni_2O_{7-δ}$. This study overcomes key limitations in growing nickelate superconductor crystals, resolves the crystal structure in the superconducting state and demonstrates an effective pathway towards achieving higher $T_c$.

cond-mat.supr-con↗

arXiv2026

NTIRE 2026 Challenge on Video Saliency Prediction: Methods and Results

This paper presents an overview of the NTIRE 2026 Challenge on Video Saliency Prediction. The goal of the challenge participants was to develop automatic saliency map prediction methods for the provided video sequences. The novel dataset of 2,000 diverse videos with an open license was prepared for this challenge. The fixations and corresponding saliency maps were collected using crowdsourced mouse tracking and contain viewing data from over 5,000 assessors. Evaluation was performed on a subset of 800 test videos using generally accepted quality metrics. The challenge attracted over 20 teams making submissions, and 7 teams passed the final phase with code review. All data used in this challenge is made publicly available - https://github.com/msu-video-group/NTIRE26_Saliency_Prediction.

cs.CV↗

arXiv2026

RelativeFlow: Taming Medical Image Denoising Learning with Noisy Reference

Medical image denoising (MID) lacks absolutely clean images for supervision, leading to a noisy reference problem that fundamentally limits denoising performance. Existing simulated-supervised discriminative learning (SimSDL) and simulated-supervised generative learning (SimSGL) treat noisy references as clean targets, causing suboptimal convergence or reference-biased learning, while self-supervised learning (SSL) imposes restrictive noise assumptions that are seldom satisfied in realistic MID scenarios. We propose \textbf{RelativeFlow}, a flow matching framework that learns from heterogeneous noisy references and drives inputs from arbitrary quality levels toward a unified high-quality target. RelativeFlow reformulates flow matching by decomposing the absolute noise-to-clean mapping into relative noisier-to-noisy mappings, and realizes this formulation through two key components: 1) consistent transport (CoT), a displacement map that constrains relative flows to be components of and progressively compose a unified absolute flow, and 2) simulation-based velocity field (SVF), which constructs a learnable velocity field using modality-specific degradation operators to support different medical imaging modalities. Extensive experiments on Computed Tomography (CT) and Magnetic Resonance (MR) denoising demonstrate that RelativeFlow significantly outperforms existing methods, taming MID with noisy references.

eess.IV↗

arXiv2026

Human Gaze-based Dual Teacher Guidance Learning for Semi-Supervised Medical Image Segmentation

In the field of medical image segmentation, the scarcity of labeled data poses a major challenge for existing models to accurately perceive target regions. Compared with manual annotation, gaze data is easier and cheaper to obtain. As a classical semi-supervised learning framework, mean-teacher can effectively use a large number of unlabeled medical images for stable training through self-teaching and collaborative optimization. Our study is based on the mean-teacher framework. By combining gaze data, it aims to address two crucial issues in semi-supervised medical image segmentation: 1) expand the scale and diversity of the dataset with limited labeled data; 2) enhance the network's perception ability. We propose the Human Gaze-based Dual Teacher Guidance Learning model (HG-DTGL). In this model, human gaze serves as an additional hidden `teacher' in the mean-teacher architecture. We introduce the GazeMix to generate reliable mixed data to expand the diversity and scale of the dataset, and the Multi-scale Gaze Perception (MGP) module is used to extract the multi-scale perception of the network. A Gaze Loss is designed to align the model's perception with human gaze. We have verified HG-DTGL on multiple datasets of different modalities and achieved superior performance on a total of ten different organs/tissues, with extensive experiments. This demonstrates that our method has strong generalization ability for medical images of different modalities, and shows the great application potential of gaze data in semi-supervised medical image segmentation.

eess.IV↗

arXiv2026

Imaging foundation model for universal enhancement of non-ideal measurement CT

Non-ideal measurement computed tomography (NICT) employs suboptimal imaging protocols to expand CT applications. However, the resulting trade-offs degrade image quality, limiting clinical acceptability. Although deep learning methods have been used to enhance NICT images, their reliance on large training datasets and limited generalizability across diverse settings hinder practical use. We propose the multi-scale integrated Transformer AMPlifier (TAMP), the first imaging foundation model for universal NICT enhancement. Pre-trained on 10.8 million physics-driven simulated NICT images, TAMP generalizes effectively across various NICT settings, defect degrees, and body regions. Moreover, a parameter-efficient fine-tuning strategy enables TAMP to adapt to specific clinical scenarios using only few slices. Extensive experiments, including radiologists and real-world validations, demonstrate that TAMP consistently improves image quality and clinical acceptability, underscoring its significant potential to advance CT imaging and broaden NICT applications in clinical practice.

eess.IV↗

arXiv2026

Evidence Packing for Cross-Domain Image Deepfake Detection with LVLMs

Image Deepfake Detection (IDD) separates manipulated images from authentic ones by spotting artifacts of synthesis or tampering. Although large vision-language models (LVLMs) offer strong image understanding, adapting them to IDD often demands costly fine-tuning and generalizes poorly to diverse, evolving manipulations. We propose the Semantic Consistent Evidence Pack (SCEP), a training-free LVLM framework that replaces whole-image inference with evidence-driven reasoning. SCEP mines a compact set of suspicious patch tokens that best reveal manipulation cues. It uses the vision encoder's CLS token as a global reference, clusters patch features into coherent groups, and scores patches with a fused metric combining CLS-guided semantic mismatch with frequency-and noise-based anomalies. To cover dispersed traces and avoid redundancy, SCEP samples a few high-confidence patches per cluster and applies grid-based NMS, producing an evidence pack that conditions a frozen LVLM for prediction. Experiments on diverse benchmarks show SCEP outperforms strong baselines without LVLM fine-tuning.

cs.CV↗

arXiv2026

BLADE: Adaptive Wi-Fi Contention Control for Next-Generation Real-Time Communication

Next-generation real-time communication (NGRTC) applications, such as cloud gaming and XR, demand consistently ultra-low latency. However, through our first large-scale measurement, we find that despite the deployment of edge servers, dedicated congestion control, and loss recovery mechanisms, cloud gaming users still experience long-tail latency in Wi-Fi networks. We further identify that Wi-Fi last-mile access points (APs) serve as the primary latency bottleneck. Specifically, short-term packet delivery droughts, caused by fundamental limitations in Wi-Fi contention control standards, are the root cause. To address this issue, we propose BLADE, an adaptive contention control algorithm that dynamically adjusts the contention windows (CW) of all Wi-Fi transmitters based on the channel contention level in a fully distributed manner. Our NS3 simulations and real-world evaluations with commercial Wi-Fi APs demonstrate that, compared to standard contention control, BLADE reduces Wi-Fi packet transmission tail latency by over 5X under heavy channel contention and significantly stabilizes MAC throughput while ensuring fast and fair convergence. Consequently, BLADE reduces the video stall rate in cloud gaming by over 90%.

cs.NI↗

arXiv2026

Differential Privacy for Network Connectedness Indices

Researchers increasingly use data on social and economic networks to study a range of social science questions, but releasing statistics derived from networks can raise significant privacy concerns. We show how to release network connectedness indices that quantify assortative mixing across node attributes under edge-adjacent differential privacy. Standard privacy techniques perform poorly in this setting both because connectedness indices have high global sensitivity and because a single node's attribute can potentially be an input to connectedness in thousands of cells, leading to poor composition. Our method, which is straightforward to apply, first adds noise to node attributes, then analytically debiases downstream statistics, and finally applies a second layer of noise to protect the presence or absence of individual edges. We prove consistency and asymptotic normality of our estimators for both discrete and continuous labels and show our method works well in simulations and on real networks with as few as 200 nodes collected by social scientists.

stat.AP↗

arXiv2026

Label Noise Cleaning for Supervised Classification via Bernoulli Random Sampling

Label noise - incorrect labels assigned to observations - can substantially degrade the performance of supervised classifiers. This paper proposes a label noise cleaning method based on Bernoulli random sampling. We show that the mean label noise levels of subsets generated by Bernoulli random sampling containing a given observation are identically distributed for all clean observations, and identically distributed, with a different distribution, for all noisy observations. Although the mean label noise levels are not independent across observations, by introducing an independent coupling we further prove that they converge to a mixture of two well-separated distributions corresponding to clean and noisy observations. By establishing a linear model between cross-validated classification errors and label noise levels, we are able to approximate this mixture distribution and thereby separate clean and noisy observations without any prior label information. The proposed method is classifier-agnostic, theoretically justified, and demonstrates strong performance on both simulated and real datasets.

stat.ME↗

arXiv2026

Gradient Flow Drifting: Generative Modeling via Wasserstein Gradient Flows of KDE-Approximated Divergences

We reveal a precise mathematical framework about a new family of generative models which we call Gradient Flow Drifting. With this framework, we prove an equivalence between the recently proposed Drifting Model and the Wasserstein gradient flow of the forward KL divergence under kernel density estimation (KDE) approximation. Specifically, we prove that the drifting field of drifting model (arXiv:2602.04770) equals, up to a bandwidth-squared scaling factor, the difference of KDE log-density gradients $\nabla \log p_{\mathrm{kde}} - \nabla \log q_{\mathrm{kde}}$, which is exactly the particle velocity field of the Wasserstein-2 gradient flow of $KL(q\|p)$ with KDE-approximated densities. Besides that, this broad family of generative models can also include MMD-based generators, which arises as special cases of Wasserstein gradient flows of different divergences under KDE approximation. We provide a concise identifiability proof, and a theoretically grounded mixed-divergence strategy. We combine reverse KL and $χ^2$ divergence gradient flows to simultaneously avoid mode collapse and mode blurring, and extend this method onto Riemannian manifold which loosens the constraints on the kernel function, and makes this method more suitable for the semantic space. Preliminary experiments on synthetic benchmarks validate the framework.

cs.LG↗

arXiv2026

A note on diffusive/random-walk behaviour in Metropolis--Hastings algorithms

We prove a general result that if a Metropolis--Hastings algorithm has a proposal that is not geometrically ergodic and the acceptance rate approaches unity at a suitable rate as the state variable becomes large, then the Metropolised chain will also not be geometrically ergodic. Our conditions seem stronger than might be expected, but are shown to be necessary through a counterexample. We then turn our attention to the random walk and guided walk Metropolis algorithms. We show that if the target distribution has polynomial tails the latter converges at twice the polynomial rate of the former, but that if instead the target distribution has strictly convex potential then the random walk Metropolis behaves as a $1/2$-lazy version of the guided walk Metropolis when the state variable is large, and therefore moves at a similar (ballistic) speed.

stat.CO↗

arXiv2026

SceneStreamer: Continuous Scenario Generation as Next Token Group Prediction

Realistic and interactive traffic simulation is essential for training and evaluating autonomous driving systems. However, most existing data-driven simulation methods rely on static initialization or log-replay data, limiting their ability to model dynamic, long-horizon scenarios with evolving agent populations. We propose SceneStreamer, a unified autoregressive framework for continuous scenario generation that represents the entire scene as a sequence of tokens, including traffic light signals, agent states, and motion vectors, and generates them step by step with a transformer model. This design enables SceneStreamer to continuously introduce and retire agents over an unbounded horizon, supporting realistic long-duration simulation. Experiments demonstrate that SceneStreamer produces realistic, diverse, and adaptive traffic behaviors. Furthermore, reinforcement learning policies trained in SceneStreamer-generated scenarios achieve superior robustness and generalization, validating its utility as a high-fidelity simulation environment for autonomous driving. More information is available at https://vail-ucla.github.io/scenestreamer/ .

cs.RO↗

arXiv2026

Enhancing Persona Following at Decoding Time via Dynamic Importance Estimation for Role-Playing Agents

The utility of Role-Playing Language Agents in sociological research is growing alongside the adoption of Large Language Models. For realism in social simulation, these agents must adhere to their personas defined by character profiles, yet existing strategies-static prompt engineering or costly fine-tuning-fail to adapt personas to dynamic scenarios. Psychological theories, such as the Cognitive-Affective Personality Systems, provide a crucial explanation for this failure: a persona's influence on behavior is not static but varies with the scenarios. This context-dependence highlights the critical need for adaptive persona management. To address this gap, we propose a novel, theory-driven method that dynamically estimates context-dependent persona importance and integrates it into weighted reward-guided decoding, enabling inference-time persona following. Specifically, we introduce the Persona Dynamic Decoding (PDD) framework, which consists of two key components: (1) Persona Importance Estimation (PIE) module, which dynamically quantifies the contextual importance of persona attributes without requiring ground-truth supervision; and (2) Persona-Guided Inference-Time Alignment (PIA) paradigm, which leverages these importance scores to construct weighted multi-objective rewards and modulate generation probabilities during inference. Extensive experiments show the effectiveness of our method in utterance consistency and behavioral fidelity.

cs.CL↗

arXiv2026

Stress-driven dynamic evolution of core-shell structured cavities with H and He in BCC-Fe under fusion conditions

Understanding the dynamic behavior of microstructures formed under fusion conditions is critical for designing high-performance structural materials for fusion reactors. Under fusion conditions, cavities of core-shell structures are formed due to the interaction between irradiation-induced vacancies and H and He atoms produced via transmutation. In this study, thermodynamic analysis and molecular dynamics simulations are combined to investigate the atomic-scale mechanisms and dynamic response of core-shell cavities formed in BCC-Fe under applied stress/strain fields. The thermodynamic analysis provides both the foundational reference for cavity structures under fusion neutron irradiation and the initial configurations for atomistic simulations. Building on this framework, atomic-scale simulations demonstrate that H and He play a decisive role in the stress-strain response and the evolution of elastic-plastic deformation within the cavities. In core-shell configurations, H atoms serve a function analogous to that in He-filled cavities, synergistically interacting with He to induce cavity deformation under mechanical loading.

cond-mat.mtrl-sci↗

arXiv2026

A Deployable Bio-inspired Compliant Leg Design for Enhanced Leaping in Quadruped Robots

Quadruped robots are becoming increasingly essential for various applications, including industrial inspection and catastrophe search and rescue. These scenarios require robots to possess enhanced agility and obstacle-navigation skills. Nonetheless, the performance of current platforms is often constrained by insufficient peak motor power, limiting their ability to perform explosive jumps. To address this challenge, this paper proposes a bio-inspired method that emulates the energy-storage mechanism found in froghopper legs. We designed a Deployable Compliant Leg (DCL) utilizing a specialized 3D-printed elastic material, Polyether block amide (PEBA), featuring a lightweight internal lattice structure. This structure functions analogously to biological tendons, storing elastic energy during the robot's squatting phase and rapidly releasing it to augment motor output during the leap. The proposed mechanical design significantly enhances the robot's vertical jumping capability. Through finite element analysis (FEA) and experimental validation, we demonstrate a relative performance improvement of 17.1% in vertical jumping height.

cs.RO↗

arXiv2026

Reply to "Threefold error in the reported zero-field cooled magnetic moment of single crystal $La_2SmNi_2O_7$ (arXiv: 2602.23240)"

We respond to the critique by Aleksandr V. Korolev and Evgeny F. Talantsev on the superconducting phase fraction ($f$) calculations in Li et al. Nature 649, 871-878 (2026). First, the weak upturn in the low-temperature tail of our data has been confirmed to originate from the background, and the paramagnetic Meissner effect is absent in our case; thus, field-cooled (FC) data can be used for superconducting phase fraction calculations. Second, demagnetization effect must be calculated based on the actual measured moment as a function of $f$, which has been well-established and routinely employed in the superconductivity community. In contrast, Korolev and Talantsev treated the demagnetization field as a constant; thus, their calculation underestimates $f$ by a factor of $(1-Nχ_{meas})(1-N)$. This factor is close to 1/3, given $N$ = 0.849, $χ_{meas}$ = -1.313 in our study, which explains the origin of their deviated result (nearly three times smaller than our results). Third, our sample is a homogeneous high-quality bulk single crystal, evidenced by various techniques, making the existence of multiple discrete superconducting regions highly unlikely. We conclude that the superconducting phase fraction calculations reported in Li et al. Nature 649, 871-878 (2026) are not invalidated by the analyses presented in Korolev et al. arXiv: 2602.23240 (2026).

cond-mat.supr-con↗