1 citations · 2 across the 3 of their papers we have counts for
8 papers
Adaptive Softassign via Hadamard-Equipped Sinkhorn
Binrui Shen, Qiang Niu, Shengxin Zhu
Softassign is a pivotal method in graph matching and other learning tasks. Many softassign-based algorithms exhibit performance sensitivity to a parameter in the softassign. Howeve…
Suboptimal subspace construction for log-determinant approximation
Zongyuan Han, Wenhao Li, Yixuan Huang +1
Variance reduction is a crucial idea for Monte Carlo simulation and the stochastic Lanczos quadrature method is a dedicated method to approximate the trace of a matrix function. In…
An analysis on stochastic Lanczos quadrature with asymmetric quadrature nodes
Wenhao Li, Yixuan Huang, Shengxin Zhu
This paper revisits the error analysis of the Stochastic Lanczos Quadrature (SLQ) method for approximating the trace of matrix functions, with a specific focus on asymmetric Lanczo…
Generalized Rough Polyharmonic Splines for Multiscale PDEs with Rough Coefficients
Xinliang Liu, Lei Zhang, Shengxin Zhu
In this paper, we demonstrate the construction of generalized Rough Polyhamronic Splines (GRPS) within the Bayesian framework, in particular, for multiscale PDEs with rough coeffic…
Fabricated Pictures Detection with Graph Matching
Binrui Shen, Qiang Niu, Shengxin Zhu
Fabricating experimental pictures in research work is a serious academic misconduct, which should better be detected in the reviewing process. However, due to large number of submi…
Sparse inversion for derivative of log determinant
Shengxin Zhu, Andrew J Wathen
Algorithms for Gaussian process, marginal likelihood methods or restricted maximum likelihood methods often require derivatives of log determinant terms. These log determinants are…