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

143286429572 · Jun 202019922001200920172026
48 results for Gaussian Random Fields

Given a Gaussian Markov random field, we consider the problem of selecting a subset of variables to observe which minimizes the total expected squared prediction error of the unobserved variables. We first show that finding an exact solution is NP-hard even for a restricted class of Gaussian Markov random fields, calle…

2012-09-26abs ↗pdf ↗

New methods reduce computational cost for Gaussian Markov Random Fields with sparse constraints.

problem Inference and simulation of GMRFs are computationally prohibitive with many constraints.
method Proposes a basis transformation into blocks of constrained and non-constrained subspaces.
result Significantly outperforms existing alternatives in computational cost.

Random Gaussian fields on 4D Riemannian manifolds with conformal invariance.

problem Characterizing and analyzing Gaussian fields on 4D Riemannian manifolds.
method Constructing and analyzing co-biharmonic Gaussian fields with covariance kernels defined by the Paneitz operator.
result Rigorous derivation of quantum Liouville measure for γ<8|γ|<\sqrt8.

Bounds on Gaussian approximation for neural networks with novel smoothing techniques.

problem Approximating the distribution of wide random neural networks.
method Stein's method, Gaussian smoothing, Laplacian operators, Cameron-Martin space.
result First bounds on Gaussian approximation of wide random neural networks.

This is a technical report which explores the estimation methodologies on hyper-parameters in Markov Random Field and Gaussian Hidden Markov Random Field. In first section, we briefly investigate a theoretical framework on Metropolis-Hastings algorithm. Next, by using MH algorithm, we simulate the data from Ising model…

2017-11-20abs ↗pdf ↗

Study of cosmic microwave background polarization using spin random fields.

problem Detecting deviations from Gaussianity and anisotropies in cosmic fields.
method Explicit formula for Lipschitz-Killing curvatures of spin spherical random fields.
result Coherent with asymptotic results, providing new metric expressions.

Study on spin random fields using chaos decomposition for cosmic microwave background modeling.

problem Modeling polarization of Cosmic Microwave Background using spin random fields.
method Explicit Wiener-Itô chaos decomposition of area measures of level sets.
result Reveals a clear difference between high frequency regime and zero spin case.

New method speeds up sampling of Markov random fields.

problem Efficient sampling of Markov random fields is computationally expensive.
method Introduced a new class of Markov random fields linked to Gaussian Markov Random fields for faster sampling.
result At least 35x faster and 37x less energy consumption compared to Gibbs sampling.

A new method uses SPDEs to efficiently model random fields on complex domains.

problem Efficient representation of random fields on complex domains for engineering and machine learning.
method Uses SPDEs to develop a scalable framework for statFEM and GP regression.
result Can model anisotropic, non-stationary random fields with arbitrary smoothness.

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…

2015-10-31abs ↗pdf ↗

CMRFs extend PGMs for topological data, capturing both conditional and marginal dependencies.

problem Limited expressiveness of PGMs for topological data.
method Introducing Colored Markov Random Fields (CMRFs) that model Gaussian edge variables on topological spaces.
result CMRFs improve distributed estimation over physical networks compared to baselines.

New framework models neural systems with random architecture on manifolds.

problem Complex, uncertain systems with non-Gaussian outputs.
method Latent random field on compact manifold generates neural architecture and weights.
result Synthetic neural systems can produce stochastic outputs for deterministic inputs.

A scalable deep GMRF model for general graphs improves predictions and uncertainty estimates.

problem Handling generally structured data on graphs efficiently.
method A new multi-layer structure of Deep GMRFs designed for general graphs, enabling efficient training and close-to-exact Bayesian inference.
result Close-to-exact Bayesian inference for latent field predictions with uncertainty estimates.

The paper proves that Gaussian field critical points have finite moments.

problem Proving the finiteness of moments for Gaussian field critical points.
method General approach not specific to critical points, using Taylor polynomial non-degeneracy.
result The finiteness of moments of the number of critical points of Gaussian fields.

Characterizes nodal volumes of Gaussian fields on manifolds, extending previous work.

problem Understanding the law and regularity of nodal volumes for Gaussian fields on manifolds.
method Gaussian measures, Morse theory, Malliavin-Sobolev spaces, ray absolute continuity.
result Extension and generalization of previous work on stationary fields to arbitrary dimensions.

Consider a random smooth Gaussian field G(x):FRG(x):F\to\mathbb{R}, where FF is a compact in Rd\mathbb{R}^d. We derive a formula for average area of a surface generated by the equation G(x)=0G(x)=0 and give some applications. As an auxiliary result we obtain an integral expression for area of a surface induced by zeros of a \e…

2011-02-17abs ↗pdf ↗

We consider the signed density of the extremal points of (two-dimensional) scalar fields with a Gaussian distribution. We assign a positive unit charge to the maxima and minima of the function and a negative one to its saddles. At first, we compute the average density for a field in half-space with Dirichlet boundary c…

2003-01-29abs ↗pdf ↗

HTFM improves mode coverage and tail-statistic recovery for heavy-tailed data.

problem Tackles heavy-tailed data in various domains with rare events.
method Proposes a framework using clock-conditioned Gaussian sources and truncated logsignature features.
result Improves mode coverage, sample quality, and tail-statistic recovery over Gaussian flow matching and baselines.

A new model for stock price fluctuations is proposed, based upon an analogy with the motion of tracers in Gaussian random fields, as used in turbulent dispersion models and in studies of transport in dynamically disordered media. Analytical and numerical results for this model in a special limiting case of a single-sca…

2003-11-28abs ↗pdf ↗

Research proves the semi-classical limit of Liouville conformal field theory, describing deterministic geometry from random fluctuations.

problem Proving the semi-classical limit of Liouville conformal field theory.
method Probabilistic definition of Liouville theory, proving existence of semi-classical limit, defining classical stress-energy tensor.
result Existence and description of the semi-classical limit in terms of a massive Gaussian free field with Robin boundary conditions.

Study reveals three limiting regimes for neural network functionals.

problem Understanding the behavior of functionals of random neural networks.
method Central and non-central limit theorems, Hermite expansions, Diagram Formula, Stein-Malliavin techniques.
result Three distinct limiting regimes based on fixed points of covariance function.

The paper develops sampling methods for ocean phenomena based on temperature and salinity measurements.

problem Improving oceanographic sampling with limited resources.
method Design criterion based on uncertainty in excursions of vector-valued Gaussian random fields.
result Demonstrates effective exploration of ambiguous regions for data-driven sampling.

New chaos formula simplifies variance calculation for Gaussian nodal volumes.

problem Analyzing the variance of Gaussian nodal volumes on Riemannian manifolds.
method Explicit Wiener-Itô chaos decomposition, reducing complexity from 2+2n2+2n to 4 Hermite polynomials.
result New exact formula for variance and bounds, valid for arbitrary manifolds.

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.

Gaussian Markov random fields (GMRFs) are probabilistic graphical models widely used in spatial statistics and related fields to model dependencies over spatial structures. We establish a formal connection between GMRFs and convolutional neural networks (CNNs). Common GMRFs are special cases of a generative model where…

2020-02-18abs ↗pdf ↗

Develops a Markov Random Field model for hypergraphs to improve machine learning tasks.

problem Modeling data generation processes on hypergraphs for better machine learning.
method Hypergraph Markov Random Field model using multivariate Gaussian distribution.
result Proposed model enhances algorithm design and outperforms existing methods in structure inference and node classification.

Abstract: Generalizes SGMs to infinite-dimensional Hilbertian setting.

problem Difficulties in extending SGMs to infinite-dimensional settings.
method Uses Gamma and Malliavin Calculus, Dirichlet forms, Wiener chaoses, and time-reversal formula.
result Generalized SGMs to Hilbertian setting with finite-dimensional entropic convergence bounds.

Motivated by numerous questions in random geometry, given a smooth manifold MM, we approach a systematic study of the differential topology of Gaussian random fields (GRF) X:MRkX:M\to \mathbb{R}^k, that we interpret as random variables with values in Cr(M,Rk)\mathcal{C}^r(M, \mathbb{R}^k), inducing on it a Gaussian measure. Wh…

2019-02-11abs ↗pdf ↗

McCullagh and Yang (2006) suggest a family of classification algorithms based on Cox processes. We further investigate the log Gaussian variant which has a number of appealing properties. Conditioned on the covariates, the distribution over labels is given by a type of conditional Markov random field. In the supervised…

2014-05-16abs ↗pdf ↗

Paper presents characteristic function of Tsallis q-Gaussian and its applications.

problem Modeling input quantities in measurement models using Tsallis q-Gaussians.
method Developed a characteristic function and proposed a numerical method for its inversion.
result Exact probability distribution of output quantities can be determined.