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.

169,051 papers · 148 categories

Trend · papers per month

5.6%11.1%16.7%22.3% · May 202619922001200920182026
48 results for Gaussian error

Paper derives uniform error bounds for Gaussian process regression for safer control applications.

problem Quantifying model error in Gaussian process regression for safety-critical applications.
method Employing Gaussian process distribution and continuity arguments, derive uniform error bounds under weaker assumptions.
result Derives novel uniform error bounds for Gaussian process regression under weaker assumptions.

New method identifies Gaussian SEMs with varying error variances.

problem Identify Gaussian SEMs with both homogeneous and heterogeneous error variances.
method Exploits error variances and edge weights; provides a statistically consistent and feasible structure learning algorithm.
result Proves identifiability of Gaussian SEMs with both homogeneous and heterogeneous unknown error variances.

Enhances reinforcement learning uncertainty estimation with a generalized Gaussian error model.

problem Inaccurate error representations and compromised uncertainty estimation in conventional uncertainty-aware TD learning.
method Introduces a novel framework for generalized Gaussian error modeling in deep reinforcement learning, incorporating higher-order moments, particularly kurtosis, to improve uncertainty estimation and mitigation.
result Significant performance gains in policy gradient algorithms with the proposed framework.

Paper bounds prediction error for misspecified Gaussian process models.

problem Guaranteeing model confidence for nonparametric Gaussian process regression.
method Derives an upper bound for mean square prediction error using pseudo-concave optimization.
result Upper bound for mean square prediction error of misspecified models.

Novel Hilbert space Gaussian process improves sequential design accuracy and efficiency.

problem Efficiently implementing Gaussian process acquisition functions for expensive simulations.
method Proposed a truncated eigenbasis representation for closed-form evaluation of IMSE acquisition function.
result Significantly lower prediction error and reduced computation time compared to benchmarks.

The study examines the universality of Gaussian data in high-dimensional generalized linear estimation.

problem Understanding when Gaussian data suffices for high-dimensional generalized linear estimation.
method Sharp asymptotic expressions for test and training errors in high-dimensional Gaussian mixture data with labels from a single-index model.
result The universality of Gaussian data in error estimation depends on the alignment between target weights and mixture cluster means and covariances.

Robust estimators for Gaussian sparse tasks with optimal error under contamination.

problem Robust mean estimation, PCA, and linear regression in the presence of Huber contamination.
method Novel multidimensional filtering method for sparse regime.
result Optimal error guarantees within constant factors for Gaussian robust kk-sparse mean estimation.

This paper addresses error bounds and posterior variance for Gaussian process regression.

problem Deriving performance guarantees for Gaussian process regression without prior knowledge.
method Lipschitz continuity and analysis of posterior variance function.
result Uniform error bounds for Gaussian process regression are derived.

Diffusion models generate data with Gaussian Universality, matching linear model test errors.

problem Analyzing the performance of models trained on synthetic data generated by diffusion models.
method Investigates Gaussian Universality for data distributions generated via diffusion models, matching test errors of linear models trained on synthetic data to Gaussian Mixture models.
result The test error of a linear model trained on diffusion-generated data matches the test error of a linear model trained on Gaussian Mixture data with matching means and covariances per class.

This work approximates finite neural networks with Gaussian processes, providing error bounds and applications in prior selection.

problem Approximating finite neural networks with Gaussian processes for error bounds and uncertainty quantification.
method Iterative approximation of neural network layers as mixtures of Gaussian processes, using optimal transport and Gaussian processes.
result The ability to return a mixture of Gaussian processes that is ε-close to the neural network at a finite set of input points.

Gaussian graphical model is a graphical representation of the dependence structure for a Gaussian random vector. It is recognized as a powerful tool in different applied fields such as bioinformatics, error-control codes, speech language, information retrieval and others. Gaussian graphical model selection is a statist…

2017-01-09abs ↗pdf ↗

Optimal Gaussian noise mechanisms achieve nearly optimal error in unbiased mean estimation.

problem Efficiently estimating the mean of high-dimensional data while preserving privacy.
method Differential privacy mechanisms with Gaussian noise, focusing on optimal covariance.
result Gaussian noise mechanisms achieve nearly optimal error among all private unbiased mean estimation mechanisms.

Theoretical analysis of entropy approximation for Gaussian mixtures.

problem Lack of theoretical guarantees for entropy approximation of Gaussian mixtures.
method Theoretical analysis of the error between true and approximate entropy.
result The error converges to zero as the ratios of means to variances tend to infinity, providing a guarantee for high-dimensional problems.

Bayesian method identifies causal DAG structure from non-Gaussian errors.

problem Learning causal structure from non-Gaussian errors in Bayesian networks.
method Bayesian hierarchical model with DAG prior for non-Gaussian errors.
result Posterior DAG selection consistency achieved under mild assumptions.

Study improves least squares estimation for heavy-tailed errors.

problem Improving least squares estimation under heteroscedastic and heavy-tailed errors.
method Analyzes the rate of convergence of least squares estimator under bounded conditional variance and finitely many moments of errors.
result Upper bounds on rates of convergence of LSE for heavy-tailed errors are found.

Gaussian process regression helps approximate Bayesian inverse problems efficiently.

problem Computational intractability of Bayesian posterior distributions in inverse problems.
method Gaussian process regression to build a surrogate model for the likelihood.
result Error between true and approximate posterior can be bounded by weighted L2L^2-norm error between true and approximate likelihood.

Improved BO algorithms reduce prediction error under Gaussian noise.

problem Reducing prediction error in Bayesian optimization with Gaussian noise.
method Established new prediction error bounds for Gaussian process under frequentist setting.
result Proved improved convergence rates of cumulative regret for GP-UCB and GP-TS.

A new error bound improves safety in Bayesian optimization.

problem Ensuring safety in Bayesian optimization with probabilistic models.
method Introducing a novel error bound using Wiener kernel regression for Gaussian processes and noise.
result The new error bound provides larger safety regions than previous methods.

Improved estimator for least squares using random projections achieves smaller error.

problem Improving the accuracy of least squares solutions for large-scale problems.
method James-Stein estimator applied to Gaussian sketching of least squares problems.
result Upper and lower bounds match when SNR is small and data matrix is well-conditioned.

A new asymmetric correntropy method improves robust adaptive filtering for asymmetric error distributions.

problem Inadequate handling of asymmetric error distributions in adaptive filtering.
method Proposes asymmetric correntropy using an asymmetric Gaussian kernel and develops a robust adaptive filtering algorithm.
result The proposed algorithm shows better steady-state convergence performance for asymmetric error distributions.

The paper develops generalization bounds for deep compound Gaussian neural networks.

problem Developing theoretical guarantees for the performance of deep neural networks.
method Novel generalization error bounds using a compound Gaussian prior and Dudley's integral.
result Theoretical bounds show generalization error scales O(nln(n))\mathcal{O}(n\sqrt{\ln(n)}) in signal dimension and O((NetworkSize)3/2)\mathcal{O}((Network Size)^{3/2}) in network size.

New approach uses Gaussian processes to learn and track complex systems with guaranteed accuracy.

problem Inaccurate first principle models for complex systems due to data complexity.
method Bayesian prediction error bound for Gaussian process regression, derived from kernel-based data density.
result Achieves vanishing tracking error with increasing data density, providing time-varying accuracy guarantees.

The paper bounds estimation and prediction errors in time series using entropy.

problem Estimating and predicting errors in time series analysis.
method Information-theoretic approach focusing on conditional entropy.
result Generic bounds on estimation and prediction errors determined by conditional entropy.

This paper analyzes error in SKI for Gaussian Processes, providing conditions for linear time inference.

problem Lack of rigorous theoretical error analysis for SKI.
method Proved error bounds for SKI Gram matrix, examined error effects, provided practical guidelines.
result Identified two dimensionality regimes for SKI's scalability-accuracy trade-offs.

The paper provides tighter error bounds for GPR under bounded support noise.

problem Rigorous error quantification for safety-critical applications with bounded noise.
method Using concentration inequalities and low complexity assumptions in RKHS, the paper derives probabilistic and deterministic error bounds for GPR.
result The derived error bounds are substantially tighter than existing state-of-the-art bounds and are particularly well-suited for GPR with neural network kernels.

Near-optimal algorithms for mean estimation and linear regression with Gaussian covariates and Huber contamination.

problem Gaussian mean estimation and linear regression with Gaussian covariates in the presence of Huber contamination.
method Near-optimal algorithms with optimal error guarantees, achieving sample complexity n=ildeO(d/ε2)n = ilde{O}(d/ε^2) and almost linear runtime.
result First sample near-optimal and almost linear-time algorithms with optimal error guarantees for both problems.

This paper considers the quantification of the prediction performance in Gaussian process regression. The standard approach is to base the prediction error bars on the theoretical predictive variance, which is a lower bound on the mean square-error (MSE). This approach, however, does not take into account that the stat…

2016-06-13abs ↗pdf ↗

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 on linear regression with dependent covariates, proving universality and error characterization.

problem Linear regression with dependent covariates in high-dimensional settings.
method Analysis of ridge regression performance, Gaussian universality theorem, spectral properties of covariance matrices.
result Asymptotic performance of ridge regression is invariant under non-Gaussian covariates with preserved mean and covariance.

Study improves error bounds for sparse regression with heavy-tailed covariates.

problem Estimating sparse coefficients in linear regression with heavy-tailed covariates.
method Employed an 1\ell_1-penalized Huber regression method.
result Error bound identical to Gaussian case for LL-subexponential covariates.

Computation of moments of transformed random variables is a problem appearing in many engineering applications. The current methods for moment transformation are mostly based on the classical quadrature rules which cannot account for the approximation errors. Our aim is to design a method for moment transformation for …

2017-01-05abs ↗pdf ↗

We provide faster algorithms for the problem of Gaussian summation, which occurs in many machine learning methods. We develop two new extensions - an O(Dp) Taylor expansion for the Gaussian kernel with rigorous error bounds and a new error control scheme integrating any arbitrary approximation method - within the best …

2012-06-27abs ↗pdf ↗

This paper improves active learning for Gaussian process regression to handle distributional uncertainty.

problem Active learning for Gaussian process regression does not guarantee accurate predictions for target distributions.
method Proposes two methods to reduce worst-case expected error for Gaussian process regression.
result Shows an upper bound of the worst-case expected squared error, suggesting finite data labels can achieve arbitrarily small error.

New GaussianSketch approximates kernel distances with almost relative error and small additive term.

problem Approximating kernel distances between point sets efficiently.
method Truncating Gaussian kernel expansions and using RecursiveTensorSketch.
result Approximates kernel distance with almost (1+ε)(1+\varepsilon)-relative error and small additive αα term.

For binary classification we establish learning rates up to the order of n1n^{-1} for support vector machines (SVMs) with hinge loss and Gaussian RBF kernels. These rates are in terms of two assumptions on the considered distributions: Tsybakov's noise assumption to establish a small estimation error, and a new geometr…

2007-08-14abs ↗pdf ↗

The article analyzes high-dimensional classification using empirical risk minimization with precise error predictions.

problem Classifying high-dimensional data with Gaussian mixture models.
method Theoretical analysis of ridge-regularized and unregularized empirical risk minimization for high-dimensional Gaussian mixture separation.
result The square loss is optimal for high-dimensional classification in both ridge-regularized and unregularized cases.

Study precise sample covariance error for Gaussian centered data.

problem Precise characterization of sample covariance error for Gaussian data.
method Developed a Random Duality Theory (RDT) framework to determine upper and lower bounds.
result Upper and lower bounds match in large-dimensional contexts, matching the spectral norm's limiting value.

Paper analyzes holdout cross-validation for large non-Gaussian covariance estimation.

problem Estimating large covariance matrices for non-Gaussian data.
method Use of Weingarten calculus and Ledoit-Péché formula for theoretical error derivation.
result Optimal train-test split ratio is proportional to square root of matrix dimension.