Develops a new method for functional regression that works with non-Gaussian data.
problem Limited models for regression in function spaces with Gaussian process priors.
method Introduces Neural Operator Flows (OpFlow) for non-Gaussian function spaces.
result OpFlow enables robust and accurate uncertainty quantification for functional regression.
Paper proves convergence rates for Gaussian kernel ridge regression.
problem Understanding convergence rates for Gaussian kernel ridge regression.
method Establishes polynomial convergence rates for KRR with fixed hyperparameters.
result First polynomial convergence rates for Gaussian kernel ridge regression.
Gaussian processes struggle with compositional functions, but deep Gaussian processes can outperform.
problem Gaussian process regression struggles with compositional functions.
method We study information-theoretic lower bounds for posterior contraction rates in Gaussian process regression for a continuous regression model.
result Posterior based on any mean-zero Gaussian process can only recover the truth at a rate strictly slower than the minimax rate for generalized additive functions.
New method for spatiotemporal data regression using Gaussian processes.
problem Regression in spatiotemporal random fields.
method Empirical Bayes approach, tight Gaussian measures, truncation scheme.
result Effective dimension reduction through time-varying angular spectra.
Proposes GPLFR for predicting high-dimensional outputs with few data.
problem Predicting high-dimensional outputs from limited data.
method GPLFR combines Gaussian process and linear-Gaussian decoding for high-dimensional prediction.
result GPLFR outperforms existing methods in predicting high-dimensional outputs.
Develops intrinsic Gaussian process regression for manifold-valued data.
problem Lack of intrinsic Gaussian process methods for manifold-valued response variables.
method Proposes an intrinsic covariance structure and a novel intrinsic Gaussian process regression model.
result Establishes asymptotic properties and shows posterior consistency.
Improves Gaussian process regression without bias.
problem Bias in Gaussian process regression estimates.
method Adaptive computation selection to minimize bias.
result Guaranteed small bias in log marginal likelihood estimates.
This paper speeds up Gaussian process regression for autocorrelated data.
problem Temporal overfitting in Gaussian process models for autocorrelated data.
method Modifying existing Gaussian process approximations to handle blocked, de-correlated data.
result Proposed methods accelerate Gaussian process regression on autocorrelated data without sacrificing performance.
The paper examines how kernel approximations affect Gaussian process regression in large data applications.
problem Effect of kernel approximations on Gaussian process regression in large data applications.
method Unified framework to analyze Gaussian process regression under computational and epistemic misspecification.
result Theoretical analysis of Gaussian process regression under various misspecifications.
Study shows that ridgeless Gaussian kernel regression overfits even with varying bandwidth or dimensionality.
problem Analyzing overfitting in Gaussian kernel ridgeless regression with varying bandwidth or dimensionality.
method Examined the behavior of minimum norm interpolating solutions for fixed and increasing dimensions under varying bandwidth and sample size.
result Ridgeless solutions are never consistent and can be worse than null predictor with large enough noise, even with varying bandwidth or dimensionality.
Enforces physical constraints in GP regression models.
problem Unbounded GP models can produce infeasible values.
method Enforces nonnegativity constraints probabilistically.
result Reduces model variance and enforces physical bounds.
Extends Gaussian Process regression for handling multiple prior distributions.
problem Handling multiple prior distributions in Bayesian Machine Learning models.
method Mixtures of Gaussian Processes with analytical and Sparse Variational approaches.
result Effective in accounting for prior misspecification in functional regression problems.
This study converts BART to Gaussian process regression, revealing its limitations and potential improvements.
problem Understanding the Gaussian process limit of BART and its implications.
method Deriving and computing BART's prior covariance function, implementing the infinite trees limit as GP regression, and tuning hyperparameters.
result The Gaussian process limit of BART is inferior to standard BART but can be made competitive with proper hyperparameter tuning.
Paper introduces robust Gaussian process regression without sacrificing computational efficiency.
problem Violation of independent and identically distributed Gaussian observation noise assumption in Gaussian process regression.
method Proves robust and conjugate Gaussian process regression (RCGP) at no additional cost using generalised Bayesian inference.
result RCGP enables exact conjugate closed form updates in all settings where standard GPs admit them.
Gaussian process regression loses locality in high dimensions, affecting molecular energy surface fitting.
problem Loss of locality in high-dimensional Gaussian process regression.
method Analysis of Matern family kernels and multi-zeta basis functions.
result The property of locality disappears in high dimensions, impacting regression quality.
This study tackles Gaussian process regression with summarized data.
problem Learning and inference with summarized data (summary statistics, counts) in spatial modeling.
method Sample quasi-likelihood approach to Gaussian process regression.
result Approximation performance of the method is influenced by data granularity and covariance function length scale.
GP-ND avoids obstacles in trajectory planning using Gaussian Process regression.
problem Avoiding obstacles in trajectory planning for real-world systems.
method GP-ND models negative data pairs using Gaussian distributions and maximizes their KL divergence from the GP to avoid them.
result GP-ND outperforms traditional GP learning in obstacle-aware trajectory planning.
Paper studies Gaussian approximation in linear regression with rates derived.
problem Gaussian approximation in online linear regression.
method Derives rates for constant learning rate settings, analyzes dependence on d d d and design matrix. result Rate of normal approximation is log n / n \sqrt{\log{n}/n} log n / n for large n n n . We introduce a new regression framework, Gaussian process regression networks (GPRN), which combines the structural properties of Bayesian neural networks with the non-parametric flexibility of Gaussian processes. This model accommodates input dependent signal and noise correlations between multiple response variables,…
Gaussian processes (GP) are a widely used model for regression problems in supervised machine learning. Implementation of GP regression typically requires O ( n 3 ) O(n^3) O ( n 3 ) logic gates. We show that the quantum linear systems algorithm [Harrow et al., Phys. Rev. Lett. 103, 150502 (2009)] can be applied to Gaussian process regre…
New bounds for kernel regression under non-Gaussian noise.
problem Uncertainty quantification for function estimates from noisy observations.
method Novel non-asymptotic probabilistic uniform error bounds for kernel-based regression.
result Proposed bounds apply to a broad class of non-Gaussian noise distributions.
A new Gaussian process regression method infers implicit manifold structure from data.
problem Scaling Gaussian process regression to high-dimensional data.
method Proposes a fully differentiable Gaussian process regression technique that infers implicit manifold structure from data.
result Improves predictive performance and calibration of standard Gaussian process regression in high-dimensional settings.
Bayesian framework for sphere regression using Gaussian fields.
problem Nonparametric regression on the sphere with Gaussian priors.
method Isotropic Gaussian field priors, harmonic structure, exact posterior distributions, optimal spectral truncation, posterior contraction rates.
result Sharp posterior contraction rates for Gaussian priors with polynomially decaying angular power spectra.
A new algorithm splits Gaussian processes for efficient streaming data.
problem Poor scaling of Gaussian processes in streaming data.
method Sequential partitioning of input space and localized Gaussian process fitting.
result The algorithm achieves linear memory complexity and superior time and space complexity.
GP-BART improves BART's predictive performance by incorporating Gaussian process priors.
problem Lack of smoothness and explicit covariance structure in BART.
method GP-BART extends BART with Gaussian process priors for tree predictions.
result GP-BART outperforms traditional models in various applications.
The paper improves Gaussian process regression by optimizing hyperparameters.
problem Hyperparameter tuning for Gaussian process regression models.
method Adaptive sparse variational approximations using variational Bayes.
result Minimax optimal rates of convergence for variational posterior.
New sparse Gaussian process method tackles unconstrained regression problems.
problem Dealing with physical systems that satisfy inequality constraints.
method Extends constrained Gaussian process by redefining hat basis functions.
result Reduces computational complexity from O ( n 3 ) O(n^{3}) O ( n 3 ) to O ( n m 2 ) O(nm^{2}) O ( n m 2 ) . Batch Active Learning uses derivative information for Gaussian Process regression.
problem Efficiently selecting data batches in Gaussian Process regression models.
method Proposes using the predictive covariance matrix to select data batches, exploiting full correlation.
result Demonstrates the effectiveness of incorporating derivative information across diverse applications.
Stochastic gradient descent improves Gaussian process regression.
problem Efficiently solving large linear systems in Gaussian process regression.
method Developed a stochastic dual descent algorithm using insights from optimisation and kernel communities.
result Stochastic gradient descent is highly effective when done right.
Gaussian Process (GP) regression models typically assume that residuals are Gaussian and have the same variance for all observations. However, applications with input-dependent noise (heteroscedastic residuals) frequently arise in practice, as do applications in which the residuals do not have a Gaussian distribution. …
Study improves error bounds for sparse regression with heavy-tailed covariates.
problem Estimating sparse coefficients in linear regression with heavy-tailed covariates.
method Employed an ℓ 1 \ell_1 ℓ 1 -penalized Huber regression method. result Error bound identical to Gaussian case for L L L -subexponential covariates. This research develops an evolutionary approach to discover non-Gaussian stochastic dynamical systems.
problem Discovering explicit governing equations of stochastic dynamical systems with Lévy noise from data.
method ESSR approach using genetic programming, sparse regression, and nonlocal Kramers-Moyal formulas.
result The approach effectively extracts non-Gaussian stochastic dynamical systems from sample path data.
In recent years, correntropy and its applications in machine learning have been drawing continuous attention owing to its merits in dealing with non-Gaussian noise and outliers. However, theoretical understanding of correntropy, especially in the statistical learning context, is still limited. In this study, within the…
Robust learning mixtures of linear regressions improve robustness.
problem Improving robustness in learning mixtures of linear regressions.
method Connecting mixtures of linear regressions and mixtures of Gaussians with thresholding for a quasi-polynomial time algorithm.
result The algorithm has significantly better robustness than previous results.
Active learning improves GP regression on complex, high-dimensional data.
problem Improving Gaussian Process regression in high-dimensional spaces with discontinuous functions.
method Combines manifold learning with active learning to optimize data selection and reduce dimensionality.
result Superior performance over random learning in synthetic data experiments.
Sparse Gaussian process quantile regression tackles computational challenges in Bayesian quantile regression.
problem Nonconjugacy and computational cost in Gaussian process quantile regression.
method Sparse Gaussian process framework with Laplace approximation, adaptive inducing-input placement, and sequential data acquisition.
result Accuracy of Laplace approximation and effectiveness of adaptive mechanisms in reducing predictive uncertainty.
Deep-HGP uses Bayesian nonparametric approach for complex data regression.
problem Complex data regression with compositional structures.
method Deep Gaussian processes with a squared-exponential kernel, data-driven lengthscale parameters.
result Posterior distribution optimally recovers unknown true regression curve in terms of quadratic loss.
New rigorous uncertainty bounds for Gaussian Process regression.
problem Need for frequentist uncertainty bounds in applications like learning-based control.
method Introduce new uncertainty bounds that are rigorous and practically useful.
result New bounds are less conservative and more useful for practical applications.
Sharp risk bounds for early-stopping in Gaussian linear regression are derived.
problem Minimizing in-sample mean squared error in high-dimensional Gaussian linear regression.
method Early-stopped mirror descent (ESMD) with local Gaussian width bounds.
result Sharp risk bounds extend to early-stopped mirror descent for least squares estimator (LSE).
Maximum likelihood estimation fails to be well-posed in Gaussian process regression.
problem Establishing well-posedness of maximum likelihood estimation in Gaussian process regression.
method Analyzing the conditions under which maximum likelihood estimation is not Lipschitz in the data with respect to the Hellinger distance.
result Maximum likelihood estimation is not well-posed in the noiseless data setting for any Gaussian process with a stationary covariance function whose lengthscale parameter is estimated using maximum likelihood.
Dividing local Gaussian processes improve real-time prediction efficiency.
problem Efficient online prediction for large data sets.
method Iterative data-driven division of input space for sublinear computational complexity.
result Sublinear computational complexity in real-time prediction.
Study on linear regression with dependent covariates, proving universality and error characterization.
problem Linear regression with dependent covariates in high-dimensional settings.
method Analysis of ridge regression performance, Gaussian universality theorem, spectral properties of covariance matrices.
result Asymptotic performance of ridge regression is invariant under non-Gaussian covariates with preserved mean and covariance.
Develops a theoretical framework for scalable Gaussian Process regression methods.
problem Limited scalability of Gaussian Process regression for large datasets.
method Introduces and analyzes Nearest Neighbour Gaussian Process (NNGP) and scalable GPnn methods.
result Derives almost sure pointwise limits for predictive criteria and proves risk minimax rates.
The paper analyzes uncertainty quantification in sparse Gaussian process regression with a Brownian motion prior.
problem Analyzing uncertainty in sparse Gaussian process regression with a Brownian motion prior.
method Theoretical guarantees and limitations for pointwise credible sets are derived for a rescaled Brownian motion prior with a sparse variational Gaussian process method.
result Theoretical characterization of asymptotic frequentist coverage for credible sets, distinguishing conservative and overconfident cases.
Researchers use Gaussian Process Regression to improve accuracy of a low-cost hot-wire anemometer.
problem Improving accuracy of low-cost hot-wire anemometers in varying temperatures.
method Probabilistic calibration using Gaussian Process Regression.
result The method provides good performance in estimating actual wind speeds, including uncertainty.
Gaussian process regression helps approximate Bayesian inverse problems efficiently.
problem Computational intractability of Bayesian posterior distributions in inverse problems.
method Gaussian process regression to build a surrogate model for the likelihood.
result Error between true and approximate posterior can be bounded by weighted L 2 L^2 L 2 -norm error between true and approximate likelihood. Survey of Gaussian process constraints for modeling expensive data.
problem Modeling expensive data with physical constraints.
method Overview of various Gaussian process constraints and their implementation.
result Discussion of computational challenges introduced by constraints.
A new multi-task learning estimator improves Gaussian graphical regression model fitting.
problem High error rate in fitting Gaussian graphical regression models due to separate node-wise lasso regressions.
method Proposes a multi-task learning estimator with cross-task group sparsity and within-task element-wise sparsity penalties, solved via an efficient augmented Lagrangian algorithm.
result Error rate improvement over separate node-wise lasso estimates, demonstrated through simulations and application to gene co-expression network study.