Related papers: Exponential Inequalities for Some Mixing Processes…
We establish a Bernstein-type inequality for a class of stochastic processes that include the classical geometrically $\phi$-mixing processes, Rio's generalization of these processes, as well as many time-discrete dynamical systems. Modulo…
In this paper we obtain a Bernstein type inequality for a class of weakly dependent and bounded random variables. The proofs lead to a moderate deviations principle for sums of bounded random variables with exponential decay of the strong…
The major contributions of this paper lie in two aspects. Firstly, we focus on deriving Bernstein-type inequalities for both geometric and algebraic irregularly-spaced NED random fields, which contain time series as special case.…
This paper studies identifiability and convergence behaviors for parameters of multiple types in finite mixtures, and the effects of model fitting with extra mixing components. First, we present a general theory for strong identifiability,…
Exponential inequalities are main tools in machine learning theory. To prove exponential inequalities for non i.i.d random variables allows to extend many learning techniques to these variables. Indeed, much work has been done both on…
We consider the stochastic integrals of multivariate point processes and study their concentration phenomena. In particular, we obtain a Bernstein type of concentration inequality through Dol\'eans-Dade exponential formula and a uniform…
Semiparametric mixture models are parametric models with latent variables. They are defined kernel, $p_\theta(x | z)$, where z is the unknown latent variable, and $\theta$ is the parameter of interest. We assume that the latent variables…
We investigate the convergence in distribution of sequential empirical processes of dependent data indexed by a class of functions F. Our technique is suitable for processes that satisfy a multiple mixing condition on a space of functions…
Let $f$ be a $C^{1+\alpha}$ diffeomorphism of a compact manifold $M$ preserving a smooth measure $\mu$. We show that if $f:(M,\mu)\to (M,\mu)$ is exponentially mixing then it is Bernoulli.
We prove an invariance principle for non-stationary random processes and establish a rate of convergence under a new type of mixing condition. The dependence is exponentially decaying in the gap between the past and the future and is…
We prove Bernstein-type matrix concentration inequalities for linear combinations with matrix coefficients of binary random variables satisfying certain $\ell_\infty$-independence assumptions, complementing recent results by Kaufman, Kyng…
Despite the popularity of feature importance (FI) measures in interpretable machine learning, the statistical adequacy of these methods is rarely discussed. From a statistical perspective, a major distinction is between analyzing a…
The conditional backward sampling particle filter (CBPF) is a powerful Markov chain Monte Carlo sampler for general state space hidden Markov model (HMM) smoothing. It was proposed as an improvement over the conditional particle filter…
We consider mixture models where location parameters are a priori encouraged to be well separated. We explore a class of determinantal point process (DPP) mixture models, which provide the desired notion of separation or repulsion. Instead…
In this paper, we show that Gibbs measures on self-conformal sets generated by a $C^{1+\alpha}$ conformal IFS on $\mathbb{R}^d$ satisfying the OSC are exponentially mixing. We exploit this to obtain essentially sharp asymptotic counting…
We establish a new Bernstein-type deviation inequality for general (non-reversible) discrete-time Markov chains via an elementary approach. More robust than existing works in the literature, our result only requires the Markov chain to…
When observations are organized into groups where commonalties exist amongst them, the dependent random measures can be an ideal choice for modeling. One of the propositions of the dependent random measures is that the atoms of the…
The conditional particle filter (CPF) is a promising algorithm for general hidden Markov model smoothing. Empirical evidence suggests that the variant of CPF with backward sampling (CBPF) performs well even with long time series. Previous…
In this work, Bernstein's concentration inequalities for squared integrable matrix-valued discrete-time martingales are obtained. Based on Lieb's theory and Bernstein's condition, a suitable supermartingale can be constructed. Our proof is…
The Entropy method provides a powerful framework for proving scalar concentration inequalities by establishing functional inequalities like Poincare and log-Sobolev inequalities. These inequalities are especially useful for deriving…