1
|
Huang W, Shan H, Xu J, Yao X. Adaptive Diffusion Pairwise Fused Lasso LMS Algorithm Over Networks. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 2023; 34:5816-5827. [PMID: 34890340 DOI: 10.1109/tnnls.2021.3131335] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/13/2023]
Abstract
The topic of identification for sparse vector in a distributed way has triggered great interest in the area of adaptive filtering. Grouping components in the sparse vector has been validated to be an efficient way for enhancing identification performance for sparse parameter. The technique of pairwise fused lasso, which can promote similarity between each possible pair of nonnegligible components in the sparse vector, does not require that the nonnegligible components have to be distributed in one or multiple clusters. In other words, the nonnegligible components may be randomly scattered in the unknown sparse vector. In this article, based on the technique of pairwise fused lasso, we propose the novel pairwise fused lasso diffusion least mean-square (PFL-DLMS) algorithm, to identify sparse vector. The objective function we construct consists of three terms, i.e., the mean-square error (MSE) term, the regularizing term promoting the sparsity of all components, and the regularizing term promoting the sparsity of difference between each pair of components in the unknown sparse vector. After investigating mean stability condition of mean-square behavior in theoretical analysis, we propose the strategy of variable regularizing coefficients to overcome the difficulty that the optimal regularizing coefficients are usually unknown. Finally, numerical experiments are conducted to verify the effectiveness of the PFL-DLMS algorithm in identifying and tracking sparse parameter vector.
Collapse
|
2
|
Coordinate descent algorithm of generalized fused Lasso logistic regression for multivariate trend filtering. JAPANESE JOURNAL OF STATISTICS AND DATA SCIENCE 2022. [DOI: 10.1007/s42081-022-00162-2] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/18/2022]
|
3
|
Brzyski D, Karas M, Ances BM, Dzemidzic M, Goñi J, Randolph TW, Harezlak J. Connectivity-informed adaptive regularization for generalized outcomes. CAN J STAT 2021; 49:203-227. [PMID: 35002039 DOI: 10.1002/cjs.11606] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/07/2022]
Abstract
One of the challenging problems in neuroimaging is the principled incorporation of information from different imaging modalities. Data from each modality are frequently analyzed separately using, for instance, dimensionality reduction techniques, which result in a loss of mutual information. We propose a novel regularization method, generalized ridgified Partially Empirical Eigenvectors for Regression (griPEER), to estimate associations between the brain structure features and a scalar outcome within the generalized linear regression framework. griPEER improves the regression coefficient estimation by providing a principled approach to use external information from the structural brain connectivity. Specifically, we incorporate a penalty term, derived from the structural connectivity Laplacian matrix, in the penalized generalized linear regression. In this work, we address both theoretical and computational issues and demonstrate the robustness of our method despite incomplete information about the structural brain connectivity. In addition, we also provide a significance testing procedure for performing inference on the estimated coefficients. Finally, griPEER is evaluated both in extensive simulation studies and using clinical data to classify HIV+ and HIV- individuals.
Collapse
Affiliation(s)
- Damian Brzyski
- Department of Mathematics, Wrocław University of Science and Technology, Wrocław, 50-372, Poland
| | - Marta Karas
- Department of Biostatistics, Johns Hopkins Bloomberg School of Public Health, Baltimore, MD, 21205, USA
| | - Beau M Ances
- Department of Neurology, Washington University School of Medicine, St. Louis, MO, 63110, USA
| | - Mario Dzemidzic
- Department of Neurology, Indiana University School of Medicine, Indianapolis, IN, 46202, USA
| | - Joaquín Goñi
- School of Industrial Engineering, Purdue University, West Lafayette, IN, 47907, USA
| | - Timothy W Randolph
- Biostatistics Program Public Health Sciences Division, Fred Hutchinson Cancer Research Center, Seattle, WA, 98109, USA
| | - Jaroslaw Harezlak
- Department of Epidemiology and Biostatistics, Indiana University, Bloomington, IN, 47405, USA
- Department of Mathematics, University of Wrocław, Wrocław, 50-383, Poland
| |
Collapse
|
4
|
Wang M, Lang C, Liang L, Feng S, Wang T, Gao Y. End-to-End Text-to-Image Synthesis with Spatial Constrains. ACM T INTEL SYST TEC 2020. [DOI: 10.1145/3391709] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/24/2022]
Abstract
Although the performance of automatically generating high-resolution realistic images from text descriptions has been significantly boosted, many challenging issues in image synthesis have not been fully investigated, due to shapes variations, viewpoint changes, pose changes, and the relations of multiple objects. In this article, we propose a novel end-to-end approach for text-to-image synthesis with spatial constraints by mining object spatial location and shape information. Instead of learning a hierarchical mapping from text to image, our algorithm directly generates multi-object fine-grained images through the guidance of the generated semantic layouts. By fusing text semantic and spatial information into a synthesis module and jointly fine-tuning them with multi-scale semantic layouts generated, the proposed networks show impressive performance in text-to-image synthesis for complex scenes. We evaluate our method both on single-object CUB dataset and multi-object MS-COCO dataset. Comprehensive experimental results demonstrate that our method significantly outperforms the state-of-the-art approaches consistently across different evaluation metrics.
Collapse
Affiliation(s)
- Min Wang
- Beijing Jiaotong University, Beijing, China
| | | | | | | | - Tao Wang
- Beijing Jiaotong University, Beijing, China
| | - Yutong Gao
- Beijing Jiaotong University, Beijing, China
| |
Collapse
|
5
|
Zille P, Calhoun VD, Wang YP. Enforcing Co-Expression Within a Brain-Imaging Genomics Regression Framework. IEEE TRANSACTIONS ON MEDICAL IMAGING 2018; 37:2561-2571. [PMID: 28678703 PMCID: PMC6415768 DOI: 10.1109/tmi.2017.2721301] [Citation(s) in RCA: 18] [Impact Index Per Article: 3.0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Grants] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/20/2023]
Abstract
Among the challenges arising in brain imaging genetic studies, estimating the potential links between neurological and genetic variability within a population is key. In this paper, we propose a multivariate, multimodal formulation for variable selection that leverages co-expression patterns across various data modalities. Our approach is based on an intuitive combination of two widely used statistical models: sparse regression and canonical correlation analysis (CCA). While the former seeks multivariate linear relationships between a given phenotype and associated observations, the latter searches to extract co-expression patterns between sets of variables belonging to different modalities. In the following, we propose to rely on a "CCA-type" formulation in order to regularize the classical multimodal sparse regression problem (essentially incorporating both CCA and regression models within a unified formulation). The underlying motivation is to extract discriminative variables that are also co-expressed across modalities. We first show that the simplest formulation of such model can be expressed as a special case of collaborative learning methods. After discussing its limitation, we propose an extended, more flexible formulation, and introduce a simple and efficient alternating minimization algorithm to solve the associated optimization problem. We explore the parameter space and provide some guidelines regarding parameter selection. Both the original and extended versions are then compared on a simple toy data set and a more advanced simulated imaging genomics data set in order to illustrate the benefits of the latter. Finally, we validate the proposed formulation using single nucleotide polymorphisms data and functional magnetic resonance imaging data from a population of adolescents ( subjects, age 16.9 ± 1.9 years from the Philadelphia Neurodevelopmental Cohort) for the study of learning ability. Furthermore, we carry out a significance analysis of the resulting features that allow us to carefully extract brain regions and genes linked to learning and cognitive ability.
Collapse
|
6
|
Gong W, Zhao R, Grünewald S. Structured sparse K-means clustering via Laplacian smoothing. Pattern Recognit Lett 2018. [DOI: 10.1016/j.patrec.2018.06.006] [Citation(s) in RCA: 8] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/16/2022]
|
7
|
Sun Z, Qiao Y, Lelieveldt BPF, Staring M. Integrating spatial-anatomical regularization and structure sparsity into SVM: Improving interpretation of Alzheimer's disease classification. Neuroimage 2018; 178:445-460. [DOI: 10.1016/j.neuroimage.2018.05.051] [Citation(s) in RCA: 34] [Impact Index Per Article: 5.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 02/14/2018] [Revised: 04/10/2018] [Accepted: 05/21/2018] [Indexed: 12/21/2022] Open
Affiliation(s)
- Zhuo Sun
- Division of Image Processing, Department of Radiology, Leiden University Medical Center, 2300, RC, Leiden, The Netherlands
| | - Yuchuan Qiao
- Division of Image Processing, Department of Radiology, Leiden University Medical Center, 2300, RC, Leiden, The Netherlands
| | - Boudewijn P F Lelieveldt
- Division of Image Processing, Department of Radiology, Leiden University Medical Center, 2300, RC, Leiden, The Netherlands; Intelligent System Group, Faculty of EEMCS, Delft University of Technology, 2600, GA, Delft, The Netherlands
| | - Marius Staring
- Division of Image Processing, Department of Radiology, Leiden University Medical Center, 2300, RC, Leiden, The Netherlands; Intelligent System Group, Faculty of EEMCS, Delft University of Technology, 2600, GA, Delft, The Netherlands.
| | | |
Collapse
|
8
|
Feature Selection and Transfer Learning for Alzheimer’s Disease Clinical Diagnosis. APPLIED SCIENCES-BASEL 2018. [DOI: 10.3390/app8081372] [Citation(s) in RCA: 25] [Impact Index Per Article: 4.2] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/16/2022]
Abstract
Background and Purpose: A majority studies on diagnosis of Alzheimer’s Disease (AD) are based on an assumption: the training and testing data are drawn from the same distribution. However, in the diagnosis of AD and mild cognitive impairment (MCI), this identical-distribution assumption may not hold. To solve this problem, we utilize the transfer learning method into the diagnosis of AD. Methods: The MR (Magnetic Resonance) images were segmented using spm-Dartel toolbox and registrated with Automatic Anatomical Labeling (AAL) atlas, then the gray matter (GM) tissue volume of the anatomical region were computed as characteristic parameter. The information gain was introduced for feature selection. The TrAdaboost algorithm was used to classify AD, MCI, and normal controls (NC) data from Alzheimer’s Disease Neuroimaging Initiative (ADNI) database, meanwhile, the “knowledge” learned from ADNI was transferred to AD samples from local hospital. The classification accuracy, sensitivity and specificity were calculated and compared with four classical algorithms. Results: In the experiment of transfer task: AD to MCI, 177 AD and 40NC subjects were grouped as training data; 245 MCI and 45 remaining NC subjects were combined as testing data, the highest accuracy achieved 85.4%, higher than the other four classical algorithms. Meanwhile, feature selection that is based on information gain reduced the features from 90 to 7, controlled the redundancy efficiently. In the experiment of transfer task: ADNI to local hospital data, the highest accuracy achieved 93.7%, and the specificity achieved 100%. Conclusions: The experimental results showed that our algorithm has a clear advantage over classic classification methods with higher accuracy and less fluctuation.
Collapse
|
9
|
Cao P, Liu X, Liu H, Yang J, Zhao D, Huang M, Zaiane O. Generalized fused group lasso regularized multi-task feature learning for predicting cognitive outcomes in Alzheimers disease. COMPUTER METHODS AND PROGRAMS IN BIOMEDICINE 2018; 162:19-45. [PMID: 29903486 DOI: 10.1016/j.cmpb.2018.04.028] [Citation(s) in RCA: 13] [Impact Index Per Article: 2.2] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Received: 09/28/2017] [Revised: 03/19/2018] [Accepted: 04/30/2018] [Indexed: 06/08/2023]
Abstract
OBJECTIVE Alzheimers disease (AD) is characterized by gradual neurodegeneration and loss of brain function, especially for memory during early stages. Regression analysis has been widely applied to AD research to relate clinical and biomarker data such as predicting cognitive outcomes from Magnetic Resonance Imaging (MRI) measures. Recently, the multi-task feature learning (MTFL) methods have been widely studied to predict cognitive outcomes and select the discriminative feature subset from MRI features by incorporating inherent correlations among multiple clinical cognitive measures. However, the existing MTFL assumes the correlation among all the tasks is uniform, and the task relatedness is modeled by encouraging a common subset of features with neglecting the inherent structure of tasks and MRI features. METHODS In this paper, we proposed a generalized fused group lasso (GFGL) regularization to model the underlying structures, involving (1) a graph structure within tasks and (2) a group structure among the image features. Then, we present a multi-task learning framework (called GFGL-MTFL), combining the ℓ2, 1-norm with the GFGL regularization, to model the flexible structures. RESULTS Through empirical evaluation and comparison with different baseline methods and the state-of-the-art MTL methods on data from Alzheimer's Disease Neuroimaging Initiative (ADNI) database, we illustrate that the proposed GFGL-MTFL method outperforms other methods in terms of both Mean Squared Error (nMSE) and weighted correlation coefficient (wR). Improvements are statistically significant for most scores (tasks). CONCLUSIONS The experimental results with real and synthetic data demonstrate that incorporating the two prior structures by the generalized fused group lasso norm into the multi task feature learning can improve the prediction performance over several state-of-the-art competing methods, and the estimated correlation of the cognitive functions and the identification of cognition relevant imaging markers are clinically and biologically meaningful.
Collapse
Affiliation(s)
- Peng Cao
- Computer Science and Engineering, Northeastern University, Shenyang, China.
| | - Xiaoli Liu
- Computer Science and Engineering, Northeastern University, Shenyang, China
| | - Hezi Liu
- The Third People's Hospital of Fushun, Fushun, China
| | - Jinzhu Yang
- Computer Science and Engineering, Northeastern University, Shenyang, China
| | - Dazhe Zhao
- Computer Science and Engineering, Northeastern University, Shenyang, China
| | - Min Huang
- College of Information Science and Engineering, Northeastern University, Shenyang, China
| | - Osmar Zaiane
- Computing Science, University of Alberta, Edmonton, Alberta, Canada
| |
Collapse
|