Supervised Hyperalignment for multi-subject fMRI data alignment

• URL: http://arxiv.org/abs/2001.02894v1
• Date: Thu, 9 Jan 2020 09:17:49 GMT
• Title: Supervised Hyperalignment for multi-subject fMRI data alignment
• Authors: Muhammad Yousefnezhad, Alessandro Selvitella, Liangxiu Han, Daoqiang Zhang
• Abstract summary: This paper proposes a Supervised Hyperalignment (SHA) method to ensure better functional alignment for MVP analysis. Experiments on multi-subject datasets demonstrate that SHA method achieves up to 19% better performance for multi-class problems.
• Score: 81.8694682249097
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Hyperalignment has been widely employed in Multivariate Pattern (MVP) analysis to discover the cognitive states in the human brains based on multi-subject functional Magnetic Resonance Imaging (fMRI) datasets. Most of the existing HA methods utilized unsupervised approaches, where they only maximized the correlation between the voxels with the same position in the time series. However, these unsupervised solutions may not be optimum for handling the functional alignment in the supervised MVP problems. This paper proposes a Supervised Hyperalignment (SHA) method to ensure better functional alignment for MVP analysis, where the proposed method provides a supervised shared space that can maximize the correlation among the stimuli belonging to the same category and minimize the correlation between distinct categories of stimuli. Further, SHA employs a generalized optimization solution, which generates the shared space and calculates the mapped features in a single iteration, hence with optimum time and space complexities for large datasets. Experiments on multi-subject datasets demonstrate that SHA method achieves up to 19% better performance for multi-class problems over the state-of-the-art HA algorithms.

Related papers

• Bayesian Optimization for Simultaneous Selection of Machine Learning Algorithms and Hyperparameters on Shared Latent Space [16.257223975129513]
  A machine learning (ML) algorithm and its hyper-parameters is crucial for the development of high-performance ML systems. Many existing studies use Bayesian optimization (BO) for accelerating the search. Our proposed method embeds different hyper- parameter spaces into a shared latent space, in which a surrogate multi-task model for BO is estimated. This approach can share information of observations from different ML algorithms by which efficient optimization is expected with a smaller number of total observations.
  arXiv  Detail & Related papers  (2025-02-13T13:43:52Z)
• Combinatorial Optimization Perspective based Framework for Multi-behavior Recommendation [23.26102452699347]
  We propose a novel multi-behavior recommendation framework based on the optimization perspective, named COPF. In the prediction step, we improve both forward and backward propagation during the generation and aggregation of multiple experts. Experiments on three real-world datasets indicate the superiority of COPF.
  arXiv  Detail & Related papers  (2025-02-04T11:19:47Z)
• Generative Subspace Adversarial Active Learning for Outlier Detection in Multiple Views of High-dimensional Data [3.501071975888134]
  We introduce Generative Subspace Adversarial Active Learning (GSAAL) for outlier detection in high-dimensional data. GSAAL is specifically designed to address the MV limitation while also handling the inlier assumption (IA), curse of dimensionality (CD), and multiple views (MV) Our experiments demonstrate the effectiveness and scalability of GSAAL, highlighting its superior performance compared to other popular OD methods.
  arXiv  Detail & Related papers  (2024-04-20T19:22:05Z)
• Mitigating the Alignment Tax of RLHF [76.4300447532456]
  aligning LLMs under Reinforcement Learning with Human Feedback can lead to forgetting pretrained abilities, also known as the alignment tax. We propose model averaging to maximize alignment performance while incurring minimal alignment tax. We validate HMA's performance across a range of RLHF algorithms over OpenLLaMA-3B and further extend our findings to Mistral-7B.
  arXiv  Detail & Related papers  (2023-09-12T14:16:54Z)
• Late Fusion Multi-view Clustering via Global and Local Alignment Maximization [61.89218392703043]
  Multi-view clustering (MVC) optimally integrates complementary information from different views to improve clustering performance. Most of existing approaches directly fuse multiple pre-specified similarities to learn an optimal similarity matrix for clustering. We propose late fusion MVC via alignment to address these issues.
  arXiv  Detail & Related papers  (2022-08-02T01:49:31Z)
• Consistency and Diversity induced Human Motion Segmentation [231.36289425663702]
  We propose a novel Consistency and Diversity induced human Motion (CDMS) algorithm. Our model factorizes the source and target data into distinct multi-layer feature spaces. A multi-mutual learning strategy is carried out to reduce the domain gap between the source and target data.
  arXiv  Detail & Related papers  (2022-02-10T06:23:56Z)
• Shared Space Transfer Learning for analyzing multi-site fMRI data [83.41324371491774]
  Multi-voxel pattern analysis (MVPA) learns predictive models from task-based functional magnetic resonance imaging (fMRI) data. MVPA works best with a well-designed feature set and an adequate sample size. Most fMRI datasets are noisy, high-dimensional, expensive to collect, and with small sample sizes. This paper proposes the Shared Space Transfer Learning (SSTL) as a novel transfer learning approach.
  arXiv  Detail & Related papers  (2020-10-24T08:50:26Z)
• Multi-View Spectral Clustering with High-Order Optimal Neighborhood Laplacian Matrix [57.11971786407279]
  Multi-view spectral clustering can effectively reveal the intrinsic cluster structure among data. This paper proposes a multi-view spectral clustering algorithm that learns a high-order optimal neighborhood Laplacian matrix. Our proposed algorithm generates the optimal Laplacian matrix by searching the neighborhood of the linear combination of both the first-order and high-order base.
  arXiv  Detail & Related papers  (2020-08-31T12:28:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.