𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Almost sure convergence of bootstrapped means and U-statistics

✍ Scribed by T. Mikosch

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
907 KB
Volume
41
Category
Article
ISSN
0378-3758

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Further results on almost sure convergen
Further results on almost sure convergence of the stochastic gradient algorithm
✍ Miloje S. Radenkovic πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 151 KB πŸ‘ 2 views

In this paper, we consider the rate of convergence of the parameter estimation error and the cost function for the stochastic gradient-type algorithm. The problem is solved in the case of the minimum-variance stochastic adaptive control. It is proven that the cost function has the rate of convergenc

On the Almost Sure Convergence of Floati
On the Almost Sure Convergence of Floating-Point Mantissas and Benford's Law
✍ Peter Schatte πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 238 KB πŸ‘ 1 views

Let Y1, Y2, ... be a sequence of random variables 8nd let J i n be the floating-point mantissa of Y,,. Further let l f ~, ~) ( , ) denote the indicator function of the interval [I, x). If Yn/n-Z as.. wheteZ+O is 5 fnrther random variable, then the seqirence i~~,z#3fn) converges a s . to log x in the

Optimality and Almost Sure Convergence o
Optimality and Almost Sure Convergence of Adaptive IIR Filters with Output Error Recursion
✍ Miloje Radenkovic; Tamal Bose; Tanawat Mathurasai πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 108 KB

We consider the almost sure convergence of the adaptive IIR filter based on the output error method. It is rigorously shown that the algorithm is globally stable, parameter estimation is consistent, and perfect noise cancellation is achieved in the presence of nonstationary colored noise. Due to the