<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Bio-Inspired AI | Dr. Manish Yadav</title><link>https://maneesh51.github.io/tags/bio-inspired-ai/</link><atom:link href="https://maneesh51.github.io/tags/bio-inspired-ai/index.xml" rel="self" type="application/rss+xml"/><description>Bio-Inspired AI</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Fri, 13 Mar 2026 00:00:00 +0000</lastBuildDate><image><url>https://maneesh51.github.io/media/sharing.png</url><title>Bio-Inspired AI</title><link>https://maneesh51.github.io/tags/bio-inspired-ai/</link></image><item><title>Emergent E-I Structure in Performance-Evolved Reservoir Networks of Neuronal Population Dynamics</title><link>https://maneesh51.github.io/publications/emergent-ei-structure-2026/</link><pubDate>Fri, 13 Mar 2026 00:00:00 +0000</pubDate><guid>https://maneesh51.github.io/publications/emergent-ei-structure-2026/</guid><description>&lt;p&gt;This preprint studies how &lt;strong&gt;performance-dependent network evolution (PDNE)&lt;/strong&gt; can build compact and interpretable reservoir models for neuronal population dynamics.&lt;/p&gt;
&lt;p&gt;Using the Wilson-Cowan excitatory-inhibitory system as the target, the evolved reservoirs:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;predict both E(t) and I(t) accurately on unseen stimulus amplitudes,&lt;/li&gt;
&lt;li&gt;generalize zero-shot to new pulse configurations without retraining, and&lt;/li&gt;
&lt;li&gt;recover population-level E-I sign structure for most interaction types as an emergent property.&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;The results support using performance-evolved reservoirs as data-efficient and interpretable computational surrogates for neuronal digital twins.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Read full preprint here:&lt;/strong&gt; M. Yadav,
&lt;/p&gt;</description></item><item><title>Network structure-function relationship | New Preprint</title><link>https://maneesh51.github.io/projects/pdne_prj/</link><pubDate>Sun, 26 Oct 2025 00:00:00 +0000</pubDate><guid>https://maneesh51.github.io/projects/pdne_prj/</guid><description>&lt;p&gt;This project has been started to understand emergent &lt;em&gt;structure-function&lt;/em&gt; relationship of evolving networks.&lt;/p&gt;
&lt;h2 id="part-1-performance-dependent-network-evolution-pdne-framework"&gt;Part-1:
.&lt;/h2&gt;
&lt;p&gt;I conceptualized a performance-driven evolutionary framework that grows reservoir networks from small initial seeds, while improving task performance. Key findings include:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Evolution consistently outperforms random network generation.&lt;/li&gt;
&lt;li&gt;Evolved reservoirs become smaller, sparser, and more specialized, yet achieve higher accuracy.&lt;/li&gt;
&lt;li&gt;Network evolution follows identifiable &lt;strong&gt;scaling laws&lt;/strong&gt; and &lt;strong&gt;self-organization&lt;/strong&gt; in Nodes-Density parametric space, as well as &lt;strong&gt;broken-symmetry&lt;/strong&gt; between input and readout nodes.&lt;/li&gt;
&lt;li&gt;As a bi-product, we discovered that task complexity can also be quantified using emerging structural signatures.&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;
&lt;figure &gt;
&lt;div class="flex justify-center "&gt;
&lt;div class="w-full" &gt;&lt;img alt="Network Evolution Process"
src="https://maneesh51.github.io/projects/pdne_prj/NARMA10_N-Density_fast.gif"
loading="lazy" data-zoomable /&gt;&lt;/div&gt;
&lt;/div&gt;&lt;/figure&gt;
&lt;em&gt;&lt;strong&gt;Figure 1:&lt;/strong&gt; Network evolution over time showing performance improvement of the evoluving networks for different evolution models.&lt;/em&gt;&lt;/p&gt;
&lt;p&gt;This work demonstrated that RC benefits substantially from non-random, purposefully shaped architectures, challenging the long-standing reliance on large random reservoirs.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Read full article here:&lt;/strong&gt; M. Yadav, S. Sinha, M. Stender, &amp;ldquo;Evolution beats random chance: Performance-dependent network evolution for enhanced computational capacity,&amp;rdquo;
&lt;/p&gt;
&lt;h2 id="part-2-performance-dependent-node-pruning"&gt;Part-2: Performance-Dependent Node Pruning.&lt;/h2&gt;
&lt;p&gt;
&lt;/p&gt;
&lt;p&gt;In this complementary work, I introduced task-driven network pruning framework, starting from a large reservoir and iteratively removing nodes while optimizing performance. Results show:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Pruned networks retain—often improve—accuracy&lt;/li&gt;
&lt;li&gt;Structural metrics such as spectral radius, out-degree, and &lt;strong&gt;input–readout asymmetry&lt;/strong&gt; reorganize systematically&lt;/li&gt;
&lt;li&gt;Pruning reveals functionally critical subnetworks within Erdős-Rényi random networks.&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;&lt;strong&gt;Read full article here:&lt;/strong&gt; M. Yadav and M. Stender, &amp;ldquo;Task-specific node pruning enhances computational efficiency of reservoir computing networks,&amp;rdquo;
&lt;/p&gt;
&lt;h2 id="part-3-applications"&gt;Part-3: Applications&lt;/h2&gt;
&lt;h3 id="building-neuronal-digital-twins-with-directed-evolution----"&gt;Building neuronal digital twins with directed evolution 🔥 🆕 📄&lt;/h3&gt;
&lt;p&gt;This new direction applies PDNE to computational neuroscience, where the objective is to build compact and interpretable digital twins of neuronal population dynamics.&lt;/p&gt;
&lt;p&gt;In our latest preprint, PDNE evolves reservoir structure directly from Wilson-Cowan dynamics and discovers functionally meaningful excitatory-inhibitory organization without imposing that structure by design.&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Accurate prediction of both excitatory and inhibitory activity across unseen stimulus amplitudes.&lt;/li&gt;
&lt;li&gt;Zero-shot generalization to new pulse configurations (number, position, and amplitude) without retraining.&lt;/li&gt;
&lt;li&gt;Emergent recovery of population-level E-I sign structure from dynamics-driven learning.&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;
&lt;figure &gt;
&lt;div class="flex justify-center "&gt;
&lt;div class="w-full" &gt;&lt;img src="https://maneesh51.github.io/uploads/pdne-wc-fig1.png" alt="PDNE applications to neuronal digital twins" loading="lazy" data-zoomable /&gt;&lt;/div&gt;
&lt;/div&gt;&lt;/figure&gt;
&lt;em&gt;&lt;strong&gt;Figure 2:&lt;/strong&gt; Performance-dependent network evolution framework for modeling Wilson-Cowan neuronal dynamics and extracting interpretable E-I structure.&lt;/em&gt;&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Article page on this site:&lt;/strong&gt;
&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Read preprint (arXiv):&lt;/strong&gt;
&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Code repository:&lt;/strong&gt;
&lt;/p&gt;
&lt;h2 id="future-directions"&gt;Future directions&lt;/h2&gt;
&lt;p&gt;Furthermore, under the bigger theme of building a &lt;strong&gt;comprehensive framework for performance-driven evolution of computational networks&lt;/strong&gt;. I further want to elucidate:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;How networks self-organize under &lt;strong&gt;performance pressure&lt;/strong&gt;?&lt;/li&gt;
&lt;li&gt;What graph-theoretic measures (spectral radius, clustering, out-degree, motif distribution) emerge?&lt;/li&gt;
&lt;li&gt;How &lt;strong&gt;structural adaptations&lt;/strong&gt; relate to task complexity and &lt;strong&gt;generalizability&lt;/strong&gt;?&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Scaling laws&lt;/strong&gt; governing optimal network&lt;/li&gt;
&lt;li&gt;Node-level and macroscopic graph properties&lt;/li&gt;
&lt;li&gt;Incorporate &lt;strong&gt;principles of biological evolution—mutation, adaptation, plasticity, co-evolution&lt;/strong&gt; and their computational analogs&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Transfer learning&lt;/strong&gt; across tasks using evolving reservoirs&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;This line of research seeks to uncover why certain network structures are optimal for computation and how evolutionary mechanisms produce them.&lt;/p&gt;</description></item><item><title>Task-specific node pruning enhances computational efficiency of reservoir computing networks</title><link>https://maneesh51.github.io/publications/chaos-node-pruning/</link><pubDate>Fri, 01 Aug 2025 00:00:00 +0000</pubDate><guid>https://maneesh51.github.io/publications/chaos-node-pruning/</guid><description>&lt;p&gt;In this work, we introduced a task-driven network pruning framework, starting from a large reservoir and iteratively removing nodes while optimizing performance. Results show:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;Pruned networks retain—often improve—accuracy&lt;/li&gt;
&lt;li&gt;Structural metrics such as spectral radius, out-degree, and &lt;strong&gt;input–readout asymmetry&lt;/strong&gt; reorganize systematically&lt;/li&gt;
&lt;li&gt;Pruning reveals functionally critical subnetworks within Erdős-Rényi random networks.&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;&lt;strong&gt;Read full article here:&lt;/strong&gt; M. Yadav and M. Stender, &amp;ldquo;Task-specific node pruning enhances computational efficiency of reservoir computing networks,&amp;rdquo;
&lt;/p&gt;</description></item><item><title>Homeorhetic regulation of cellular phenotype</title><link>https://maneesh51.github.io/publications/homeorhetic-regulation-2024/</link><pubDate>Fri, 06 Jun 2025 00:00:00 +0000</pubDate><guid>https://maneesh51.github.io/publications/homeorhetic-regulation-2024/</guid><description>&lt;p&gt;This paper investigates homeorhetic regulation mechanisms in cellular phenotype dynamics.
How cells translate growth factor (GF) signals into context-specific phenotypes remains a fundamental question in cell biology. The classical view holds that cells translate a constant concentration of a GF with specific chemical identity to a steady state activation of the underlying signaling pathway, resulting in a defined phenotypic response. However, recent findings suggest that even a single GF, when presented in a pulsatile manner, drives differential phenotypic responses depending on the frequency of stimulation. To reconcile these views, we introduce a novel conceptual framework of &amp;ldquo;signaling homeorhesis&amp;rdquo;. Unlike homeostasis, homeorhesis describes the stable evolution of signaling trajectories over time. Defining this concept quantitatively using a dynamical systems framework, we use mathematical models of the Epidermal Factor Growth Receptor (EGFR) and the Tropomyosin receptor kinase A (TrkA) networks, as well as available experimental temporal protein activity recordings in PC-12 cells to demonstrate that cells classify GF signals to unique signaling trajectories that encode for distinct cell phenotypes, irrespective of the GF identity. We thereby propose that the cellular phenotype is determined in real-time, as the cell actively interprets the growth factor signals from its environment.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Read full article here:&lt;/strong&gt; M. Yadav, D. koch and A. Koseska, &amp;ldquo;Homeorhetic regulation of cellular phenotype,&amp;rdquo;
&lt;/p&gt;</description></item></channel></rss>