Gal Mishne
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Gal Mishne has a total of 148 co-authors. Here are the top co-authors by number of shared publications:
- Adam S. Charles
Department of Biomedical Engineering, Johns Hopkins University, Baltimore, MD
8 shared publications - Hadas Benisty
Technion, Israel Institute of Technology
5 shared publications - Ram Dyuthi Sristi
Electrical and Computer Engineering, University of California San Diego, La Jolla, USA
5 shared publications Alexander Cloninger
Department of Mathematics, UC San Diego, La Jolla, CA 92093 USA
4 shared publications- Dhruv Kohli
Department of Mathematics, UC San Diego, La Jolla, CA 92093 USA
4 shared publications - Ronen Talmon
Technion – Israel Institute of Technology
4 shared publications
Latest Publications
- Top Cited Papers
- 26 March 2026
- Published by Springer Nature in Nature Neuroscience
- Vol. 29 (5) , 1203-1211
The neurovascular impulse response function differentially reflects intrinsic neuromodulation across cortical regions
Neuromodulatory transmitters have vasoactive properties. Therefore, the impulse response function (IRF) linking spontaneous neuronal activity with hemodynamics may depend on neuromodulation. To test this hypothesis, we used optical imaging to measure norepinephrine (NE) or acetylcholine (ACh), calcium (Ca2+) activity of cortical neurons and hemodynamics in cerebral cortex in awake mice. We show that modeling of hemodynamics as a weighted sum of Ca2+-specific and NE-specific IRFs (IRFCa2+ and IRFNE) convolved with the respective time courses dramatically improved the model performance compared to using IRFCa2+ alone. In contrast to NE, ACh was largely redundant with Ca2+ and, therefore, did not improve the hemodynamic estimation. Because NE covaried with arousal, we observed instances of the diminished hemodynamic coherence between cortical regions during high arousal despite coherent behavior of the underlying neuronal Ca2+ activity. We conclude that, without accounting for noradrenergic neuromodulation, diminished hemodynamic coherence can be falsely interpreted as neuronal desynchronizations in neuroimaging studies.
- 26 March 2026
- Published by Springer Nature in Nature Neuroscience
- Vol. 29 (5) , 1203-1211
Top Cited PapersThe neurovascular impulse response function differentially reflects intrinsic neuromodulation across cortical regions
Neuromodulatory transmitters have vasoactive properties. Therefore, the impulse response function (IRF) linking spontaneous neuronal activity with hemodynamics may depend on neuromodulation. To test this hypothesis, we used optical imaging to measure norepinephrine (NE) or acetylcholine (ACh), calcium (Ca2+) activity of cortical neurons and hemodynamics in cerebral cortex in awake mice. We show that modeling of hemodynamics as a weighted sum of Ca2+-specific and NE-specific IRFs (IRFCa2+ and IRFNE) convolved with the respective time courses dramatically improved the model performance compared to using IRFCa2+ alone. In contrast to NE, ACh was largely redundant with Ca2+ and, therefore, did not improve the hemodynamic estimation. Because NE covaried with arousal, we observed instances of the diminished hemodynamic coherence between cortical regions during high arousal despite coherent behavior of the underlying neuronal Ca2+ activity. We conclude that, without accounting for noradrenergic neuromodulation, diminished hemodynamic coherence can be falsely interpreted as neuronal desynchronizations in neuroimaging studies.
- 18 March 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 36 (1) , 434-465
Non-degenerate Rigid Alignment in a Patch Framework
Given a set of overlapping local views (patches) of a dataset, we consider the problem of finding a rigid alignment of the views that minimizes a 2-norm based alignment error. In general, the views are noisy and a perfect alignment may not exist. In this work, we characterize the non-degeneracy of an alignment in the noisy setting based on the kernel and positivity of a certain matrix. This leads to a polynomial time algorithm for testing the non-degeneracy of a given alignment. Subsequently, we focus on Riemannian gradient descent for minimizing the alignment error, providing a sufficient condition on an alignment for the algorithm to converge (locally) linearly to it. Additionally, we provide an exact recovery and noise stability analysis of the algorithm. In the case of noiseless views, a perfect alignment exists, resulting in a realization of the points that respects the geometry of the views. Under a mild condition on the views, we show that a non-degenerate perfect alignment characterizes the infinitesimally rigidity of a realization and thus the local rigidity of a generic realization. By specializing the non-degeneracy conditions to the noiseless case, we derive necessary and sufficient conditions on the overlapping structure of the views for a perfect alignment to be non-degenerate and, equivalently, for the resulting realization to be infinitesimally rigid.
- 18 March 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 36 (1) , 434-465
Non-degenerate Rigid Alignment in a Patch Framework
Given a set of overlapping local views (patches) of a dataset, we consider the problem of finding a rigid alignment of the views that minimizes a 2-norm based alignment error. In general, the views are noisy and a perfect alignment may not exist. In this work, we characterize the non-degeneracy of an alignment in the noisy setting based on the kernel and positivity of a certain matrix. This leads to a polynomial time algorithm for testing the non-degeneracy of a given alignment. Subsequently, we focus on Riemannian gradient descent for minimizing the alignment error, providing a sufficient condition on an alignment for the algorithm to converge (locally) linearly to it. Additionally, we provide an exact recovery and noise stability analysis of the algorithm. In the case of noiseless views, a perfect alignment exists, resulting in a realization of the points that respects the geometry of the views. Under a mild condition on the views, we show that a non-degenerate perfect alignment characterizes the infinitesimally rigidity of a realization and thus the local rigidity of a generic realization. By specializing the non-degeneracy conditions to the noiseless case, we derive necessary and sufficient conditions on the overlapping structure of the views for a perfect alignment to be non-degenerate and, equivalently, for the resulting realization to be infinitesimally rigid.
- Open Access
- 12 March 2026
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 22 (3) , e1014038
Fast and accessible morphology-free functional fluorescence imaging analysis
Optical calcium imaging is a powerful tool for recording neural activity across a wide range of spatial scales, from dendrites and spines to whole-brain imaging through two-photon and widefield microscopy. Traditional methods for analyzing functional calcium imaging data rely heavily on spatial features, such as the compact shapes of somas, to extract regions of interest and their associated temporal traces. This spatial dependency can introduce biases in time trace estimation and limit the applicability of these methods across different neuronal morphologies and imaging scales. To address these limitations, the Graph Filtered Temporal Dictionary Learning (GraFT) uses a graph-based approach to identify neural components based on shared temporal activity rather than spatial proximity, enhancing generalizability across diverse datasets. Here we present significant advancements to the GraFT algorithm, including the integration of a more efficient solver for the L1 least absolute shrinkage and selection operator (LASSO) problem and the application of compressive sensing techniques to reduce computational complexity. By employing random projections to reduce data dimensionality, we achieve substantial speedups while maintaining analytical accuracy. These advancements significantly accelerate the GraFT algorithm, making it more scalable for larger and more complex datasets. Moreover, to increase accessibility, we developed a graphical user interface to facilitate running and analyzing the outputs of GraFT. Finally, we demonstrate the utility of GraFT to imaging data beyond meso-scale imaging, including vascular and axonal imaging.
- 12 March 2026
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 22 (3) , e1014038
Open AccessFast and accessible morphology-free functional fluorescence imaging analysis
Optical calcium imaging is a powerful tool for recording neural activity across a wide range of spatial scales, from dendrites and spines to whole-brain imaging through two-photon and widefield microscopy. Traditional methods for analyzing functional calcium imaging data rely heavily on spatial features, such as the compact shapes of somas, to extract regions of interest and their associated temporal traces. This spatial dependency can introduce biases in time trace estimation and limit the applicability of these methods across different neuronal morphologies and imaging scales. To address these limitations, the Graph Filtered Temporal Dictionary Learning (GraFT) uses a graph-based approach to identify neural components based on shared temporal activity rather than spatial proximity, enhancing generalizability across diverse datasets. Here we present significant advancements to the GraFT algorithm, including the integration of a more efficient solver for the L1 least absolute shrinkage and selection operator (LASSO) problem and the application of compressive sensing techniques to reduce computational complexity. By employing random projections to reduce data dimensionality, we achieve substantial speedups while maintaining analytical accuracy. These advancements significantly accelerate the GraFT algorithm, making it more scalable for larger and more complex datasets. Moreover, to increase accessibility, we developed a graphical user interface to facilitate running and analyzing the outputs of GraFT. Finally, we demonstrate the utility of GraFT to imaging data beyond meso-scale imaging, including vascular and axonal imaging.
- Open Access
Compositional decoding of neural activity enhances generalization in handwriting BCIs
Recent brain-computer interfaces (BCIs) have achieved state-of-the-art performance in decoding behavior from neural activity. These models are typically trained on a con-strained set of behaviors, which limits their ability to generalize to real-world settings where behavior is variable, complex, and context-dependent. However, many complex behaviors can be decomposed into a set of reusable behavioral motifs, indicating a compositional organization. Here, we analyze human intracortical neural activity underlying attempted handwriting and find signatures of neural compositionality at a finer resolution than individual letters. We further introduce a compositional temporal decoding model, MOtif-based Temporal Inference Framework (MOTIF), that jointly predicts the fine-scale behavioral motifs (e.g., strokes, phonemes) and the longer-timescale behavior class (e.g., characters, words). We show that the compositional structure leveraged by MOTIF enables improved generalization in few-shot learning. Our results demonstrate that explicitly incorporating compositionality into neural decoders can enhance generalization and sample efficiency, while providing a principled approach to designing more scalable, robust, and interpretable BCIs.
Open AccessCompositional decoding of neural activity enhances generalization in handwriting BCIs
Recent brain-computer interfaces (BCIs) have achieved state-of-the-art performance in decoding behavior from neural activity. These models are typically trained on a con-strained set of behaviors, which limits their ability to generalize to real-world settings where behavior is variable, complex, and context-dependent. However, many complex behaviors can be decomposed into a set of reusable behavioral motifs, indicating a compositional organization. Here, we analyze human intracortical neural activity underlying attempted handwriting and find signatures of neural compositionality at a finer resolution than individual letters. We further introduce a compositional temporal decoding model, MOtif-based Temporal Inference Framework (MOTIF), that jointly predicts the fine-scale behavioral motifs (e.g., strokes, phonemes) and the longer-timescale behavior class (e.g., characters, words). We show that the compositional structure leveraged by MOTIF enables improved generalization in few-shot learning. Our results demonstrate that explicitly incorporating compositionality into neural decoders can enhance generalization and sample efficiency, while providing a principled approach to designing more scalable, robust, and interpretable BCIs.
- Open Access
Multi-Integration of Labels across Categories for Component Identification (MILCCI)
Many fields collect large-scale temporal data through repeated measurements (trials), where each trial is labeled with a set of metadata variables spanning several categories. For example, a trial in a neuroscience study may be linked to a value from category (a): task difficulty, and category (b): animal choice. A critical challenge in time-series analysis is to understand how these labels are encoded within the multi-trial observations, and disentangle the distinct effect of each label entry across categories. Here, we present MILCCI, a novel data-driven method that i) identifies the interpretable components underlying the data, ii) captures cross-trial variability, and iii) integrates label information to understand each category's representation within the data. MILCCI extends a sparse per-trial decomposition that leverages label similarities within each category to enable subtle, label-driven cross-trial adjustments in component compositions and to distinguish the contribution of each category. MILCCI also learns each component's corresponding temporal trace, which evolves over time within each trial and varies flexibly across trials. We demonstrate MILCCI's performance through both synthetic and real-world examples, including voting patterns, online page view trends, and neuronal recordings.
Open AccessMulti-Integration of Labels across Categories for Component Identification (MILCCI)
Many fields collect large-scale temporal data through repeated measurements (trials), where each trial is labeled with a set of metadata variables spanning several categories. For example, a trial in a neuroscience study may be linked to a value from category (a): task difficulty, and category (b): animal choice. A critical challenge in time-series analysis is to understand how these labels are encoded within the multi-trial observations, and disentangle the distinct effect of each label entry across categories. Here, we present MILCCI, a novel data-driven method that i) identifies the interpretable components underlying the data, ii) captures cross-trial variability, and iii) integrates label information to understand each category's representation within the data. MILCCI extends a sparse per-trial decomposition that leverages label similarities within each category to enable subtle, label-driven cross-trial adjustments in component compositions and to distinguish the contribution of each category. MILCCI also learns each component's corresponding temporal trace, which evolves over time within each trial and varies flexibly across trials. We demonstrate MILCCI's performance through both synthetic and real-world examples, including voting patterns, online page view trends, and neuronal recordings.
- Open Access
- 30 January 2026
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 12 (5) , eaea3935
Complementary cortical and thalamic contributions to cell type–specific striatal activity dynamics during movement
Coordinated motor behavior emerges from information flow across brain regions. How long-range inputs drive cell type–specific activity within motor circuits remains unclear. The dorsolateral striatum (DLS) contains direct- and indirect-pathway medium spiny neurons (dMSNs and iMSNs) with distinct roles in movement control. In mice performing skilled locomotion, we recorded from dMSNs, iMSNs, and their cortical and thalamic inputs identified by monosynaptic rabies tracing. A recurrent neural network (RNN) classifier and clustering analysis revealed functionally heterogeneous subpopulations in each population, with dMSNs preferentially activated at movement onset and offset, and iMSNs during execution. Cortical and thalamic inputs were preferentially activated during onset/offset and execution, respectively, though dMSN- and iMSN-projecting neurons in each region showed similar patterns. Locomotion phase-specific rhythmic activity was found in a subset of thalamic dMSN-projecting neurons and dMSNs. Cortex or thalamus inactivation reduced MSN activity. These findings suggest that corticostriatal and thalamostriatal inputs convey complementary motor signals via shared and cell type–specific pathways.
- 30 January 2026
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 12 (5) , eaea3935
Open AccessComplementary cortical and thalamic contributions to cell type–specific striatal activity dynamics during movement
Coordinated motor behavior emerges from information flow across brain regions. How long-range inputs drive cell type–specific activity within motor circuits remains unclear. The dorsolateral striatum (DLS) contains direct- and indirect-pathway medium spiny neurons (dMSNs and iMSNs) with distinct roles in movement control. In mice performing skilled locomotion, we recorded from dMSNs, iMSNs, and their cortical and thalamic inputs identified by monosynaptic rabies tracing. A recurrent neural network (RNN) classifier and clustering analysis revealed functionally heterogeneous subpopulations in each population, with dMSNs preferentially activated at movement onset and offset, and iMSNs during execution. Cortical and thalamic inputs were preferentially activated during onset/offset and execution, respectively, though dMSN- and iMSN-projecting neurons in each region showed similar patterns. Locomotion phase-specific rhythmic activity was found in a subset of thalamic dMSN-projecting neurons and dMSNs. Cortex or thalamus inactivation reduced MSN activity. These findings suggest that corticostriatal and thalamostriatal inputs convey complementary motor signals via shared and cell type–specific pathways.
- Open Access
Unsupervised Feature Selection Through Group Discovery
Unsupervised feature selection (FS) is essential for high-dimensional learning tasks where labels are not available. It helps reduce noise, improve generalization, and enhance interpretability. However, most existing unsupervised FS methods evaluate features in isolation, even though informative signals often emerge from groups of related features. For example, adjacent pixels, functionally connected brain regions, or correlated financial indicators tend to act together, making independent evaluation suboptimal. Although some methods attempt to capture group structure, they typically rely on predefined partitions or label supervision, limiting their applicability. We propose GroupFS, an end-to-end, fully differentiable framework that jointly discovers latent feature groups and selects the most informative groups among them, without relying on fixed a priori groups or label supervision. GroupFS enforces Laplacian smoothness on both feature and sample graphs and applies a group sparsity regularizer to learn a compact, structured representation. Across nine benchmarks spanning images, tabular data, and biological datasets, GroupFS consistently outperforms state-of-the-art unsupervised FS in clustering and selects groups of features that align with meaningful patterns.
Open AccessUnsupervised Feature Selection Through Group Discovery
Unsupervised feature selection (FS) is essential for high-dimensional learning tasks where labels are not available. It helps reduce noise, improve generalization, and enhance interpretability. However, most existing unsupervised FS methods evaluate features in isolation, even though informative signals often emerge from groups of related features. For example, adjacent pixels, functionally connected brain regions, or correlated financial indicators tend to act together, making independent evaluation suboptimal. Although some methods attempt to capture group structure, they typically rely on predefined partitions or label supervision, limiting their applicability. We propose GroupFS, an end-to-end, fully differentiable framework that jointly discovers latent feature groups and selects the most informative groups among them, without relying on fixed a priori groups or label supervision. GroupFS enforces Laplacian smoothness on both feature and sample graphs and applies a group sparsity regularizer to learn a compact, structured representation. Across nine benchmarks spanning images, tabular data, and biological datasets, GroupFS consistently outperforms state-of-the-art unsupervised FS in clustering and selects groups of features that align with meaningful patterns.
- Open Access
Coupled Transformer Autoencoder for Disentangling Multi-Region Neural Latent Dynamics
Simultaneous recordings from thousands of neurons across multiple brain areas reveal rich mixtures of activity that are shared between regions and dynamics that are unique to each region. Existing alignment or multi-view methods neglect temporal structure, whereas dynamical latent variable models capture temporal dependencies but are usually restricted to a single area, assume linear read-outs, or conflate shared and private signals. We introduce the Coupled Transformer Autoencoder (CTAE) - a sequence model that addresses both (i) non-stationary, non-linear dynamics and (ii) separation of shared versus region-specific structure in a single framework. CTAE employs transformer encoders and decoders to capture long-range neural dynamics and explicitly partitions each region's latent space into orthogonal shared and private subspaces. We demonstrate the effectiveness of CTAE on two high-density electrophysiology datasets with simultaneous recordings from multiple regions, one from motor cortical areas and the other from sensory areas. CTAE extracts meaningful representations that better decode behavioral variables compared to existing approaches.
Open AccessCoupled Transformer Autoencoder for Disentangling Multi-Region Neural Latent Dynamics
Simultaneous recordings from thousands of neurons across multiple brain areas reveal rich mixtures of activity that are shared between regions and dynamics that are unique to each region. Existing alignment or multi-view methods neglect temporal structure, whereas dynamical latent variable models capture temporal dependencies but are usually restricted to a single area, assume linear read-outs, or conflate shared and private signals. We introduce the Coupled Transformer Autoencoder (CTAE) - a sequence model that addresses both (i) non-stationary, non-linear dynamics and (ii) separation of shared versus region-specific structure in a single framework. CTAE employs transformer encoders and decoders to capture long-range neural dynamics and explicitly partitions each region's latent space into orthogonal shared and private subspaces. We demonstrate the effectiveness of CTAE on two high-density electrophysiology datasets with simultaneous recordings from multiple regions, one from motor cortical areas and the other from sensory areas. CTAE extracts meaningful representations that better decode behavioral variables compared to existing approaches.
- Open Access
Robust Tangent Space Estimation via Laplacian Eigenvector Gradient Orthogonalization
Estimating the tangent spaces of a data manifold is a fundamental problem in data analysis. The standard approach, Local Principal Component Analysis (LPCA), struggles in high-noise settings due to a critical trade-off in choosing the neighborhood size. Selecting an optimal size requires prior knowledge of the geometric and noise characteristics of the data that are often unavailable. In this paper, we propose a spectral method, Laplacian Eigenvector Gradient Orthogonalization (LEGO), that utilizes the global structure of the data to guide local tangent space estimation. Instead of relying solely on local neighborhoods, LEGO estimates the tangent space at each data point by orthogonalizing the gradients of low-frequency eigenvectors of the graph Laplacian. We provide two theoretical justifications of our method. First, a differential geometric analysis on a tubular neighborhood of a manifold shows that gradients of the low-frequency Laplacian eigenfunctions of the tube align closely with the manifold's tangent bundle, while an eigenfunction with high gradient in directions orthogonal to the manifold lie deeper in the spectrum. Second, a random matrix theoretic analysis also demonstrates that low-frequency eigenvectors are robust to sub-Gaussian noise. Through comprehensive experiments, we demonstrate that LEGO yields tangent space estimates that are significantly more robust to noise than those from LPCA, resulting in marked improvements in downstream tasks such as manifold learning, boundary detection, and local intrinsic dimension estimation.
Open AccessRobust Tangent Space Estimation via Laplacian Eigenvector Gradient Orthogonalization
Estimating the tangent spaces of a data manifold is a fundamental problem in data analysis. The standard approach, Local Principal Component Analysis (LPCA), struggles in high-noise settings due to a critical trade-off in choosing the neighborhood size. Selecting an optimal size requires prior knowledge of the geometric and noise characteristics of the data that are often unavailable. In this paper, we propose a spectral method, Laplacian Eigenvector Gradient Orthogonalization (LEGO), that utilizes the global structure of the data to guide local tangent space estimation. Instead of relying solely on local neighborhoods, LEGO estimates the tangent space at each data point by orthogonalizing the gradients of low-frequency eigenvectors of the graph Laplacian. We provide two theoretical justifications of our method. First, a differential geometric analysis on a tubular neighborhood of a manifold shows that gradients of the low-frequency Laplacian eigenfunctions of the tube align closely with the manifold's tangent bundle, while an eigenfunction with high gradient in directions orthogonal to the manifold lie deeper in the spectrum. Second, a random matrix theoretic analysis also demonstrates that low-frequency eigenvectors are robust to sub-Gaussian noise. Through comprehensive experiments, we demonstrate that LEGO yields tangent space estimates that are significantly more robust to noise than those from LPCA, resulting in marked improvements in downstream tasks such as manifold learning, boundary detection, and local intrinsic dimension estimation.
- 29 September 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 47 (5) , A2774-A2800
On a Generalization of Wasserstein Distance and the Beckmann Problem to Connection Graphs
We propose a model of optimal parallel transport between vector fields on a connection graph, which consists of a weighted graph along with a map from its edges to an orthogonal group. Inspired by the well-known equivalence of 1-Wasserstein distance and minimum cost flows on standard graphs, we consider two versions of this problem: a minimum norm vector-valued flow problem with divergence constraints reflective of the connection structure of the graph, and a modified version which incorporates both quadratic regularization and a relaxation of the divergence constraint. Our theoretical contributions include conditions for feasibility and computation of the Lagrangian dual problem for both problems and duality correspondence for the relaxed-regularized version. Example applications of the model including transport between color images, vector field interpolation, and unsupervised clustering of vector field-valued data (in this case hurricane trajectory data) are also considered.
- 29 September 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 47 (5) , A2774-A2800
On a Generalization of Wasserstein Distance and the Beckmann Problem to Connection Graphs
We propose a model of optimal parallel transport between vector fields on a connection graph, which consists of a weighted graph along with a map from its edges to an orthogonal group. Inspired by the well-known equivalence of 1-Wasserstein distance and minimum cost flows on standard graphs, we consider two versions of this problem: a minimum norm vector-valued flow problem with divergence constraints reflective of the connection structure of the graph, and a modified version which incorporates both quadratic regularization and a relaxation of the divergence constraint. Our theoretical contributions include conditions for feasibility and computation of the Lagrangian dual problem for both problems and duality correspondence for the relaxed-regularized version. Example applications of the model including transport between color images, vector field interpolation, and unsupervised clustering of vector field-valued data (in this case hurricane trajectory data) are also considered.