Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userCircuit bases for randomisation
76
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
After a rich history in medicine, randomisation control trials both simple and complex are in increasing use in other areas such as web-based AB testing and planning and design decisions. A main objective is to be able to measure parameters, and contrasts in particular, while guarding against biases from hidden confounders. After careful definitions of classical entities such as contrasts, an algebraic method based on circuits is introduced which gives a wide choice of randomisation schemes.
rate research
Read More
Markov basis for statistical model of contingency tables gives a useful tool for performing the conditional test of the model via Markov chain Monte Carlo method. In this paper we derive explicit forms of Markov bases for change point models and block diagonal effect models, which are typical block-wise effect models of two-way contingency tables, and perform conditional tests with some real data sets.
In this paper, we study the power iteration algorithm for the spiked tensor model, as introduced in [44]. We give necessary and sufficient conditions for the convergence of the power iteration algorithm. When the power iteration algorithm converges, for the rank one spiked tensor model, we show the estimators for the spike strength and linear functionals of the signal are asymptotically Gaussian; for the multi-rank spiked tensor model, we show the estimators are asymptotically mixtures of Gaussian. This new phenomenon is different from the spiked matrix model. Using these asymptotic results of our estimators, we construct valid and efficient confidence intervals for spike strengths and linear functionals of the signals.
The article presents new sup-sums principles for integral F-divergence for arbitrary convex function F and arbitrary (not necessarily positive and absolutely continuous) measures. As applications of these results we derive the corresponding sup-sums principle for Kullback--Leibler divergence and work out new `integral definition for t-entropy explicitly establishing its relation to Kullback--Leibler divergence.
In this paper, we study a high-dimensional random matrix model from nonparametric statistics called the Kendall rank correlation matrix, which is a natural multivariate extension of the Kendall rank correlation coefficient. We establish the Tracy-Widom law for its largest eigenvalue. It is the first Tracy-Widom law for a nonparametric random matrix model, and also the first Tracy-Widom law for a high-dimensional U-statistic.
The main goal of this paper is to study the parameter estimation problem, using the Bayesian methodology, for the drift coefficient of some linear (parabolic) SPDEs driven by a multiplicative noise of special structure. We take the spectral approach by assuming that one path of the first $N$ Fourier modes of the solution is continuously observed over a finite time interval. First, we show that the model is regular and fits into classical local asymptotic normality framework, and thus the MLE and the Bayesian estimators are weakly consistent, asymptotically normal, efficient, and asymptotically equivalent in the class of loss functions with polynomial growth. Secondly, and mainly, we prove a Bernstein-Von Mises type result, that strengthens the existing results in the literature, and that also allows to investigate the Bayesian type estimators with respect to a larger class of priors and loss functions than that covered by classical asymptotic theory. In particular, we prove strong consistency and asymptotic normality of Bayesian estimators in the class of loss functions of at most exponential growth. Finally, we present some numerical examples that illustrate the obtained theoretical results.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
