Sushil Mittal
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Sushil Mittal has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
David Madigan
Department of Statistics, Columbia University, New York, NY 10027, USA
2 shared publicationsRandall S. Burd
Division of Trauma and Burn Surgery, Joseph E. Robert Jr. Center for Surgical Care, Children's National Medical Center, Washington, DC 20010, USA
2 shared publicationsJerry Q. Cheng
Cardiovascular Institute; UMDNJ-Robert Wood Johnson Medical School; 125 Patterson Street, Clinical Academic Building New Brunswick NJ 08901 U.S.A.
1 shared publicationMarc A. Suchard
1 shared publicationPeter Meer
Rutgers University, Piscataway
1 shared publication- Ramarathnam Venkatesan
Department of Computer Science Boston University Microsoft Research 111 Cummington Mall ‡ One Microsoft Way 02215 98052 Boston Redmond MA WA
1 shared publication
Latest Publications
- 4 October 2013
- Published by Oxford University Press (OUP) in Biostatistics
- Vol. 15 (2) , 207-221
High-dimensional, massive sample-size Cox proportional hazards regression for survival analysis
Survival analysis endures as an old, yet active research field with applications that spread across many domains. Continuing improvements in data acquisition techniques pose constant challenges in applying existing survival analysis methods to these emerging data sets. In this paper, we present tools for fitting regularized Cox survival analysis models on high-dimensional, massive sample-size (HDMSS) data using a variant of the cyclic coordinate descent optimization technique tailored for the sparsity that HDMSS data often present. Experiments on two real data examples demonstrate that efficient analyses of HDMSS data using these tools result in improved predictive performance and calibration.
- 4 October 2013
- Published by Oxford University Press (OUP) in Biostatistics
- Vol. 15 (2) , 207-221
High-dimensional, massive sample-size Cox proportional hazards regression for survival analysis
Survival analysis endures as an old, yet active research field with applications that spread across many domains. Continuing improvements in data acquisition techniques pose constant challenges in applying existing survival analysis methods to these emerging data sets. In this paper, we present tools for fitting regularized Cox survival analysis models on high-dimensional, massive sample-size (HDMSS) data using a variant of the cyclic coordinate descent optimization technique tailored for the sparsity that HDMSS data often present. Experiments on two real data examples demonstrate that efficient analyses of HDMSS data using these tools result in improved predictive performance and calibration.
- Open Access
- 28 April 2013
- Published by Wiley in Statistics in Medicine
- Vol. 32 (23) , 3955-3971
Large-scale parametric survival analysis
- 28 April 2013
- Published by Wiley in Statistics in Medicine
- Vol. 32 (23) , 3955-3971
Open AccessLarge-scale parametric survival analysis
- Open Access
Error Correction in Learning using SVMs
This paper is concerned with learning binary classifiers under adversarial label-noise. We introduce the problem of error-correction in learning where the goal is to recover the original clean data from a label-manipulated version of it, given (i) no constraints on the adversary other than an upper-bound on the number of errors, and (ii) some regularity properties for the original data. We present a simple and practical error-correction algorithm called SubSVMs that learns individual SVMs on several small-size (log-size), class-balanced, random subsets of the data and then reclassifies the training points using a majority vote. Our analysis reveals the need for the two main ingredients of SubSVMs, namely class-balanced sampling and subsampled bagging. Experimental results on synthetic as well as benchmark UCI data demonstrate the effectiveness of our approach. In addition to noise-tolerance, log-size subsampled bagging also yields significant run-time benefits over standard SVMs.
Open AccessError Correction in Learning using SVMs
This paper is concerned with learning binary classifiers under adversarial label-noise. We introduce the problem of error-correction in learning where the goal is to recover the original clean data from a label-manipulated version of it, given (i) no constraints on the adversary other than an upper-bound on the number of errors, and (ii) some regularity properties for the original data. We present a simple and practical error-correction algorithm called SubSVMs that learns individual SVMs on several small-size (log-size), class-balanced, random subsets of the data and then reclassifies the training points using a majority vote. Our analysis reveals the need for the two main ingredients of SubSVMs, namely class-balanced sampling and subsampled bagging. Experimental results on synthetic as well as benchmark UCI data demonstrate the effectiveness of our approach. In addition to noise-tolerance, log-size subsampled bagging also yields significant run-time benefits over standard SVMs.
- 14 February 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 34 (12) , 2351-2364
Generalized Projection-Based M-Estimator
We propose a novel robust estimation algorithm - the generalized projection-based M-estimator (gpbM), which does not require the user to specify any scale parameters. The algorithm is general and can handle heteroscedastic data with multiple linear constraints for single and multicarrier problems. The gpbM has three distinct stages - scale estimation, robust model estimation, and inlier/outlier dichotomy. In contrast, in its predecessor pbM, each model hypotheses was associated with a different scale estimate. For data containing multiple inlier structures with generally different noise covariances, the estimator iteratively determines one structure at a time. The model estimation can be further optimized by using Grassmann manifold theory. We present several homoscedastic and heteroscedastic synthetic and real-world computer vision problems with single and multiple carriers.
- 14 February 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. 34 (12) , 2351-2364
Generalized Projection-Based M-Estimator
We propose a novel robust estimation algorithm - the generalized projection-based M-estimator (gpbM), which does not require the user to specify any scale parameters. The algorithm is general and can handle heteroscedastic data with multiple linear constraints for single and multicarrier problems. The gpbM has three distinct stages - scale estimation, robust model estimation, and inlier/outlier dichotomy. In contrast, in its predecessor pbM, each model hypotheses was associated with a different scale estimate. For data containing multiple inlier structures with generally different noise covariances, the estimator iteratively determines one structure at a time. The model estimation can be further optimized by using Grassmann manifold theory. We present several homoscedastic and heteroscedastic synthetic and real-world computer vision problems with single and multiple carriers.