Mathukumalli Vidyasagar
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Mathukumalli Vidyasagar has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Mehmet Eren Ahsen
University of Illinois at Urbana-Champaign, Department of Business Administration
3 shared publications - Masaaki Nagahara
Hiroshima University
2 shared publications Michael A. White
2 shared publications- Niharika Challapalli
Department of Electrical Engineering University of Texas at Dallas Richardson 75080 TX USA
2 shared publications Anna Unruh
Graduate Student, The University of Texas Graduate School of the Biomedical Sciences, Houston, TX, USA
1 shared publicationBurook Misganaw
Erik Jonsson School of Engineering and Computer Science, University of Texas at Dallas, Richardson, TX, USA
1 shared publication
Latest Publications
- 4 August 2021
- Published by Springer Nature
- p. 1103-1107
Learning Theory: the Probably Approximately Correct Framework
- 4 August 2021
- Published by Springer Nature
- p. 1103-1107
Learning Theory: the Probably Approximately Correct Framework
- Open Access
CLOT Norm Minimization for Continuous Hands-off Control
In this paper, we consider hands-off control via minimization of the CLOT (Combined $L$-One and Two) norm. The maximum hands-off control is the $L^0$-optimal (or the sparsest) control among all feasible controls that are bounded by a specified value and transfer the state from a given initial state to the origin within a fixed time duration. In general, the maximum hands-off control is a bang-off-bang control taking values of $\pm 1$ and $0$. For many real applications, such discontinuity in the control is not desirable. To obtain a continuous but still relatively sparse control, we propose to use the CLOT norm, a convex combination of $L^1$ and $L^2$ norms. We show by numerical simulations that the CLOT control is continuous and much sparser (i.e. has longer time duration on which the control takes 0) than the conventional EN (elastic net) control, which is a convex combination of $L^1$ and squared $L^2$ norms. We also prove that the CLOT control is continuous in the sense that, if $O(h)$ denotes the sampling period, then the difference between successive values of the CLOT-optimal control is $O(\sqrt{h})$, which is a form of continuity. Also, the CLOT formulation is extended to encompass constraints on the state variable.Open AccessCLOT Norm Minimization for Continuous Hands-off Control
In this paper, we consider hands-off control via minimization of the CLOT (Combined $L$-One and Two) norm. The maximum hands-off control is the $L^0$-optimal (or the sparsest) control among all feasible controls that are bounded by a specified value and transfer the state from a given initial state to the origin within a fixed time duration. In general, the maximum hands-off control is a bang-off-bang control taking values of $\pm 1$ and $0$. For many real applications, such discontinuity in the control is not desirable. To obtain a continuous but still relatively sparse control, we propose to use the CLOT norm, a convex combination of $L^1$ and $L^2$ norms. We show by numerical simulations that the CLOT control is continuous and much sparser (i.e. has longer time duration on which the control takes 0) than the conventional EN (elastic net) control, which is a convex combination of $L^1$ and squared $L^2$ norms. We also prove that the CLOT control is continuous in the sense that, if $O(h)$ denotes the sampling period, then the difference between successive values of the CLOT-optimal control is $O(\sqrt{h})$, which is a form of continuity. Also, the CLOT formulation is extended to encompass constraints on the state variable. - Open Access
Two New Approaches to Compressed Sensing Exhibiting Both Robust Sparse Recovery and the Grouping Effect
In this paper we introduce a new optimization formulation for sparse regression and compressed sensing, called CLOT (Combined L-One and Two), wherein the regularizer is a convex combination of the $\ell_1$- and $\ell_2$-norms. This formulation differs from the Elastic Net (EN) formulation, in which the regularizer is a convex combination of the $\ell_1$- and $\ell_2$-norm squared. It is shown that, in the context of compressed sensing, the EN formulation does not achieve robust recovery of sparse vectors, whereas the new CLOT formulation achieves robust recovery. Also, like EN but unlike LASSO, the CLOT formulation achieves the grouping effect, wherein coefficients of highly correlated columns of the measurement (or design) matrix are assigned roughly comparable values. It is already known LASSO does not have the grouping effect. Therefore the CLOT formulation combines the best features of both LASSO (robust sparse recovery) and EN (grouping effect). The CLOT formulation is a special case of another one called SGL (Sparse Group LASSO) which was introduced into the literature previously, but without any analysis of either the grouping effect or robust sparse recovery. It is shown here that SGL achieves robust sparse recovery, and also achieves a version of the grouping effect in that coefficients of highly correlated columns belonging to the same group of the measurement (or design) matrix are assigned roughly comparable values.
Open AccessTwo New Approaches to Compressed Sensing Exhibiting Both Robust Sparse Recovery and the Grouping Effect
In this paper we introduce a new optimization formulation for sparse regression and compressed sensing, called CLOT (Combined L-One and Two), wherein the regularizer is a convex combination of the $\ell_1$- and $\ell_2$-norms. This formulation differs from the Elastic Net (EN) formulation, in which the regularizer is a convex combination of the $\ell_1$- and $\ell_2$-norm squared. It is shown that, in the context of compressed sensing, the EN formulation does not achieve robust recovery of sparse vectors, whereas the new CLOT formulation achieves robust recovery. Also, like EN but unlike LASSO, the CLOT formulation achieves the grouping effect, wherein coefficients of highly correlated columns of the measurement (or design) matrix are assigned roughly comparable values. It is already known LASSO does not have the grouping effect. Therefore the CLOT formulation combines the best features of both LASSO (robust sparse recovery) and EN (grouping effect). The CLOT formulation is a special case of another one called SGL (Sparse Group LASSO) which was introduced into the literature previously, but without any analysis of either the grouping effect or robust sparse recovery. It is shown here that SGL achieves robust sparse recovery, and also achieves a version of the grouping effect in that coefficients of highly correlated columns belonging to the same group of the measurement (or design) matrix are assigned roughly comparable values.
- Open Access
- 27 March 2017
- Published by Springer Nature in BMC Genomics
- Vol. 18 (S3) , 233
Sparse feature selection for classification and prediction of metastasis in endometrial cancer
Metastasis via pelvic and/or para-aortic lymph nodes is a major risk factor for endometrial cancer. Lymph-node resection ameliorates risk but is associated with significant co-morbidities. Incidence in patients with stage I disease is 4–22% but no mechanism exists to accurately predict it. Therefore, national guidelines for primary staging surgery include pelvic and para-aortic lymph node dissection for all patients whose tumor exceeds 2cm in diameter. We sought to identify a robust molecular signature that can accurately classify risk of lymph node metastasis in endometrial cancer patients. 86 tumors matched for age and race, and evenly distributed between lymph node-positive and lymph node-negative cases, were selected as a training cohort. Genomic micro-RNA expression was profiled for each sample to serve as the predictive feature matrix. An independent set of 28 tumor samples was collected and similarly characterized to serve as a test cohort. A feature selection algorithm was designed for applications where the number of samples is far smaller than the number of measured features per sample. A predictive miRNA expression signature was developed using this algorithm, which was then used to predict the metastatic status of the independent test cohort. A weighted classifier, using 18 micro-RNAs, achieved 100% accuracy on the training cohort. When applied to the testing cohort, the classifier correctly predicted 90% of node-positive cases, and 80% of node-negative cases (FDR = 6.25%). Results indicate that the evaluation of the quantitative sparse-feature classifier proposed here in clinical trials may lead to significant improvement in the prediction of lymphatic metastases in endometrial cancer patients.
- 27 March 2017
- Published by Springer Nature in BMC Genomics
- Vol. 18 (S3) , 233
Open AccessSparse feature selection for classification and prediction of metastasis in endometrial cancer
Metastasis via pelvic and/or para-aortic lymph nodes is a major risk factor for endometrial cancer. Lymph-node resection ameliorates risk but is associated with significant co-morbidities. Incidence in patients with stage I disease is 4–22% but no mechanism exists to accurately predict it. Therefore, national guidelines for primary staging surgery include pelvic and para-aortic lymph node dissection for all patients whose tumor exceeds 2cm in diameter. We sought to identify a robust molecular signature that can accurately classify risk of lymph node metastasis in endometrial cancer patients. 86 tumors matched for age and race, and evenly distributed between lymph node-positive and lymph node-negative cases, were selected as a training cohort. Genomic micro-RNA expression was profiled for each sample to serve as the predictive feature matrix. An independent set of 28 tumor samples was collected and similarly characterized to serve as a test cohort. A feature selection algorithm was designed for applications where the number of samples is far smaller than the number of measured features per sample. A predictive miRNA expression signature was developed using this algorithm, which was then used to predict the metastatic status of the independent test cohort. A weighted classifier, using 18 micro-RNAs, achieved 100% accuracy on the training cohort. When applied to the testing cohort, the classifier correctly predicted 90% of node-positive cases, and 80% of node-negative cases (FDR = 6.25%). Results indicate that the evaluation of the quantitative sparse-feature classifier proposed here in clinical trials may lead to significant improvement in the prediction of lymphatic metastases in endometrial cancer patients.
- Open Access
Continuous Hands-off Control by CLOT Norm Minimization
In this paper, we consider hands-off control via minimization of the CLOT (Combined L-One and Two) norm. The maximum hands-off control is the L0-optimal (or the sparsest) control among all feasible controls that are bounded by a specified value and transfer the state from a given initial state to the origin within a fixed time duration. In general, the maximum hands-off control is a bang-off-bang control taking values of +1, -1, and 0. For many real applications, such discontinuity in the control is not desirable. To obtain a continuous but still relatively sparse control, we propose to use the CLOT norm, a convex combination of L1 and L2 norms. We show by numerical simulation that the CLOT control is continuous and much sparser (i.e. has longer time duration on which the control takes 0) than the conventional EN (elastic net) control, which is a convex combination of L1 and squared L2 norms.
Open AccessContinuous Hands-off Control by CLOT Norm Minimization
In this paper, we consider hands-off control via minimization of the CLOT (Combined L-One and Two) norm. The maximum hands-off control is the L0-optimal (or the sparsest) control among all feasible controls that are bounded by a specified value and transfer the state from a given initial state to the origin within a fixed time duration. In general, the maximum hands-off control is a bang-off-bang control taking values of +1, -1, and 0. For many real applications, such discontinuity in the control is not desirable. To obtain a continuous but still relatively sparse control, we propose to use the CLOT norm, a convex combination of L1 and L2 norms. We show by numerical simulation that the CLOT control is continuous and much sparser (i.e. has longer time duration on which the control takes 0) than the conventional EN (elastic net) control, which is a convex combination of L1 and squared L2 norms.
- Open Access
Reverse Engineering Gene Interaction Networks Using the Phi-Mixing Coefficient
Constructing gene interaction networks (GINs) from high-throughput gene expression data is an important and challenging problem in systems biology. Existing algorithms produce networks that either have undirected and unweighted edges, or else are constrained to contain no cycles, both of which are biologically unrealistic. In the present paper we propose a new algorithm, based on a concept from probability theory known as the phi-mixing coefficient, that produces networks whose edges are weighted and directed, and are permitted to contain cycles. Because there is no "ground truth" for genome-wide networks on a human scale, we analyzed the outcomes of several experiments on lung cancer, and matched the predictions from the inferred networks with experimental results. Specifically, we inferred three networks (NSCLC, Neuro-endocrine NSCLC plus SCLC, and normal) from the gene expression measurements of 157 lung cancer and 59 normal cell lines, compared with the outcomes of siRNA screening of 19,000+ genes on 11 NSCLC cell lines, and analyzed data from a ChIP-Seq experiment to determine putative downstream targets of the lineage specific oncogenic transcription factor ASCL1. The inferred networks displayed a scale-free or power law behavior between the degree of a node and the number of nodes with that degree. There was a strong correlation between the degree of a gene in the inferred NSCLC network and its essentiality for the survival of the cells. The inferred downstream neighborhood genes of ASCL1 in the SCLC network were significantly enriched by ChIP-Seq determined putative target genes, while no such enrichment was found in the inferred NSCLC network.
Open AccessReverse Engineering Gene Interaction Networks Using the Phi-Mixing Coefficient
Constructing gene interaction networks (GINs) from high-throughput gene expression data is an important and challenging problem in systems biology. Existing algorithms produce networks that either have undirected and unweighted edges, or else are constrained to contain no cycles, both of which are biologically unrealistic. In the present paper we propose a new algorithm, based on a concept from probability theory known as the phi-mixing coefficient, that produces networks whose edges are weighted and directed, and are permitted to contain cycles. Because there is no "ground truth" for genome-wide networks on a human scale, we analyzed the outcomes of several experiments on lung cancer, and matched the predictions from the inferred networks with experimental results. Specifically, we inferred three networks (NSCLC, Neuro-endocrine NSCLC plus SCLC, and normal) from the gene expression measurements of 157 lung cancer and 59 normal cell lines, compared with the outcomes of siRNA screening of 19,000+ genes on 11 NSCLC cell lines, and analyzed data from a ChIP-Seq experiment to determine putative downstream targets of the lineage specific oncogenic transcription factor ASCL1. The inferred networks displayed a scale-free or power law behavior between the degree of a node and the number of nodes with that degree. There was a strong correlation between the degree of a gene in the inferred NSCLC network and its essentiality for the survival of the cells. The inferred downstream neighborhood genes of ASCL1 in the SCLC network were significantly enriched by ChIP-Seq determined putative target genes, while no such enrichment was found in the inferred NSCLC network.
- 1 January 2016
- Published by Springer Nature
- p. 455-465
Modeling Extreme Events Using Heavy-Tailed Distributions
- 1 January 2016
- Published by Springer Nature
- p. 455-465
Modeling Extreme Events Using Heavy-Tailed Distributions
- Open Access
Error Bounds for Compressed Sensing Algorithms With Group Sparsity: A Unified Approach
In compressed sensing, in order to recover a sparse or nearly sparse vector from possibly noisy measurements, the most popular approach is $\ell_1$-norm minimization. Upper bounds for the $\ell_2$- norm of the error between the true and estimated vectors are given in [1] and reviewed in [2], while bounds for the $\ell_1$-norm are given in [3]. When the unknown vector is not conventionally sparse but is "group sparse" instead, a variety of alternatives to the $\ell_1$-norm have been proposed in the literature, including the group LASSO, sparse group LASSO, and group LASSO with tree structured overlapping groups. However, no error bounds are available for any of these modified objective functions. In the present paper, a unified approach is presented for deriving upper bounds on the error between the true vector and its approximation, based on the notion of decomposable and $\gamma$-decomposable norms. The bounds presented cover all of the norms mentioned above, and also provide a guideline for choosing norms in future to accommodate alternate forms of sparsity.
Open AccessError Bounds for Compressed Sensing Algorithms With Group Sparsity: A Unified Approach
In compressed sensing, in order to recover a sparse or nearly sparse vector from possibly noisy measurements, the most popular approach is $\ell_1$-norm minimization. Upper bounds for the $\ell_2$- norm of the error between the true and estimated vectors are given in [1] and reviewed in [2], while bounds for the $\ell_1$-norm are given in [3]. When the unknown vector is not conventionally sparse but is "group sparse" instead, a variety of alternatives to the $\ell_1$-norm have been proposed in the literature, including the group LASSO, sparse group LASSO, and group LASSO with tree structured overlapping groups. However, no error bounds are available for any of these modified objective functions. In the present paper, a unified approach is presented for deriving upper bounds on the error between the true vector and its approximation, based on the notion of decomposable and $\gamma$-decomposable norms. The bounds presented cover all of the norms mentioned above, and also provide a guideline for choosing norms in future to accommodate alternate forms of sparsity.
- 21 July 2015
- Published by Springer Nature
- p. 628-631
Learning Theory
- 6 January 2015
- Published by Annual Reviews in Annual Review of Pharmacology and Toxicology
- Vol. 55 (1) , 15-34
Identifying Predictive Features in Drug Response Using Machine Learning: Opportunities and Challenges
This article reviews several techniques from machine learning that can be used to study the problem of identifying a small number of features, from among tens of thousands of measured features, that can accurately predict a drug response. Prediction problems are divided into two categories: sparse classification and sparse regression. In classification, the clinical parameter to be predicted is binary, whereas in regression, the parameter is a real number. Well-known methods for both classes of problems are briefly discussed. These include the SVM (support vector machine) for classification and various algorithms such as ridge regression, LASSO (least absolute shrinkage and selection operator), and EN (elastic net) for regression. In addition, several well-established methods that do not directly fall into machine learning theory are also reviewed, including neural networks, PAM (pattern analysis for microarrays), SAM (significance analysis for microarrays), GSEA (gene set enrichment analysis), and k-means clustering. Several references indicative of the application of these methods to cancer biology are discussed.
- 6 January 2015
- Published by Annual Reviews in Annual Review of Pharmacology and Toxicology
- Vol. 55 (1) , 15-34
Identifying Predictive Features in Drug Response Using Machine Learning: Opportunities and Challenges
This article reviews several techniques from machine learning that can be used to study the problem of identifying a small number of features, from among tens of thousands of measured features, that can accurately predict a drug response. Prediction problems are divided into two categories: sparse classification and sparse regression. In classification, the clinical parameter to be predicted is binary, whereas in regression, the parameter is a real number. Well-known methods for both classes of problems are briefly discussed. These include the SVM (support vector machine) for classification and various algorithms such as ridge regression, LASSO (least absolute shrinkage and selection operator), and EN (elastic net) for regression. In addition, several well-established methods that do not directly fall into machine learning theory are also reviewed, including neural networks, PAM (pattern analysis for microarrays), SAM (significance analysis for microarrays), GSEA (gene set enrichment analysis), and k-means clustering. Several references indicative of the application of these methods to cancer biology are discussed.