arXiv 1003.41832010-03-22math.PR

Asymptotic normality of randomly truncated stochastic algorithms

Jérôme Lelong

英文摘要：

We study the convergence rate of randomly truncated stochastic algorithms, which consist in the truncation of the standard Robbins-Monro procedure on an increasing sequence of compact sets. Such a truncation is often required in practice to ensure convergence when standard algorithms fail because the expected-value function grows too fast. In this work, we give a self contained proof of a central limit theorem for this algorithm under local assumptions on the expected-value function, which are fairly easy to check in practice.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Almost sure convergence of randomly truncated stochastic algorithms under verifiable conditions

We study the almost sure convergence of randomly truncated stochastic algorithms. We present a new convergence theorem which extends the already known results by making vanish the classical condition on the noise terms. The aim of this work is to prove an almost sure convergence result of randomly truncated stochastic algorithms under easily verifiable conditions

2007-06-06math.PR

Asymptotic normality of randomly truncated stochastic algorithms

2010-03-25math.OCmath.PR

On the Asymptotic Normality of the Conditional Maximum Likelihood Estimators for the Truncated Regression Model and the Tobit Model

In this paper, we study the asymptotic normality of the conditional maximum likelihood (ML) estimators for the truncated regression model and the Tobit model. We show that under the general setting assumed in his book, the conjectures made by Hayashi (2000) \footnote{see page 516, and page 520 of Hayashi (2000).} about the asymptotic normality of the conditional ML estimators for both models are true, namely, a sufficient condition is the nonsingularity of $\mathbf{x_tx'_t}$.

2008-02-05math.PRmath.STstat.TH

Asymptotic normality of Hill Estimator for truncated data

The problem of estimating the tail index from truncated data is addressed in Chakrabarty and Samorodnitsky (2009). In that paper, a sample based (and hence random) choice of k is suggested, and it is shown that the choice leads to a consistent estimator of the inverse of the tail index. In this paper, the second order behavior of the Hill estimator with that choice of k is studied, under some additional assumptions. In the untruncated situation, it is well known that asymptotic normality of the Hill estimator follows from the assumption of second order regular variation of the underlying distr…

2010-09-22math.PRmath.STstat.TH

Single index regression models with randomly left-truncated data

In this paper, based on the kernel estimator proposed by Ould-Said and Lemdani (Ann. Instit. Statist. Math. 2006), we develop some new generalized M-estimator procedures for single index regression models with left-truncated responses. The consistency and asymptotic normality of our estimators are also established. Some simulation studies are given to investigate the finite sample performance of the proposed estimators.

2018-01-19math.PRmath.STstat.TH

On asymptotics of large Haar distributed unitary matrices

Let $U_n$ be an $n \times n$ Haar unitary matrix. In this paper, the asymptotic normality and independence of $\Tr U_n, \Tr U_n^2, ..., \Tr U_n^k$ are shown by using elementary methods. More generally, it is shown that the renormalized truncated Haar unitaries converge to a Gaussian random matrix in distribution.

2003-10-21math.PR

更多相关论文收起更多论文

Distinguishing a truncated random permutation from a random function

An oracle chooses a function $f$ from the set of $n$ bits strings to itself, which is either a randomly chosen permutation or a randomly chosen function. When queried by an $n$-bit string $w$, the oracle computes $f(w)$, truncates the $m$ last bits, and returns only the first $n-m$ bits of $f(w)$. How many queries does a querying adversary need to submit in order to distinguish the truncated permutation from a random function? In 1998, Hall et al. showed an algorithm for determining (with high probability) whether or not $f$ is a permutation, using $O(2^{\frac{m+n}{2}})$ queries. They also sho…

2015-07-29math.COmath.PR

The external lengths in Kingman's coalescent

In this paper we prove asymptotic normality of the total length of external branches in Kingman's coalescent. The proof uses an embedded Markov chain, which can be descriped as follows: Take an urn with n black balls. Empty it in n steps according to the rule: In each step remove a randomly chosen pair of balls and replace it by one red ball. Finally remove the last remaining ball. Then the numbers U_k, 0 \leq k \leq n, of red balls after k steps exhibits an unexpected property: (U_0,...,U_n) and (U_n,..., U_0) are equal in distribution.

2011-01-17math.PR