Related papers: Filling The Gaps With PCO's
We present a novel algorithm, FAST-PT, for performing convolution or mode-coupling integrals that appear in nonlinear cosmological perturbation theory. The algorithm uses several properties of gravitational structure formation -- the…
We introduce an algorithm that can be used to perform stochastic perturbation theory (sPT) to correct any non-linearly parametrized wavefunction that can be optimized using orbital space Variational Monte Carlo (VMC). Although the…
Superstring field theory expresses the perturbative S-matrix of superstring theory as a sum of Feynman diagrams each of which is manifestly free from ultraviolet divergences. The interaction vertices fall off exponentially for large…
A body of recent work has focused on constructing a variational family of filtered distributions using Sequential Monte Carlo (SMC). Inspired by this work, we introduce Particle Smoothing Variational Objectives (SVO), a novel backward…
In this note we reformulate topological string theory using supermanifolds and supermoduli spaces, following the approach worked out by Witten for superstring perturbation theory in arXiv:1209.5461. We intend to make the construction…
Spatiotemporal optical coherence (STOC) imaging is a new technique for suppressing coherent crosstalk noise in Fourier-domain full-field optical coherence tomography (FD-FF-OCT). In STOC imaging, the timevarying inhomogeneous phase masks…
Sparse Subspace Clustering (SSC) is a popular unsupervised machine learning method for clustering data lying close to an unknown union of low-dimensional linear subspaces; a problem with numerous applications in pattern recognition and…
Particle Swarm Optimisation (PSO) makes use of a dynamical system for solving a search task. Instead of adding search biases in order to improve performance in certain problems, we aim to remove algorithm-induced scales by controlling the…
Conditional Monte Carlo or pre-integration is a powerful tool for reducing variance and improving the regularity of integrands when using Monte Carlo and quasi-Monte Carlo (QMC) methods. To select the variable to pre-integrate, one must…
Sparse Principal Component Analysis (sPCA) is a cardinal technique for obtaining combinations of features, or principal components (PCs), that explain the variance of high-dimensional datasets in an interpretable manner. This involves…
Computational spectrometers are pivotal in enabling low-cost, in-situ and rapid spectral analysis, with potential applications in chemistry, biology, and environmental science. However, filter-based spectral encoding approaches typically…
Probabilistic circuits (PCs) are a unifying representation for probabilistic models that support tractable inference. Numerous applications of PCs like controllable text generation depend on the ability to efficiently multiply two circuits.…
Spectral neural operators, particularly Fourier Neural Operators (FNO), are a powerful framework for learning solution operators of partial differential equations (PDEs) due to their efficient global mixing in the frequency domain. However,…
In this paper we demonstrate that the numerical method of steepest descent fails when applied in a straight forward fashion to the most commonly occurring highly oscillatory integrals in scattering theory. Through a polar change of…
Unitary transformations are an essential tool for the theoretical understanding of many systems by mapping them to simpler effective models. A systematically controlled variant to perform such a mapping is a perturbative continuous unitary…
Nonperturbative corrections in type II string theory corresponding to Riemann surfaces with one boundary are calculated in several noncompact geometries of desingularized orbifolds. One of these models has a complicated phase structure…
Sparse principal component analysis (sparse PCA) is a widely used technique for dimensionality reduction in multivariate analysis, addressing two key limitations of standard PCA. First, sparse PCA can be implemented in high-dimensional low…
It is well known in NSR string theory, that vertex operators can be constructed in various ``pictures''. Recently this was discussed in the context of pure spinor formalism. NSR picture changing operators have an elegant super-geometrical…
This paper proposes a novel approach for modeling and controlling nonlinear systems with varying parameters. The approach introduces the use of a parameter-varying Koopman operator (PVKO) in a lifted space, which provides an efficient way…
In this report, a novel variation of Particle Swarm Optimization (PSO) algorithm, called Multiagent Coordination Optimization (MCO), is implemented in a parallel computing way for practical use by introducing MATLAB built-in function…