YKYuehaw Khoo

Yuehaw Khoo

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Yuehaw Khoo has a total of 54 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    A model-guided neural network method for the inverse scattering problem

    by Olivia Tsang, Owen Melia, Vasileios Charisopoulos, Jeremy Hoskins, Yuehaw Khoo, Rebecca Willett

  • Open Access

    Accelerated Learning of High Dimensional Functions with a Tensor-Featured Training Network

    by Karl Pierce, Yuehaw Khoo, Haizhao Yang

    In this work we present a method to accelerate the optimization of learning high dimensional functions using deep neural network (DNN). This optimization procedure first introduces contextual features into the input layer of a DNN forming a basis outer basis. The parameters of DNN are optimized via standard gradient descent while keeping the input-feature basis fixed. Periodically, the feature layer may be updated before DNN optimization resumes. In the input feature layer, we consider two types of basis functions: those that can be evaluated quickly in a matrix-free way on the domain (i.e. rank-1 features) and more complex features that must first be decomposed using tensor network (TN) decomposition strategies (TN features). In particular, we study the effect of adding features which distill trained DNN into TNs using a discretize and decompose strategy. To efficiently decompose high-dimensional functions constructed from discretized DNN, we leverage a randomized tensor decomposition strategy. Using randomization, we are able to reduce the storage cost of decomposing high dimensional functions by at least 8 orders of magnitude. With tensor featured training, using only rank-1 features, we are able to significantly reduce the error in DNN training from scratch with a marginal effect on both the time and storage cost. By introducing a TN feature, we are able to further improve the accuracy of DNN that are converged to strong local minimum.

  • Open Access

    Machine-Learning Accelerated Simulations for Forecasting, Data Assimilation, and Extreme Events (Final Report)

    by Rebecca Willett, Il (United States) Univ. Of Chicago, Argonne Argonne National Laboratory (Anl), Daniel Sanz-Alonso, Yuehaw Khoo, Mihai Anitescu, Julie Bessac

    This is the final technical report for DOE Grant DE-SC0022232.

  • Method of Moments for Estimation of Noisy Curves

    by Phillip Lo, Yuehaw Khoo

    In this paper, we study the problem of recovering a ground truth high dimensional piecewise linear curve [Formula: see text] from a high noise Gaussian point cloud with covariance [Formula: see text] centered around the curve. We establish that the sample complexity of recovering [Formula: see text] from data scales with order at least [Formula: see text]. We then show that recovery of a piecewise linear curve from the third moment is locally well-posed and, hence, [Formula: see text] samples are also sufficient for recovery. We propose methods to recover a curve from data based on a fitting to the third moment tensor with a careful initialization strategy and conduct some numerical experiments verifying the ability of our methods to recover curves. All code for our numerical experiments is publicly available on GitHub.


  • Subspace Method of Moments for Ab Initio 3-D Single Particle Cryo-EM Reconstruction

    by Jeremy Hoskins, Yuehaw Khoo, Oscar Mickelin, Amit Singer, Yuguan Wang

    Cryo-electron microscopy (cryo-EM) is a widely used technique for recovering the three-dimensional (3-D) structure of biological molecules from a large number of experimentally generated noisy 2-D tomographic projection images of the 3-D structure, taken from unknown viewing angles. Through computationally intensive algorithms, these observed images are processed to reconstruct the 3-D structures. Many popular computational methods rely on estimating the unknown angles as part of the reconstruction process, which becomes particularly challenging at low signal-to-noise ratios. The method of moments offers an alternative approach that circumvents the estimation of viewing orientations of individual projection images by instead estimating the underlying distribution of the viewing angles, and is robust to noise given sufficiently many images. However, the method of moments typically entails computing higher-order moments of the projection images, incurring significant computational and memory costs. To mitigate this, we propose a new approach called the subspace method of moments (SubspaceMoM), which compresses the first three moments using data-driven low-rank tensor techniques as well as expansion into a suitable function basis. The compressed moments can be efficiently computed from the set of projection images using numerical quadrature and can be employed to jointly reconstruct the 3-D structure and the distribution of viewing orientations. We illustrate the practical applicability of SubspaceMoM through numerical experiments using up to the third-order moment on synthetic datasets with a simplified cryo-EM image formation model, which significantly improves the reconstruction resolution compared to previous MoM approaches.


  • Open Access

    Recursive Sketched Interpolation: Efficient Hadamard Products of Tensor Trains

    by Zhaonan Meng, Yuehaw Khoo, Jiajia Li, E. Miles Stoudenmire

    The Hadamard product of two tensors in the tensor-train (TT) format is a fundamental operation across various applications, such as TT-based function multiplication for nonlinear differential equations or convolutions. However, conventional methods for computing this product typically scale as at least $\mathcal{O}(χ^4)$ with respect to the TT bond dimension (TT-rank) $χ$, creating a severe computational bottleneck in practice. By combining randomized tensor-train sketching with slice selection via interpolative decomposition, we introduce Recursive Sketched Interpolation (RSI), a ``scale product'' algorithm that computes the Hadamard product of TTs at a computational cost of $\mathcal{O}(χ^3)$. Benchmarks across various TT scenarios demonstrate that RSI offers superior scalability compared to traditional methods while maintaining comparable accuracy. We generalize RSI to compute more complex operations, including Hadamard products of multiple TTs and other element-wise nonlinear mappings, without increasing the complexity beyond $\mathcal{O}(χ^3)$.


  • Open Access

    Combining monte carlo and tensor-network methods for partial differential equations

    by Yian Chen, Yuehaw Khoo, Ziang Yu

    In this paper, we propose a general framework for solving high-dimensional partial differential equations with tensor networks. Our approach uses Monte Carlo simulations to update the solution and re-estimates the new solution from samples as a tensor network using a recently proposed tensor train-sketching technique. We showcase the versatility and flexibility of our approach by applying it to two specific scenarios: quantum imaginary-time evolution via auxiliary-field quantum Monte Carlo and simulating the Fokker-Planck equation through Langevin dynamics. We also provide convergence guarantees and numerical experiments to demonstrate the efficacy of the proposed method.

  • Open Access

    A Model-Guided Neural Network Method for the Inverse Scattering Problem

    by Olivia Tsang, Owen Melia, Vasileios Charisopoulos, Jeremy G. Hoskins, Yuehaw Khoo, Rebecca Willett

    Inverse medium scattering is an ill-posed, nonlinear wave-based imaging problem arising in medical imaging, remote sensing, and non-destructive testing. Machine learning (ML) methods offer increased inference speed and flexibility in capturing prior knowledge of imaging targets relative to classical optimization-based approaches; however, they perform poorly in regimes where the scattering behavior is highly nonlinear. A key limitation is that ML methods struggle to incorporate the physics governing the scattering process, which are typically inferred implicitly from the training data or loosely enforced via architectural design. In this paper, we present a method that endows a machine learning framework with explicit knowledge of problem physics, in the form of a differentiable solver representing the forward model. The proposed method progressively refines reconstructions of the scattering potential using measurements at increasing wave frequencies, following a classical strategy to stabilize recovery. Empirically, we find that our method provides high-quality reconstructions at a fraction of the computational or sampling costs of competing approaches.

  • Open Access

    Sketch Tomography: Hybridizing Classical Shadow and Matrix Product State

    by Xun Tang, Haoxuan Chen, Yuehaw Khoo, Lexing Ying

    We introduce Sketch Tomography, an efficient procedure for quantum state tomography based on the classical shadow protocol used for quantum observable estimations. The procedure applies to the case where the ground truth quantum state is a matrix product state (MPS). The density matrix of the ground truth state admits a tensor train ansatz as a result of the MPS assumption, and we estimate the tensor components of the ansatz through a series of observable estimations, thus outputting an approximation of the density matrix. The procedure is provably convergent with a sample complexity that scales quadratically in the system size. We conduct extensive numerical experiments to show that the procedure outputs an accurate approximation to the quantum state. For observable estimation tasks involving moderately large subsystems, we show that our procedure gives rise to a more accurate estimation than the classical shadow protocol. We also show that sketch tomography is more accurate in observable estimation than quantum states trained from the maximum likelihood estimation formulation.