arXiv subjects

Fangfang Wang

Publications and source records attributed to Fangfang Wang.

At least 19 recordsLinked to original sources

arXiv2026

Response Morphologies of a Canonical Fluctuation Diagnostic Across Ehrenfest Phase Transitions

Microcanonical inflection-point analysis identifies MIPA-type higher-order transition structures from derivatives of the microcanonical entropy. Until recently, however, there was no canonical formulation for probing the corresponding fluctuation-level behavior directly from measurable energy fluctuations without reconstructing the density of states. Previous work addressed this limitation by introducing a canonical fluctuation diagnostic that quantifies energy-fluctuation asymmetry. Here, we investigate how this diagnostic behaves across representative first-, second-, and third-order phase transitions in the Ehrenfest classification. We consider the eight-state Potts model, the two-dimensional Ising model, and ideal three-dimensional Bose--Einstein condensation. The Potts and Ising systems exhibit a robust paired-extremum structure of the diagnostic near their respective transition regions, whereas ideal Bose--Einstein condensation exhibits a discontinuous response at the condensation temperature in the thermodynamic limit. These results show that a single fluctuation-based observable can display qualitatively distinct response morphologies across thermodynamic regimes, reflecting sensitivity to the nature of the underlying phase transition rather than serving as a direct classifier of Ehrenfest order.

cond-mat.stat-mech↗

arXiv2026

Cross-Platform Chinese Offensive Comment Detection via Dual-Threshold Hard Example Mining

Cross-platform deployment of offensive comment detection for Chinese social media suffers performance degradation. The paper proposes a dual-threshold hard mining method to address this. First, the clean-Chinese-base RoBERTa is finetuned on COLD to establish a binary baseline for fair comparison. Second, a three-class fine-labeled test set covering Weibo, Xiaohongshu, Tieba, and Zhihu is constructed, domain distances from the source are quantified using Jaccard and Proxy-A Distance, as well as the degradation bottleneck of the baseline under domain shift is systematically revealed. Herein, a dual threshold hard example mining strategy is proposed. High- and low-confidence error-prone samples are filtered from unlabeled corpora by prediction confidence. The model is secondarily finetuned under implicit contexts with merely a small set of manually labeled hard examples, realizing low-cost cross-platform domain adaptation. Experiments reveal significant performance gains of the optimized model across four platforms.

cs.CL↗

arXiv2026

Threshold-Controlled Geometric Reorganization in 2D Bootstrap Percolation

Two-dimensional bootstrap percolation is usually characterized by bulk observables, but whether increasing the activation threshold qualitatively reorganizes the geometry of the absorbing state has remained unclear. Here we show that the response undergoes a threshold-controlled geometric crossover. At low thresholds, the extrema of bulk and boundary-sensitive observables remain confined to a single collective low-$p$ window. At high thresholds, they split into distinct branches, revealing multiple geometric response scales. Over the accessible system sizes, the dominant finite-size signatures shift from fluctuations of the final active density to non-singleton boundary observables, while the fluctuation peak itself decreases. Time-resolved mechanism traces show that this crossover is accompanied by a progression from extended collective propagation to frontier exhaustion and, at the highest threshold, to quasi-one-step stabilization. Our results identify boundary organization as the dominant structural signature of high-threshold bootstrap percolation and show that conventional bulk observables alone do not capture the full reorganization of the absorbing state.

cond-mat.stat-mech↗

arXiv2026

Spectral Signatures of Third-Order Pseudo-Transitions in Finite Systems: An Eigen-Microstate Approach

Third-order pseudo-transitions in finite systems reflect reorganization beyond conventional criticality, yet their identification usually relies on microcanonical entropy, which is often inaccessible in practice. Here we introduce a spectral generalized response within the eigen-microstate framework. From the distribution of normalized spectral weights, we construct the third-order ratio $R_3=K_3/(K_2)^3$, which probes asymmetric redistribution among fluctuation modes beyond leading-mode condensation. Across Ising and Potts models on regular lattices and random regular networks, extrema of $R_3$ consistently track higher-order anomalies. Combined with spectral projection, the method further distinguishes dependent and independent branches: the former remain tied to the dominant ordering channel, whereas the latter arise from redistribution within the subleading fluctuation subspace. The effective spectral dimension $R_{\mathrm{eff}}$ provides the participation background in which these anomalies develop. These results establish a geometric characterization of third-order pseudo-transitions as reorganizations of statistical weight in configuration space and provide an order-parameter-free route to finite-size structural criticality.

cond-mat.stat-mech↗

arXiv2026

Not all tokens contribute equally to diffusion learning

With the rapid development of conditional diffusion models, significant progress has been made in text-to-video generation. However, we observe that these models often neglect semantically important tokens during inference, leading to biased or incomplete generations under classifier-free guidance. We attribute this issue to two key factors: distributional bias caused by the long-tailed token frequency in training data, and spatial misalignment in cross-attention where semantically important tokens are overshadowed by less informative ones. To address these issues, we propose Distribution-Aware Rectification and Spatial Ensemble (DARE), a unified framework that improves semantic guidance in diffusion models from the perspectives of distributional debiasing and spatial consistency. First, we introduce Distribution-Rectified Classifier-Free Guidance (DR-CFG), which regularizes the training process by dynamically suppressing dominant tokens with low semantic density, encouraging the model to better capture underrepresented semantic cues and learn a more balanced conditional distribution. This design mitigates the risk of the model distribution overfitting to tokens with low semantic density. Second, we propose Spatial Representation Alignment (SRA), which adaptively reweights cross-attention maps according to token importance and enforces representation consistency, enabling semantically important tokens to exert stronger spatial guidance during generation. This mechanism effectively prevents low semantic-density tokens from dominating the attention allocation, thereby avoiding the dilution of the spatial and distributional guidance provided by high semantic-density tokens. Extensive experiments on multiple benchmark datasets demonstrate that DARE consistently improves generation fidelity and semantic alignment, achieving significant gains over existing approaches.

cs.CV↗

arXiv2026

Third-order transitions in Ising and Potts models on Watts--Strogatz small-world networks

We study third-order transitions in the two-dimensional Ising and Potts model on regular lattices and Watts--Strogatz small-world networks. Cluster observables are used to track post-critical boundary reorganization and pre-critical cluster breakup. For the Ising model, the critical temperature $T_c$ is calibrated independently from Binder-cumulant crossings and susceptibility peaks, whereas for the Potts model on small-world networks it is identified operationally from the dominant critical peak of $\mathrm d\langle P\rangle/\mathrm dT$. The independent and dependent third-order transitions are identified from the isolated-spin peak and the post-critical structural extremum, respectively. For both lattice and small-world topologies, we find the robust ordering $T_{\mathrm{ind}}<T_c<T_{\mathrm{dep}}$. Increasing the rewiring probability shifts all three characteristic temperatures upward and enhances the visibility of the post-critical transition. The effect is especially clear in the Potts model, where perimeter-based observables are more sensitive to multistate boundary fluctuations. The systematic persistence of the characteristic temperature hierarchy across topologies and finite sizes argues against interpreting these features as incidental finite-size irregularities. Instead, our results support their interpretation as genuine third-order transitions whose structural detectability can be amplified by network topology.

cond-mat.stat-mech↗

arXiv2026

Canonical Criterion for Third-Order Transitions

Microcanonical inflection-point analysis (MIPA) identifies third-order transitions from derivatives of the microcanonical entropy, but whether such transitions admit a direct canonical formulation has remained unclear. Here we establish a fluctuation-based canonical framework for third-order transitions through a cumulant-ratio criterion whose signed extrema define their canonical counterparts and, in the single-saddle regime, are asymptotically linked to microcanonical classification. Because the criterion depends only on energy cumulants, it avoids explicit density-of-states reconstruction and remains operational in nonequilibrium steady states. Physically, it reveals dependent and independent third-order transitions as fluctuation reorganizations around low-order transitions, namely disordered-side precursors and ordered-side restructuring. Benchmarks on Onsager's two-dimensional Ising solution, finite size Potts models, and a driven nonreciprocal Ising model show that the framework is theoretically grounded and broadly applicable.

cond-mat.stat-mech↗

arXiv2025

MamFusion: Multi-Mamba with Temporal Fusion for Partially Relevant Video Retrieval

Partially Relevant Video Retrieval (PRVR) is a challenging task in the domain of multimedia retrieval. It is designed to identify and retrieve untrimmed videos that are partially relevant to the provided query. In this work, we investigate long-sequence video content understanding to address information redundancy issues. Leveraging the outstanding long-term state space modeling capability and linear scalability of the Mamba module, we introduce a multi-Mamba module with temporal fusion framework (MamFusion) tailored for PRVR task. This framework effectively captures the state-relatedness in long-term video content and seamlessly integrates it into text-video relevance understanding, thereby enhancing the retrieval process. Specifically, we introduce Temporal T-to-V Fusion and Temporal V-to-T Fusion to explicitly model temporal relationships between text queries and video moments, improving contextual awareness and retrieval accuracy. Extensive experiments conducted on large-scale datasets demonstrate that MamFusion achieves state-of-the-art performance in retrieval effectiveness. Code is available at the link: https://github.com/Vision-Multimodal-Lab-HZCU/MamFusion.

cs.CV↗

arXiv2024

Pseudo Transitions in the Finite-Size Blume-Capel Model

This article investigates the pseudo transitions of the Blume-Capel model on two-dimensional finite-size lattices. By employing the Wang-Landau sampling method and microcanonical inflection point analysis, we identified the positions of phase transitions as well as higher-order phase transitions. Through Metropolis sampling and canonical ensemble analysis, we determined the geometric characteristics of the system at these transition points. When the crystal field parameter $D$ exceeds 1.965, crossing the tricritical point, no third-order dependent phase transition is observed. However, a fourth-order independent transition was identified in the high-temperature region, and through Metropolis sampling analysis, a phase transition from the ordered paramagnetic phase to the disordered paramagnetic phase was confirmed, enhancing the phase diagram. Furthermore, the positions of the third-order phase transition obtained from both microcanonical and canonical analyses are consistent and mutually corroborative. We speculate that third-order dependent transitions vanish in the presence of strong first-order phase transitions.

cond-mat.stat-mech↗

arXiv2024

Geometric properties of the additional third-order transitions in the two-dimensional Potts model

Within the canonical ensemble framework, this paper investigates the presence of higher-order transition signals in the $q$-state Potts model (for $q \geq 3$), using two geometric order parameters: isolated spins number and the average perimeter of clusters. Our results confirm that higher-order transitions exist in the Potts model, where the number of isolated spins reliably indicates third-order independent transitions. This signal persists regardless of the system's phase transition order, even at higher values of $q$. In contrast, the average perimeter of clusters, used as an order parameter for detecting third-order dependent transitions, shows that for $q = 6$ and $q = 8$, the signal for third-order dependent transitions disappears, indicating its absence in systems undergoing first-order transitions. These findings are consistent with results from microcanonical inflection-point analysis, further validating the robustness of this approach.

cond-mat.stat-mech↗

arXiv2024

Self-distilled Dynamic Fusion Network for Language-based Fashion Retrieval

In the domain of language-based fashion image retrieval, pinpointing the desired fashion item using both a reference image and its accompanying textual description is an intriguing challenge. Existing approaches lean heavily on static fusion techniques, intertwining image and text. Despite their commendable advancements, these approaches are still limited by a deficiency in flexibility. In response, we propose a Self-distilled Dynamic Fusion Network to compose the multi-granularity features dynamically by considering the consistency of routing path and modality-specific information simultaneously. Two new modules are included in our proposed method: (1) Dynamic Fusion Network with Modality Specific Routers. The dynamic network enables a flexible determination of the routing for each reference image and modification text, taking into account their distinct semantics and distributions. (2) Self Path Distillation Loss. A stable path decision for queries benefits the optimization of feature extraction as well as routing, and we approach this by progressively refine the path decision with previous path information. Extensive experiments demonstrate the effectiveness of our proposed model compared to existing methods.

cs.CV↗

arXiv2023

Deep Feature Screening: Feature Selection for Ultra High-Dimensional Data via Deep Neural Networks

The applications of traditional statistical feature selection methods to high-dimension, low sample-size data often struggle and encounter challenging problems, such as overfitting, curse of dimensionality, computational infeasibility, and strong model assumption. In this paper, we propose a novel two-step nonparametric approach called Deep Feature Screening (DeepFS) that can overcome these problems and identify significant features with high precision for ultra high-dimensional, low-sample-size data. This approach first extracts a low-dimensional representation of input data and then applies feature screening based on multivariate rank distance correlation recently developed by Deb and Sen (2021). This approach combines the strengths of both deep neural networks and feature screening, and thereby has the following appealing features in addition to its ability of handling ultra high-dimensional data with small number of samples: (1) it is model free and distribution free; (2) it can be used for both supervised and unsupervised feature selection; and (3) it is capable of recovering the original input data. The superiority of DeepFS is demonstrated via extensive simulation studies and real data analyses.

stat.ML↗

arXiv2023

Semiparametric Regression for Spatial Data via Deep Learning

In this work, we propose a deep learning-based method to perform semiparametric regression analysis for spatially dependent data. To be specific, we use a sparsely connected deep neural network with rectified linear unit (ReLU) activation function to estimate the unknown regression function that describes the relationship between response and covariates in the presence of spatial dependence. Under some mild conditions, the estimator is proven to be consistent, and the rate of convergence is determined by three factors: (1) the architecture of neural network class, (2) the smoothness and (intrinsic) dimension of true mean function, and (3) the magnitude of spatial dependence. Our method can handle well large data set owing to the stochastic gradient descent optimization algorithm. Simulation studies on synthetic data are conducted to assess the finite sample performance, the results of which indicate that the proposed method is capable of picking up the intricate relationship between response and covariates. Finally, a real data analysis is provided to demonstrate the validity and effectiveness of the proposed method.

stat.ML↗

arXiv2023

Calibrating multi-dimensional complex ODE from noisy data via deep neural networks

Ordinary differential equations (ODEs) are widely used to model complex dynamics that arises in biology, chemistry, engineering, finance, physics, etc. Calibration of a complicated ODE system using noisy data is generally very difficult. In this work, we propose a two-stage nonparametric approach to address this problem. We first extract the de-noised data and their higher order derivatives using boundary kernel method, and then feed them into a sparsely connected deep neural network with ReLU activation function. Our method is able to recover the ODE system without being subject to the curse of dimensionality and complicated ODE structure. When the ODE possesses a general modular structure, with each modular component involving only a few input variables, and the network architecture is properly chosen, our method is proven to be consistent. Theoretical properties are corroborated by an extensive simulation study that demonstrates the validity and effectiveness of the proposed method. Finally, we use our method to simultaneously characterize the growth rate of Covid-19 infection cases from 50 states of the USA.

stat.ML↗

arXiv2023

The precursor of the critical transitions in majority vote model with the noise feedback from the vote layer

In this paper, we investigate phase transitions in the Majority-Vote model coupled with noise layers of different structures. We examine the Square lattice and Random-regular networks, as well as their combinations, for both vote layers and noise layers. Our findings reveal the presence of independent third-order transitions in all cases and dependent third-order transitions when critical transitions occur. This suggests that dependent third-order transitions may serve as precursors to critical transitions in non-equilibrium systems. Furthermore, we observe that when the structure of vote layers is local, the coupling between the vote layer and the noise layer leads to the absence of critical phenomena.

physics.soc-ph↗

arXiv2022

Pseudo-Phase Transitions of Ising and Baxter-Wu Models in Two-Dimensional Finite-Size Lattices

This article offers a detailed analysis of pseudo-phase transitions of Ising and Baxter-Wu models in two-dimensional finite-size lattices. We carry out Wang Landau sampling to obtain the density of states. Using microcanonical inflection point analysis with microcanonical entropy, we obtain the order of the psuedo-phase transitions in the models. The microcanonical analysis results of the second-order transition for the Ising model and the first-order transition for the Baxter-Wu model are consistent with the traditional canonical results. In addition, the third-order transitions are found in both models, implying the universality of higher-order phase transitions.

cond-mat.stat-mech↗

arXiv2022

S2TNet: Spatio-Temporal Transformer Networks for Trajectory Prediction in Autonomous Driving

To safely and rationally participate in dense and heterogeneous traffic, autonomous vehicles require to sufficiently analyze the motion patterns of surrounding traffic-agents and accurately predict their future trajectories. This is challenging because the trajectories of traffic-agents are not only influenced by the traffic-agents themselves but also by spatial interaction with each other. Previous methods usually rely on the sequential step-by-step processing of Long Short-Term Memory networks (LSTMs) and merely extract the interactions between spatial neighbors for single type traffic-agents. We propose the Spatio-Temporal Transformer Networks (S2TNet), which models the spatio-temporal interactions by spatio-temporal Transformer and deals with the temporel sequences by temporal Transformer. We input additional category, shape and heading information into our networks to handle the heterogeneity of traffic-agents. The proposed methods outperforms state-of-the-art methods on ApolloScape Trajectory dataset by more than 7\% on both the weighted sum of Average and Final Displacement Error. Our code is available at https://github.com/chenghuang66/s2tnet.

cs.CV↗

arXiv2022

CFNet: Learning Correlation Functions for One-Stage Panoptic Segmentation

Recently, there is growing attention on one-stage panoptic segmentation methods which aim to segment instances and stuff jointly within a fully convolutional pipeline efficiently. However, most of the existing works directly feed the backbone features to various segmentation heads ignoring the demands for semantic and instance segmentation are different: The former needs semantic-level discriminative features, while the latter requires features to be distinguishable across instances. To alleviate this, we propose to first predict semantic-level and instance-level correlations among different locations that are utilized to enhance the backbone features, and then feed the improved discriminative features into the corresponding segmentation heads, respectively. Specifically, we organize the correlations between a given location and all locations as a continuous sequence and predict it as a whole. Considering that such a sequence can be extremely complicated, we adopt Discrete Fourier Transform (DFT), a tool that can approximate an arbitrary sequence parameterized by amplitudes and phrases. For different tasks, we generate these parameters from the backbone features in a fully convolutional way which is optimized implicitly by corresponding tasks. As a result, these accurate and consistent correlations contribute to producing plausible discriminative features which meet the requirements of the complicated panoptic segmentation task. To verify the effectiveness of our methods, we conduct experiments on several challenging panoptic segmentation datasets and achieve state-of-the-art performance on MS COCO with $45.1$\% PQ and ADE20k with $32.6$\% PQ.

cs.CV↗