Schr\"{o}dinger PCA: On the Duality between Principal Component Analysis and Schr\"{o}dinger Equation

• URL: http://arxiv.org/abs/2006.04379v2
• Date: Wed, 18 Aug 2021 04:11:56 GMT
• Title: Schr\"{o}dinger PCA: On the Duality between Principal Component Analysis and Schr\"{o}dinger Equation
• Authors: Ziming Liu, Sitian Qian, Yixuan Wang, Yuxuan Yan, and Tianyi Yang
• Abstract summary: Principal component analysis (PCA) has achieved great success in unsupervised learning. In particular, PCA will fail the spatial Gaussian Process (GP) model in the undersampling regime. Counterly, by drawing the connection between PCA and Schr"odinger equation, we can not only attack the undersampling challenge but also compute in an efficient and decoupled way. Our algorithm only requires variances of features and estimated correlation length as input, constructs the corresponding Schr"odinger equation, and solves it to obtain the energy eigenstates.
• Score: 4.230413425773648
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Principal component analysis (PCA) has achieved great success in unsupervised learning by identifying covariance correlations among features. If the data collection fails to capture the covariance information, PCA will not be able to discover meaningful modes. In particular, PCA will fail the spatial Gaussian Process (GP) model in the undersampling regime, i.e. the averaged distance of neighboring anchor points (spatial features) is greater than the correlation length of GP. Counterintuitively, by drawing the connection between PCA and Schr\"odinger equation, we can not only attack the undersampling challenge but also compute in an efficient and decoupled way with the proposed algorithm called Schr\"odinger PCA. Our algorithm only requires variances of features and estimated correlation length as input, constructs the corresponding Schr\"odinger equation, and solves it to obtain the energy eigenstates, which coincide with principal components. We will also establish the connection of our algorithm to the model reduction techniques in the partial differential equation (PDE) community, where the steady-state Schr\"odinger operator is identified as a second-order approximation to the covariance function. Numerical experiments are implemented to testify the validity and efficiency of the proposed algorithm, showing its potential for unsupervised learning tasks on general graphs and manifolds.

Related papers

• Harmonic Path Integral Diffusion [0.4527270266697462]
  We present a novel approach for sampling from a continuous multivariate probability distribution. Our method constructs a time-dependent bridge from a delta function centered at the origin of the state space.
  arXiv  Detail & Related papers  (2024-09-23T16:20:21Z)
• Streaming quantum gate set tomography using the extended Kalman filter [0.0]
  We apply the extended Kalman filter to data from quantum gate set tomography to provide a streaming estimator of the both the system error model and its uncertainties. With our method, a standard laptop can process one- and two-qubit circuit outcomes and update gate set error model at rates comparable to current experimental execution.
  arXiv  Detail & Related papers  (2023-06-26T23:51:08Z)
• Monte Carlo Neural PDE Solver for Learning PDEs via Probabilistic Representation [59.45669299295436]
  We propose a Monte Carlo PDE solver for training unsupervised neural solvers. We use the PDEs' probabilistic representation, which regards macroscopic phenomena as ensembles of random particles. Our experiments on convection-diffusion, Allen-Cahn, and Navier-Stokes equations demonstrate significant improvements in accuracy and efficiency.
  arXiv  Detail & Related papers  (2023-02-10T08:05:19Z)
• Asymptotically Unbiased Instance-wise Regularized Partial AUC Optimization: Theory and Algorithm [101.44676036551537]
  One-way Partial AUC (OPAUC) and Two-way Partial AUC (TPAUC) measures the average performance of a binary classifier. Most of the existing methods could only optimize PAUC approximately, leading to inevitable biases that are not controllable. We present a simpler reformulation of the PAUC problem via distributional robust optimization AUC.
  arXiv  Detail & Related papers  (2022-10-08T08:26:22Z)
• Improvements to Supervised EM Learning of Shared Kernel Models by Feature Space Partitioning [0.0]
  This paper addresses the lack of rigour in the derivation of the EM training algorithm and the computational complexity of the technique. We first present a detailed derivation of EM for the Gaussian shared kernel model PRBF classifier. To reduce complexity of the resulting SKEM algorithm, we partition the feature space into $R$ non-overlapping subsets of variables.
  arXiv  Detail & Related papers  (2022-05-31T09:18:58Z)
• Partial Wasserstein Adversarial Network for Non-rigid Point Set Registration [33.70389309762202]
  Given two point sets, the problem of registration is to recover a transformation that matches one set to the other. We formulate the registration problem as a partial distribution matching (PDM) problem, where the goal is to partially match the distributions represented by point sets in a metric space. We propose a partial Wasserstein adversarial network (PWAN), which is able to approximate the PW discrepancy by a neural network, and minimize it by gradient descent.
  arXiv  Detail & Related papers  (2022-03-04T10:23:48Z)
• Differentiable Annealed Importance Sampling and the Perils of Gradient Noise [68.44523807580438]
  Annealed importance sampling (AIS) and related algorithms are highly effective tools for marginal likelihood estimation. Differentiability is a desirable property as it would admit the possibility of optimizing marginal likelihood as an objective. We propose a differentiable algorithm by abandoning Metropolis-Hastings steps, which further unlocks mini-batch computation.
  arXiv  Detail & Related papers  (2021-07-21T17:10:14Z)
• Accurate methods for the analysis of strong-drive effects in parametric gates [94.70553167084388]
  We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach. We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
  arXiv  Detail & Related papers  (2021-07-06T02:02:54Z)
• Doubly Robust Off-Policy Actor-Critic: Convergence and Optimality [131.45028999325797]
  We develop a doubly robust off-policy AC (DR-Off-PAC) for discounted MDP. DR-Off-PAC adopts a single timescale structure, in which both actor and critics are updated simultaneously with constant stepsize. We study the finite-time convergence rate and characterize the sample complexity for DR-Off-PAC to attain an $epsilon$-accurate optimal policy.
  arXiv  Detail & Related papers  (2021-02-23T18:56:13Z)
• Exponentially Weighted l_2 Regularization Strategy in Constructing Reinforced Second-order Fuzzy Rule-based Model [72.57056258027336]
  In the conventional Takagi-Sugeno-Kang (TSK)-type fuzzy models, constant or linear functions are usually utilized as the consequent parts of the fuzzy rules. We introduce an exponential weight approach inspired by the weight function theory encountered in harmonic analysis.
  arXiv  Detail & Related papers  (2020-07-02T15:42:15Z)
• Discrete Adjoints for Accurate Numerical Optimization with Application to Quantum Control [0.0]
  This paper considers the optimal control problem for realizing logical gates in a closed quantum system. The system is discretized with the Stormer-Verlet scheme, which is a symplectic partitioned Runge-Kutta method. A parameterization of the control functions based on B-splines with built-in carrier waves is also introduced.
  arXiv  Detail & Related papers  (2020-01-04T00:02:23Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.