Papers for

neuroscience data teams

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.

Causal structures learned from incomplete noisy time series data

Causal Heteroscedastic Structure Learning From Incomplete Temporal data

Abstract: Discovering causal structures in multivariate time series (MTS) is critical in domains such as finance and neuroscience, yet remains challenging in practice due to three distinct obstacles. First, MTS are routinely corrupted by missing values, where naive impute-then-discover pipelines distort the underlying data distribution and yield spurious causal graphs. Second, identifying instantaneous effects is difficult even on complete data, and missingness further entangles imputation with graph recovery. Third, real-world data frequently exhibits heteroscedastic noise with variance driven by both instantaneous and lagged causes, violating the core assumptions of standard discovery methods. Existing approaches fail to address these challenges concurrently, typically presuming complete data, homoscedastic noise, or strictly time-lagged relationships. Crucially, we show through ablation studies that resolving these issues sequentially, rather than jointly, leads to a substantial degradation in performance. To overcome this, we introduce Cheesefill, an optimal transport framework for causal structure learning under missingness and heteroscedastic noise. Cheesefill parameterizes causal mechanisms using conditional normalizing flows and jointly learns a stochastic correction map that refines naive imputations into trajectories consistent with the inferred causal mechanisms. Theoretically, we prove that optimizing over stochastic correction maps is equivalent to a conditional kernel reformulation of the Kantorovich problem, from which our neural parameterization yields a tractable objective. Extensive experiments on synthetic and real-world benchmarks demonstrate that Cheesefill consistently outperforms existing baselines across diverse missingness regimes.

Sat 7 NovMachine LearningArtificial Intelligence
The gist
Finding cause-and-effect relationships in data that changes over time is very important but hard, especially when some data is missing or noisy. The authors show that trying to fix missing data and find causes separately does not work well. They introduce a new method called Cheesefill that fixes missing data while learning the causes at the same time, even when the noise changes in different ways. Their method uses advanced math and neural networks to do this optimally. Tests show Cheesefill works better than previous methods on both fake and real data.
Open → 2611.10668v1

ContactCut improves 3D error correction in brain connectivity maps

ContactCut: A Partition-Aware Contact Selection Framework for False-Merge Correction in Connectomics

Abstract: Localized false-merge correction in connectomics requires converting an identified error into an executable native 3D partition. Still, neither intermediate correction predictions nor seeded graph solvers alone determine which native source-sink constraints should define that partition. We formulate this problem as a 3D-native partition-aware contact selection problem: selecting candidate contacts based on the complete partitions they induce. Our solution comprises two components: ContactCut (CC)-Auto, which uses learned single-contact selection, and ContactCut (CC)-Search, which enables bounded paired-contact search, generates compact alternatives, and applies learned panel ranking. On historical two-way false-merge corrections from MICrONS and FlyWire, CC-Auto improves failure-aware 3D partition (FA-3D Part.) mIoU by 5.9 and 3.4 points over the strongest graph-based controls and by 12.5 and 10.0 points over the best learned baselines. A MICrONS-trained ranker transfers to FlyWire with negligible degradation. CC-Search expands oracle reachability and prioritizes near-oracle alternatives. The code is available at https://github.com/bentake/ContactCut.

Sun 1 NovComputer Vision and Pattern Recognition
The gist
Mapping brain connections accurately is hard because sometimes different neurons get mistakenly merged together. The authors address this problem by focusing on how to select tiny contact points that define where these incorrect merges happen. They created ContactCut, a method that uses learned models to pick these points and identify better partitions in 3D brain maps. Their method works better than previous ones on data from real brain mapping projects and even transfers well between different datasets.
Open → 2611.01457v1

Measuring independence in complex network models with new statistical method

Joint Independence Testing for Latent Position Random Graphs

Abstract: Kernel techniques are among the most powerful methods in data science and statistics. One of the key properties of kernels contributing to their numerous successful applications is that the associated reproducing kernel Hilbert space is expressive enough to encode probability distributions without loss of information or to capture the joint independence of $M\ge 2$ random variables, under mild conditions. Computationally, these measures (i) rely on the so-called Gram matrix which contains the pairwise similarity of sample points, and (ii) converge at a rate $O \left(n^{-\frac{1}{2}}\right)$, where $n$ denotes the sample size. We focus on measuring the independence of latent position random graphs (LPRGs), a model widely-applied for instance in neuroscience, sociology, and epidemiology. In LPRGs a latent representation is associated to each node. The similarity of these representations (meant via a kernel) determines whether two nodes are connected, making the Gram matrices only implicitly observable and the estimation challenging. Despite the fundamental importance of quantifying the independence of $M$ LPRGs, very little is known about the solution of this problem; existing techniques are restricted to $M=2$ components and only guarantee consistency without rates. In this work, (i) we define an independence measure called graph Hilbert-Schmidt independence criterion (GHSIC) for $M\ge 2$ LPRGs, (ii) we prove that it can be estimated at a rate $\tilde{O}\left(n^{-\frac{1}{3}}\right)$ relying on spectral decomposition of adjacency matrices, (iii) without the need to choose kernels and their hyperparameters. Numerical experiments demonstrate the effectiveness of the proposed GHSIC estimator both on synthetic examples and in the analysis of brain functional connectivity subnetworks in natural language perception.

Sun 25 OctMachine LearningSocial and Information Networks
The gist
Graphs are used to represent relationships between things, like neurons in the brain or social connections. Sometimes these graphs are modeled by hidden features that affect who connects with whom, but these features are hard to observe directly. The authors developed a new way to check if multiple such graphs are independent or linked, even when these hidden features are only indirectly visible. Their method uses special math tools called kernels and spectral analysis, and it works faster and with fewer assumptions than previous methods. They showed it can be used for example on brain data to understand how different parts communicate during language processing.
Open → 2610.34544v1

Vision language models improve error detection in brain image analysis

Benchmarking Vision-Language Models on Synapse Detection and Proofreading in Connectomics

Abstract: We benchmarked vision-language models (VLMs) on the decisions annotators take when inspecting electron microscopy images in connectomics: synapse detection (presence and polarity) and proofreading (split errors and merge errors). For synapse detection, we evaluated 19 open and 2 closed models across various architectures and sizes under zero-shot, four-shot in-context learning and LoRA settings, against specialist models, on datasets constructed by us using public resources. For proofreading, we evaluated 3 open and 2 closed models on the ConnectomeBench2 dataset, with cross-species transfer from fly and mouse to human and zebrafish. Most models were at chance zero-shot; a few examples helped mainly the closed and largest open ones. LoRA on a few thousand labels brought open models level with specialist models. When evaluated on unseen species, the best adapted VLMs outperformed specialist models trained on the same data in identifying merge errors. The project will be publicly available upon acceptance.

Tue 29 SeptComputer Vision and Pattern RecognitionArtificial IntelligenceMachine Learning
The gist
Finding connections between neurons in brain images is very hard for people and computers. The authors tested special AI models that can see and understand images along with text instructions to spot connections and fix mistakes. They found that most models don’t do well without help, but a few get better when given some examples or training. The models can also work across different animal brains, sometimes even better than specialized tools. This work helps future AI tools assist scientists studying brain wiring.
Open → 2609.36492v1

Catena integrates tools for mapping neuron connections at scale

Catena: A Comprehensive Software Suite for Large-Scale Connectomics

Abstract: The gold standard datasets for mapping connectomes are electron microscopy volumes of densely labeled neural tissue at nanometer resolution. Yet reconstructing and proofreading neuronal arbors and annotating all synapses requires pipelining multiple software tools that are often fragmented, inconsistently maintained, or proprietary, hindering reproducibility and automation. Here, we introduce Catena, an open-source, comprehensive, developer-centric software suite for connectomics that integrates modules for 3D neuron and organelle segmentation, synapse detection, microtubule tracking, and neurotransmitter inference. Catena organizes its modules in composable, chunk-wise processing pipelines in a completely documented, extensible, and adaptable design. We further reduce compute and ground-truth data requirements with pretrained machine learning models, facilitating fine-tuning. Catena ships fully containerized modules that encapsulate evolving dependencies for consistent execution across workstations and clusters. By consolidating open components, shareable models, and containerized runtimes, Catena delivers a reproducible and scalable approach to mapping cellular connectomes from electron microscopy volumes. Code and documentation: https://github.com/Mohinta2892/catena.git

Fri 18 SeptComputer Vision and Pattern Recognition
The gist
Mapping how neurons connect in the brain requires many different software tools that often don’t work well together. The authors created Catena, a complete and open software system that combines all necessary steps like detecting neurons, synapses, and cellular structures, making the process easier and more consistent. Catena uses pre-trained machine learning models to reduce the amount of new data needed and runs reliably across different computers. This helps scientists create detailed maps of brain connections from electron microscope images with less manual effort.
Open → 2609.21887v1

SkNeXt reduces cost of brain cell mapping from huge microscopy data

SkNeXt enables topology-guided neuronal reconstruction from petabyte-scale microscopy data

Abstract: Recent advances in high-resolution fluorescence and electron microscopy have enabled nanoscale imaging across increasingly large brain volumes, but the resulting terabyte- to petabyte-scale datasets make complete neuronal reconstruction prohibitively expensive in computation, data movement, and manual proofreading. Here, we present SkNeXt, a topology-first framework for scalable neuronal reconstruction from large volumetric microscopy datasets. Instead of densely processing entire image volumes, SkNeXt first converts neuronal morphology into compact SWC skeletons that preserve long-range connectivity. Proofreading is therefore focused on sparse neuronal trees, allowing branch, continuity, and connectivity errors to be corrected before high-resolution reconstruction. The corrected skeletons then serve as persistent structural priors for recovering detailed morphology while preserving neuronal identity and topology. Crucially, SkNeXt also uses neuronal skeletons as spatial indices for selective data access, retrieving high-resolution image regions only along reconstructed trajectories and bypassing most background and signal-free volumes. This substantially reduces I/O and computational overhead, allowing reconstruction cost to scale with neuronal morphology rather than total dataset size. Using SkNeXt, we reconstructed neurons from a petabyte-scale super-resolution fluorescence dataset of the mouse brain on a single GPU within one week, without requiring exhaustive dense inference across the complete imaging volume.

Wed 9 SeptComputer Vision and Pattern Recognition
The gist
Mapping the shape and connections of brain cells from large, detailed microscope images is usually very slow and expensive. The authors developed SkNeXt, a new method that first summarizes brain cell shapes in simple outline forms to focus on the important parts. This lets them fix mistakes easily and only look at detailed images where needed, saving lots of time and computer work. Using SkNeXt, they mapped neurons from a very large mouse brain dataset using a single graphics processor in just one week.
Open → 2609.09832v1