Different Algorithms (Might) Uncover Different Patterns: A Brain-Age Prediction Case Study

• URL: http://arxiv.org/abs/2402.09464v1
• Date: Thu, 8 Feb 2024 19:55:07 GMT
• Title: Different Algorithms (Might) Uncover Different Patterns: A Brain-Age Prediction Case Study
• Authors: Tobias Ettling, Sari Saba-Sadiya, Gemma Roig
• Abstract summary: We investigate whether established hypotheses in brain-age prediction from EEG research validate across algorithms. Few of our models achieved state-of-the-art performance on the specific data-set we utilized.
• Score: 8.597209503064128
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Machine learning is a rapidly evolving field with a wide range of applications, including biological signal analysis, where novel algorithms often improve the state-of-the-art. However, robustness to algorithmic variability - measured by different algorithms, consistently uncovering similar findings - is seldom explored. In this paper we investigate whether established hypotheses in brain-age prediction from EEG research validate across algorithms. First, we surveyed literature and identified various features known to be informative for brain-age prediction. We employed diverse feature extraction techniques, processing steps, and models, and utilized the interpretative power of SHapley Additive exPlanations (SHAP) values to align our findings with the existing research in the field. Few of our models achieved state-of-the-art performance on the specific data-set we utilized. Moreover, analysis demonstrated that while most models do uncover similar patterns in the EEG signals, some variability could still be observed. Finally, a few prominent findings could only be validated using specific models. We conclude by suggesting remedies to the potential implications of this lack of robustness to model variability.

Related papers

• Supervised Score-Based Modeling by Gradient Boosting [49.556736252628745]
  We propose a Supervised Score-based Model (SSM) which can be viewed as a gradient boosting algorithm combining score matching. We provide a theoretical analysis of learning and sampling for SSM to balance inference time and prediction accuracy. Our model outperforms existing models in both accuracy and inference time.
  arXiv  Detail & Related papers  (2024-11-02T07:06:53Z)
• Benchmarking Reliability of Deep Learning Models for Pathological Gait Classification [2.1548132286330453]
  Researchers have recently sought to leverage advances in machine learning algorithms to detect symptoms of altered gait. This paper analyzes existing approaches to identify gaps inhibiting translation. We propose our strong baseline called Asynchronous Multi-Stream Graph Convolutional Network (AMS-GCN) that can reliably differentiate multiple categories of pathological gaits.
  arXiv  Detail & Related papers  (2024-09-20T16:47:45Z)
• Seeing Unseen: Discover Novel Biomedical Concepts via Geometry-Constrained Probabilistic Modeling [53.7117640028211]
  We present a geometry-constrained probabilistic modeling treatment to resolve the identified issues. We incorporate a suite of critical geometric properties to impose proper constraints on the layout of constructed embedding space. A spectral graph-theoretic method is devised to estimate the number of potential novel classes.
  arXiv  Detail & Related papers  (2024-03-02T00:56:05Z)
• Can Tree Based Approaches Surpass Deep Learning in Anomaly Detection? A Benchmarking Study [0.6291443816903801]
  This paper evaluates a diverse array of machine learning-based anomaly detection algorithms. The paper contributes significantly by conducting an unbiased comparison of various anomaly detection algorithms.
  arXiv  Detail & Related papers  (2024-02-11T19:12:51Z)
• Incorporating Prior Knowledge in Deep Learning Models via Pathway Activity Autoencoders [5.950889585409067]
  We propose a novel prior-knowledge-based deep auto-encoding framework, PAAE, for RNA-seq data in cancer. We show that, despite having access to a smaller set of features, our PAAE and PAVAE models achieve better out-of-set reconstruction results compared to common methodologies.
  arXiv  Detail & Related papers  (2023-06-09T11:12:55Z)
• Learning to Bound Counterfactual Inference in Structural Causal Models from Observational and Randomised Data [64.96984404868411]
  We derive a likelihood characterisation for the overall data that leads us to extend a previous EM-based algorithm. The new algorithm learns to approximate the (unidentifiability) region of model parameters from such mixed data sources. It delivers interval approximations to counterfactual results, which collapse to points in the identifiable case.
  arXiv  Detail & Related papers  (2022-12-06T12:42:11Z)
• Investigating the Impact of Model Misspecification in Neural Simulation-based Inference [1.933681537640272]
  We study the behaviour of neural SBI algorithms in the presence of various forms of model misspecification. We find that misspecification can have a profoundly deleterious effect on performance. We conclude that new approaches are required to address model misspecification if neural SBI algorithms are to be relied upon to derive accurate conclusions.
  arXiv  Detail & Related papers  (2022-09-05T09:08:16Z)
• A method for comparing multiple imputation techniques: a case study on the U.S. National COVID Cohort Collaborative [1.259457977936316]
  We numerically evaluate strategies for handling missing data in the context of statistical analysis. Our approach could effectively highlight the most valid and performant missing-data handling strategy.
  arXiv  Detail & Related papers  (2022-06-13T19:49:54Z)
• Mixed Effects Neural ODE: A Variational Approximation for Analyzing the Dynamics of Panel Data [50.23363975709122]
  We propose a probabilistic model called ME-NODE to incorporate (fixed + random) mixed effects for analyzing panel data. We show that our model can be derived using smooth approximations of SDEs provided by the Wong-Zakai theorem. We then derive Evidence Based Lower Bounds for ME-NODE, and develop (efficient) training algorithms.
  arXiv  Detail & Related papers  (2022-02-18T22:41:51Z)
• Rethinking Generalization of Neural Models: A Named Entity Recognition Case Study [81.11161697133095]
  We take the NER task as a testbed to analyze the generalization behavior of existing models from different perspectives. Experiments with in-depth analyses diagnose the bottleneck of existing neural NER models. As a by-product of this paper, we have open-sourced a project that involves a comprehensive summary of recent NER papers.
  arXiv  Detail & Related papers  (2020-01-12T04:33:53Z)
• CONSAC: Robust Multi-Model Fitting by Conditional Sample Consensus [62.86856923633923]
  We present a robust estimator for fitting multiple parametric models of the same form to noisy measurements. In contrast to previous works, which resorted to hand-crafted search strategies for multiple model detection, we learn the search strategy from data. For self-supervised learning of the search, we evaluate the proposed algorithm on multi-homography estimation and demonstrate an accuracy that is superior to state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-01-08T17:37:01Z)

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.