Cheng Meng

Cheng Meng

Auto-generated profile, based on publicly available information

Cheng Meng

Institute of Statistics and Big Data Renmin University of China Beijing China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 February 2023 in Journal of Computational and Graphical Statistics
Verified
Journal Article
Closed access
MLMengyu Li
Mengyu Li
JYJun Yu
Jun Yu
Hongteng XuHongteng Xu
Hongteng Xu
CMCheng Meng
Cheng Meng
As a valid metric of metric-measure spaces, Gromov-Wasserstein (GW) distance has shown the potential for matching problems of structured data like point clouds and graphs. However, its application in practice is limited due to the high computational complexity. To overcome this challenge, we propose a novel importance sparsification method, called Spar-GW, to approximate GW distance efficiently. In particular, instead of considering a dense coupling matrix, our method leverages a simple but effective sampling strategy to construct a sparse coupling matrix and update it with few computations. The proposed Spar-GW method is applicable to the GW distance with arbitrary ground cost, and it reduces the complexity from O(n4) to O(n2+δ) for an arbitrary small δ>0. Theoretically, the convergence and consistency of the proposed estimation for GW distance are established under mild regularity conditions. In addition, this method can be extended to approximate the variants of GW distance, including the entropic GW distance, the fused GW distance, and the unbalanced GW distance. Experiments show the superiority of our Spar-GW to state-of-the-art methods in both synthetic and real-world tasks. Supplementary materials for this article are available online.

13 May 2022 in WIREs Computational Statistics
Verified
Journal Article
Closed access
JZJingyi Zhang
Jingyi Zhang
PMPing Ma
Ping Ma
WZWenxuan Zhong
Wenxuan Zhong
CMCheng Meng
Cheng Meng

5 July 2022 in Journal of Computational and Graphical Statistics
Verified
Journal Article
Closed access
JZJingyi Zhang
Jingyi Zhang
CMCheng Meng
Cheng Meng
JYJun Yu
Jun Yu
MZMengrui Zhang
Mengrui Zhang
WZWenxuan Zhong
Wenxuan Zhong
PMPing Ma
Ping Ma
Subsampling methods aim to select a subsample as a surrogate for the observed sample. Such methods have been used pervasively in large-scale data analytics, active learning, and privacy-preserving analysis in recent decades. Instead of model-based methods, in this article, we study model-free subsampling methods, which aim to identify a subsample, that is, not confined by model assumptions. Existing model-free subsampling methods are usually built upon clustering techniques or kernel tricks. Most of these methods suffer from either a large computational burden or a theoretical weakness. In particular, the theoretical weakness is that the empirical distribution of the selected subsample may not necessarily converge to the population distribution. Such computational and theoretical limitations hinder the broad applicability of model-free subsampling methods in practice. We propose a novel model-free subsampling method by using optimal transport techniques. Moreover, we develop an efficient subsampling algorithm, that is, adaptive to the unknown probability density function. Theoretically, we show the selected subsample can be used for efficient density estimation by deriving the convergence rate for the proposed subsample kernel density estimator. We also provide the optimal bandwidth for the proposed estimator. Numerical studies on synthetic and real-world datasets demonstrate the performance of the proposed method is superior.

8 February 2024 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
TLTao Li
Tao Li
CMCheng Meng
Cheng Meng
Hongteng XuHongteng Xu
Hongteng Xu
JYJun Yu
Jun Yu
Distribution comparison plays a central role in many machine learning tasks like data classification and generative modeling. In this study, we propose a novel metric, called Hilbert curve projection (HCP) distance , to measure the distance between two probability distributions with low complexity. In particular, we first project two high-dimensional probability distributions using Hilbert curve to obtain a coupling between them, and then calculate the transport distance between these two distributions in the original space, according to the coupling. We show that HCP distance is a proper metric and is well-defined for probability measures with bounded supports. Furthermore, we demonstrate that the modified empirical HCP distance with the $L_{p}$ cost in the $d$ -dimensional space converges to its population counterpart at a rate of no more than $O(n^{-1/2\max \lbrace d,p\rbrace })$ . To suppress the curse-of-dimensionality, we also develop two variants of the HCP distance using (learnable) subspace projections. Experiments on both synthetic and real-world data show that our HCP distance works as an effective surrogate of the Wasserstein distance with low complexity and overcomes the drawbacks of the sliced Wasserstein distance.

12 April 2023 in Journal of Computational and Graphical Statistics
Verified
Journal Article
Closed access
TLTao Li
Tao Li
JYJun Yu
Jun Yu
CMCheng Meng
Cheng Meng
We consider the model-free feature screening problem that aims to discard non-informative features before downstream analysis. Most of the existing feature screening approaches have at least quadratic computational cost with respect to the sample size n, thus may suffer from a huge computational burden when n is large. To alleviate the computational burden, we propose a scalable model-free sure independence screening approach. This approach is based on the so-called sliced-Wasserstein dependency, a novel metric that measures the dependence between two random variables. Specifically, we quantify the dependence between two random variables by measuring the sliced-Wasserstein distance between their joint distribution and the product of their marginal distributions. For a predictor matrix of size n × d, the computational cost for the proposed algorithm is at the order of O(n log (n)d), even when the response variable is multivariate. Theoretically, we show the proposed method enjoys both sure screening and rank consistency properties under mild regularity conditions. Numerical studies on various synthetic and real-world datasets demonstrate the superior performance of the proposed method in comparison with mainstream competitors, requiring significantly less computational time.

28 September 2024 in Statistics and Computing
Verified
Journal Article
Closed access
PDF file
MLMengyu Li
Mengyu Li
JYJun Yu
Jun Yu
TLTao Li
Tao Li
CMCheng Meng
Cheng Meng