Optimizes black-box functions with varying costs across multiple sources.
problem Optimizing black-box functions with varying costs across multiple sources.
method Uses Augmented Gaussian Process and Gaussian Process to model fidelity and location-dependent costs, respectively. Uses Confidence Bound acquisition function to select sources and locations.
result The approach significantly outperforms existing methods on Hyperparameters Optimization tasks.
ELU algorithm improves on EM for over-specified Gaussian mixtures.
problem Slow convergence of EM in over-specified Gaussian mixtures.
method Developed ELU algorithm for two-component mixtures, combining exponential location update and gradient descent.
result ELU converges to final statistical radius after logarithmic iterations, resolving open question.
Exact 1-Wasserstein distance between location-scale distributions derived, with privacy effects studied.
problem Calculating the 1-Wasserstein distance between location-scale distributions and its impact on differential privacy.
method Exact expressions and special functions for 1-Wasserstein distance, new upper bounds, and asymptotic analysis.
result New linear upper bound and detailed asymptotic bounds for Gaussian case, effect of differential privacy studied.
Proposes a privacy framework for location traces under conditional priors.
problem Challenges in protecting privacy for location-based services with multiple points.
method Rényi differential privacy framework for conditionally dependent data.
result Achieves privacy within a fixed radius for every user location in a trace.
Estimates Gaussian location model with ridge regularization, comparing variational and spectral methods.
problem Estimating parameters in Gaussian location model with regularization.
method Ridge-regularized log-density-ratio estimation, variational and spectral approaches.
result Regularized variational estimator has lower risk with many observations, spectral estimator with fewer observations.
Study uniform rates for estimating Gaussian mixtures without separation assumption.
problem Estimating parameters in two-component Gaussian mixtures without separation.
method Uniform convergence rates derived using minimax lower bounds and careful analysis of polynomial equalities.
result Phase transition in optimal estimation rate based on mixture balance.
Spatially-aware model improves earthquake hazard assessment accuracy.
problem Misrepresentation of seismic effects across diverse landscapes.
method Causal Bayesian network with Gaussian Processes and normalizing flows.
result Achieves up to 35.2% AUC improvement over existing methods.
Correntropy is a local similarity measure defined in kernel space and the maximum correntropy criterion (MCC) has been successfully applied in many areas of signal processing and machine learning in recent years. The kernel function in correntropy is usually restricted to the Gaussian function with center located at ze…
The paper finds non-Gaussian directions in high-dimensional data using Wasserstein distance.
problem Locating interesting non-Gaussian features in high-dimensional data.
method Projection pursuit using 2-Wasserstein distance to maximize the difference from Gaussian.
result Statistical guarantees for accurately approximating an unknown low-dimensional non-Gaussian subspace.
Adaptive selection of IPs improves online GP performance.
problem Efficiently training GPs in streaming data.
method Adaptive selection of inducing points (IPs) based on GP properties and data structure.
result Adaptive IPs enhance online GP performance.
Simplified DGPs training by fixing inducing inputs to subset of data.
problem Challenging training of deep Gaussian processes.
method Fixed subset of data for inducing inputs, variational sampling.
result Significant reduction in trainable parameters and computation cost without performance degradation.
Bayesian approach improves performance in Gaussian process models.
problem Scalable posterior estimation in Gaussian process models.
method Revisiting variational inference techniques with Bayesian treatment of inducing variables and hyper-parameters.
result State-of-the-art performance demonstrated across various regression and classification problems.
Active learning reduces SP calculations by 90%.
problem Efficiently calculating saddle points in energy functions.
method Active learning framework with GPR and GAD.
result Significant reduction in the number of expensive evaluations.
Dirichlet processes (DP) are widely applied in Bayesian nonparametric modeling. However, in their basic form they do not directly integrate dependency information among data arising from space and time. In this paper, we propose location dependent Dirichlet processes (LDDP) which incorporate nonparametric Gaussian proc…
This paper addresses the problem of active learning of a multi-output Gaussian process (MOGP) model representing multiple types of coexisting correlated environmental phenomena. In contrast to existing works, our active learning problem involves selecting not just the most informative sampling locations to be observed …
Improved Gaussian process inference for spatio-temporal data.
problem Cubic computational costs in Gaussian process inference, especially in spatio-temporal settings.
method Proposes the Vanilla-SPDE Exchange, leveraging an equivalence between standard and SPDE formulations to achieve improved computational cost.
result Demonstrates improved computational efficiency through complexity analysis and numerical experiments.
Study uses GPLFM to create Digital Twin for ferry quay health monitoring.
problem Deterioration of ferry quays due to harsh maritime environments and impacts.
method Gaussian Process Latent Force Model (GPLFM) integrating physics-based model and machine learning.
result GPLFM provides accurate acceleration response estimates, even under simplifying assumptions.
Bayesian Gaussian process models handle uncertain data locations in PDE approximations.
problem Handling uncertainties in data locations for PDE approximations.
method Bayesian inference of uncertain inputs integrated into Gaussian process predictions.
result Substantial reduction in predictive uncertainties achieved through Bayesian inference.
Sparse Gaussian Processes improve scalability by learning inducing points from data.
problem Scaling issues in Gaussian Processes due to cubic computational cost.
method Amortized learning of inducing points and variational posterior parameters using neural networks.
result Significant reduction in the number of inducing points, improving scalability.
A new TwinGP framework for efficient large-scale GP modeling.
problem Efficiently modeling large-scale Gaussian processes with computational constraints.
method Combines global and local approximations using a subset-of-data approach.
result TwinGP framework performs on par or better than state-of-the-art methods at a fraction of the computational cost.
Gaussian processes (GPs) are commonplace in spatial statistics. Although many non-stationary models have been developed, there is arguably a lack of flexibility compared to equipping each location with its own parameters. However, the latter suffers from intractable computation and can lead to overfitting. Taking the i…
New algorithm for fitting Gaussian mixtures using Wasserstein-Fisher-Rao geometry.
problem Hard problem of fitting Gaussian mixture models to data computationally.
method Gradient descent over Wasserstein-Fisher-Rao geometry for probability measures.
result Established convergence guarantees for the proposed algorithm.
New GP model estimates piecewise continuous functions.
problem Piecewise continuous regression functions in scientific and engineering applications.
method Local Gaussian process model with partitioned local data and joint estimation of boundaries.
result Superior performance over conventional GP models in estimating piecewise regression functions.
The chapter compares Gaussian process models for stochastic simulators with varying noise.
problem Modeling stochastic simulators with varying noise.
method Various Gaussian process models are compared, including input varying noise variance, non-Gaussian noise, and quantile modeling.
result Sequential design procedures are adapted for these models.
Gaussian processes have been successful in both supervised and unsupervised machine learning tasks, but their computational complexity has constrained practical applications. We introduce a new approximation for large-scale Gaussian processes, the Gaussian Process Random Field (GPRF), in which local GPs are coupled via…
We tackle the problem of estimating a location parameter with differential privacy guarantees and sub-Gaussian deviations. Recent work in statistics has focused on the study of estimators that achieve sub-Gaussian type deviations even for heavy tailed data. We revisit some of these estimators through the lens of differ…
We study the Nonparametric Maximum Likelihood Estimator (NPMLE) for estimating Gaussian location mixture densities in d-dimensions from independent observations. Unlike usual likelihood-based methods for fitting mixtures, NPMLEs are based on convex optimization. We prove finite sample results on the Hellinger accurac…
This work studies the location estimation problem for a mixture of two rotation invariant log-concave densities. We demonstrate that Least Squares EM, a variant of the EM algorithm, converges to the true location parameter from a randomly initialized point. We establish the explicit convergence rates and sample complex…
Many expensive black-box optimisation problems are sensitive to their inputs. In these problems it makes more sense to locate a region of good designs, than a single-possibly fragile-optimal design. Expensive black-box functions can be optimised effectively with Bayesian optimisation, where a Gaussian process is a popu…
Paper proposes a new method for efficient Pareto Front modeling.
problem Efficient modeling of Pareto Front (PF) in decision making problems.
method Projection based active Gaussian process regression (P-aGPR) method.
result The proposed method can provide a generative PF model and examine new points efficiently.
Iterative methods for fitting a Gaussian Random Field (GRF) model via maximum likelihood (ML) estimation requires solving a nonconvex optimization problem. The problem is aggravated for anisotropic GRFs where the number of covariance function parameters increases with the dimension. Even evaluation of the likelihood fu…
The paper optimizes estimating high-dimensional Gaussian mixtures without separation conditions.
problem Estimating the mixing distribution in high-dimensional Gaussian mixtures without separation conditions.
method The method of moments and careful application of moment tensors.
result The minimax rate of estimating the mixing distribution in Wasserstein distance is Θ((d/n)1/4+n−1/(4k−2)). Bayesian method suppresses low-frequency pulses in audio recordings.
problem Suppressing long pulses caused by mechanical defects in audio recordings.
method Bayesian approach using Gaussian Process for pulse location, signal interpolation, and tail estimation.
result Perceptual results similar to previous methods, performs well on naturally degraded signals.
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.
New method provides valid confidence intervals for spatial associations.
problem Limited insight into covariate-response relationships in spatial settings.
method Lipschitz-driven uncertainty quantification for spatial association.
result Valid frequentist confidence intervals for associations in spatial settings.
A new method for spotting symbols in CAD images reduces annotation costs and improves accuracy.
problem Challenging task of labeling symbols from CAD drawings.
method Pixel-wise point location via Progressive Gaussian Kernels (PGK) and local offset.
result The proposed method achieves good generalization on real-world CAD images.
This paper studies identifiability and convergence behaviors for parameters of multiple types in finite mixtures, and the effects of model fitting with extra mixing components. First, we present a general theory for strong identifiability, which extends from the previous work of Nguyen [2013] and Chen [1995] to address…
Bayesian optimisation (BO) has been a successful approach to optimise functions which are expensive to evaluate and whose observations are noisy. Classical BO algorithms, however, do not account for errors about the location where observations are taken, which is a common issue in problems with physical components. In …
Modeling spatial extremes with non-Gaussian fields using SAR models and CNNs.
problem Challenges in modeling spatial data with heavy-tailed distributions and missing cells.
method Spatial autoregressive models with Generalized Extreme Value innovations, combined with CNN for fast parameter estimation.
result Effective modeling of spatial extremes in non-Gaussian fields, demonstrated on precipitation data.
A-BLINK speeds up Gaussian process covariance estimation.
problem Slow covariance matrix inversion in Gaussian processes.
method Two pre-trained neural networks learn Kriging weights and spatial variance.
result Significant computational speedups and posterior inference.
In this paper we propose a new method to predict the final destination of vehicle trips based on their initial partial trajectories. We first review how we obtained clustering of trajectories that describes user behaviour. Then, we explain how we model main traffic flow patterns by a mixture of 2d Gaussian distribution…
This paper develops mfEGRA, a multifidelity active learning method using data-driven adaptively refined surrogates for failure boundary location in reliability analysis. This work addresses the issue of prohibitive cost of reliability analysis using Monte Carlo sampling for expensive-to-evaluate high-fidelity models by…
DeepICMGP surrogate models multiple outputs efficiently.
problem Challenges in modeling dependencies between multiple outputs using traditional multi-output GPs.
method Introduces hierarchical coregionalization structures across layers in DGPs.
result Demonstrates competitive performance and active learning strategies.
As a novel similarity measure that is defined as the expectation of a kernel function between two random variables, correntropy has been successfully applied in robust machine learning and signal processing to combat large outliers. The kernel function in correntropy is usually a zero-mean Gaussian kernel. In a recent …
The paper develops adaptive confidence intervals for Efron's Gaussian two-groups model with unknown contamination.
problem Developing robust uncertainty quantification for Efron's Gaussian two-groups model with unknown contamination fraction.
method The approach involves Fourier-based certification procedures to find minimax-optimal adaptive confidence intervals.
result The minimax-optimal length of adaptive confidence intervals is polynomially worse than when contamination fraction is known.
A new algorithm detects changes in data with constant cost per iteration.
problem Detecting changes in data with low computational cost.
method Adapting pruning and maximisation techniques from Gaussian data to exponential family models.
result The algorithm can detect changes in a wide range of models with a constant per-iteration cost.
Reconstruction of a function from noisy data is often formulated as a regularized optimization problem over an infinite-dimensional reproducing kernel Hilbert space (RKHS). The solution describes the observed data and has a small RKHS norm. When the data fit is measured using a quadratic loss, this estimator has a know…
Sparse pseudo-point approximations for Gaussian process (GP) models provide a suite of methods that support deployment of GPs in the large data regime and enable analytic intractabilities to be sidestepped. However, the field lacks a principled method to handle streaming data in which both the posterior distribution ov…