Study symmetry breaking in quantum mechanics to understand many-body physics.
problem Understanding many-body physics from quantum mechanics.
method Analyzing potentials with unstable critical points and local minima.
result Emergence of many-body physics from spontaneous symmetry breaking.
Extends spectral number variance convergence to random matrix ensembles for twisted Laplacians.
problem Spectral number variance convergence for twisted Laplacians and Dirac operators.
method Extends Rudnick's approach to Gaussian ensembles for twisted Laplacians and Dirac operators.
result Convergence to Gaussian ensembles for twisted Laplacians and Dirac operators.
Expected centre of mass for random embeddings is constant.
problem Understanding the expected centre of mass for random embeddings.
method Analyzing the Haar measure and Gaussian unitary ensemble on SL(N, C).
result The expectation of the centre of mass is a constant multiple of the identity matrix.
Random matrix ensembles yield uniform distributions on manifolds.
problem Understanding distributions of vectors in random matrix ensembles.
method Analyzing eigenvalues, singular values, and Autonne-Takagi vectors of various random matrix ensembles.
result Uniform distributions on specific manifolds for different types of random matrix ensembles.
Paper solves a key problem in learning from high-dimensional covariance matrices.
problem Computing normalizing factors for Riemannian Gaussian distributions on high-dimensional covariance matrices.
method Equivalence with random matrix theory and log-normal matrix ensembles to approximate normalizing factors.
result Efficient approximation of normalizing factors with decreasing error as dimension increases.
Study smooth linear statistics on random covers of hyperbolic surfaces, showing central limit and variance results.
problem Analyzing fluctuations and energy variance of random covers of compact hyperbolic surfaces.
method Examining fluctuations in a small energy window around a fixed energy level, considering the variance of a typical surface, using a double limit where n and L go to infinity. result Distribution of fluctuations tends to a Gaussian with variance of GOE/GUE, and energy variance of a typical random n-cover is that of GOE/GUE. Ens-CGP synthesizes ensemble-based inference with Gaussian processes.
problem Ensemble-based inference and Gaussian process modeling.
method Formulates Ens-CGP as a conditional Gaussian process for ensemble moments.
result Ens-CGP provides a unified probabilistic foundation for Kalman-type methods.
Quantum neural networks converge to Gaussian processes as they grow.
problem Understanding the convergence of quantum neural networks to Gaussian processes.
method Analyzing Haar random unitary and orthogonal deep QNNs, considering input states, measurement observables, and non-independence of unitary matrix entries.
result Quantum neural networks outputs converge to Gaussian processes in the limit of large Hilbert space dimension.
Study on Gaussian ensemble of matrix products with mixed moments computed.
problem Understanding the statistical properties of matrix products of Gaussian matrices.
method Analysis of a multi-Wishart ensemble and enumeration of non-crossing pairings.
result Mixed moments of the product matrix are computed and found to be weighted by Fuss-Catalan numbers at large N. In this work a novel method to quantify spectral ergodicity for random matrices is presented. The new methodology combines approaches rooted in the metrics of Thirumalai-Mountain (TM) and Kullbach-Leibler (KL) divergence. The method is applied to a general study of deep and recurrent neural networks via the analysis of…
We reconsider the problem of calculating a general spectral correlation function containing an arbitrary number of products and ratios of characteristic polynomials for a N x N random matrix taken from the Gaussian Unitary Ensemble (GUE). Deviating from the standard "supersymmetry" approach, we integrate out Grassmann …
This work preserves linear invariants in ensemble filters for non-Gaussian data assimilation.
problem Maintaining critical invariants like mass, stoichiometric balance, and charge in non-Gaussian data assimilation.
method Introducing a novel class of nonlinear ensemble filters using measure transport theory.
result Recovery of a constrained Kalman filter for Gaussian settings and combination with regularization techniques.
Ensembles dynamic models using random feature approximations.
problem Online scalable Bayesian learning with dynamic models and ensembling.
method Random feature approximations and dynamic models using random walks.
result Better performance with alternative basis expansions like Hilbert space Gaussian processes.
DGMEs use Gaussian mixtures to quantify uncertainty in deep learning.
problem Quantifying uncertainty in complex predictive densities.
method DGMEs use a Gaussian mixture model with an EM algorithm for parameter learning.
result DGMEs outperform state-of-the-art models in uncertainty quantification.
GEnBP combines EnKF and GaBP for efficient high-dimensional inference.
problem Efficient inference in high-dimensional models.
method Gaussian Ensemble Belief Propagation algorithm combining EnKF and GaBP.
result GEnBP outperforms existing methods in accuracy and efficiency.
EnKF's update is shown to be similar to Matheron's method in Gaussian process regression.
problem Data assimilation in high-dimensional systems.
method Empirical Matheron update applied to EnKF.
result Ensemble Kalman Filter's update is equivalent to an empirical Matheron update.
Unified framework for ensemble transport-based smoothing of non-Gaussian time series.
problem Bayesian time series re-analysis with non-Gaussian distributions.
method Measure transport approach to derive consistent prior-to-posterior transformations.
result General ensemble framework for transport-based smoothing of state-space models.
A new method for uncertainty estimation in neural networks using Gaussian-softmax integration.
problem Quantifying uncertainty in neural network predictions.
method Proposes a single-model approach integrating Gaussian distribution with softmax outputs, using mean-field approximation.
result Competitive performance on uncertainty estimation tasks and outperforms many methods on out-of-distribution detection.
Decentralized Gaussian processes for multi-agent systems.
problem Scalable and flexible learning solutions for multi-agent systems.
method Asymptotically exact decentralized solution to Gaussian processes, with online Bayesian model averaging for hyperparameter selection.
result Asymptotically exact decentralized Gaussian process approximation and online Bayesian model averaging.
Quantum Gaussian processes enable scalable quantum learning.
problem Lack of simple, interpretable, scalable learning frameworks for quantum data.
method Bayesian framework using Gaussian processes with quantum kernels.
result Provable and scalable quantum Gaussian processes for quantum learning.
GPR ensemble method predicts stock returns efficiently.
problem Predicting stock returns using machine learning.
method Ensemble Gaussian Process Regression (GPR) for online learning.
result Method outperforms existing models in R-squared and Sharpe ratio. A new method detects outliers using ensembles of Dirichlet process mixtures.
problem Challenges in unsupervised outlier detection using Dirichlet process mixtures.
method Ensembles of Dirichlet process Gaussian mixtures with random subspace and subsampling.
result Empirically outperforms existing approaches in unsupervised outlier detection.
A new ensemble of Gaussian processes improves active learning efficiency.
problem Efficiently labeling data in high-cost domains like medical imaging.
method Adaptive weighted ensemble of Gaussian processes (EGP) for active learning.
result EGP-based approaches outperform single GP-based active learning methods.
Compact Gaussian model approximates deep ensemble predictions.
problem Efficiently approximating deep ensemble models for image prediction.
method Sparse-structured multivariate Gaussian with Cholesky parameterization trained to match pre-trained ensemble outputs.
result Compact representation captures uncertainty and structured correlations explicitly.
Real world systems typically feature a variety of different dependency types and topologies that complicate model selection for probabilistic graphical models. We introduce the ensemble-of-forests model, a generalization of the ensemble-of-trees model. Our model enables structure learning of Markov random fields (MRF) …
Gaussian process regression is a machine learning approach which has been shown its power for estimation of unknown functions. However, Gaussian processes suffer from high computational complexity, as in a basic form they scale cubically with the number of observations. Several approaches based on inducing points were …
New nonlinear smoothers improve state estimation in chaotic systems.
problem Improving state estimation in chaotic dynamical systems with non-Gaussian behavior.
method Developed nonlinear backward ensemble transport smoothers with parameterization and regularization of transport maps.
result Nonlinear smoothers yield lower estimation error than conventional methods for comparable model evaluations.
This work evaluates uncertainty in deep Gaussian processes.
problem Uncertainty quantification in deep Gaussian processes.
method Hierarchical deep Gaussian processes (DGPs) and Deep Sigma Point Processes (DSPPs) evaluated on regression and classification tasks.
result DSPPs provide strong in-distribution calibration but are less robust under distribution shift compared to ensembles.
EnEMF uses Epanechnikov kernel for high-dimensional filtering, improving accuracy and robustness.
problem Suboptimal Gaussian mixture kernel density estimates in high-dimensional settings.
method Ensemble Epanechnikov mixture filter (EnEMF) using optimal Epanechnikov kernel.
result EnEMF reduces error per particle on high-dimensional systems like Lorenz '96.
A new framework for recycling Gaussian process approximations.
problem Efficiently combining multiple Gaussian process approximations.
method Construct variational ensembles using a dictionary of fitted Gaussian processes.
result Framework allows for various tasks and scalability.
We examine a network of learners which address the same classification task but must learn from different data sets. The learners cannot share data but instead share their models. Models are shared only one time so as to preserve the network load. We introduce DELCO (standing for Decentralized Ensemble Learning with CO…
Enhanced ensemble filters use machine learning to improve accuracy in filtering models.
problem Accuracy limitations of traditional ensemble Kalman filters.
method Introduces a measure neural mapping (MNM) to map joint predicted state and observation to updated state estimates.
result Superior root-mean-square-error performance compared to leading methods in filtering models.
We prove that a Gaussian ensemble of smooth random sections of a real vector bundle over compact manifold canonically defines a metric on the bundle together with a connection compatible with it. Additionally, we prove a refined Gauss-Bonnet-Chern theorem stating that if the bundle and the manifold are oriented, then t…
The use of ensembles of neural networks (NNs) for the quantification of predictive uncertainty is widespread. However, the current justification is intuitive rather than analytical. This work proposes one minor modification to the normal ensembling methodology, which we prove allows the ensemble to perform Bayesian inf…
HD algorithm simulates dynamics on random matrix ensembles without generating full matrices.
problem Simulating dynamics on dense random matrix ensembles with high space and time complexity.
method Householder reflectors for adaptive and recursive construction, deferring decisions.
result Significant reductions in runtime and memory footprint for practical T≪n. Tree ensemble kernels improve Bayesian optimization for mixed features and constraints.
problem Optimizing over mixed-feature spaces with known constraints.
method Kernel interpretation of tree ensembles as Gaussian Process prior, compatible optimization formulation for acquisition function, integration of known constraints.
result Framework outperforms state-of-the-art methods for mixed-feature spaces and constraints.
We formulate the unitary rational orbifold conformal field theories in the algebraic quantum field theory framework. Under general conditions, we show that the orbifold of a given unitary rational conformal field theories generates a unitary modular category. Many new unitary modular categories are obtained. We also sh…
Contact group retracts to unitary subgroup.
problem Understanding contact structures on 3-sphere.
method Proving deformation retraction to unitary subgroup.
result Group of contactomorphisms retracts to U(2).
The paper learns compact implicit surface maps from streaming data using an ensemble of sparse Gaussian processes.
problem Creating compact and accurate implicit surface maps from streaming range data.
method An ensemble of sparse Gaussian process experts, incrementally adjusted, trades-off between model complexity and prediction error.
result The approach learns compact and accurate implicit surface models comparable to or better than exact GP regression with subsampled data.
Study finds Calabi-Yau models' operator spectra match random matrix theory.
problem Understanding spectra of Calabi-Yau sigma models.
method Numerical methods for Ricci-flat metrics, averaging over complex structure moduli space.
result Spectrum matches Gaussian orthogonal ensemble of random matrix theory.
New samplers improve MCMC efficiency in high dimensions.
problem Efficient sampling in high-dimensional problems.
method Affine invariant ensemble samplers, including derivative-free and derivative-based HMC.
result Affine invariant ensemble HMC outperforms standard HMC in high dimensions.
Study develops ensemble machine learning framework for predicting groundwater heavy metal pollution.
problem Statistical complexity and spatial heterogeneity of heavy metal contamination in groundwater.
method Nested cross-validated ensemble machine learning with response transformations (raw, log, Gaussian copula).
result Copula-based models with DBSCAN clustering diagnostics provide the most reliable and interpretable assessments of groundwater contamination.
Zeta functions for non-unitary twists are shown to have analytic continuation.
problem Analytic continuation of zeta functions for non-unitary twists.
method Analytic continuation for compact locally-symmetric spaces with non-unitary twists.
result Zeta functions admit analytic continuation as meromorphic functions.
Bayesian deep ensembles improve prediction accuracy in various settings.
problem Improving prediction accuracy of deep ensembles in out-of-distribution settings.
method Introducing a randomised, untrainable function to each ensemble member, enabling a posterior predictive distribution interpretation.
result Bayesian deep ensembles make more conservative predictions and outperform standard ensembles in various tasks.
Recurrent neural networks are powerful models for processing sequential data, but they are generally plagued by vanishing and exploding gradient problems. Unitary recurrent neural networks (uRNNs), which use unitary recurrence matrices, have recently been proposed as a means to avoid these issues. However, in previous …
BI-EqNO improves Bayesian inference with flexible neural operators.
problem Inaccurate estimation of marginal likelihoods in approximate Bayesian methods.
method Equivariant neural operator framework for generalized approximate Bayesian inference.
result BI-EqNO enhances both deterministic and stochastic approaches to Bayesian inference.
Improved neural population modeling using shared features and ensemble detection.
problem Missing shared coding properties in neural latent variable models.
method Feature sharing across tuning curves and soft clustering of neurons.
result More interpretable and better-performing neural population models.
Study on determinants of unitary Brownian motion and their asymptotic laws.
problem Understanding determinants of unitary Brownian motion and their behavior over time.
method Using Stiefel fibration and skew-product decomposition of the Stiefel Brownian motion.
result Prove asymptotic laws for determinants of block entries of unitary Brownian motion.