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


Hananel Hazan has a total of 127 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Computational Framework for Identifying Ion Channel Mutation-Compensating Interventions

    by Hananel Hazan, Michael Levin

    We present an automated pipeline for finding therapeutic interventions in channelopathies. It starts from patch clamp recordings of the variant channel, searches over the pharmacologically accessible conductances, and says which currents must change and by how much. The intervention never touches the mutated channel: it compensates by modulating others. The feasibility of this approach is demonstrated through two computational strategies, each addressing a specific capability gap. First, we employ high-fidelity NEURON simulations combined with exploratory search algorithms to model two clinically described variants, and identify “stability windows” in which channel modulations restore the reference firing pattern. The compensating configurations are degenerate: 37 conductance triples fire the same number of action potentials at every one of the 35 injected-current levels, and the 10,780 triples reaching the best intervention value produce only six distinct firing patterns. Second, to address the computational cost of such detailed modeling, we implement a differentiable Hodgkin-Huxley model in Py-Torch. Applied here to theoretical mutation screening, this approach trades granular detail for speed, treating the search as a continuous optimization problem that makes very large, non-local searches of the conductance parameter space affordable: the differentiable forward model evaluates 34,000–64,000 candidate parameter sets per second on a single consumer graphics card, against 11.9–16.9 per second for the non-differentiable pipeline on a 72-core node. The gain arises from forward-model throughput feeding a search rather than from the gradient itself, and it is what makes the 32,000,000-point survey of the solution topology reported here affordable. These computational predictions can inform practical drug development and high-throughput screening by naming the currents that must change and by how much.

  • Open Access

    A platform for automated training of mammalian cell physiology

    by Patrick Erickson, Douglas Hazel, Ramses Martinez, Kostyantyn Shcherbina, Susan L. Marquez, Thomas Ferrante, Katarina Johnson, Angelina Pimkina, Hananel Hazan, Juanita Mathews, et al.

    Controlling cell physiology is difficult, not only because of cells’ complexity, but also their capacity for real-time adaptation to interventions, leading to challenges such as drug resistance and transgene silencing. Accumulating evidence suggests that this adaptivity resembles classical forms of learning defined in behavioral science. However, a lack of appropriate platforms has led to gaps in our understanding of cells’ capacity for adaptive problem-solving in physiological and transcriptional space. Here, we present a device, the Cell Trainer, capable of performing a wide variety of automated training experiments on non-neural mammalian cells, using timed drug pulses as the stimulus, and a mobile fluorescence microscope to capture images of responses, across replicate cultures. The Cell Trainer can operate in either an open-loop (feedforward) or closed-loop (feedback-controlled) mode, and our image analysis pipeline can report the behaviors of individual cells throughout each experiment and quantify population heterogeneity. We showcase the ability of the Cell Trainer to execute experimental protocols and perform single-cell analyses in both modes. We first demonstrate with a feedforward experiment in which myoblasts are repeatedly pulsed with dimethyl sulfoxide (DMSO) and their discrete calcium responses are analyzed, revealing sensitization-like dynamics. Next, we demonstrate a feedback control scheme wherein the fluorescence of a pH/voltage reporter in kidney cells is maintained below a threshold level with controlled pulses of acid. To accelerate research in the field of cell training, learning, and memory, we are openly sharing the Cell Trainer schematics and software with the research community. This platform provides a flexible tool for studying how cellular physiological states can be shaped by patterned stimulation and feedback control through approaches that work with the native adaptive competencies of cells.

  • Open Access

    Evidence-Gated Plasticity and Context-Dependent Consolidation for Multi-Goal Learning in Spiking Neural Networks

    by Samuel A Neymotin, Hananel Hazan, Gozde Unal, Christopher Earl, Haroon Anwar, Piotr Franaszczuk, David Boothe

    Background / Introduction: Biologically inspired spiking neural networks offer a mechanistic framework for adaptive behavior, yet learning multiple goals remains challenging when synaptic updates for different targets interfere. We investigated whether multi-timescale plasticity and context-dependent consolidation improve interleaved multi-goal learning in a spiking navigation system inspired by entorhinal-hippocampal circuitry. Methods: We introduce evidence-gated plasticity (EGP), in which STDP-based reinforcement learning (STDP/RL) generates transient synaptic proposals and need-weighted behavioral evidence modulates their slower consolidation into durable weights. Global EGP pools these proposals and the corresponding evidence across goals. Target-context EGP extends this framework through goal-specific proposal and evidence stores and additional need-dependent scaling of consolidation. We compared the algorithms across paired spiking networks, tested learned weights with plasticity disabled, and examined upstream representations and consolidation components. Results: Global EGP supported multi-goal learning and durable navigation, while target-context EGP improved reward acquisition across replicated network comparisons and increased target-contact success during extended training. Independent evaluation confirmed that both algorithms retained navigation competence when plasticity was disabled. Additional controls suggested that overall consolidation strength contributes to the target-context reward advantage. In matched short-training experiments, conventional STDP/RL acquired shaped reward more rapidly, whereas EGP networks achieved higher target-contact success with learned synaptic weights held fixed. Conclusions: EGP supports durable multi-goal learning in spiking neural networks, and its target-context extension improves acquisition and conditional target selectivity in this interleaved navigation task. The framework offers a basis for testing context-sensitive, evidence-modulated plasticity in other multi-context learning problems.

  • Open Access

    DeltaQ: Value-Guided Hebbian Learning in Spiking Neuronal Networks for Multi-Goal Navigation

    by Christopher Earl, Gozde Unal, Hananel Hazan, Samuel A Neymotin

    Animals must often navigate environments where feedback about progress toward a goal is sparse or delayed, requiring internal representations of space and memory of prior experience. The hippocampal-entorhinal system is believed to support this capability through distributed spatial representations that guide goal-directed behavior. However, many computational models of these circuits focus primarily on reproducing neural dynamics rather than demonstrating how such representations support learning on navigation tasks. We present a biologically inspired spiking neuronal network (SNN) model that combines grid-cell-derived spatial representations, ΔQ-modulated Hebbian plasticity, and context-dependent modulation to support navigation under sparse reward conditions. Grid Cell populations generate distributed spatial codes that are transformed by an Association Cell population into more spatially selective internal representations. Learning is driven by changes in Q-values (ΔQ) computed from a goal-conditioned Q-table, allowing local synaptic plasticity to incorporate information about long-term navigation outcomes. For environments containing multiple navigation objectives, a Context Cell population provides task-dependent modulation that enables a shared network architecture to support distinct navigation policies. Across two complementary maze environments, the model demonstrates three core capabilities: generation of distinct spatial representations, learning of efficient navigation policies under sparse and delayed reward, and support for multiple navigation objectives within a shared environment. The results further show that contextual modulation introduces subtle task-dependent variations into a largely shared population representation, allowing identical spatial locations to support different navigation behaviors. These findings demonstrate that biologically inspired spatial representations, value-guided plasticity, and contextual modulation can jointly support flexible navigation in spiking neuronal networks, providing a bridge between mechanistic neural circuit models and functional reinforcement learning.


  • Open Access

    Diffusion Models are Evolutionary Algorithms

    by Yanbo Zhang, Benedikt Hartl, Hananel Hazan, Michael Levin

    In a convergence of machine learning and biology, we reveal that diffusion models are evolutionary algorithms. By considering evolution as a denoising process and reversed evolution as diffusion, we mathematically demonstrate that diffusion models inherently perform evolutionary algorithms, naturally encompassing selection, mutation, and reproductive isolation. Building on this equivalence, we propose the Diffusion Evolution method: an evolutionary algorithm utilizing iterative denoising -- as originally introduced in the context of diffusion models -- to heuristically refine solutions in parameter spaces. Unlike traditional approaches, Diffusion Evolution efficiently identifies multiple optimal solutions and outperforms prominent mainstream evolutionary algorithms. Furthermore, leveraging advanced concepts from diffusion models, namely latent space diffusion and accelerated sampling, we introduce Latent Space Diffusion Evolution, which finds solutions for evolutionary tasks in high-dimensional complex parameter space while significantly reducing computational steps. This parallel between diffusion and evolution not only bridges two different fields but also opens new avenues for mutual enhancement, raising questions about open-ended evolution and potentially utilizing non-Gaussian or discrete diffusion models in the context of Diffusion Evolution.


  • Open Access

    Heuristically Adaptive Diffusion‐Model Evolutionary Strategy

    by Benedikt Hartl, Yanbo Zhang, Hananel Hazan, Michael Levin

    Diffusion Models (DMs) and Evolutionary Algorithms (EAs) share a core generative principle: iterative refinement of random initial distributions to produce high‐quality solutions. DMs degrade and restore data using Gaussian noise, enabling versatile generation, while EAs optimize numerical parameters through biologically inspired heuristics. Our research integrates these frameworks, employing deep learning‐based DMs to enhance EAs across diverse domains. By iteratively refining DMs with heuristically curated databases, we generate better‐adapted offspring parameters, achieving efficient convergence toward high‐fitness solutions while preserving explorative diversity. DMs augment EAs with deep memory, retaining historical data and exploiting subtle correlations for refined sampling. Classifier‐free guidance further enables precise control over evolutionary dynamics, targeting specific genotypical, phenotypical, or population traits. This hybrid approach transforms EAs into adaptive, memory‐enhanced frameworks, offering unprecedented flexibility, and precision in evolutionary optimization, with broad implications for generative modeling and heuristic search.


  • Differentiable simulation expands frontiers for biophysical neural models

    by Samuel A. Neymotin, Hananel Hazan

  • Open Access

    Reservoir Computation with Networks of Differentiating Neuron Ring Oscillators

    by Alexander Yeung, Peter DelMastro, Arjun Karuvally, Hava Siegelmann, Edward Rietman, Hananel Hazan

    Reservoir computing is an approach to machine learning that leverages the dynamics of a complex system alongside a simple, often linear, machine learning model for a designated task. While many efforts have previously focused their attention on integrating neurons, which produce an output in response to large, sustained inputs, we focus on using differentiating neurons, which produce an output in response to large changes in input. Here, we introduce a small-world graph built from rings of differentiating neurons as a Reservoir Computing substrate. We find the coupling strength and network topology that enable these small-world networks to function as an effective reservoir. The dynamics of differentiating neurons naturally give rise to oscillatory dynamics when arranged in rings, where we study their computational use in the Reservoir Computing setting. We demonstrate the efficacy of these networks in the MNIST digit recognition task, achieving comparable performance of 90.65% to existing Reservoir Computing approaches. Beyond accuracy, we conduct systematic analysis of our reservoir’s internal dynamics using three complementary complexity measures that quantify neuronal activity balance, input dependence, and effective dimensionality. Our analysis reveals that optimal performance emerges when the reservoir operates with intermediate levels of neural entropy and input sensitivity, consistent with the edge-of-chaos hypothesis, where the system balances stability and responsiveness. The findings suggest that differentiating neurons can be a potential alternative to integrating neurons and can provide a sustainable future alternative for power-hungry AI applications.


  • Open Access

    Reservoir Computation with Networks of Differentiating Neuron Ring Oscillators

    by Alexander Yeung, Peter DelMastro, Arjun Karuvally, Hava Siegelmann, Edward Rietman, Hananel Hazan

    Reservoir Computing is a machine learning approach that uses the rich repertoire of complex system dynamics for function approximation. Current approaches to reservoir computing use a network of coupled integrating neurons that require a steady current to maintain activity. Here, we introduce a small world graph of differentiating neurons that are active only when there are changes in input as an alternative to integrating neurons as a reservoir computing substrate. We find the coupling strength and network topology that enable these small world networks to function as an effective reservoir. We demonstrate the efficacy of these networks in the MNIST digit recognition task, achieving comparable performance of 90.65% to existing reservoir computing approaches. The findings suggest that differentiating neurons can be a potential alternative to integrating neurons and can provide a sustainable future alternative for power-hungry AI applications.

  • Open Access

    Transient Dynamics in Lattices of Differentiating Ring Oscillators

    by Peter DelMastro, Arjun Karuvally, Hananel Hazan, Hava Siegelmann, Edward Rietman

    Recurrent neural networks (RNNs) are machine learning models widely used for learning temporal relationships. Current state-of-the-art RNNs use integrating or spiking neurons -- two classes of computing units whose outputs depend directly on their internal states -- and accordingly there is a wealth of literature characterizing the behavior of large networks built from these neurons. On the other hand, past research on differentiating neurons, whose outputs are computed from the derivatives of their internal states, remains limited to small hand-designed networks with fewer than one-hundred neurons. Here we show via numerical simulation that large lattices of differentiating neuron rings exhibit local neural synchronization behavior found in the Kuramoto model of interacting oscillators. We begin by characterizing the periodic orbits of uncoupled rings, herein called ring oscillators. We then show the emergence of local correlations between oscillators that grow over time when these rings are coupled together into lattices. As the correlation length grows, transient dynamics arise in which large regions of the lattice settle to the same periodic orbit, and thin domain boundaries separate adjacent, out-of-phase regions. The steady-state scale of these correlated regions depends on how the neurons are shared between adjacent rings, which suggests that lattices of differentiating ring oscillator might be tuned to be used as reservoir computers. Coupled with their simple circuit design and potential for low-power consumption, differentiating neural nets therefore represent a promising substrate for neuromorphic computing that will enable low-power AI applications.