arXiv subjects

Yuan Zhong

Publications and source records attributed to Yuan Zhong.

At least 37 records · Page 2Linked to original sources

arXiv2025

Shape-invariant Potentials and Singular Spaces

In this work, we present two brane-world-type solutions in a two-dimensional (2D) dilaton gravity model with singular space-time backgrounds. By employing a first-order superpotential formalism, we first construct the 2D analogues of the thick brane solution previously given by Gremm and analyze the corresponding linear scalar perturbations. We show that for a model with canonical scalar matter fields, the effective potential of the linear perturbation equation is a singular Pöschl--Teller~II type, which does not admit bound states. However, for a model with non-canonical scalar fields, the effective potential becomes an exactly solvable Pöschl--Teller~I potential, which has an infinite tower of normalizable bound states. We also present a second analytic solution inspired by the work of Girardello \emph{et al.}, but with non-canonical scalar field. In this case, the linear perturbation equation is a Schrödinger equation with the Eckart potential, which is also exactly solvable.

hep-th↗

arXiv2025

Multilevel Picard scheme for solving high-dimensional drift control problems with state constraints

Motivated by applications to the dynamic control of queueing networks, we develop a simulation-based scheme, the so-called multilevel Picard (MLP) approximation, for solving high-dimensional drift control problems whose states are constrained to stay within the nonnegative orthant, over a finite time horizon. We prove that under suitable conditions, the MLP approximation overcomes the curse of dimensionality in the following sense: To approximate the value function and its gradient evaluated at a given time and state to within a prescribed accuracy $\varepsilon$, the computational complexity grows at most polynomially in the problem dimension $d$ and $1/\varepsilon$. To illustrate the effectiveness of the scheme, we carry out numerical experiments for a class of test problems that are related to the dynamic scheduling problem of parallel server systems in heavy traffic, and demonstrate that the scheme is computationally feasible up to dimension at least $20$.

math.OC↗

arXiv2025

Electrically Reconfigurable Arbitrary Splitting-Ratio Optical Splitter Based on Low-Loss Sb2Se3

Reconfigurable beam splitters capable of being arbitrarily programmed for the power splitting ratios are vital for the adaptive optical networks and photonic computing. Conventional mechanisms such as thermo-optic, free-carrier, or mechanical tuning are usually volatile and require continuous power, limiting their suitability for low-frequency and low power-consumption programmable operations. Here, we experimentally demonstrate an electrically reconfigurable beam splitter based on the low-loss phase-change material Sb2Se3, enabling multi-level and arbitrary splitting-ratio (SR) control. By locally triggering phase transitions in the coupling region with integrated micro-electrodes, we exploit the high refractive-index contrast between different phases and negligible absorption in the near-infrared wavelength of Sb2Se3 to precisely tune the coupling strength with non-volatile retention. 8-level of power splitting states is achieved within a compact footprint of ~14.5-μm in the experiments, with insertion loss is ~1 dB across 1515-1550 nm and near-zero static power. Combining the advantages of compactness, broad bandwidth, low loss, non-volatility, and multi-level control experimentally, this device provides a universal building block for scalable, energy-efficient reconfigurable photonic circuits, with great prospects in optical computing and intelligent communication systems.

physics.optics↗

arXiv2025

GPR: Empowering Generation with Graph-Pretrained Retriever

Graph retrieval-augmented generation (GRAG) places high demands on graph-specific retrievers. However, existing retrievers often rely on language models pretrained on plain text, limiting their effectiveness due to domain misalignment and structure ignorance. To address these challenges, we propose GPR, a graph-based retriever pretrained directly on knowledge graphs. GPR aligns natural language questions with relevant subgraphs through LLM-guided graph augmentation and employs a structure-aware objective to learn fine-grained retrieval strategies. Experiments on two datasets, three LLM backbones, and five baselines show that GPR consistently improves both retrieval quality and downstream generation, demonstrating its effectiveness as a robust retrieval solution for GRAG.

cs.IR↗

arXiv2025

MEDMKG: Benchmarking Medical Knowledge Exploitation with Multimodal Knowledge Graph

Medical deep learning models depend heavily on domain-specific knowledge to perform well on knowledge-intensive clinical tasks. Prior work has primarily leveraged unimodal knowledge graphs, such as the Unified Medical Language System (UMLS), to enhance model performance. However, integrating multimodal medical knowledge graphs remains largely underexplored, mainly due to the lack of resources linking imaging data with clinical concepts. To address this gap, we propose MEDMKG, a Medical Multimodal Knowledge Graph that unifies visual and textual medical information through a multi-stage construction pipeline. MEDMKG fuses the rich multimodal data from MIMIC-CXR with the structured clinical knowledge from UMLS, utilizing both rule-based tools and large language models for accurate concept extraction and relationship modeling. To ensure graph quality and compactness, we introduce Neighbor-aware Filtering (NaF), a novel filtering algorithm tailored for multimodal knowledge graphs. We evaluate MEDMKG across three tasks under two experimental settings, benchmarking twenty-four baseline methods and four state-of-the-art vision-language backbones on six datasets. Results show that MEDMKG not only improves performance in downstream medical tasks but also offers a strong foundation for developing adaptive and robust strategies for multimodal knowledge integration in medical artificial intelligence.

cs.AI↗

arXiv2024

FairMedFM: Fairness Benchmarking for Medical Imaging Foundation Models

The advent of foundation models (FMs) in healthcare offers unprecedented opportunities to enhance medical diagnostics through automated classification and segmentation tasks. However, these models also raise significant concerns about their fairness, especially when applied to diverse and underrepresented populations in healthcare applications. Currently, there is a lack of comprehensive benchmarks, standardized pipelines, and easily adaptable libraries to evaluate and understand the fairness performance of FMs in medical imaging, leading to considerable challenges in formulating and implementing solutions that ensure equitable outcomes across diverse patient populations. To fill this gap, we introduce FairMedFM, a fairness benchmark for FM research in medical imaging.FairMedFM integrates with 17 popular medical imaging datasets, encompassing different modalities, dimensionalities, and sensitive attributes. It explores 20 widely used FMs, with various usages such as zero-shot learning, linear probing, parameter-efficient fine-tuning, and prompting in various downstream tasks -- classification and segmentation. Our exhaustive analysis evaluates the fairness performance over different evaluation metrics from multiple perspectives, revealing the existence of bias, varied utility-fairness trade-offs on different FMs, consistent disparities on the same datasets regardless FMs, and limited effectiveness of existing unfairness mitigation methods. Checkout FairMedFM's project page and open-sourced codebase, which supports extendible functionalities and applications as well as inclusive for studies on FMs in medical imaging over the long term.

cs.CV↗

arXiv2024

3DSAM-adapter: Holistic adaptation of SAM from 2D to 3D for promptable tumor segmentation

Despite that the segment anything model (SAM) achieved impressive results on general-purpose semantic segmentation with strong generalization ability on daily images, its demonstrated performance on medical image segmentation is less precise and not stable, especially when dealing with tumor segmentation tasks that involve objects of small sizes, irregular shapes, and low contrast. Notably, the original SAM architecture is designed for 2D natural images, therefore would not be able to extract the 3D spatial information from volumetric medical data effectively. In this paper, we propose a novel adaptation method for transferring SAM from 2D to 3D for promptable medical image segmentation. Through a holistically designed scheme for architecture modification, we transfer the SAM to support volumetric inputs while retaining the majority of its pre-trained parameters for reuse. The fine-tuning process is conducted in a parameter-efficient manner, wherein most of the pre-trained parameters remain frozen, and only a few lightweight spatial adapters are introduced and tuned. Regardless of the domain gap between natural and medical data and the disparity in the spatial arrangement between 2D and 3D, the transformer trained on natural images can effectively capture the spatial patterns present in volumetric medical images with only lightweight adaptations. We conduct experiments on four open-source tumor segmentation datasets, and with a single click prompt, our model can outperform domain state-of-the-art medical image segmentation models on 3 out of 4 tasks, specifically by 8.25%, 29.87%, and 10.11% for kidney tumor, pancreas tumor, colon cancer segmentation, and achieve similar performance for liver tumor segmentation. We also compare our adaptation method with existing popular adapters, and observed significant performance improvement on most datasets.

cs.CV↗

arXiv2024

Rosen-Morse potential and gravitating kinks

We show that in a special type of two-dimensional dilaton-gravity-scalar model, where both the dilaton and the scalar matter fields have noncanonical kinetic terms, it is possible to construct kink solutions whose linear perturbation equation is a Schrödinger-like equation with Rosen-Morse potential. For this potential, eigenvalues and wave functions of the bound states, if had any, can be derived by using the standard shape invariance procedure. Depending on the values of the parameters, the stability potential can be reflective or reflectionless. There can be an arbitrary number of shape modes, but the zero mode is always absent.

hep-th↗

arXiv2024

Demonstration of 3 V Programmable Josephson Junction Arrays Using Non-Integer-Multiple Logic

This article demonstrates a new kind of programmable logic for the representation of an integer that can be used for the programmable Josephson voltage standard. It can enable the numbers of junctions in most bits to be variable integer values, which is different from normal binary logic or ternary logic. Consequently, missing junctions due to superconducting short circuits can be tolerated under this logic. This logic can also have nearly the same segmentation efficiency as ternary logic. The completeness of the sequences using this logic is proven by the recursive method in mathematics in this paper. After that, a new algorithm for the representation of integers is presented according to the proven process, and an analysis of the number of fault-tolerant junctions for each bit is provided. Although the first and second bits are not tolerant to missing junctions, bits beyond these can tolerate one to hundreds of missing junctions. Due to the non-fixed multiples between the bits of the sequence, this logic is called non-integer-multiple logic. Finally, the design and fabrication of a 3 V programmable Josephson junction array using this logic are described, and the measurements and analysis of the characteristic parameters are presented.

cs.ET↗

arXiv2024

Recent Advances in Predictive Modeling with Electronic Health Records

The development of electronic health records (EHR) systems has enabled the collection of a vast amount of digitized patient data. However, utilizing EHR data for predictive modeling presents several challenges due to its unique characteristics. With the advancements in machine learning techniques, deep learning has demonstrated its superiority in various applications, including healthcare. This survey systematically reviews recent advances in deep learning-based predictive models using EHR data. Specifically, we begin by introducing the background of EHR data and providing a mathematical definition of the predictive modeling task. We then categorize and summarize predictive deep models from multiple perspectives. Furthermore, we present benchmarks and toolkits relevant to predictive modeling in healthcare. Finally, we conclude this survey by discussing open challenges and suggesting promising directions for future research.

cs.LG↗

arXiv2024

Weakly-supervised Medical Image Segmentation with Gaze Annotations

Eye gaze that reveals human observational patterns has increasingly been incorporated into solutions for vision tasks. Despite recent explorations on leveraging gaze to aid deep networks, few studies exploit gaze as an efficient annotation approach for medical image segmentation which typically entails heavy annotating costs. In this paper, we propose to collect dense weak supervision for medical image segmentation with a gaze annotation scheme. To train with gaze, we propose a multi-level framework that trains multiple networks from discriminative human attention, simulated with a set of pseudo-masks derived by applying hierarchical thresholds on gaze heatmaps. Furthermore, to mitigate gaze noise, a cross-level consistency is exploited to regularize overfitting noisy labels, steering models toward clean patterns learned by peer networks. The proposed method is validated on two public medical datasets of polyp and prostate segmentation tasks. We contribute a high-quality gaze dataset entitled GazeMedSeg as an extension to the popular medical segmentation datasets. To the best of our knowledge, this is the first gaze dataset for medical image segmentation. Our experiments demonstrate that gaze annotation outperforms previous label-efficient annotation schemes in terms of both performance and annotation time. Our collected gaze data and code are available at: https://github.com/med-air/GazeMedSeg.

cs.CV↗

arXiv2024

Synthesizing Multimodal Electronic Health Records via Predictive Diffusion Models

Synthesizing electronic health records (EHR) data has become a preferred strategy to address data scarcity, improve data quality, and model fairness in healthcare. However, existing approaches for EHR data generation predominantly rely on state-of-the-art generative techniques like generative adversarial networks, variational autoencoders, and language models. These methods typically replicate input visits, resulting in inadequate modeling of temporal dependencies between visits and overlooking the generation of time information, a crucial element in EHR data. Moreover, their ability to learn visit representations is limited due to simple linear mapping functions, thus compromising generation quality. To address these limitations, we propose a novel EHR data generation model called EHRPD. It is a diffusion-based model designed to predict the next visit based on the current one while also incorporating time interval estimation. To enhance generation quality and diversity, we introduce a novel time-aware visit embedding module and a pioneering predictive denoising diffusion probabilistic model (PDDPM). Additionally, we devise a predictive U-Net (PU-Net) to optimize P-DDPM.We conduct experiments on two public datasets and evaluate EHRPD from fidelity, privacy, and utility perspectives. The experimental results demonstrate the efficacy and utility of the proposed EHRPD in addressing the aforementioned limitations and advancing EHR data generation.

cs.LG↗

arXiv2024

PatentGPT: A Large Language Model for Intellectual Property

In recent years, large language models(LLMs) have attracted significant attention due to their exceptional performance across a multitude of natural language process tasks, and have been widely applied in various fields. However, the application of large language models in the Intellectual Property (IP) domain is challenging due to the strong need for specialized knowledge, privacy protection, processing of extremely long text in this field. In this technical report, we present for the first time a low-cost, standardized procedure for training IP-oriented LLMs, meeting the unique requirements of the IP domain. Using this standard process, we have trained the PatentGPT series models based on open-source pretrained models. By evaluating them on the open-source IP-oriented benchmark MOZIP, our domain-specific LLMs outperforms GPT-4, indicating the effectiveness of the proposed training procedure and the expertise of the PatentGPT models in the IP domain. Remarkably, our model surpassed GPT-4 on the 2019 China Patent Agent Qualification Examination, scoring 65 and matching human expert levels. Additionally, the PatentGPT model, which utilizes the SMoE architecture, achieves performance comparable to that of GPT-4 in the IP domain and demonstrates a better cost-performance ratio on long-text tasks, potentially serving as an alternative to GPT-4 within the IP domain.

cs.CL↗

arXiv2024

FineRec:Exploring Fine-grained Sequential Recommendation

Sequential recommendation is dedicated to offering items of interest for users based on their history behaviors. The attribute-opinion pairs, expressed by users in their reviews for items, provide the potentials to capture user preferences and item characteristics at a fine-grained level. To this end, we propose a novel framework FineRec that explores the attribute-opinion pairs of reviews to finely handle sequential recommendation. Specifically, we utilize a large language model to extract attribute-opinion pairs from reviews. For each attribute, a unique attribute-specific user-opinion-item graph is created, where corresponding opinions serve as the edges linking heterogeneous user and item nodes. To tackle the diversity of opinions, we devise a diversity-aware convolution operation to aggregate information within the graphs, enabling attribute-specific user and item representation learning. Ultimately, we present an interaction-driven fusion mechanism to integrate attribute-specific user/item representations across all attributes for generating recommendations. Extensive experiments conducted on several realworld datasets demonstrate the superiority of our FineRec over existing state-of-the-art methods. Further analysis also verifies the effectiveness of our fine-grained manner in handling the task.

cs.IR↗

arXiv2024

Thermal Corrections to Rényi Entropy in BMS Field Theory

In the study of three-dimensional flat holography, the BMS field theory manifests the infinite-dimensional BMS$_3$ symmetry, a powerful tool in elucidating numerous universal phenomena. This paper explores a certain low-temperature limit of the BMS field theory. The primary focus lies in the calculation of the thermal correction to the Rényi entropy of the single interval on the cylinder from the replica trick and the uniformizing map. As a double check, an alternative method calculating the entanglement entropy is introduced, with the entanglement first law and the modular Hamiltonian.

hep-th↗

arXiv2024

Gravitating kinks with asymptotically flat metrics

In this work, we consider a two-dimensional (2D) dilaton gravity model where the dilaton kinetic term $\mathcal{X}$ is modified by an additional derivative coupling term $α\mathcal{X}^2$. In the case with a canonical scalar matter field, the field equations of this model have a simple first-order formalism, from which exact static kink solutions can be constructed. The novelty of these solutions is that the corresponding metric can be asymptotically flat rather than asymptotically anti de Sitter. The linear stability and the localization of scalar matter fields are also studied. It was found that the solutions are stable against small linear perturbations, and the localization of scalar matter fields can be realized by introducing scalar-kink interactions.

hep-th↗

arXiv2024

Kink solutions in generalized 2D dilaton gravity

We study static kink solutions in a generalized two-dimensional dilaton gravity model, where the kinetic term of the dilaton is generalized to be an arbitrary function of the canonical one $\mathcal X= -\frac12 (\nabla φ)^2$, say $\mathcal F(\mathcal X)$, and the kink is generated by a canonical scalar matter field $ϕ$. It is found that for arbitrary $\mathcal F(\mathcal X)$, the background field equations have a simple first-order formalism, and the linear perturbation equation can always be written as a Schrödinger-like equation with factorizable Hamiltonian operator. After choosing appropriate $\mathcal F(\mathcal X)$ and superpotential, we obtain a sine-Gordon type kink solution with pure AdS$_2$ metric. The linear perturbation issue of this solution becomes an exactly solvable conformal quantum mechanics problem, if one of the model parameter takes a critical value.

hep-th↗

arXiv2024

Automated Fusion of Multimodal Electronic Health Records for Better Medical Predictions

The widespread adoption of Electronic Health Record (EHR) systems in healthcare institutes has generated vast amounts of medical data, offering significant opportunities for improving healthcare services through deep learning techniques. However, the complex and diverse modalities and feature structures in real-world EHR data pose great challenges for deep learning model design. To address the multi-modality challenge in EHR data, current approaches primarily rely on hand-crafted model architectures based on intuition and empirical experiences, leading to sub-optimal model architectures and limited performance. Therefore, to automate the process of model design for mining EHR data, we propose a novel neural architecture search (NAS) framework named AutoFM, which can automatically search for the optimal model architectures for encoding diverse input modalities and fusion strategies. We conduct thorough experiments on real-world multi-modal EHR data and prediction tasks, and the results demonstrate that our framework not only achieves significant performance improvement over existing state-of-the-art methods but also discovers meaningful network architectures effectively.

cs.LG↗