Papers for

neuroimaging analysts

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Separating signals needs enough varied environments and samples

Separation Is a Riesz Energy: How Many Environments Does ICA Need?

Abstract: Can independent components be recovered when all of them are Gaussian? Yes, if their variances change across environments; but how many environments, and how many samples as the number of components $d$ grows? We answer both for the joint diagonalization of $K$ covariances. Each component has a signature, its variances across the environments. Separating component $j$ costs the Riesz 2-energy $E_j$ of this signature, a sum, over the other components, of inverse pairwise Fisher informations. For Gaussian sources no estimator in $O(d)$ beats $cE_j/(n+E_j)$ at any $n$ and $d$, and above an explicit sample size a spectral estimator attains $E_j/n$ up to a constant, for every mixing and without the signatures (given a lower bound on the pairwise information). Since signatures live in $K-1$ dimensions, the rate obeys a dimension law: $d^2/n$, $d\log d/n$ and $d/n$ for $K=2$, $3$ and $K\ge4$ well-spread environments. What counts is the dimension the signatures span, not their number, and $\log d$ well-designed environments make $d\log d$ samples suffice. Projecting the covariances onto one linear combination pays $d^2/n$ at first order instead. In simulations up to $d=1000$ the predictions hold and joint diagonalization with $K\ge4$ attains the rate once $n/d$ is in the hundreds; on task fMRI the energy says which components are hard to separate.

Wed 4 NovMachine LearningInformation Theory
The gist
Some signals can be hidden inside mixtures of many noises, and how well we can separate them depends on how their strengths vary in different situations called environments. The authors show exactly how many different environments and how many data samples we need as the number of hidden signals grows. They introduce a way to measure the difficulty of separating each signal based on how different its strengths are across environments and prove that with enough well-designed environments, fewer samples are needed. They also test their findings on large simulated data and brain scan data to show it predicts which signals are easy or hard to separate.
Open → 2611.06228v1

Brain connectivity method reveals excitatory and inhibitory links

Identifiable Signed Causal Learning via Latent Stochastic Differential Equations for Inferring Brain Dynamic Effective Connectivity

Abstract: Understanding how brain regions interact to support cognitive tasks requires characterizing directed causal influences among them, known as effective connectivity (EC). As inter-regional coupling changes over time, a dynamic EC (dEC) estimate is required to track this temporal variation. Existing dEC learning methods typically lack a causal rationality guarantee or an identifiability analysis, and output unsigned connectivity that cannot distinguish excitatory from inhibitory influences, which limits further study of brain mechanisms. We propose ISCL, a latent stochastic differential equation framework that derives dEC from latent dynamics through a causal influence operator defined in observation space. As established by a rationality theorem, the operator captures a directed interventional response at each brain state, and under invariance assumptions the operator is identifiable from data, with its signed output separating excitatory from inhibitory influences. On synthetic benchmarks, \model recovers the causal structure on Lorenz96 and achieves the lowest mean structural Hamming distance among compared methods on NetSim, while preserving signed influence structures that distinguish excitatory from inhibitory interactions. Applied to HCP Social Cognition task-fMRI, ISCL reveals a signed architecture whose stability across seeds supports the identifiability guarantee, identifies dominant source and target networks consistent with social-cognition systems, and shows that condition-specific training strengthens causal outflow from the default-mode and frontoparietal networks during theory-of-mind processing. In this task, the recovered signed structure reveals network-level excitatory and inhibitory organization, with the dorsal-attention network as the only consistently positive out-strength source.

Mon 2 NovMachine Learning
The gist
Understanding how different parts of the brain influence each other is important for studying how we think and behave. The authors created a new method called ISCL that can track how brain connections change over time and tell whether those connections excite or inhibit other areas. This method is more accurate and shows clear cause-and-effect links in brain activity. When tested on brain imaging data from a social cognition task, ISCL identified specific brain networks involved and how they interact positively or negatively during thinking about others.
Open → 2611.02876v1

Self-supervised learning aligns brain scans across people for image decoding

Latent Prediction Yields Cross-Subject Alignable Representations in Sensory-Evoked fMRI

Abstract: Decoding sensory-evoked functional magnetic resonance imaging (fMRI) data is a central analytical tool in cognitive neuroscience. Here we ask whether self-supervised learning (SSL), which has been scarcely explored in this domain, can yield representations that support strong downstream performance. To do so, we adapt a joint embedding predictive architecture (JEPA) to train participant-specific encoders on brain data alone. The encoders never see the stimulus images or any representation derived from them. Applied to the Natural Scenes Dataset (NSD), we evaluate our learned brain embeddings on the downstream tasks of brain captioning and image reconstruction, as well as cross-participant generalization. Our self-supervised approach achieves competitive performance with parameter-rich supervised pipelines that are trained end-to-end with access to image and language data. We further find that encoders trained independently for different participants can be aligned fully unsupervised, using neither images nor stimuli shared between them. After alignment, a neural decoding head trained on one participant can be applied to another without fine-tuning and retains most of its within-subject performance on image reconstruction and brain captioning. By removing the need for images and shared stimuli, our approach is a step towards pooling fMRI data across participants and, eventually, across datasets.

Thu 29 OctMachine LearningArtificial Intelligence
The gist
Brain scans can show how people see images, but comparing scans from different people is hard. The authors use a method called self-supervised learning that trains brain scan models without using the actual images shown to people. Their approach creates brain data representations that work well to describe and recreate images from scans. Remarkably, models trained on one person’s brain data can be matched to another person’s data without shared images, allowing decoding tools to work across individuals.
Open → 2610.40280v1

Pairwise neural networks predict brain traits from limited MRI data

Inferring continuous cognitive traits from limited neuroimaging data using pairwise convolutional neural networks

Abstract: Individual differences in cognitive abilities vary widely, yet the structural brain features supporting these differences remain poorly understood. Traditional brain-behavior analyses rely on predefined metrics such as volume or cortical thickness and typically assume linear relationships with behavior, limiting sensitivity in small datasets. Here, we introduce a pairwise convolutional ranking framework that learns directly from whole-brain T1-weighted MRI by making comparative rather than absolute predictions, which performs well even with small samples (N=108). We tested this method with four small-scale spatial abilities tasks. Regression analysis predicted performance with high accuracy across all tasks, achieving greater predictive power over standard regression and pointwise deep learning baselines. Iterative cortical-region removal (backward elimination) revealed brain regions supporting individual performance common to all four tasks, as well as task-specific regions. These results demonstrate that pairwise learning extracts meaningful behavioral information from structural MRI, providing prediction and interpretable insight into the neuroanatomy of individual differences.

Tue 20 OctArtificial IntelligenceComputer Vision and Pattern RecognitionMachine Learning
The gist
People's cognitive skills differ a lot, but it's hard to connect these differences to brain pictures using traditional methods, especially when you don't have many brain scans. The authors developed a new computer method that looks at pairs of brain images and compares them, instead of just looking at one at a time. This approach works well even with a small number of MRI brain scans and can predict how well someone performs on certain thinking tasks. It also helps identify which brain areas are important for those tasks.
Open → 2610.27668v1

Joint learning finds task-focused graphs for better data analysis

Joint Precision Neural Networks: Task-Aware Dependency and Predictive Learning

Abstract: Exploiting meaningful latent structures from data to solve downstream tasks is a fundamental challenge in signal processing and machine learning. While Principal Component Analysis (PCA) and coVariance Neural Networks (VNNs) successfully leverage the covariance matrix to process data, they inherently capture both direct and indirect correlations. The precision matrix (inverse covariance) overcomes this by explicitly encoding conditional independencies, making it largely studied in graphical lasso and graph topology identification. However, finite-sample precision estimates are notoriously unstable, and regularized estimators remain task-agnostic. In this work, our principal contribution is tackling the challenging problem of task-aware graph inference. We propose Precision Neural Networks-Joint (PNN-Joint), a framework that jointly estimates a sparse, statistically grounded precision matrix alongside graph neural network weights via an alternating optimization scheme. As a foundational framework to support this, we introduce Precision Neural Networks (PNNs), a broader class of graph convolutional networks operating on precision estimators, and establish their spectral connections to PCA and VNNs alongside their stability to finite-sample errors. Extensive empirical evaluations on synthetic data, as well as real-world neuroimaging and motion sensor datasets, demonstrate that PNN-Joint yields highly interpretable task-aware graphs, exhibits remarkable robustness in low-data regimes, and consistently achieves the best or second-best performance among competitors on real-world tasks.

Mon 5 OctMachine Learning
The gist
Data often contains hidden connections hard to find with usual methods. The authors propose a way to learn these connections while keeping the main goal, or task, in mind, improving accuracy. They developed a new type of neural network called Precision Neural Networks that work on special matrices representing direct dependencies. Their method works well even with small datasets and produces understandable connection patterns in brain scans and motion data.
Open → 2610.06023v1

Functional neural network models brain imaging patterns on curved matrix space

Geometric Feature Learning for Functional Data Valued on the Symmetric Positive Definite Manifold

Abstract: We here develop a functional neural network, termed MatFAE, for learning trajectories on the Riemannian manifold of symmetric positive definite (SPD) matrices. MatFAE features intrinsic layers that map manifold-valued functions to Euclidean vector-valued functions, followed by a functional layer that projects them into a finite-dimensional Euclidean space. Unlike most neural networks for discrete-time sequences, MatFAE treats each sequence as a continuous function and can therefore encode trajectory dynamics (e.g., first-order derivatives) in its latent representations. Additionally, the morphology of the functional weights in the functional layer offers interpretability by revealing the regions of the input functional data that contribute most to the latent representations. We justify the design principles and properties of each intrinsic layer and detail how matrix factorization is handled during backpropagation. We apply MatFAE to a range of fMRI datasets, demonstrating its ability to efficiently learn informative representations from high-dimensional SPD trajectories and its practical value for real-world neuroimaging analysis.

Thu 24 SeptMachine Learning
The gist
The paper develops a special kind of neural network called MatFAE that learns from data which changes smoothly over time and lives on a curved space of matrices called SPD matrices. Unlike usual methods that see data as discrete points, MatFAE treats data as continuous functions, capturing how they evolve and revealing important parts of the data. The authors show how this method can analyze complex brain imaging data to find useful representations for further study in neuroscience.
Open → 2609.30487v1