اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPerturbation method for determining the group of invariance of hierarchical models
264
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We propose a perturbation method for determining the (largest) group of invariance of a toric ideal defined in Aoki and Takemura [2008a]. In the perturbation method, we investigate how a generic element in the row space of the configuration defining a toric ideal is mapped by a permutation of the indeterminates. Compared to the proof in Aoki and Takemura [2008a] which was based on stabilizers of a subset of indeterminates, the perturbation method gives a much simpler proof of the group of invariance. In particular, we determine the group of invariance for a general hierarchical model of contingency tables in statistics, under the assumption that the numbers of the levels of the factors are generic. We prove that it is a wreath product indexed by a poset related to the intersection poset of the maximal interaction effects of the model.
قيم البحث
اقرأ أيضاً
We consider the inference problem for parameters in stochastic differential equation models from discrete time observations (e.g. experimental or simulation data). Specifically, we study the case where one does not have access to observations of the
model itself, but only to a perturbed version which converges weakly to the solution of the model. Motivated by this perturbation argument, we study the convergence of estimation procedures from a numerical analysis point of view. More precisely, we introduce appropriate consistency, stability, and convergence concepts and study their connection. It turns out that standard statistical techniques, such as the maximum likelihood estimator, are not convergent methodologies in this setting, since they fail to be stable. Due to this shortcoming, we introduce and analyse a novel inference procedure for parameters in stochastic differential equation models which turns out to be convergent. As such, the method is particularly suited for the estimation of parameters in effective (i.e. coarse-grained) models from observations of the corresponding multiscale process. We illustrate these theoretical findings via several numerical examples.
Let $X$ and $Y$ be nonsingular projective varieties over an algebraically closed field $k$ of positive characteristic. If $X$ and $Y$ are birational, we show their $S$-fundamental group schemes are isomorphic.
Least Absolute Shrinkage and Selection Operator or the Lasso, introduced by Tibshirani (1996), is a popular estimation procedure in multiple linear regression when underlying design has a sparse structure, because of its property that it sets some re
gression coefficients exactly equal to 0. In this article, we develop a perturbation bootstrap method and establish its validity in approximating the distribution of the Lasso in heteroscedastic linear regression. We allow the underlying covariates to be either random or non-random. We show that the proposed bootstrap method works irrespective of the nature of the covariates, unlike the resample-based bootstrap of Freedman (1981) which must be tailored based on the nature (random vs non-random) of the covariates. Simulation study also justifies our method in finite samples.
Based on deleting-item central limit theory, the classical Donskers theorem of partial-sum process of independent and identically distributed (i.i.d.) random variables is extended to incomplete partial-sum process. The incomplete partial-sum process
Donskers invariance principles are constructed and derived for general partial-sum process of i.i.d random variables and empirical process respectively, they are not only the extension of functional central limit theory, but also the extension of deleting-item central limit theory. Our work enriches the random elements structure of weak convergence.
Cooks distance [Technometrics 19 (1977) 15-18] is one of the most important diagnostic tools for detecting influential individual or subsets of observations in linear regression for cross-sectional data. However, for many complex data structures (e.g
., longitudinal data), no rigorous approach has been developed to address a fundamental issue: deleting subsets with different numbers of observations introduces different degrees of perturbation to the current model fitted to the data, and the magnitude of Cooks distance is associated with the degree of the perturbation. The aim of this paper is to address this issue in general parametric models with complex data structures. We propose a new quantity for measuring the degree of the perturbation introduced by deleting a subset. We use stochastic ordering to quantify the stochastic relationship between the degree of the perturbation and the magnitude of Cooks distance. We develop several scaled Cooks distances to resolve the comparison of Cooks distance for different subset deletions. Theoretical and numerical examples are examined to highlight the broad spectrum of applications of these scaled Cooks distances in a formal influence analysis.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
