1 code implementation • 16 Mar 2024 • Jiashun Jin, Zheng Tracy Ke, Gabriel Moryoussef, Jiajun Tang, Jingming Wang
Vertex hunting is the problem of estimating the $K$ vertices of the simplex.
1 code implementation • 1 Jan 2024 • Zheng Tracy Ke, Pengsheng Ji, Jiashun Jin, Wanshan Li
In particular, we propose a new statistical model for ranking the citation impacts of $11$ topics, and we also build a cross-topic citation graph to illustrate how research results on different topics spread to one another.
1 code implementation • 8 Jun 2023 • Dieyi Chen, Jiashun Jin, Zheng Tracy Ke
We also find that IF-PCA is quite competitive, which slightly outperforms Seurat and SC3 over the $8$ single-cell data sets.
no code implementations • 9 Mar 2023 • Jiashun Jin, Zheng Tracy Ke, Paxton Turner, Anru R. Zhang
Using a degree-corrected block model (DCBM), we establish phase transitions of this testing problem concerning the size of the small community and the edge densities in small and large communities.
no code implementations • 3 Jan 2023 • T. Tony Cai, Zheng Tracy Ke, Paxton Turner
Motivated by applications in text mining and discrete distribution inference, we investigate the testing for equality of probability mass functions of $K$ groups of high-dimensional multinomial distributions.
no code implementations • 15 Jul 2020 • Zhirui Hu, Zheng Tracy Ke, Jun S. Liu
The success of deep learning has inspired recent interests in applying neural networks in statistical inference.
no code implementations • 14 Nov 2018 • Jiashun Jin, Zheng Tracy Ke, Shengming Luo
It accommodates severe degree heterogeneity and is adaptive to different levels of sparsity, but its performance for networks with weak signals is unclear.
no code implementations • NeurIPS 2019 • Yaqi Duan, Zheng Tracy Ke, Mengdi Wang
Our proposed method is a simple two-step algorithm: The first step is spectral decomposition of empirical transition matrix, and the second step conducts a linear transformation of singular vectors to find their approximate convex hull.
no code implementations • 16 Aug 2016 • Zheng Tracy Ke
In the probabilistic topic models, the quantity of interest---a low-rank matrix consisting of topic vectors---is hidden in the text corpus matrix, masked by noise, and the Singular Value Decomposition (SVD) is a potentially useful tool for learning such a low-rank matrix.
no code implementations • 24 Feb 2015 • Jiashun Jin, Zheng Tracy Ke, Wanjie Wang
In the two-dimensional phase space calibrating the rarity and strengths of useful features, we find the precise demarcation for the Region of Impossibility and Region of Possibility.