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,657 papers · 148 categories

Trend · papers per month

151303454605 · Jun 202019922001200920172026
48 results for Bayesian Hilbert Space

This paper introduces Bayes Hilbert spaces for efficient posterior approximation.

problem Efficient posterior approximation in Bayesian models for large datasets.
method Develops Bayes Hilbert spaces for posterior approximation and connects them to Bayesian coresets and kernel-based distances.
result Bayes Hilbert spaces provide a novel framework for posterior approximation that is computationally efficient.

FHBI enhances generalization in Bayesian inference with iterative steps in functional spaces.

problem Improving generalization in Bayesian inference models.
method Iterative two-step procedure with adversarial and functional descent steps in a reproducing kernel Hilbert space.
result FHBI consistently outperforms nine baseline methods on the VTAB-1K benchmark.

The article analyzes LCE in Hilbert space, deriving new formulas and regularisation methods.

problem Analyzing conditional expectation in infinite-dimensional Hilbert space.
method Establishing analytical properties and regularisation for LCE in Hilbert space, deriving new formulas.
result Simple derivation and intuitive justification of conditional mean embedding formula.

Kernel-based Bayesian filter for nonlinear systems using infinite-dimensional operators.

problem Modeling and predicting nonlinear dynamical systems.
method Functional Bayesian perspective, reproducing kernel Hilbert space, Gaussian kernel.
result Effective approximation and accurate results for nonlinear systems.

Bayesian nonparametric models get better posterior estimates via SPDE methods.

problem Estimating posterior distributions in nonparametric Bayesian models.
method Extending diffusion methods to SPDEs on Hilbert spaces for posterior contraction and Laplace approximation.
result Derivation of posterior contraction rates and finite-sample Bernstein von Mises results.

New variational inference approach using Hilbert space for robotic state estimation.

problem Robotic state estimation with high-dimensional data.
method Variational inference reformulated in a Bayesian Hilbert space, using iterative projection.
result Variational inference can be seen as iterative projection in Euclidean space.

The paper revisits and improves on a Bayesian relevance vector machine method for small sample sizes.

problem Statistical modeling with small sample sizes relative to the number of covariates.
method Introduces a new class of global-local priors and provides theoretical properties.
result Results on posterior consistency and contraction rates are provided.

Quantum Graphical Models (QGMs) generalize classical graphical models by adopting the formalism for reasoning about uncertainty from quantum mechanics. Unlike classical graphical models, QGMs represent uncertainty with density matrices in complex Hilbert spaces. Hilbert space embeddings (HSEs) also generalize Bayesian …

2018-10-29abs ↗pdf ↗

Unified analysis for nonlinear parametric models in Bayesian optimization.

problem Limited theoretical guarantees for nonlinear parametric models in Bayesian optimization.
method Kernel-based framework for analyzing regularized nonlinear parametric models trained on adaptively collected data.
result Unified convergence guarantees for nonlinear acquisition and surrogate models.

The paper studies estimating the normalizing constant using queries to a black-box function in RKHS.

problem Estimating the normalizing constant of a function in a reproducing kernel Hilbert space.
method Combines Bayesian quadrature and Bayesian optimization approaches, considering different levels of difficulty based on the parameter λ.
result The difficulty of estimating the normalizing constant varies between Bayesian quadrature and Bayesian optimization, even with noisy function evaluations.

BayesIMP combines multiple causal graphs to estimate average treatment effects with uncertainty.

problem Uncertainty quantification in causal inference from multiple datasets.
method Bayesian Interventional Mean Processes (BayesIMP) integrating probabilistic integration and kernel mean embeddings.
result Improvements in average treatment effect estimation over state-of-the-art methods.

Improves DRO with Bayesian Ambiguity Sets for model misspecification.

problem Overly conservative decisions due to misspecified models in DRO.
method Introduces DRO-RoBAS with robust posterior predictive distribution.
result Outperforms other Bayesian and empirical DRO approaches in out-of-sample performance.

Random exploration optimizes Bayesian optimization with optimal error rates and computational efficiency.

problem Optimizing Gaussian Process models in Bayesian optimization.
method Random sampling from a distribution in an infinite dimensional Hilbert space, with domain shrinking and order-optimal regret guarantees.
result Achieves optimal error rates and computational efficiency in both noise-free and noisy settings.

The paper improves error bounds for Bayesian quadrature in noisy settings.

problem Improving error bounds for Bayesian quadrature in noisy settings.
method Develops a two-step meta-algorithm to relate average-case quadrature error to L2L^2-function approximation error.
result Provides new average-case results for various kernels and noise settings.

fCBO optimizes interventions in causal graphs using Gaussian processes.

problem Optimizing interventions in known causal graphs.
method Functional causal Bayesian optimization (fCBO) using Gaussian processes and expected improvement acquisition.
result Functional interventions can lead to better target effects and optimal conditional effects.

This paper proposes a Hilbert space embedding for Dirichlet Process mixture models via a stick-breaking construction of Sethuraman. Although Bayesian nonparametrics offers a powerful approach to construct a prior that avoids the need to specify the model size/complexity explicitly, an exact inference is often intractab…

2012-10-16abs ↗pdf ↗

The automation of posterior inference in Bayesian data analysis has enabled experts and nonexperts alike to use more sophisticated models, engage in faster exploratory modeling and analysis, and ensure experimental reproducibility. However, standard automated posterior inference algorithms are not tractable at the scal…

2017-10-13abs ↗pdf ↗

Bayesian optimization algorithm reduces regret with efficient region pruning.

problem Sequential optimization of unknown functions in high-dimensional spaces.
method Gaussian process-based, domain shrinking through tree-based region pruning.
result Order-optimal regret performance with reduced computational complexity.

DeltaBO accelerates Bayesian optimization with theoretical guarantees.

problem Improving Bayesian optimization performance through knowledge transfer.
method DeltaBO algorithm that transfers knowledge from related source tasks to target tasks using the difference function.
result DeltaBO achieves a regret bound of O~(T(T/N+γδ))\widetilde{O}(\sqrt{T (T/N + γ_δ)}), significantly better than existing methods.

Modeling functional data, this study uncovers the size-and-shape of functions under noisy observations.

problem Uncertainty in recovering a fixed effect function from noisy observations.
method Bayesian functional mixed model with priors on unitary transformations.
result It is possible to recover the size-and-shape of a square-integrable function μμ.

A new method improves inference for complex Bayesian models.

problem Bayesian inference for doubly intractable distributions is computationally challenging.
method Monte Carlo Stein variational gradient descent (MC-SVGD) approach.
result The method achieves substantial computational gains over existing algorithms.

CEI achieves convergence rates for constrained Bayesian optimization.

problem Constrained Bayesian optimization with theoretical convergence rates.
method Analyzing simple regret upper bound for CEI in RKHS and Gaussian process settings.
result CEI achieves convergence rates of t12logd+12(t)t^{-\frac{1}{2}}\log^{\frac{d+1}{2}}(t) and tν2ν+dlogν2ν+d(t)t^{\frac{-ν}{2ν+d}} \log^{\fracν{2ν+d}}(t) for squared exponential and Matérn kernels, respectively.

We propose a vector-valued regression problem whose solution is equivalent to the reproducing kernel Hilbert space (RKHS) embedding of the Bayesian posterior distribution. This equivalence provides a new understanding of kernel Bayesian inference. Moreover, the optimization problem induces a new regularization for the …

2016-07-07abs ↗pdf ↗

Bayesian deconditioning improves downscaling of spatial fields.

problem Challenges in refining low-resolution spatial fields with high-resolution information.
method Proposes a Bayesian formulation of deconditioning to solve the inverse problem of conditional expectation.
result Shows substantial improvements in atmospheric field downscaling over existing methods.

Study optimizes learning rates for conditional mean embedding estimates.

problem Consistency of kernel ridge regression for conditional mean embedding.
method Adaptive statistical learning rate derived for misspecified setting.
result Upper bound matches optimal O(logn/n)O(\log n / n) rates without assuming finite dimensionality.

Kernel Bayes' rule has been proposed as a nonparametric kernel-based method to realize Bayesian inference in reproducing kernel Hilbert spaces. However, we demonstrate both theoretically and experimentally that the prediction result by kernel Bayes' rule is in some cases unnatural. We consider that this phenomenon is i…

2015-07-04abs ↗pdf ↗

We extend the herding algorithm to continuous spaces by using the kernel trick. The resulting "kernel herding" algorithm is an infinite memory deterministic process that learns to approximate a PDF with a collection of samples. We show that kernel herding decreases the error of expectations of functions in the Hilbert …

2012-03-15abs ↗pdf ↗

Paper tackles infinite-dimensional optimization and Bayesian learning for stochastic differential equations.

problem Learning the drift function of stochastic differential equations with uncertainty quantification.
method Combines infinite-dimensional optimization results with Bayesian hierarchical framework, incorporating shrinkage priors for sparse learning.
result Systematic approach for accurate learning of stochastic differential equations with uncertainty quantification.

Study geometry of tetrahedra in complex hyperbolic space and Hilbert spaces.

problem Understanding geometric relationships between complex hyperbolic spaces and Hilbert spaces.
method Use a complex analog of the cosine of a vertex angle as a novel technical tool.
result Describe possible triangular faces of tetrahedra in hyperbolic space and three-dimensional subspaces in Hilbert spaces with Pick kernels.

We give first examples of finitely generated groups having an intermediate, with values in (0,1), Hilbert space compression (which is a numerical parameter measuring the distortion required to embed a metric space into Hilbert space). These groups include certain diagram groups. In particular, we show that the Hilbert …

2004-11-26abs ↗pdf ↗

GWI combines deep neural networks with Gaussian processes for better predictive performance and uncertainty quantification.

problem Combining deep learning with Gaussian process uncertainty quantification.
method Gaussian Wasserstein inference (GWI) using Wasserstein distance between Gaussian measures.
result GWI achieves state-of-the-art performance on benchmark datasets.

Theory developed for Hilbert geometry over valued fields, linking real and non-Archimedean geometries.

problem Understanding Hilbert geometry over general valued fields and their limits.
method Developed a theory of Hilbert geometry over general ordered valued fields, proving ultralimit results.
result Ultralimit of rescaled real Hilbert geometries is isometric to a non-Archimedean Hilbert metric space.

Measuring conditional independence is one of the important tasks in statistical inference and is fundamental in causal discovery, feature selection, dimensionality reduction, Bayesian network learning, and others. In this work, we explore the connection between conditional independence measures induced by distances on …

2019-12-02abs ↗pdf ↗

In the paper "Direct Images, Fields of Hilbert Spaces, and Geometric Quantization", Lempert and Szőke proved that any flat analytic Hilbert field will induce a hermitian Hilbert bundle and gave an example of a flat Hilbert field that does not induce any Hilbert bundle. In this paper, we will provide an example of an an…

2014-05-07abs ↗pdf ↗

New GP-based method improves uncertainty quantification for causal functions.

problem Challenges in quantifying uncertainty for causal effects, especially for entire functions.
method GP-based approach using inner-product of observational functions in RKHS, with tractable posterior moments and calibration.
result Improves uncertainty quantification while maintaining causal effect estimation performance.

When there is a family of complex structures on the phase space, parametrized by a set SS, the prequantum Hilbert spaces produced by geometric quantization, using the half-form correction, also depends on these parameters. This way we obtain a field of Hilbert spaces p:HprQSp:H^{pr Q}\rightarrow S. We show that this field …

2018-08-12abs ↗pdf ↗

This study describes the Fisher-Rao metric on Gaussian measures in infinite-dimensional spaces.

problem Understanding the Fisher-Rao metric in infinite-dimensional Gaussian settings.
method Explicit description and generalization of finite-dimensional quantities to infinite-dimensional Hilbert spaces.
result The Fisher-Rao metric and related geometric quantities generalize from finite to infinite dimensions.

Paper analyzes convergence rate of noisy Bayesian Optimization with Expected Improvement.

problem Theoretical convergence behaviors and rates of Expected Improvement (EI) in Bayesian optimization.
method Analyzes Expected Improvement (EI) under Gaussian process (GP) prior assumption, considering noisy observations.
result Established asymptotic error bound and rate for GP-EI with noisy observations.