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

237474710947 · Jun 202019922001200920172026
48 results for Gaussian random functions

Bayesian approach approximates probability functions of Gaussian mixtures.

problem Approximating probability functions of non-spherical Gaussian mixtures.
method Bayesian decomposition, spherical radial decomposition, random sampling.
result Established differentiability and integral representation of gradient for probability functions.

Generalizes randomized SVD for better matrix approximations using Gaussian vectors.

problem Computing accurate rank-k approximations of matrices with limited data.
method Extends randomized SVD to multivariate Gaussian vectors, incorporating prior knowledge and using Gaussian processes.
result Demonstrates improved accuracy in approximating matrices and Hilbert-Schmidt operators.

Orthogonal random features approximate a Bessel kernel, offering sharper bounds than random Fourier features.

problem Approximating Gaussian kernel efficiently for large datasets.
method Use of Haar orthogonal matrices to construct orthogonal random features and analyze their bias and variance.
result Orthogonal random features approximate a Bessel kernel, not the Gaussian kernel, with sharper bounds.

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.

Gradient span algorithms show consistent progress in high dimensions.

problem Understanding consistent training progress in large machine learning models.
method Proving deterministic behavior of gradient span algorithms on Gaussian random functions.
result Gradient span algorithms have asymptotically deterministic behavior in high dimensions.

Proves new concentration inequalities for sub-gaussian and sub-exponential variables.

problem Understanding functions of independent random variables better.
method Sub-gaussian and sub-exponential conditions, Rademacher complexities, Lipschitz function classes.
result Extension of Rademacher complexities to unbounded sub-exponential distributions.

We study random Morse functions on a Riemann manifold (Mm,g)(M^m,g) defined as a random Gaussian weighted superpositions of eigenfunctions of the Laplacian of the metric gg. The randomness is determined by a fixed Schwartz function ww and a small parameter ε>0\varepsilon>0. We first prove that as ε0\varepsilon\to 0 the ex…

2012-09-04abs ↗pdf ↗

Paper introduces a nonparametric functional graphical model for random functions.

problem Estimating probabilistic conditional independence in functional graphical models.
method Functional sufficient dimension reduction to relax Gaussian or copula Gaussian assumptions.
result Enhances estimation accuracy and retains probabilistic conditional independence.

Study Gaussian approximation for deep neural networks with random weights.

problem Understanding the distribution of deep neural networks with random weights.
method Established Gaussian approximation bounds in Wasserstein-1 norm.
result Convergence rates of order n(1/6)L1+εn^{-({1}/{6})^{L-1} + ε} for deep networks with proportional layer widths.

We introduce a new functional measure of tail dependence for weakly dependent (asymptotically independent) random vectors, termed weak tail dependence function. The new measure is defined at the level of copulas and we compute it for several copula families such as the Gaussian copula, copulas of a class of Gaussian mi…

2014-02-19abs ↗pdf ↗

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.

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.

We derive Gaussian approximations for random forest predictions using region-based stabilization.

problem Improving the accuracy of random forest predictions for Poisson process data.
method Region-based stabilization and Malliavin-Stein method for multivariate Gaussian approximation.
result Established Gaussian approximation bounds for random forest predictions under Poisson process.

Random neural networks with ReLU activations are non-Gaussian processes.

problem Understanding the behavior of neural networks with random initialization and rectified linear units.
method Proving these networks are non-Gaussian processes and deriving their properties.
result These networks can converge to non-Gaussian processes under certain conditions.

The paper proposes a Gaussian mixture model for Hilbert-space-valued data.

problem Challenges in characterizing probability measures for infinite-dimensional random objects.
method Gaussian mixture framework based on kernel mean embeddings.
result The proposed algorithm yields a dense class of approximations in infinite-dimensional spaces.

Improved kernel ridge regression for large datasets using weighted random binning.

problem Efficiently approximating kernel matrices for large-scale datasets.
method Introduced weighted random binning features for locality sensitive hashing.
result Weighted random binning features generate Gaussian processes of any desired smoothness.

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.

The study proves Gaussian universality of deep random features learning.

problem Understanding the test error in deep random features learning.
method Proving Gaussian universality of test error in ridge regression and arbitrary convex losses.
result Sharp asymptotic formula for test error in ridge regression setting.

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.

The paper connects Riemannian Gaussian distributions to random matrix theory and diffusion kernels.

problem Analyzing Riemannian Gaussian distributions on symmetric spaces.
method Analytical computation of marginals using orthogonal and skew orthogonal polynomials, and diffusion kernels.
result Riemannian Gaussian distributions are random matrix types, and their probability density functions can be computed analytically.

Extends Gaussian process theory to Banach spaces.

problem Extending Gaussian process theory to Banach spaces.
method Investigates the connection between Gaussian processes and Gaussian random elements in reproducing kernel Banach spaces.
result Characterizes positive definite functions that arise from covariance operators in Banach space setting.

We use matricial free energy to regularize autoencoders, producing Gaussian-like codes.

problem Generating Gaussian-like codes for autoencoders.
method Define a differentiable loss function based on singular values of the code matrix, minimizing matricial free energy.
result Minimizing matricial free energy results in Gaussian-like codes that generalize.

Deep random feature models are analyzed for their performance with exact asymptotic expressions.

problem Understanding the performance of deep random feature models.
method Established a novel universality result and used the convex Gaussian Min-Max theorem.
result Exact asymptotic expressions for the performance of deep random feature models are derived.

Develops a new method for nonlinear dimension reduction using random features.

problem Statistical challenges in generalizing Gaussian process-based latent variable models to non-Gaussian data.
method Random feature latent variable models (RFLVMs) that approximate nonlinear relationships with linear functions of random features.
result RFLVMs produce comparable results to state-of-the-art methods on various data types.

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 ↗

New bounds for optimal transport using Gaussian processes and rate-distortion functions.

problem Finding bounds for entropic optimal transport with mutual information constraints.
method Lifting technique to construct a Gaussian process and applying the majorizing measure theorem.
result Maximum expected inner product is equivalent to a truncated integral involving the rate-distortion function.

A qq-Gaussian measure is a generalization of a Gaussian measure. This generalization is obtained by replacing the exponential function with the power function of exponent 1/(1q)1/(1-q) (q1q\neq 1). The limit case q=1q=1 recovers a Gaussian measure. For 1q<31\leq q <3, the set of all qq-Gaussian densities over the real line …

2020-02-06abs ↗pdf ↗

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 ↗

This paper improves GP-UCB by using a shifted exponential distribution for confidence parameters.

problem Theoretical confidence parameter in GP-UCB increases with iterations, leading to large values.
method Introduced IRGP-UCB, a randomized variant of GP-UCB using a shifted exponential distribution for confidence parameters.
result IRGP-UCB achieves sub-linear regret without increasing the confidence parameter.

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.

Randomly biased data makes complex models as easy to learn as simple ones.

problem Learning complex models like multi-index and sparse Boolean functions.
method Introducing a small random shift in the first moment of the data distribution.
result Randomly biased data makes Gaussian single index models and sparse Boolean functions as easy to learn as linear functions.

Wide neural networks can be closely approximated by Gaussian processes, with rates depending on the activation function's properties.

problem Approximating the behavior of wide neural networks using Gaussian processes.
method Established convergence rates for the central limit theorem in an infinite-dimensional functional space, using a transportation distance metric.
result Explicit convergence rates for neural networks approximated by Gaussian processes, varying based on the activation function's properties.

We introduce a new method to explain Gaussian processes using Shapley values.

problem Explaining the uncertainty in Gaussian process models.
method Extending Shapley values to stochastic cooperative games for Gaussian processes.
result Our method generates explanations that are random variables and satisfy favorable axioms.

We relate the distribution of eigenvalues of a random symmetric matrix in the Gaussian Orthogonal Ensemble to the distribution of critical values of a random linear combination of eigenfunctions of the Laplacian on a compact Riemann manifold. We then prove a central limit theorem describing what happens when the dimens…

2012-01-24abs ↗pdf ↗