arXiv subjects

Rong Ma

Publications and source records attributed to Rong Ma.

At least 19 recordsLinked to original sources

arXiv2026

Stacked SVD or SVD stacked? A Random Matrix Theory perspective on data integration

Modern data analysis increasingly requires identifying shared latent structure across multiple high-dimensional datasets. A commonly used model assumes that the data matrices are noisy observations of low-rank matrices with a shared singular subspace. In this case, two primary methods have emerged for estimating this shared structure, which vary in how they integrate information across datasets. The first approach, termed Stack-SVD, concatenates all the datasets, and then performs a singular value decomposition (SVD). The second approach, termed SVD-Stack, first performs an SVD separately for each dataset, then aggregates the top singular vectors across these datasets, and finally computes a consensus amongst them. While these methods are widely used, they have not been rigorously studied in the proportional asymptotic regime, which is of great practical relevance in today's world of increasing data size and dimensionality. Consequently, it remains unclear when one method should be preferred over another. In this work, we derive exact expressions for the asymptotic performance and phase transitions of these two methods and develop optimal weighting schemes to further improve both methods. Our analysis reveals that while neither method uniformly dominates the other in the unweighted case, optimally weighted Stack-SVD dominates optimally weighted SVD-Stack when the low rank signal is fully shared across the datasets. We then analyze multiple, partially shared components per dataset and demonstrate that SVD-Stack can yield improved performance without requiring estimation of subspace alignment. Finally, we provide practical algorithms for estimating optimal weights from data, offering theoretical guidance for method selection in practical data integration problems. Extensive numerical simulations and semi-synthetic experiments on genomic data corroborate our theoretical findings.

stat.ML↗

arXiv2026

Inference for Similarity and Alignability between Noisy High-Dimensional Datasets

The rapid growth of high-dimensional datasets across a wide range of scientific domains has created an urgent need for new statistical methods to compare distributions with underlying low-dimensional structure. Assessing similarity between high-dimensional datasets whose observations concentrate near low-dimensional manifolds is particularly challenging due to the nontrivial effects of noise in high dimensions. We propose a principled framework for statistical inference on the similarity and alignability of high-dimensional datasets with low-dimensional smooth signals under heterogeneous noise. The key idea is to link the spectral properties of the observed data matrices to the geometry of their underlying signal distributions. Under a manifold signal-plus-noise model, we build on the principal variances associated to the underlying signals and develop a scale- and rotation-invariant dissimilarity measure between two datasets that may differ in sample size and noise structure. We further construct an estimator of the dissimilarity and a statistical test of dataset alignability, namely, whether the dissimilarity vanishes. The proposed methodology and its theoretical guarantees under high-dimensional asymptotic settings draw on recent advances in random matrix theory (RMT). The proposed framework accommodates heterogeneous noise across datasets and provides a fast, theoretically grounded approach to comparing high-dimensional datasets with low-dimensional structures. Through extensive simulations and analyses of multiple single-cell datasets, we demonstrate that the proposed method substantially outperforms existing approaches.

math.ST↗

arXiv2026

Optimal Estimation of Shared Singular Subspaces across Multiple Noisy Matrices

Estimating singular subspaces from noisy matrices is a fundamental problem with wide-ranging applications across various fields. Driven by the challenges of data integration and multi-view analysis, this study focuses on estimating shared singular subspaces across multiple matrices within a low-rank matrix denoising framework. A common approach for this task is to perform singular value decomposition on the stacked matrix (Stack-SVD), which concatenates all the matrices. We establish that Stack-SVD achieves minimax rate-optimality when the true singular subspaces of the noisy matrices are identical, whereas a popular alternative approach based on SVD of concatenated singular vector matrices (Average-SVD) can be sub-optimal. We then tackle the more complex scenario where the true singular subspaces are only partially shared across matrices. For various cases of partial sharing, we rigorously characterize the conditions under which Stack-SVD remains effective, achieves minimax optimality, or fails to deliver consistent estimates, offering theoretical insights into its practical applicability. To address the limitations of Stack-SVD in scenarios with partial sharing, we propose novel estimators and an efficient algorithm designed to identify both shared and unshared singular vectors. We further prove that these methods attain minimax rate-optimality under partial sharing. Extensive simulations and real-world data applications demonstrate the advantages of our proposed approach.

math.ST↗

arXiv2026

Uncovering smooth structures in single-cell data with PCS-guided neighbor embeddings

Single-cell sequencing is revolutionizing biology by enabling detailed investigations of cell-state transitions. Many biological processes unfold along continuous trajectories, yet it remains challenging to extract smooth, low-dimensional representations from inherently noisy, high-dimensional single-cell data. Neighbor embedding (NE) algorithms, such as t-SNE and UMAP, are widely used to embed high-dimensional single-cell data into low dimensions. But they often introduce undesirable distortions, resulting in misleading interpretations. Existing evaluation methods for NE algorithms primarily focus on separating discrete cell types rather than capturing continuous cell-state transitions, while dynamic modeling approaches rely on strong assumptions about cellular processes and specialized data. To address these challenges, we build on the Predictability-Computability-Stability (PCS) framework for reliable and reproducible data-driven discoveries. First, we systematically evaluate popular NE algorithms through empirical analysis, simulation, and theory, and reveal their key shortcomings, such as artifacts and instability. We then introduce NESS, a principled and interpretable machine learning approach to improve NE representations by leveraging algorithmic stability and to enable robust inference of smooth biological structures. NESS offers useful concepts, quantitative stability metrics, and efficient computational workflows to uncover developmental trajectories and cell-state transitions in single-cell data. Finally, we apply NESS to six single-cell datasets, spanning pluripotent stem cell differentiation, organoid development, and multiple tissue-specific lineage trajectories. Across these diverse contexts, NESS consistently yields useful biological insights, such as identification of transitional and stable cell states and quantification of transcriptional dynamics during development.

stat.ML↗

arXiv2026

Waring's problem involving D.H. Lehmer numbers

For every positive integer $a$ which is coprime with $p$, $p$ is an odd prime, we denote by $\overline{a}$ the unique integer satisfying $1\leq \overline{a}\leq p$ and $a\overline{a}\equiv 1(\mathrm{mod}~p)$. Put $$L(p)=\{a\in Z^+:(a,p)=1,2\nmid a+\overline{a}\}.$$ The elements of $L(p)$ are called D.H. Lehmer numbers. The main purpose of this paper is to prove that for any fixed odd prime $p$, every sufficiently large number unless it is congruent to 15 or 16$(\mathrm{mod}~{16})$ is representable as the sum of 14 fourth powers of D.H. Lehmer numbers. Furthermore, every sufficiently large number is representable as the sum of 16 fourth powers of D.H. Lehmer numbers.

math.NT↗

arXiv2026

Enhancing Spectral Embedding through Robust and Flexible Knowledge Transfer in Electronic Health Records

We propose a spectral-based, unsupervised representation learning framework to derive low-dimensional embeddings for clinical concepts and patients in rare disease cohorts from electronic health records, where data are high-dimensional but sample sizes are limited. To overcome this challenge, we incorporate a knowledge matrix extracted from a broader population that shares a partially overlapping subspace with the rare-disease cohort. Our method departs from existing approaches by relaxing restrictive one-to-one signal-alignment assumptions between the latent data matrix and knowledge matrix, allowing more flexible and realistic forms of structured sharing. We introduce a novel two-step spectral embedding procedure: first, we identify and remove irrelevant components from the knowledge matrix; then, we apply a projection-based method to separately recover shared and heterogeneous components. Simulations and an analysis of a real-world multiple sclerosis cohort show that the proposed method outperforms competing approaches, particularly in challenging scenarios where shared signals are weak and only partially aligned, as is common in rare-disease data.

stat.ML↗

arXiv2026

Entropic Optimal Transport Eigenmaps for Nonlinear Alignment and Joint Embedding of High-Dimensional Datasets

Embedding high-dimensional data into a low-dimensional space is an indispensable component of data analysis. In numerous applications, it is necessary to align and jointly embed multiple datasets from different studies or experimental conditions. Such datasets may share underlying structures of interest but exhibit individual distortions, resulting in misaligned embeddings using traditional techniques. In this work, we propose Entropic Optimal Transport (EOT) eigenmaps, a principled approach for aligning and jointly embedding a pair of datasets with theoretical guarantees. Our approach leverages the leading singular vectors of the EOT plan matrix between two datasets to extract their shared underlying structure and align them in a common embedding space. We interpret our approach as an inter-data variant of the classical Laplacian eigenmaps and diffusion maps embeddings, showing that it enjoys many favorable analogous properties. We analyze a generative model in which two observed high-dimensional datasets share latent variables supported on a common low-dimensional manifold, while each dataset is subject to translation, geometric distortion, orthogonal nuisance structure, and noise. In a large-sample, high-dimensional regime, we prove that the EOT plan concentrates around a population kernel on an effective manifold determined by the geometric mean of the distortions, with invariance to translations, orthogonal nuisance structure, and noise. Subsequently, we relate our embedding to eigenfunctions of population-level operators encoding the density and geometry of the shared manifold. Finally, we showcase the performance of our approach for data integration and embedding through simulations and analyses of real-world biological data, demonstrating its advantages over alternative methods in challenging scenarios.

stat.ML↗

arXiv2026

Kernel spectral joint embeddings for high-dimensional noisy datasets using duo-landmark integral operators

Integrative analysis of multiple heterogeneous datasets has become standard practice in many research fields, especially in single-cell genomics and medical informatics. Existing approaches oftentimes suffer from limited power in capturing nonlinear structures, insufficient account of noisiness and effects of high-dimensionality, lack of adaptivity to signals and sample sizes imbalance, and their results are sometimes difficult to interpret. To address these limitations, we propose a novel kernel spectral method that achieves joint embeddings of two independently observed high-dimensional noisy datasets. The proposed method automatically captures and leverages possibly shared low-dimensional structures across datasets to enhance embedding quality. The obtained low-dimensional embeddings can be utilized for many downstream tasks such as simultaneous clustering, data visualization, and denoising. The proposed method is justified by rigorous theoretical analysis. Specifically, we show the consistency of our method in recovering the low-dimensional noiseless signals, and characterize the effects of the signal-to-noise ratios on the rates of convergence. Under a joint manifolds model framework, we establish the convergence of ultimate embeddings to the eigenfunctions of some newly introduced integral operators. These operators, referred to as duo-landmark integral operators, are defined by the convolutional kernel maps of some reproducing kernel Hilbert spaces (RKHSs). These RKHSs capture the either partially or entirely shared underlying low-dimensional nonlinear signal structures of the two datasets. Our numerical experiments and analyses of two single-cell omics datasets demonstrate the empirical advantages of the proposed method over existing methods in both embeddings and several downstream tasks.

stat.ML↗

arXiv2026

Machine-learning wall model of large-eddy simulation for low- and high-speed flows over rough surfaces

We present a wall model for large-eddy simulation that incorporates surface-roughness effects and is applicable across low- and high-speed flows, for both transitional and fully rough conditions. The model, implemented using an artificial neural network, is trained on a direct numerical simulation database of compressible turbulent channel flows over rough walls. The dataset contains 372 cases spanning a wide range of irregular roughness topographies, including Gaussian and Weibull distributions, Mach numbers 0~3.3, and friction Reynolds numbers 180~2000. We employ an information-theoretic, dimensionless learning method to identify the inputs with the highest predictive power for the dimensionless wall friction and wall heat flux. Predictions are accompanied by a confidence score derived from a spectrally normalized neural Gaussian process, which quantifies uncertainty in regions that deviate from the training dataset. The model performance is first evaluated a-priori on 110 turbulent channel flow cases, yielding prediction errors below 4%. The model is assessed a-posteriori in wall-modeled large-eddy simulations across diverse test cases. These include over 160 subsonic and supersonic turbulent channel flows with rough walls, a transonic high-pressure turbine (HPT) blade with Gaussian roughness, a high-speed compression ramp with sandpaper roughness, and three hypersonic blunt bodies with sand-grain roughness. Results show that the proposed wall model typically achieves a-posteriori predictive accuracy within 10% for wall shear stress and within 15% for wall heat flux, with high confidence in the channel flows and HPT blade cases. In the rough-wall compression ramp and hypersonic blunt bodies, the model captures the heating augmentation with errors ranging 0%~20%. In the cases with the highest errors, the reduced performance is correctly detected by a drop in the confidence score.

physics.flu-dyn↗

arXiv2026

Sums of eight fourth power of primes

For any sufficiently large $\ell$, suppose that $\ell$ can be expressed as $$ \ell=p_1^4+p_2^4+p_3^4+ \cdots +p_8^4,$$ where $p_1, p_2,p_3,\cdots, p_8$ are primes.For such $\ell$, in this paper we will use circle method and sieves to prove that the proportion of $\ell$ in positive integers is at least $\frac{1}{414.465}$ .

math.NT↗

arXiv2025

On a kind of generilized multi-harmonic sum

Let $p$ be an odd prime, Jianqiang Zhao has established a curious congruence $$ \sum_{i+j+k=p \atop i,j,k > 0} \frac{1}{ijk} \equiv -2B_{p-3}\pmod p , $$ where $B_{n}$ denotes the $n-$th Bernoulli numbers. In this paper, we will generalize this problem by using congruent theory and combinatorial methods, and we get some curious congruences.

math.NT↗

arXiv2025

On a kind of generalized multi-harmonic sums

Let $p$ be an odd prime, Jianqiang Zhao has established a curious congruence, which is $$ \sum_{i+j+k=p \atop i,j,k > 0} \frac{1}{ijk} \equiv -2B_{p-3}\pmod p , $$ where $B_{n}$ denotes the $n$-th Bernoulli number. In this paper, we will generalize this kind of sums and prove a family of similar congruences modulo prime powers $p^r$.

math.NT↗

arXiv2025

TIDE: Achieving Balanced Subject-Driven Image Generation via Target-Instructed Diffusion Enhancement

Subject-driven image generation (SDIG) aims to manipulate specific subjects within images while adhering to textual instructions, a task crucial for advancing text-to-image diffusion models. SDIG requires reconciling the tension between maintaining subject identity and complying with dynamic edit instructions, a challenge inadequately addressed by existing methods. In this paper, we introduce the Target-Instructed Diffusion Enhancing (TIDE) framework, which resolves this tension through target supervision and preference learning without test-time fine-tuning. TIDE pioneers target-supervised triplet alignment, modelling subject adaptation dynamics using a (reference image, instruction, target images) triplet. This approach leverages the Direct Subject Diffusion (DSD) objective, training the model with paired "winning" (balanced preservation-compliance) and "losing" (distorted) targets, systematically generated and evaluated via quantitative metrics. This enables implicit reward modelling for optimal preservation-compliance balance. Experimental results on standard benchmarks demonstrate TIDE's superior performance in generating subject-faithful outputs while maintaining instruction compliance, outperforming baseline methods across multiple quantitative metrics. TIDE's versatility is further evidenced by its successful application to diverse tasks, including structural-conditioned generation, image-to-image generation, and text-image interpolation. Our code is available at https://github.com/KomJay520/TIDE.

cs.CV↗

arXiv2025

OIBench: Benchmarking Strong Reasoning Models with Olympiad in Informatics

As models become increasingly sophisticated, conventional algorithm benchmarks are increasingly saturated, underscoring the need for more challenging benchmarks to guide future improvements in algorithmic reasoning. This paper introduces OIBench, a high-quality, private, and challenging olympiad-level informatics dataset comprising 250 carefully curated original problems. We detail the construction methodology of the benchmark, ensuring a comprehensive assessment across various programming paradigms and complexities, and we demonstrate its contamination-resistant properties via experiments. We propose Time/Space Completion Curves for finer-grained efficiency analysis and enable direct human-model comparisons through high-level participant evaluations. Our experiments reveal that while open-source models lag behind closed-source counterparts, current SOTA models already outperform most human participants in both correctness and efficiency, while still being suboptimal compared to the canonical solutions. By releasing OIBench as a fully open-source resource (https://huggingface.co/datasets/AGI-Eval/OIBench), we hope this benchmark will contribute to advancing code reasoning capabilities for future LLMs.

cs.AI↗

arXiv2025

Assessing and improving reliability of neighbor embedding methods: a map-continuity perspective

Visualizing high-dimensional data is essential for understanding biomedical data and deep learning models. Neighbor embedding methods, such as t-SNE and UMAP, are widely used but can introduce misleading visual artifacts. We find that the manifold learning interpretations from many prior works are inaccurate and that the misuse stems from a lack of data-independent notions of embedding maps, which project high-dimensional data into a lower-dimensional space. Leveraging the leave-one-out principle, we introduce LOO-map, a framework that extends embedding maps beyond discrete points to the entire input space. We identify two forms of map discontinuity that distort visualizations: one exaggerates cluster separation and the other creates spurious local structures. As a remedy, we develop two types of point-wise diagnostic scores to detect unreliable embedding points and improve hyperparameter selection, which are validated on datasets from computer vision and single-cell omics.

stat.ME↗

arXiv2024

Automated Label Unification for Multi-Dataset Semantic Segmentation with GNNs

Deep supervised models possess significant capability to assimilate extensive training data, thereby presenting an opportunity to enhance model performance through training on multiple datasets. However, conflicts arising from different label spaces among datasets may adversely affect model performance. In this paper, we propose a novel approach to automatically construct a unified label space across multiple datasets using graph neural networks. This enables semantic segmentation models to be trained simultaneously on multiple datasets, resulting in performance improvements. Unlike existing methods, our approach facilitates seamless training without the need for additional manual reannotation or taxonomy reconciliation. This significantly enhances the efficiency and effectiveness of multi-dataset segmentation model training. The results demonstrate that our method significantly outperforms other multi-dataset training methods when trained on seven datasets simultaneously, and achieves state-of-the-art performance on the WildDash 2 benchmark.

cs.CV↗

arXiv2024

An exact way to verify whether n is a congruent number using Heegner points

We introduce the relationship between congruent numbers and elliptic curves, and compute the conductor of the elliptic curve $y^2 = x^3 - n^2 x$ associated with it. Furthermore, we prove that its $L$-series coefficient $a_m = 0$ when $m \equiv 3 \mod 4$.By using the invariants of the elliptic curve introduced above, we calculate Heegner points to quickly verify whether $n$ is a congruent number.

math.NT↗

arXiv2024

Sailing in high-dimensional spaces: Low-dimensional embeddings through angle preservation

Low-dimensional embeddings (LDEs) of high-dimensional data are ubiquitous in science and engineering. They allow us to quickly understand the main properties of the data, identify outliers and processing errors, and inform the next steps of data analysis. As such, LDEs have to be faithful to the original high-dimensional data, i.e., they should represent the relationships that are encoded in the data, both at a local as well as global scale. The current generation of LDE approaches focus on reconstructing local distances between any pair of samples correctly, often out-performing traditional approaches aiming at all distances. For these approaches, global relationships are, however, usually strongly distorted, often argued to be an inherent trade-off between local and global structure learning for embeddings. We suggest a new perspective on LDE learning, reconstructing angles between data points. We show that this approach, Mercat, yields good reconstruction across a diverse set of experiments and metrics, and preserve structures well across all scales. Compared to existing work, our approach also has a simple formulation, facilitating future theoretical analysis and algorithmic improvements.

cs.LG↗