11 citations · 20 across the 13 of their papers we have counts for
13 papers
Reduced order model for parametric Boltzmann equation and its application to inverse problems
Shanyin Tong, Jingwei Hu, Fengyan Li +3
The Boltzmann equation plays an important role in modeling mesoscopic behavior in a wide range of scientific and engineering applications. However, its numerical solution is comput…
Structure-Preserving Reduced-Order Modeling via Low-Rank Transport Signatures
Jiajia Yu, Jingwei Hu, Fengyan Li +3
Parametrized PDEs with density-valued solutions are often difficult to approximate with classical linear reduced-order models, especially in transport-dominated regimes. We introdu…
Advancing Local Clustering on Graphs via Compressive Sensing: Semi-supervised and Unsupervised Methods
Zhaiming Shen, Sung Ha Kang
Local clustering aims to identify specific substructures within a large graph without any additional structural information of the graph. These substructures are typically small co…
Local Clustering for Lung Cancer Image Classification via Sparse Solution Technique
Jackson Hamel, Ming-Jun Lai, Zhaiming Shen +1
In this work, we propose to use a local clustering approach based on the sparse solution technique to study the medical image, especially the lung cancer image classification task.…
Tree-based Ensemble Learning for Out-of-distribution Detection
Zhaiming Shen, Menglun Wang, Guang Cheng +5
Being able to successfully determine whether the testing samples has similar distribution as the training samples is a fundamental question to address before we can safely deploy m…
The Optimal Linear B-splines Approximation via Kolmogorov Superposition Theorem and its Application
Ming-Jun Lai, Zhaiming Shen
We propose a new approach for approximating functions in via Kolmogorov superposition theorem (KST) based on the linear spline interpolation of the outer function in t…
Maximal Volume Matrix Cross Approximation for Image Compression and Least Squares Solution
Kenneth Allen, Ming-Jun Lai, Zhaiming Shen
We study the classic matrix cross approximation based on the maximal volume submatrices. Our main results consist of an improvement of the classic estimate for matrix cross approxi…
Graph-based Semi-supervised Local Clustering with Few Labeled Nodes
Zhaiming Shen, Ming-Jun Lai, Sheng Li
Local clustering aims at extracting a local structure inside a graph without the necessity of knowing the entire graph structure. As the local structure is usually small in size co…
A Compressed Sensing Based Least Squares Approach to Semi-supervised Local Cluster Extraction
Ming-Jun Lai, Zhaiming Shen
A least squares semi-supervised local clustering algorithm based on the idea of compressed sensing is proposed to extract clusters from a graph with known adjacency matrix. The alg…
The Kolmogorov Superposition Theorem can Break the Curse of Dimensionality When Approximating High Dimensional Functions
Ming-Jun Lai, Zhaiming Shen
We explain how to use Kolmogorov Superposition Theorem (KST) to break the curse of dimensionality when approximating a dense class of multivariate continuous functions. We first sh…
A Quasi-Orthogonal Matching Pursuit Algorithm for Compressive Sensing
Ming-Jun Lai, Zhaiming Shen
In this paper, we propose a new orthogonal matching pursuit algorithm called quasi-OMP algorithm which greatly enhances the performance of classical orthogonal matching pursuit (OM…
The exponential map is chaotic: An invitation to transcendental dynamics
Zhaiming Shen, Lasse Rempe-Gillen
We present an elementary and conceptual proof that the complex exponential map is "chaotic" when considered as a dynamical system on the complex plane. (This result was conjectured…
Group Testing with Pools of Fixed Size
David Cariolaro, Zhaiming Shen, Yi Zhang
In the classical combinatorial (adaptive) group testing problem, one is given two integers \(d\) and \(n\), where \(0\le d\le n\), and a population of \(n\) items, exactly \(d\) of…