Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

2875738601,146 · Jun 202019922001200920172026
48 results for Gaussian process optimization

Optimizes Gaussian process hyperparameters using Bayesian autoregression.

problem Optimizing hyperparameters for Matérn kernel temporal Gaussian processes.
method Recursive Bayesian estimation for autoregressive parameters.
result Outperforms traditional optimization methods in runtime and accuracy.

New method optimizes processes under constraints using bivariate Gaussian models.

problem Optimizing processes with constraints using traditional methods.
method Developed a constrained expected improvement acquisition function using bivariate Gaussian process models.
result Demonstrated improved performance in a manufacturing cure process optimization.

Bayesian Optimization using Gaussian Processes is a popular approach to deal with the optimization of expensive black-box functions. However, because of the a priori on the stationarity of the covariance matrix of classic Gaussian Processes, this method may not be adapted for non-stationary functions involved in the op…

2019-05-07abs ↗pdf ↗

Gaussian process priors are commonly used in aerospace design for performing Bayesian optimization. Nonetheless, Gaussian processes suffer two significant drawbacks: outliers are a priori assumed unlikely, and the posterior variance conditioned on observed data depends only on the locations of those data, not the assoc…

2018-01-18abs ↗pdf ↗

New method for global optimization of Gaussian processes reduces computational time.

problem Nonconvex optimization problems with Gaussian processes trained on few data points.
method Reduced-space formulation with branch-and-bound solver and McCormick relaxations.
result Significantly reduced computational time compared to state-of-the-art methods.

A new method reduces energy consumption in machine learning by using multiple, less costly data sources.

problem High computational and energy costs in machine learning model training.
method Augmented Gaussian Process (AGP-MISO) with multi-source optimization.
result The AGP-MISO method reduces computational time and energy consumption compared to traditional approaches.

New algorithms use Gaussian processes to optimize stopping times in financial markets.

problem Optimizing stopping times in financial time series with specific applications.
method Gaussian and Deep Gaussian Process models to analytically evaluate optimal stopping value functions and policies.
result Proposed algorithms outperform benchmarks on various financial time series datasets.

The study optimizes wind farm yaw control using Gaussian process regression and high-fidelity simulations.

problem Improving yaw control inputs for maximum power production in wind farms.
method Gaussian process regression and modifier adaptation scheme based on high-fidelity simulation data.
result Both modifier adaptation and Bayesian optimization improve power production with smaller yaw misalignments.

Paper improves regret bounds for Gaussian process upper confidence bound in Bayesian optimization.

problem Minimizing regret in Gaussian process bandit optimization.
method Gaussian process upper confidence bound (GP-UCB) algorithm with refined analysis.
result Achieves O(Tln2T)O(\sqrt{T \ln^2 T}) cumulative regret under squared exponential kernel.

Enhanced Gaussian process models accelerate optimization and posterior approximation.

problem Improving the accuracy and speed of Gaussian process models for optimization and inference.
method Introduces a random exploration step to classical GP-UCB algorithms, facilitating faster convergence.
result New algorithms achieve nearly optimal convergence rates and provide bounds for Hellinger distance.

This paper optimizes Bayesian acquisition functions in Gaussian Processes for better optimization.

problem Improving the efficiency of Bayesian optimization methods.
method Analysis of different acquisition functions and optimizers for optimizing Bayesian acquisition functions.
result Optimization of acquisition functions leads to faster and more accurate sampling points.

Optical scatterometry is a method to measure the size and shape of periodic micro- or nanostructures on surfaces. For this purpose the geometry parameters of the structures are obtained by reproducing experimental measurement results through numerical simulations. We compare the performance of Bayesian optimization to …

2019-03-28abs ↗pdf ↗

Improves Bayesian optimization using Gaussian process Thompson sampling.

problem Global optimization of Gaussian process posterior samples.
method Carefully selects starting points for gradient-based multi-start optimizers, identifies all local optima via univariate global rootfinding, and optimizes the posterior sample.
result Dramatic improvements in overall performance of Bayesian optimization.

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.

Deep Gaussian Processes improve likelihood-free inference for complex distributions.

problem Limited flexibility of Bayesian Optimization with GPs for multimodal distributions.
method Proposes Deep Gaussian Processes (DGPs) as a surrogate model for likelihood-free inference.
result DGPs outperform GPs on multimodal distributions while maintaining comparable performance on unimodal cases.

A new method uses Gaussian Processes to solve power flow problems with uncertain renewable and load inputs.

problem Solving power flow problems with uncertain renewable and load inputs.
method Non-parametric Bayesian inference-based uncertainty propagation using Gaussian Processes.
result The method provides reasonably accurate solutions with fewer samples and time compared to Monte-Carlo simulations.

In the last five years, the financial industry has been impacted by the emergence of digitalization and machine learning. In this article, we explore two methods that have undergone rapid development in recent years: Gaussian processes and Bayesian optimization. Gaussian processes can be seen as a generalization of Gau…

2019-03-12abs ↗pdf ↗

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.

Efficiently searches through Gaussian process kernels using symbolic representation and Bayesian optimization.

problem Manual selection of kernels in Gaussian processes is complex and computationally expensive.
method Proposes a novel method using symbolic representation and Bayesian optimization to search through a structured kernel space.
result Empirically shows a computationally more efficient way of searching through a discrete kernel space.

GP CC-OPF solves uncertain power grid optimization with Gaussian Process.

problem Uncertainty in power grid operations due to high renewables integration.
method Data-driven Gaussian Process regression for solving non-convex CC-OPF problem.
result Effective economic dispatch optimization in uncertain power grids.

Paper proposes no-regret algorithms for private GP bandit optimization.

problem Private Gaussian process bandit optimization.
method Combines uniform kernel approximator with random perturbations for differentially private GP bandit algorithms.
result Provable no-regret algorithms for stationary kernel functions in two DP settings.

Proposes a more efficient knot selection method for sparse Gaussian processes.

problem Optimizing marginal likelihood for knot selection leads to suboptimal and inefficient placement of knots.
method Uses Bayesian optimization to propose knots one at a time, avoiding multimodal surface issues.
result Improves both accuracy and speed of knot selection compared to current methods.

Ada-BKB optimizes black-box functions on continuous domains with adaptive discretization.

problem Optimizing functions with continuous domains using Gaussian process optimization.
method Adaptive discretization of the function domain to avoid non-convex optimization costs.
result Ada-BKB algorithm runs in O(T2dexteff2)O(T^2 d_ ext{eff}^2), significantly faster than existing methods.

A new algorithm uses concavity in Gaussian processes to optimize decisions in bandit problems.

problem Optimizing decisions in sequential problems with context-dependent rewards.
method Proposes a UCB algorithm using a shape-constrained reward function estimator based on a Gaussian Process model with concavity constraints.
result Derives regret bounds for the proposed UCB algorithm.

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.

A new GP interpolation method for better predictive distributions in ranges of interest.

problem Improving predictive distributions in specific ranges of interest.
method Relaxed Gaussian process interpolation, relaxing interpolation constraints outside ranges of interest.
result Better predictive distributions in ranges of interest, especially in non-stationary cases.

This paper simplifies MTGP derivations for Gaussian processes.

problem Understanding the derivations of Multi-task Gaussian Process formulations and their gradients.
method Friendly derivations of Multi-task Gaussian Process formulations and their gradients.
result Simplified derivations of Multi-task Gaussian Process formulations and gradients.

Bayesian optimization is a class of global optimization techniques. In Bayesian optimization, the underlying objective function is modeled as a realization of a Gaussian process. Although the Gaussian process assumption implies a random distribution of the Bayesian optimization outputs, quantification of this uncertain…

2020-02-04abs ↗pdf ↗

A new method for efficient Gaussian process inference using sparse approximations.

problem Scalable and accurate inference for latent Gaussian processes.
method Variational approximation with sparse inverse Cholesky factors and double Kullback-Leibler minimization.
result The proposed method can achieve highly accurate approximations with polylogarithmic time complexity.

RAMBO optimizes multi-regime problems by discovering and modeling distinct energy basins.

problem Multi-regime problems in molecular conformation and drug discovery.
method Dirichlet Process Mixture of Gaussian Processes with adaptive hyperparameters and concentration parameters.
result Consistent improvements over state-of-the-art on multi-regime objectives.

Combines VI and EP for better Gaussian process hyperparameter learning.

problem Improving hyperparameter learning in Gaussian processes for better performance.
method Hybrid training procedure combining Variational Inference (VI) for posterior inference and Expectation Propagation (EP) for hyperparameter learning.
result The hybrid training procedure provides a better learning objective and generalizes better than using only VI or EP.

A new kernel for probability measures based on optimal transport.

problem Efficiently comparing and modeling distributions.
method Kernel over probability measures using regularized optimal transport and Hilbertian embedding.
result The proposed kernel enables Gaussian process modeling on distributions with theoretical and computational advantages.

A method for predicting signals on graphs using Gaussian processes and optimal transport.

problem Predicting signals on complex, graph-based inputs with uncertainty quantification.
method Combining regularized optimal transport, dimension reduction, and Gaussian processes indexed by graphs.
result Efficient prediction of signals on graphs with confidence intervals.