Related papers: Inference for possibly high-dimensional inhomogene…

This work considers parameter estimation for Gaussian process interpolation with a periodized version of the Mat{\'e}rn covariance function introduced by Stein. Convergence rates are studied for the joint maximum likelihood estimation of…

Gaussian processes (GPs) defined through intrinsic random fields provide a flexible framework for modeling spatial phenomena, and have been advocated in a variety of applications over the past several decades. Nevertheless, their adoption…

We present a vine copula based composite likelihood approach to model spatial dependencies, which allows to perform prediction at arbitrary locations. This approach combines established methods to model (spatial) dependencies. On the one…

Determinantal point processes (DPPs) have attracted substantial attention as an elegant probabilistic model that captures the balance between quality and diversity within sets. DPPs are conventionally parameterized by a positive…

The goal of this presentation is to build an efficient non-parametric Bayes classifier in the presence of large numbers of predictors. When analyzing such data, parametric models are often too inflexible while non-parametric procedures tend…

This paper proposes a new estimation technique for fitting parametric Gibbs point process models to a spatial point pattern dataset. The technique is a counterpart, for spatial point processes, of the variational estimators for Markov…

Plausible identification of conditional average treatment effects (CATEs) may rely on controlling for a large number of variables to account for confounding factors. In these high-dimensional settings, estimation of the CATE requires…

We develop a scalable class of models for latent variable estimation using composite Gaussian processes, with a focus on derivative Gaussian processes. We jointly model multiple data sources as outputs to improve the accuracy of latent…

Gaussian processes (GPs) enable principled computation of model uncertainty, making them attractive for safety-critical applications. Such scenarios demand that GP decisions are not only accurate, but also robust to perturbations. In this…

Gaussian processes provide a flexible framework for spatial prediction, but their computational cost limits applicability to large-scale data with large sample size $n$. Predictive processes (PPs), a popular low-rank approximation, mitigate…

Point pattern data often exhibit features such as abrupt changes, hotspots and spatially varying dependence in local intensity. Under a Poisson process framework, these correspond to discontinuities and nonstationarity in the underlying…

Large-scale saddle-point problems arise in such machine learning tasks as GANs and linear models with affine constraints. In this paper, we study distributed saddle-point problems (SPP) with strongly-convex-strongly-concave smooth…

We investigate high-dimensional nonconvex penalized regression, where the number of covariates may grow at an exponential rate. Although recent asymptotic theory established that there exists a local minimum possessing the oracle property…

This work lies at the intersection of Gibbs models and hyperuniform point processes. Classical Gibbs models, whether defined on lattices or in continuous space, provide flexible tools to describe interacting particle systems but are…

A fundamental process for any given chaotic flow is the deterministic point process (DPP) generated by any chaotic trajectory of the flow repeatedly crossing a canonical surface-of-section (herein referred to as a sigma-type DPP). This…

We propose a novel diverse feature selection method based on determinantal point processes (DPPs). Our model enables one to flexibly define diversity based on the covariance of features (similar to orthogonal matching pursuit) or…

We study computational aspects of repulsive Gibbs point processes, which are probabilistic models of interacting particles in a finite-volume region of space. We introduce an approach for reducing a Gibbs point process to the hard-core…

We present an optimization algorithm that can identify a global minimum of a potentially nonconvex smooth function with high probability, assuming the Gibbs measure of the potential satisfies a logarithmic Sobolev inequality. Our…

In this paper we consider the computation of approximate solutions for inverse problems in Hilbert spaces. In order to capture the special feature of solutions, non-smooth convex functions are introduced as penalty terms. By exploiting the…

Estimating causal effects in quasi-experiments with spatio-temporal panel data often requires adjusting for unmeasured confounding that varies across space and time. Gaussian Processes (GPs) offer a flexible, nonparametric modeling approach…