Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userNon-uniform Bounds in the Poisson Approximation with Applications to Informational Distances. I
70
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We explore asymptotically optimal bounds for deviations of Bernoulli convolutions from the Poisson limit in terms of the Shannon relative entropy and the Pearson $chi^2$-distance. The results are based on proper non-uniform estimates for densities. They deal with models of non-homogeneous, non-degenerate Bernoulli distributions.
rate research
Read More
We explore asymptotically optimal bounds for deviations of distributions of independent Bernoulli random variables from the Poisson limit in terms of the Shannon relative entropy and Renyi/Tsallis relative distances (including Pearsons $chi^2$). This part generalizes the results obtained in Part I and removes any constraints on the parameters of the Bernoulli distributions.
The goal of this paper is to establish relative perturbation bounds, tailored for empirical covariance operators. Our main results are expansions for empirical eigenvalues and spectral projectors, leading to concentration inequalities and limit theorems. Our framework is very general, allowing for a huge variety of stationary, ergodic sequences, requiring only $p > 4$ moments. One of the key ingredients is a specific separation measure for population eigenvalues, which we call the relative rank. Developing a new algebraic approach for relative perturbations, we show that this relative rank gives rise to necessary and sufficient conditions for our concentration inequalities and limit theorems.
In this paper, we develop Steins method for negative binomial distribution using call function defined by $f_z(k)=(k-z)^+=max{k-z,0}$, for $kge 0$ and $z ge 0$. We obtain error bounds between $mathbb{E}[f_z(text{N}_{r,p})]$ and $mathbb{E}[f_z(V)]$, where $text{N}_{r,p}$ follows negative binomial distribution and $V$ is the sum of locally dependent random variables, using certain conditions on moments. We demonstrate our results through an interesting application, namely, collateralized debt obligation (CDO), and compare the bounds with the existing bounds.
In this paper, we consider graphon particle systems with heterogeneous mean-field type interactions and the associated finite particle approximations. Under suitable growth (resp. convexity) assumptions, we obtain uniform-in-time concentration estimates, over finite (resp. infinite) time horizon, for the Wasserstein distance between the empirical measure and its limit, extending the work of Bolley--Guillin--Villani.
We study reinforcement learning (RL) with linear function approximation. Existing algorithms for this problem only have high-probability regret and/or Probably Approximately Correct (PAC) sample complexity guarantees, which cannot guarantee the convergence to the optimal policy. In this paper, in order to overcome the limitation of existing algorithms, we propose a new algorithm called FLUTE, which enjoys uniform-PAC convergence to the optimal policy with high probability. The uniform-PAC guarantee is the strongest possible guarantee for reinforcement learning in the literature, which can directly imply both PAC and high probability regret bounds, making our algorithm superior to all existing algorithms with linear function approximation. At the core of our algorithm is a novel minimax value function estimator and a multi-level partition scheme to select the training samples from historical observations. Both of these techniques are new and of independent interest.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
