Random threshold for linear model selection, revisited
نویسندگان
چکیده
منابع مشابه
Random Thresholds for Linear Model Selection
A method is introduced to select the significant or non null mean terms among a collection of independent random variables. As an application we consider the problem of recovering the significant coefficients in non ordered model selection. The method is based on a convenient random centering of the partial sums of the ordered observations. Based on L-statistics methods we show consistency of t...
متن کاملThe satisfiability threshold for random linear equations
Let $A$ be a random $m\times n$ matrix over the finite field $F_q$ with precisely $k$ non-zero entries per row and let $y\in F_q^m$ be a random vector chosen independently of $A$. We identify the threshold $m/n$ up to which the linear system $A x=y$ has a solution with high probability and analyse the geometry of the set of solutions. In the special case $q=2$, known as the random $k$-XORSAT pr...
متن کاملLaws of Large Numbers for Random Linear
The computational solution of large scale linear programming problems contains various difficulties. One of the difficulties is to ensure numerical stability. There is another difficulty of a different nature, namely the original data, contains errors as well. In this paper, we show that the effect of the random errors in the original data has a diminishing tendency for the optimal value as the...
متن کاملBayesian model selection for group studies - Revisited
In this paper, we revisit the problem of Bayesian model selection (BMS) at the group level. We originally addressed this issue in Stephan et al. (2009), where models are treated as random effects that could differ between subjects, with an unknown population distribution. Here, we extend this work, by (i) introducing the Bayesian omnibus risk (BOR) as a measure of the statistical risk incurred ...
متن کاملInside the clustering threshold for random linear equations
We study a random system of cn linear equations over n variables in GF(2), where each equation contains exactly r variables. Previous results determined the clustering threshold cr: if c > c ∗ r, the solution space is partitioned into well-separated clusters whereas if c < c ∗ r, all solutions lie inside one well-connected cluster. This clustering phenomenon is hypothesized in many random const...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics and Its Interface
سال: 2012
ISSN: 1938-7989,1938-7997
DOI: 10.4310/sii.2012.v5.n2.a10