2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DS2024
Approximating Partition in Near-Linear Time
Lin Chen, Jiayi Lian, Yuchen Mao +1
We propose an $\widetilde{O}(n + 1/\eps)$-time FPTAS (Fully Polynomial-Time Approximation Scheme) for the classical Partition problem. This is the best possible (up to a polylogari…
stat.ME2023★ 2 cited
On Block Cholesky Decomposition for Sparse Inverse Covariance Estimation
Xiaoning Kang, Jiayi Lian, Xinwei Deng
The modified Cholesky decomposition is popular for inverse covariance estimation, but often needs pre-specification on the full information of variable ordering. In this work, we p…