An oracle inequality for regularized risk minimizers with strongly mixing observations

2013 ◽  
Vol 8 (2) ◽  
pp. 301-315
Author(s):  
Feilong Cao ◽  
Xing Xing
2016 ◽  
Vol 2016 ◽  
pp. 1-17 ◽  
Author(s):  
Victor Chulaevsky

We adapt the method of direct scaling analysis developed earlier for single-particle Anderson models, to the fermionic multiparticle models with finite or infinite interaction on graphs. Combined with a recent eigenvalue concentration bound for multiparticle systems, the new method leads to a simpler proof of the multiparticle dynamical localization with optimal decay bounds in a natural distance in the multiparticle configuration space, for a large class of strongly mixing random external potentials. Earlier results required the random potential to be IID.


2017 ◽  
Vol 9 (2) ◽  
pp. 65
Author(s):  
Brahima Soro ◽  
Ouagnina Hili ◽  
Sophie Dabo- Niang

We present general results of consistency and normality of a real-valued longitudinal random variable. We suppose that this random variable is some formed weighted averages of alpha-mixing data. The results can be applied to within-subject covariance function.


2016 ◽  
Vol 33 (5) ◽  
pp. 1121-1153
Author(s):  
Shin Kanaya

The convergence rates of the sums of α-mixing (or strongly mixing) triangular arrays of heterogeneous random variables are derived. We pay particular attention to the case where central limit theorems may fail to hold, due to relatively strong time-series dependence and/or the nonexistence of higher-order moments. Several previous studies have presented various versions of laws of large numbers for sequences/triangular arrays, but their convergence rates were not fully investigated. This study is the first to investigate the convergence rates of the sums of α-mixing triangular arrays whose mixing coefficients are permitted to decay arbitrarily slowly. We consider two kinds of asymptotic assumptions: one is that the time distance between adjacent observations is fixed for any sample size n; and the other, called the infill assumption, is that it shrinks to zero as n tends to infinity. Our convergence theorems indicate that an explicit trade-off exists between the rate of convergence and the degree of dependence. While the results under the infill assumption can be seen as a direct extension of those under the fixed-distance assumption, they are new and particularly useful for deriving sharper convergence rates of discretization biases in estimating continuous-time processes from discretely sampled observations. We also discuss some examples to which our results and techniques are useful and applicable: a moving-average process with long lasting past shocks, a continuous-time diffusion process with weak mean reversion, and a near-unit-root process.


2017 ◽  
Vol 11 (2) ◽  
pp. 4851-4870 ◽  
Author(s):  
Pierre C. Bellec ◽  
Joseph Salmon ◽  
Samuel Vaiter
Keyword(s):  

2012 ◽  
Vol 8 (2) ◽  
pp. 245-257
Author(s):  
Huse Fatkić ◽  
Mehmed Brkić
Keyword(s):  

1997 ◽  
Vol 10 (1) ◽  
pp. 3-20 ◽  
Author(s):  
Shan Sun ◽  
Ching-Yuan Chiang

We prove the almost sure representation, a law of the iterated logarithm and an invariance principle for the statistic Fˆn(Un) for a class of strongly mixing sequences of random variables {Xi,i≥1}. Stationarity is not assumed. Here Fˆn is the perturbed empirical distribution function and Un is a U-statistic based on X1,…,Xn.


Sign in / Sign up

Export Citation Format

Share Document