Variable selection via RIVAL and its application in nuclear material detection

In many situations, the number of data points is fixed, and the asymptotic convergence results of popular model selection tools may not be useful. A new algorithm for model selection, RIVAL (removing irrelevant variables amidst Lasso iterations), is presented and shown to be particularly effective for a large but fixed number of data points. The algorithm is motivated by an application of nuclear material detection where all unknown parameters are to be non-negative. Thus, positive Lasso and its variants are analyzed. Then, RIVAL is proposed and is shown to have some desirable properties, namely the number of data points needed to have convergence is smaller than existing methods.

Comments on “Wirtinger-based integral inequality: Application to time-delay systems [Automatica 49 (2013) 2860–2866]”

In a recent paper (Automatica 49 (2013) 2860–2866), the Wirtinger-based inequality has been introduced to derive tractable stability conditions for time-delay or sampled-data systems. We point out that there exist two errors in Theorem 8 for the stability analysis of sampled-data systems, and the correct theorem is presented.