English
Related papers

Related papers: A vector-valued almost sure invariance principle f…

200 papers

Importance sampling (IS) is a Monte Carlo technique that relies on weighted samples, simulated from a proposal distribution, to estimate intractable integrals. The quality of the estimators improves with the number of samples. However, for…

Computation · Statistics 2022-07-18 Medha Agarwal , Dootika Vats , Víctor Elvira

Approximate Message Passing (AMP), originally designed to solve high-dimensional linear inverse problems, has found broad applications in signal processing and statistical inference. Among its key variants, Vector Approximate Message…

Information Theory · Computer Science 2024-10-29 Qun Chen , Haochuan Zhang , Huimin Zhu

We establish a large deviation principle for the empirical spectral measure of a sample covariance matrix with sub-Gaussian entries, which extends Bordenave and Caputo's result for Wigner matrices having the same type of entries [7]. To…

Probability · Mathematics 2015-05-22 Benjamin Groux

We consider a piecewise smooth expanding map of the interval possessing two invariant subsets of positive Lebesgue measure and exactly two ergodic absolutely continuous invariant probability measures (ACIMs). When this system is perturbed…

Dynamical Systems · Mathematics 2013-02-05 Cecilia González Tokman , Brian R. Hunt , Paul Wright

We provide a set of probabilistic laws for estimating the quadratic variation of continuous semimartingales with realized range-based variance -- a statistic that replaces every squared return of realized variance with a normalized squared…

Econometrics · Economics 2026-01-29 Kim Christensen , Mark Podolskij

The Akaike information criterion (AIC) is a model selection criterion widely used in practical applications. The AIC is an estimator of the log-likelihood expected value, and measures the discrepancy between the true model and the estimated…

Computation · Statistics 2017-02-03 Fábio M. Bayer , Francisco Cribari-Neto

Approximate message passing (AMP) methods and their variants have attracted considerable recent attention for the problem of estimating a random vector $\mathbf{x}$ observed through a linear transform $\mathbf{A}$. In the case of large…

Information Theory · Computer Science 2018-03-05 Sundeep Rangan , Philip Schniter , Alyson K. Fletcher , Subrata Sarkar

This paper is devoted to two different two-time-scale stochastic approximation algorithms for superquantile estimation. We shall investigate the asymptotic behavior of a Robbins-Monro estimator and its convexified version. Our main…

Statistics Theory · Mathematics 2020-07-30 Bernard Bercu , Manon Costa , Sébastien Gadat

We present a novel method for the estimation of variance parameters in generalised linear mixed models. The method has its roots in Harville (1977)'s work, but it is able to deal with models that have a precision matrix for the…

Methodology · Statistics 2018-06-13 María Xosé Rodríguez-Álvarez , Maria Durban , Dae-Jin Lee , Paul H. C. Eilers

Randomized experiments have become important tools in empirical research. In a completely randomized treatment-control experiment, the simple difference in means of the outcome is unbiased for the average treatment effect, and covariate…

Statistics Theory · Mathematics 2021-01-01 Lihua Lei , Peng Ding

We prove quenched invariance principle for simple random walk on the unique infinite percolation cluster for a general class of percolation models on Z^d, d>=2, with long-range correlations introduced in arXiv:1212.2885, solving one of the…

Probability · Mathematics 2015-09-28 Eviatar Procaccia , Ron Rosenthal , Artem Sapozhnikov

This paper considers estimating a covariance matrix of $p$ variables from $n$ observations by either banding or tapering the sample covariance matrix, or estimating a banded version of the inverse of the covariance. We show that these…

Statistics Theory · Mathematics 2008-12-18 Peter J. Bickel , Elizaveta Levina

We investigate the complexity of covariance matrix estimation for Gibbs distributions based on dependent samples from a Markov chain. We show that when $\pi$ satisfies a Poincar\'e inequality and the chain possesses a spectral gap, we can…

Statistics Theory · Mathematics 2024-10-23 Yunbum Kook , Matthew S. Zhang

Importance sampling (IS) is a Monte Carlo methodology that allows for approximation of a target distribution using weighted samples generated from another proposal distribution. Adaptive importance sampling (AIS) implements an iterative…

Computation · Statistics 2018-06-04 Yousef El-Laham , Victor Elvira , Monica F. Bugallo

We provide a computationally and statistically efficient method for estimating the parameters of a stochastic covariance model observed on a regular spatial grid in any number of dimensions. Our proposed method, which we call the Debiased…

Methodology · Statistics 2022-04-27 Arthur P. Guillaumin , Adam M. Sykulski , Sofia C. Olhede , Frederik J. Simons

Variational inference approximates the posterior distribution of a probabilistic model with a parameterized density by maximizing a lower bound for the model evidence. Modern solutions fit a flexible approximation with stochastic gradient…

Machine Learning · Statistics 2017-07-13 Joseph Sakaya , Arto Klami

In this paper we give a simple new proof of a result of Pittel and Wormald concerning the asymptotic value and (suitably rescaled) limiting distribution of the number of vertices in the giant component of $G(n,p)$ above the scaling window…

Probability · Mathematics 2012-02-07 Bela Bollobas , Oliver Riordan

The PAC-Bayesian approach is a powerful set of techniques to derive non- asymptotic risk bounds for random estimators. The corresponding optimal distribution of estimators, usually called the Gibbs posterior, is unfortunately intractable.…

Machine Learning · Statistics 2015-06-16 Pierre Alquier , James Ridgway , Nicolas Chopin

We prove the almost sure invariance principle with rate $o(n^{\varepsilon})$ for every $\varepsilon > 0$ for H\"older continuous observables on nonuniformly expanding and nonuniformly hyperbolic transformations with exponential tails.…

Dynamical Systems · Mathematics 2018-09-26 Alexey Korepanov

We prove an almost sure invariance principle for a random walker among i.i.d. conductances in $\Z^d$, $d\geq 2$. We assume conductances are bounded from above but we dot require they are bounded from below.

Probability · Mathematics 2012-09-11 P. Mathieu
‹ Prev 1 4 5 6 7 8 10 Next ›