TST. N. Sriram

T. N. Sriram

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


T. N. Sriram has a total of 16 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Robust estimation of conditional variance of time series using density power divergences

    by Jin‐Hong Park, T. N. Sriram

    Suppose Zt is the square of a time series Yt whose conditional mean is zero. We do not specify a model for Yt, but assume that there exists a p×1 parameter vector Φ such that the conditional distribution of Zt|Zt−1 is the same as that of , where Zt−1=(Zt−1,…,Zt−p)T for some lag p⩾1. Consequently, the conditional variance of Yt is some function of . To estimate Φ, we propose a robust estimation methodology based on density power divergences (DPD) indexed by a tuning parameter α∈[0,1], which yields a continuum of estimators, , where α controls the trade‐off between robustness and efficiency of the DPD estimators. For each α, is shown to be strongly consistent. We develop data‐dependent criteria for the selection of optimal α and lag p in practice. We illustrate the usefulness of our DPD methodology via simulation studies for ARCH‐type models, where the errors are drawn from a gross‐error contamination model and the conditional variance is a linear and/or nonlinear function of . Furthermore, we analyze the Chicago Board Options Exchange Dow Jones volatility index data and show that our DPD approach yields viable models for the conditional variance, which are as good as, or superior to, ARCH/GARCH models and two other divergence‐based models in terms of in‐sample and out‐of‐sample forecasts.


  • Professor Hira Lal Koul’s Contribution to Statistics

    by Soumendra Lahiri, Anton Schick, Ashis SenGupta, T.N. Sriram

  • On the performance ofL2Eestimation in modelling heterogeneous count responses with extreme values

    by Jaejun Lee, T.N. Sriram

    In healthcare studies, count data sets measured with covariates often exhibit heterogeneity and contain extreme values. To analyse such count data sets, we use a finite mixture of regression model framework and investigate a robust estimation approach, called the L2E [D.W. Scott, On fitting and adapting of density estimates, Comput. Sci. Stat. 30 (1998), pp. 124–133], to estimate the parameters. The L2E is based on an integrated L2 distance between parametric conditional and true conditional mass functions. In addition to studying the theoretical properties of the L2E estimator, we compare the performance of L2E with the maximum likelihood (ML) estimator and a minimum Hellinger distance (MHD) estimator via Monte Carlo simulations for correctly specified and gross-error contaminated mixture of Poisson regression models. These show that the L2E is a viable robust alternative to the ML and MHD estimators. More importantly, we use the L2E to perform a comprehensive analysis of a Western Australia hospital inpatient obstetrical length of stay (LOS) (in days) data that contains extreme values. It is shown that the L2E provides a two-component Poisson mixture regression fit to the LOS data which is better than those based on the ML and MHD estimators. The L2E fit identifies admission type as a significant covariate that profiles the predominant subpopulation of normal-stayers as planned patients and the small subpopulation of long-stayers as emergency patients.

  • Open Access

    Sample size determination for classifiers based on single-nucleotide polymorphisms

    by Xinyu Liu, Yupeng Wang, Romdhane Rekaya, T. N. Sriram

    Single-nucleotide polymorphisms (SNPs), believed to determine human differences, are widely used to predict risk of diseases. Typically, clinical samples are limited and/or the sampling cost is high. Thus, it is essential to determine an adequate sample size needed to build a classifier based on SNPs. Such a classifier would facilitate correct classifications, while keeping the sample size to a minimum, thereby making the studies cost-effective. For coded SNP data from 2 classes, an optimal classifier and an approximation to its probability of correct classification (PCC) are derived. A linear classifier is constructed and an approximation to its PCC is also derived. These approximations are validated through a variety of Monte Carlo simulations. A sample size determination algorithm based on the criterion, which ensures that the difference between the 2 approximate PCCs is below a threshold, is given and its effectiveness is illustrated via simulations. For the HapMap data on Chinese and Japanese populations, a linear classifier is built using 51 independent SNPs, and the required total sample sizes are determined using our algorithm, as the threshold varies. For example, when the threshold value is 0.05, our algorithm determines a total sample size of 166 (83 for Chinese and 83 for Japanese) that satisfies the criterion.


  • Multivariate Association and Dimension Reduction: A Generalization of Canonical Correlation Analysis

    by Ross Iaci, T.N. Sriram, Xiangrong Yin

    SummaryIn this article, we propose a new generalized index to recover relationships between two sets of random vectors by finding the vector projections that minimize anL2distance between each projected vector and an unknown function of the other. The unknown functions are estimated using the Nadaraya–Watson smoother. Extensions to multiple sets and groups of multiple sets are also discussed, and a bootstrap procedure is developed to detect the number of significant relationships. All the proposed methods are assessed through extensive simulations and real data analyses. In particular, for environmental data from Los Angeles County, we apply our multiple‐set methodology to study relationships between mortality, weather, and pollutants vectors. Here, we detect existence of both linear and nonlinear relationships between the dimension‐reduced vectors, which are then used to build nonlinear time‐series regression models for the dimension‐reduced mortality vector. These findings also illustrate potential use of our method in many other applications. A comprehensive assessment of our methodologies along with their theoretical properties are given in a Web Appendix.


  • Estimation of the offspring mean in a controlled branching process with a random control function

    by T.N. Sriram, A. Bhattacharya, M. González, R. Martínez, I. del Puerto


  • Counting by Weighing: An Alternative Sampling Scheme

    by Xinyu Wei, T. N. Sriram

    When it is necessary to manually count a large number N s of items, significant time and energy can be saved by weighing the items. When the weights are random with unknown mean and variance, one procedure is to take a small sample of n items, weigh them, and add more items until the total weight reaches N s times the average weight of the n items. This procedure yields a batch of items. An estimation criterion used in Yu ( 1989 Yu , K. F. ( 1989 ). On a Problem of Counting by Weighing , Canadian Journal of Statistics 17 : 377 – 389 . [CSA] [Crossref], [Web of Science ®] [Google Scholar] ) yields an optimal value n* for the original sample, but it is not useful when the coefficient of variation is unknown. To overcome this, Yu ( 1989 Yu , K. F. ( 1989 ). On a Problem of Counting by Weighing , Canadian Journal of Statistics 17 : 377 – 389 . [CSA] [Crossref], [Web of Science ®] [Google Scholar] ) proposed a fully, sequential scheme. Here, we propose a relatively new sequential sampling scheme due to Liu ( 1997a Liu , W. ( 1997a ). Improving The Fully Sequential Sampling Scheme of Anscombe-Chow-Robbins , Annals of Statistics 25 : 2164 – 2171 . [CSA] [CROSSREF] [Crossref], [Web of Science ®] [Google Scholar] ). Our scheme and Yu's ( 1989 Yu , K. F. ( 1989 ). On a Problem of Counting by Weighing , Canadian Journal of Statistics 17 : 377 – 389 . [CSA] [Crossref], [Web of Science ®] [Google Scholar] ) scheme are shown to be second-order efficient, but our scheme requires substantially fewer sampling operations. These show that a little bit of sampling using substantially fewer sampling operations can significantly reduce the effort and cost of complete counting.