Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Oliver Johnson"'
Publikováno v:
Yu, L, Daly, F & Johnson, O T 2022, ' A negative binomial approximation in group testing ', Probability in the Engineering and Informational Sciences . https://doi.org/10.1017/S026996482200033X
We consider the problem of group testing (pooled testing), first introduced by Dorfman. For nonadaptive testing strategies, we refer to a nondefective item as “intruding” if it only appears in positive tests. Such items cause misclassification er
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa457e75d06a2e1753ab1bc282608e80
http://arxiv.org/abs/2203.07803
http://arxiv.org/abs/2203.07803
Autor:
Oliver Johnson, Ramji Venkataramanan
Publikováno v:
Electron. J. Statist. 12, no. 1 (2018), 1126-1149
Venkataramanan, R & Johnson, O 2018, ' A strong converse bound for multiple hypothesis testing, with applications to high-dimensional estimation ', Electronic Journal of Statistics, vol. 12, no. 1, pp. 1126-1149 . https://doi.org/10.1214/18-EJS1419
Venkataramanan, R & Johnson, O 2018, ' A strong converse bound for multiple hypothesis testing, with applications to high-dimensional estimation ', Electronic Journal of Statistics, vol. 12, no. 1, pp. 1126-1149 . https://doi.org/10.1214/18-EJS1419
In statistical inference problems, we wish to obtain lower bounds on the minimax risk, that is to bound the performance of any possible estimator. A standard technique to obtain risk lower bounds involves the use of Fano's inequality. In an informati
Autor:
Oliver Johnson
Publikováno v:
Electron. J. Statist. 2 (2008), 807-828
We analyse the properties of the Principal Fitted Components (PFC) algorithm proposed by Cook. We derive theoretical properties of the resulting estimators, including sufficient conditions under which they are $\sqrt{n}$-consistent, and explain some
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::40dbf646f59ab4ea228d7b81c2a3a696
http://arxiv.org/abs/0806.4120
http://arxiv.org/abs/0806.4120
Autor:
Richard J. Samworth, Oliver Johnson
Publikováno v:
University of Bristol-PURE
Bernoulli 11, no. 5 (2005), 829-845
Bernoulli 12, no. 1 (2006), 191
Bernoulli 11, no. 5 (2005), 829-845
Bernoulli 12, no. 1 (2006), 191
We give a new proof of the classical Central Limit Theorem, in the Mallows ($L^r$-Wasserstein) distance. Our proof is elementary in the sense that it does not require complex analysis, but rather makes use of a simple subadditive inequality related t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::256b39aec6afd1e5bf300695648b102a
http://arxiv.org/abs/math/0406218
http://arxiv.org/abs/math/0406218
Autor:
Andrew R. Barron, Oliver Johnson
We give conditions for an O(1/n) rate of convergence of Fisher information and relative entropy in the Central Limit Theorem. We use the theory of projections in L2 spaces and Poincare inequalities, to provide a better understanding of the decrease i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::49e9dd3f315dd50cfc955f4509c634f9
http://arxiv.org/abs/math/0111020
http://arxiv.org/abs/math/0111020