Searcharxiv⌕ Search

arXiv subjects

Yuanyuan Liu

Publications and source records attributed to Yuanyuan Liu.

At least 37 records · Page 2Linked to original sources

A Technical Report on the Second Place Solution for the CIKM 2025 AnalytiCup Competition

In this work, we address the challenge of multilingual category relevance judgment in e-commerce search, where traditional ensemble-based systems improve accuracy but at the cost of heavy training, inference, and maintenance complexity. To overcome this limitation, we propose a simplified yet effective framework that leverages prompt engineering with Chain-of-Thought task decomposition to guide reasoning within a single large language model. Specifically, our approach decomposes the relevance judgment process into four interpretable subtasks: translation, intent understanding, category matching, and relevance judgment -- and fine-tunes a base model (Qwen2.5-14B) using Low-Rank Adaptation (LoRA) for efficient adaptation. This design not only reduces computational and storage overhead but also enhances interpretability by explicitly structuring the model's reasoning path. Experimental results show that our single-model framework achieves competitive accuracy and high inference efficiency, processing 20 samples per second on a single A100 GPU. In the CIKM 2025 AnalytiCup Competition Proposals, our method achieved 0.8902 on the public leaderboard and 0.8889 on the private leaderboard, validating the effectiveness and robustness of the proposed approach. These results highlight that structured prompting combined with lightweight fine-tuning can outperform complex ensemble systems, offering a new paradigm for scalable industrial AI applications.

cs.IR↗

Accurate myocardial T1 mapping at 5T using an improved MOLLI method: A validation study

Background: Accurate myocardial T1 mapping at 5T remains a technical challenge due to field inhomogeneity and prolonged T1 values. The aim of this study is to develop an accurate and clinically applicable myocardial T1 mapping technique for 5T magnetic resonance imaging (MRI) systems and validate its performance in a multicenter study. Methods: The proposed method is based on a 5-(3)-3 MOLLI sequence, dubbed combined-correction MOLLI (coMOLLI), which corrects for both inversion efficiency and readout-induced signal disturbances. Specifically, coMOLLI employs a gradient recalled echo (GRE) readout rather than the commonly used bSSFP readout. Its signal evolution is modeled to estimate T1 values, which incorporates both inversion efficiency and readout disturbances to improve fitting accuracy. To further enhance accuracy, the inversion pulse was redesigned under hardware constraints and the observed B0 and B1 variations over the heart at 5T, using adiabatic hyperbolic secant (HSn) and tangent/hyperbolic tangent (Tan/Tanh) pulses. The method was validated in phantom experiments, as well as in 21 healthy volunteers and 9 patients. Results: The optimized inversion pulse at 5T is the Tan/Tanh pulse with A = 10 kHz, K_s = 4, k = 22, and T_p = 8 ms. In phantom studies, coMOLLI showed high accuracy versus reference IR-FSE, yielding relative errors within 5% for all nine vials. In vivo studies, the average native myocardial T1 values across 21 healthy volunteers were 1468 +/- 48 ms, 1514 +/- 39 ms, and 1545 +/- 50 ms, and blood T1 values were 2182 +/- 132 ms, 2124 +/- 153 ms, and 2131 +/- 158 ms for apical, middle, and base slices, respectively. Conclusion: The coMOLLI method demonstrated high accuracy in phantom studies and feasibility in vivo studies. By adopting the widely used 5-(3)-3 MOLLI acquisition scheme, it shows potential for clinical cardiac imaging at 5T.

physics.med-ph↗

Fabrication and characterization of AlMn alloy superconducting films for 0vbb experiments

Neutrinoless double-beta decay (0vbb) experiments constitute a pivotal probe for elucidating the characteristics of neutrinos and further discovering new physics. Compared to the neutron transmutation doped germanium thermistors (NTD-Ge) used in 0vbb experiments such as CUORE, transition edge sensors (TES) theoretically have a relatively faster response time and higher energy resolution. These make TES detectors good choice for next generation 0vbb experiments. In this paper, AlMn alloy superconducting films, the main components of TES, were prepared and studied. The relationship between critical temperature (Tc) and annealing temperature was established, and the impact of magnetic field on Tc was tested. The experimental results demonstrate that the Tc of AlMn film can be tuned in the required range of 10 - 20 mK by using the above methods, which is a key step for the application of AlMn TES in 0vbb experiment. In the test range, the Tc of AlMn film is sensitive to out-of-plane magnetic field but not to the in-plane magnetic field. Furthermore, we find that a higher annealing temperature results in a more uniform distribution of Mn ions in depth, which opens a new avenue for elucidating the underlying mechanism for tuning Tc.

hep-ex↗

FedSWA: Improving Generalization in Federated Learning with Highly Heterogeneous Data via Momentum-Based Stochastic Controlled Weight Averaging

For federated learning (FL) algorithms such as FedSAM, their generalization capability is crucial for real-word applications. In this paper, we revisit the generalization problem in FL and investigate the impact of data heterogeneity on FL generalization. We find that FedSAM usually performs worse than FedAvg in the case of highly heterogeneous data, and thus propose a novel and effective federated learning algorithm with Stochastic Weight Averaging (called \texttt{FedSWA}), which aims to find flatter minima in the setting of highly heterogeneous data. Moreover, we introduce a new momentum-based stochastic controlled weight averaging FL algorithm (\texttt{FedMoSWA}), which is designed to better align local and global models. Theoretically, we provide both convergence analysis and generalization bounds for \texttt{FedSWA} and \texttt{FedMoSWA}. We also prove that the optimization and generalization errors of \texttt{FedMoSWA} are smaller than those of their counterparts, including FedSAM and its variants. Empirically, experimental results on CIFAR10/100 and Tiny ImageNet demonstrate the superiority of the proposed algorithms compared to their counterparts. Open source code at: https://github.com/junkangLiu0/FedSWA.

cs.LG↗

DUN-SRE: Deep Unrolling Network with Spatiotemporal Rotation Equivariance for Dynamic MRI Reconstruction

Dynamic Magnetic Resonance Imaging (MRI) exhibits transformation symmetries, including spatial rotation symmetry within individual frames and temporal symmetry along the time dimension. Explicit incorporation of these symmetry priors in the reconstruction model can significantly improve image quality, especially under aggressive undersampling scenarios. Recently, Equivariant convolutional neural network (ECNN) has shown great promise in exploiting spatial symmetry priors. However, existing ECNNs critically fail to model temporal symmetry, arguably the most universal and informative structural prior in dynamic MRI reconstruction. To tackle this issue, we propose a novel Deep Unrolling Network with Spatiotemporal Rotation Equivariance (DUN-SRE) for Dynamic MRI Reconstruction. The DUN-SRE establishes spatiotemporal equivariance through a (2+1)D equivariant convolutional architecture. In particular, it integrates both the data consistency and proximal mapping module into a unified deep unrolling framework. This architecture ensures rigorous propagation of spatiotemporal rotation symmetry constraints throughout the reconstruction process, enabling more physically accurate modeling of cardiac motion dynamics in cine MRI. In addition, a high-fidelity group filter parameterization mechanism is developed to maintain representation precision while enforcing symmetry constraints. Comprehensive experiments on Cardiac CINE MRI datasets demonstrate that DUN-SRE achieves state-of-the-art performance, particularly in preserving rotation-symmetric structures, offering strong generalization capability to a broad range of dynamic MRI reconstruction tasks.

eess.IV↗

Deep Learning-Based Longitudinal Prediction of Childhood Myopia Progression Using Fundus Image Sequences and Baseline Refraction Data

Childhood myopia constitutes a significant global health concern. It exhibits an escalating prevalence and has the potential to evolve into severe, irreversible conditions that detrimentally impact familial well-being and create substantial economic costs. Contemporary research underscores the importance of precisely predicting myopia progression to enable timely and effective interventions, thereby averting severe visual impairment in children. Such predictions predominantly rely on subjective clinical assessments, which are inherently biased and resource-intensive, thus hindering their widespread application. In this study, we introduce a novel, high-accuracy method for quantitatively predicting the myopic trajectory and myopia risk in children using only fundus images and baseline refraction data. This approach was validated through a six-year longitudinal study of 3,408 children in Henan, utilizing 16,211 fundus images and corresponding refractive data. Our method based on deep learning demonstrated predictive accuracy with an error margin of 0.311D per year and AUC scores of 0.944 and 0.995 for forecasting the risks of developing myopia and high myopia, respectively. These findings confirm the utility of our model in supporting early intervention strategies and in significantly reducing healthcare costs, particularly by obviating the need for additional metadata and repeated consultations. Furthermore, our method was designed to rely only on fundus images and refractive error data, without the need for meta data or multiple inquiries from doctors, strongly reducing the associated medical costs and facilitating large-scale screening. Our model can even provide good predictions based on only a single time measurement. Consequently, the proposed method is an important means to reduce medical inequities caused by economic disparities.

cs.CV↗

Computable Bounds on the Solution to Poisson's Equation for General Harris Chains

Poisson's equation is fundamental to the study of Markov chains, and arises in connection with martingale representations and central limit theorems for additive functionals, perturbation theory for stationary distributions, and average reward Markov decision process problems. In this paper, we develop a new probabilistic representation for the solution of Poisson's equation, and use Lyapunov functions to bound this solution representation explicitly. In contrast to most prior work on this problem, our bounds are computable. Our contribution is closely connected to recent work of Herve and Ledoux (2025), in which they focus their study on a special class of Harris chains satisfying a particular small set condition. However, our theory covers general Harris chains, and often provides a tighter bound. In addition to the new bound and representation, we also develop a computable uniform bound on marginal expectations for Harris chains, and a computable bound on the potential kernel representation of the solution to Poisson's equation.

math.PR↗

Potentials of skip-free Markov chains

Potential theory has important applications in various fields such as physics, finance, and biology. In this paper, we investigate the potentials of two classic types of discrete-time skip-free Markov chains: upward skip-free and downward skip-free Markov chains. The key to deriving these potentials lies in the use of truncation approximation techniques. The results are then applied to GI/M/1 queues and M/G/1 queues, and further extended to continuous-time skip-free Markov chains.

math.PR↗

DIG-FACE: De-biased Learning for Generalized Facial Expression Category Discovery

We introduce a novel task, Generalized Facial Expression Category Discovery (G-FACE), that discovers new, unseen facial expressions while recognizing known categories effectively. Even though there are generalized category discovery methods for natural images, they show compromised performance on G-FACE. We identified two biases that affect the learning: implicit bias, coming from an underlying distributional gap between new categories in unlabeled data and known categories in labeled data, and explicit bias, coming from shifted preference on explicit visual facial change characteristics from known expressions to unknown expressions. By addressing the challenges caused by both biases, we propose a Debiased G-FACE method, namely DIG-FACE, that facilitates the debiasing of both implicit and explicit biases. In the implicit debiasing process of DIG-FACE, we devise a novel learning strategy that aims at estimating and minimizing the upper bound of implicit bias. In the explicit debiasing process, we optimize the model's ability to handle nuanced visual facial expression data by introducing a hierarchical category-discrimination refinement strategy: sample-level, triplet-level, and distribution-level optimizations. Extensive experiments demonstrate that our DIG-FACE significantly enhances recognition accuracy for both known and new categories, setting a first-of-its-kind standard for the task.

cs.CV↗

Smile upon the Face but Sadness in the Eyes: Emotion Recognition based on Facial Expressions and Eye Behaviors

Emotion Recognition (ER) is the process of identifying human emotions from given data. Currently, the field heavily relies on facial expression recognition (FER) because facial expressions contain rich emotional cues. However, it is important to note that facial expressions may not always precisely reflect genuine emotions and FER-based results may yield misleading ER. To understand and bridge this gap between FER and ER, we introduce eye behaviors as an important emotional cues for the creation of a new Eye-behavior-aided Multimodal Emotion Recognition (EMER) dataset. Different from existing multimodal ER datasets, the EMER dataset employs a stimulus material-induced spontaneous emotion generation method to integrate non-invasive eye behavior data, like eye movements and eye fixation maps, with facial videos, aiming to obtain natural and accurate human emotions. Notably, for the first time, we provide annotations for both ER and FER in the EMER, enabling a comprehensive analysis to better illustrate the gap between both tasks. Furthermore, we specifically design a new EMERT architecture to concurrently enhance performance in both ER and FER by efficiently identifying and bridging the emotion gap between the two.Specifically, our EMERT employs modality-adversarial feature decoupling and multi-task Transformer to augment the modeling of eye behaviors, thus providing an effective complement to facial expressions. In the experiment, we introduce seven multimodal benchmark protocols for a variety of comprehensive evaluations of the EMER dataset. The results show that the EMERT outperforms other state-of-the-art multimodal methods by a great margin, revealing the importance of modeling eye behaviors for robust ER. To sum up, we provide a comprehensive analysis of the importance of eye behaviors in ER, advancing the study on addressing the gap between FER and ER for more robust ER performance.

cs.CV↗

Score-based Diffusion Models With Self-supervised Learning For Accelerated 3D Multi-contrast Cardiac Magnetic Resonance Imaging

Long scan time significantly hinders the widespread applications of three-dimensional multi-contrast cardiac magnetic resonance (3D-MC-CMR) imaging. This study aims to accelerate 3D-MC-CMR acquisition by a novel method based on score-based diffusion models with self-supervised learning. Specifically, we first establish a mapping between the undersampled k-space measurements and the MR images, utilizing a self-supervised Bayesian reconstruction network. Secondly, we develop a joint score-based diffusion model on 3D-MC-CMR images to capture their inherent distribution. The 3D-MC-CMR images are finally reconstructed using the conditioned Langenvin Markov chain Monte Carlo sampling. This approach enables accurate reconstruction without fully sampled training data. Its performance was tested on the dataset acquired by a 3D joint myocardial T1 and T1rho mapping sequence. The T1 and T1rho maps were estimated via a dictionary matching method from the reconstructed images. Experimental results show that the proposed method outperforms traditional compressed sensing and existing self-supervised deep learning MRI reconstruction methods. It also achieves high quality T1 and T1rho parametric maps close to the reference maps, even at a high acceleration rate of 14.

eess.SP↗

Monte Carlo Simulation of Angular Response of GRID Detectors for GRID Mission

The Gamma-Ray Integrated Detectors (GRID) are a space science mission that employs compact gamma-ray detectors mounted on NanoSats in low Earth orbit (LEO) to monitor the transient gamma-ray sky. Owing to the unpredictability of the time and location of gamma-ray bursts (GRBs), obtaining the photon responses of gamma-ray detectors at various incident angles is important for the scientific analysis of GRB data captured by GRID detectors. For this purpose, a dedicated Monte Carlo simulation framework has been developed for GRID detectors. By simulating each GRID detector and the NanoSat carrying it, the spectral energy response, detection efficiency, and other angular responses of each detector for photons with different incident angles and energies can be obtained within this framework. The accuracy of these simulations has been corroborated through on-ground calibration, and the derived angular responses have been successfully applied to the data analysis of recorded GRBs.

astro-ph.IM↗

Open-Set Video-based Facial Expression Recognition with Human Expression-sensitive Prompting

In Video-based Facial Expression Recognition (V-FER), models are typically trained on closed-set datasets with a fixed number of known classes. However, these models struggle with unknown classes common in real-world scenarios. In this paper, we introduce a challenging Open-set Video-based Facial Expression Recognition (OV-FER) task, aiming to identify both known and new, unseen facial expressions. While existing approaches use large-scale vision-language models like CLIP to identify unseen classes, we argue that these methods may not adequately capture the subtle human expressions needed for OV-FER. To address this limitation, we propose a novel Human Expression-Sensitive Prompting (HESP) mechanism to significantly enhance CLIP's ability to model video-based facial expression details effectively. Our proposed HESP comprises three components: 1) a textual prompting module with learnable prompts to enhance CLIP's textual representation of both known and unknown emotions, 2) a visual prompting module that encodes temporal emotional information from video frames using expression-sensitive attention, equipping CLIP with a new visual modeling ability to extract emotion-rich information, and 3) an open-set multi-task learning scheme that promotes interaction between the textual and visual modules, improving the understanding of novel human emotions in video sequences. Extensive experiments conducted on four OV-FER task settings demonstrate that HESP can significantly boost CLIP's performance (a relative improvement of 17.93% on AUROC and 106.18% on OSCR) and outperform other state-of-the-art open-set video understanding methods by a large margin. Code is available at https://github.com/cosinehuang/HESP.

cs.CV↗

LINEAR: Learning Implicit Neural Representation With Explicit Physical Priors for Accelerated Quantitative T1rho Mapping

Quantitative T1rho mapping has shown promise in clinical and research studies. However, it suffers from long scan times. Deep learning-based techniques have been successfully applied in accelerated quantitative MR parameter mapping. However, most methods require fully-sampled training dataset, which is impractical in the clinic. In this study, a novel subject-specific unsupervised method based on the implicit neural representation is proposed to reconstruct T1rho-weighted images from highly undersampled k-space data, which only takes spatiotemporal coordinates as the input. Specifically, the proposed method learned a implicit neural representation of the MR images driven by two explicit priors from the physical model of T1rho mapping, including the signal relaxation prior and self-consistency of k-t space data prior. The proposed method was verified using both retrospective and prospective undersampled k-space data. Experiment results demonstrate that LINEAR achieves a high acceleration factor up to 14, and outperforms the state-of-the-art methods in terms of suppressing artifacts and achieving the lowest error.

eess.IV↗

A better approach to diagnose retinal diseases: Combining our Segmentation-based Vascular Enhancement with deep learning features

Abnormalities in retinal fundus images may indicate certain pathologies such as diabetic retinopathy, hypertension, stroke, glaucoma, retinal macular edema, venous occlusion, and atherosclerosis, making the study and analysis of retinal images of great significance. In conventional medicine, the diagnosis of retina-related diseases relies on a physician's subjective assessment of the retinal fundus images, which is a time-consuming process and the accuracy is highly dependent on the physician's subjective experience. To this end, this paper proposes a fast, objective, and accurate method for the diagnosis of diseases related to retinal fundus images. This method is a multiclassification study of normal samples and 13 categories of disease samples on the STARE database, with a test set accuracy of 99.96%. Compared with other studies, our method achieved the highest accuracy. This study innovatively propose Segmentation-based Vascular Enhancement(SVE). After comparing the classification performances of the deep learning models of SVE images, original images and Smooth Grad-CAM ++ images, we extracted the deep learning features and traditional features of the SVE images and input them into nine meta learners for classification. The results shows that our proposed UNet-SVE-VGG-MLP model has the optimal performance for classifying diseases related to retinal fundus images on the STARE database, with a overall accuracy of 99.96% and a weighted AUC of 99.98% for the 14 categories on test dataset. This method can be used to realize rapid, objective, and accurate classification and diagnosis of retinal fundus image related diseases.

eess.IV↗

Hoeffding's inequality for continuous-time Markov chains

Hoeffding's inequality is a fundamental tool widely applied in probability theory, statistics, and machine learning. In this paper, we establish Hoeffding's inequalities specifically tailored for an irreducible and positive recurrent continuous-time Markov chain (CTMC) on a countable state space with the invariant probability distribution $π$ and an $\mathcal{L}^{2}(π)$-spectral gap $λ(Q)$. More precisely, for a function $g:E\to [a,b]$ with a mean $π(g)$, and given $t,\varepsilon>0$, we derive the inequality \[ \mathbb{P}_π\left(\frac{1}{t} \int_{0}^{t} g\left(X_{s}\right)\mathrm{d}s-π(g) \geq \varepsilon \right) \leq \exp\left\{-\frac{λ(Q)t\varepsilon^2}{(b-a)^2} \right\}, \] which can be viewed as a generalization of Hoeffding's inequality for discrete-time Markov chains (DTMCs) presented in [J. Fan et al., J. Mach. Learn. Res., 22(2022), pp. 6185-6219] to the realm of CTMCs. The key analysis enabling the attainment of this inequality lies in the utilization of the techniques of skeleton chains and augmented truncation approximations. Furthermore, we also discuss Hoeffding's inequality for a jump process on a general state space.

math.PR↗

Affective Computing for Healthcare: Recent Trends, Applications, Challenges, and Beyond

Affective computing, which aims to recognize, interpret, and understand human emotions, provides benefits in healthcare, such as improving patient care and enhancing doctor-patient communication. However, there is a noticeable absence of a comprehensive summary of recent advancements in affective computing for healthcare, which could pose difficulties for researchers entering this field. To address this, our paper aims to provide an extensive literature review of related studies published in the last five years. We begin by analyzing trends, benefits, and limitations of recent datasets and affective computing methods devised for healthcare. Subsequently, we highlight several healthcare application hotspots of current technologies that could be promising for real-world deployment. Through our analysis, we identify and discuss some ongoing challenges in the field as evidenced by the literature. Concluding with a thorough review, we further offer potential future research directions and hope our findings and insights could guide related researchers to make better contributions to the evolution of affective computing in healthcare.

cs.HC↗

A Numerical Truncation Approximation with A Posteriori Error Bounds for the Solution of Poisson's Equation

The solution to Poisson's equation arise in many Markov chain and Markov jump process settings, including that of the central limit theorem, value functions for average reward Markov decision processes, and within the gradient formula for equilibrium Markovian rewards. In this paper, we consider the problem of numerically computing the solution to Poisson's equation when the state space is infinite or very large. In such settings, the state space must be truncated in order to make the problem computationally tractable. In this paper, we provide the first truncation approximation solution to Poisson's equation that comes with provable and computable a posteriori error bounds. Our theory applies to both discrete-time chains and continuous-time jump processes. Through numerical experiments, we show our method can provide highly accurate solutions and tight bounds.

math.PR↗