In this paper, we consider the problem of robust M-estimation of parameters of nonlinear signal processing models. We investigate the conditions under which estimators are strongly consistent for convex and non-convex penalty functions and a wide class of noise scenarios, contaminating the actual transmitted signal. It is shown that the M-estimators of a general nonlinear signal model are asymptotically consistent with probability one under different sets of sufficient conditions on loss function and noise distribution. Simulations are performed for nonlinear superimposed sinusoidal model to observe the small sample performance of the M-estimators for various heavy tailed error distributions, outlier contamination levels and sample sizes.
In both statistical non-inferiority (NI) and superiority (S) tests, the critical region must be a Barnard convex set for two main reasons. One, being computational in nature, based on the fact that calculating test sizes is a computationally intensive problem due to the presence of a nuisance parameter. However, this calculation is considerably reduced when the critical region is a Barnard convex set. The other reason is that in order for the NI/S statistical tests to make sense, its critical regions must be Barnard convex sets. While it is indeed possible for NI/S tests’ critical regions to not be Barnard convex sets, for the reasons stated above, it is desirable that they are. Therefore, it is important to generate, from a given NI/S test, a test which guarantees that the critical regions are Barnard convex sets. We propose a method by which, from a given NI/S test, we construct another NI/S test, ensuring that the critical regions corresponding to the modified test are Barnard convex sets, we illustrate this through examples. This work is theoretical because the type of developments refers to the general framework of NI/S testing for two independent binomial proportions and it is applied because statistical tests that do not ensure that their critical regions are Barnard convex sets may appear in practice, particularly in the clinical trials area.
The odds ratio is the predominant measure of association in 2×2 contingency tables, which, for inferential purposes, is usually considered on the log-scale. Under an information theoretic set-up, it is connected to the Kullback–Leibler divergence. Considering a generalized family of divergences, the ϕ divergence, alternative association measures are derived for 2×2 contingency tables. Their properties are studied and asymptotic inference is developed. For some members of this family, the estimated association measures remain finite in the presence of a sampling zero while for a subset of these members the estimators of these measures have finite variance as well. Special attention is given to the power divergence, which is a parametric family. The role of its parameter λ, in terms of the asymptotic confidence intervals' coverage probability and average relative length, is further discussed. In special probability table structures, for which the performance of the asymptotic confidence intervals for the classical log odds ratio is poor, the measure corresponding to λ=1/3 is suggested as an alternative.
A new stochastic order called dynamic cumulative residual quantile entropy (DCRQE) order is established. Some characterizations of the new order are investigated. Closure and reversed closure properties of the DCRQE order are obtained. Applications of the DCRQE ordering in characterizing the proportional hazard rate model and the k-record values model are considered.
We propose a new variable selection and estimation technique for high dimensional single index models with unknown monotone smooth link function. Among many predictors, typically, only a small fraction of them have significant impact on prediction. In such a situation, more interpretable models with better prediction accuracy can be obtained by variable selection. In this article, we propose a new penalized forward selection technique which can reduce high dimensional optimization problems to several one dimensional optimization problems by choosing the best predictor and then iterating the selection steps until convergence. The advantage of optimizing in one dimension is that the location of optimum solution can be obtained with an intelligent search by exploiting smoothness of the criterion function. Moreover, these one dimensional optimization problems can be solved in parallel to reduce computing time nearly to the level of the one-predictor problem. Numerical comparison with the LASSO and the shrinkage sliced inverse regression shows very promising performance of our proposed method.
