Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Anamika Agrawal

dblp:311/6244 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
0000-0002-1213-2321ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Representation and self-supervised learning · 50% Deep learning architectures and training · 50%
Theoretical computer science
1 paper
Coding theory · 50% Computational complexity · 50%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning
computational neuroscience
0.912025
Bounds on the computational complexity of neurons due to dendritic morphology · NeurIPS 2025
Machine learning › Deep learning architectures and training › feedforward neural network
linear threshold unit
0.912025
Bounds on the computational complexity of neurons due to dendritic morphology · NeurIPS 2025
Coding theory
boolean functions
0.312025
Bounds on the computational complexity of neurons due to dendritic morphology · NeurIPS 2025
Computational complexity › learning theory
learnability
0.312025
Bounds on the computational complexity of neurons due to dendritic morphology · NeurIPS 2025

Methods — techniques the papers use, named apart from their topics

phase transition analysis · 1.7boolean function analysis · 1.7
YearPublicationVenuePosition
2025 Bounds on the computational complexity of neurons due to dendritic morphology
abstract
The simple linear threshold units used in many artificial neural networks have a limited computational capacity. Famously, a single unit cannot handle non-linearly separable problems like XOR. In contrast, real neurons exhibit complex morphologies as well as active dendritic integration, suggesting that their computational capacities outperform those of simple linear units. Considering specific families of Boolean functions, we empirically examine the computational limits of single units that incorporate more complex dendritic structures. For random Boolean functions, we show that there is a phase transition in learnability as a function of the input dimension, with most random functions below a certain critical dimension being learnable and those above not. This critical dimension is best predicted by the overall size of the dendritic arbor. This demonstrates that real neurons have a far higher computational complexity than is usually considered in neural models, whether in machine learning or computational neuroscience. Furthermore, using architectures that are, respectively, more "apical" or "basal" we show that there are non-trivially disjoint sets of learnable functions by each type of neuron. Importantly, these two types of architectures differ in the robustness and generality of the computations they can perform. The basal-like architecture shows a higher probability of function realization, while the apical-like architecture shows an advantage with fast retraining for different functions. Given the cell-type specificity of morphological characteristics, these results suggest both that different components of the dendritic arbor as well as distinct cell types may have distinct computational roles. In single neurons, morphology sculpts computation, shaping not only what neurons do, but how they learn and adapt. Our analysis offers new directions for neuron-level inductive biases in NeuroAI models using scalable models for neuronal cell-type specific computation.
Anamika Agrawal, Michael A. Buice
NeurIPS1
2021 Optimizing mitochondrial maintenance in extended neuronal projections
abstract
Neurons rely on localized mitochondria to fulfill spatially heterogeneous metabolic demands. Mitochondrial aging occurs on timescales shorter than the neuronal lifespan, necessitating transport of fresh material from the soma. Maintaining an optimal distribution of healthy mitochondria requires an interplay between a stationary pool localized to sites of high metabolic demand and a motile pool capable of delivering new material. Interchange between these pools can occur via transient fusion / fission events or by halting and restarting entire mitochondria. Our quantitative model of neuronal mitostasis identifies key parameters that govern steady-state mitochondrial health at discrete locations. Very infrequent exchange between stationary and motile pools optimizes this system. Exchange via transient fusion allows for robust maintenance, which can be further improved by selective recycling through mitophagy. These results provide a framework for quantifying how perturbations in organelle transport and interactions affect mitochondrial homeostasis in neurons, a key aspect underlying many neurodegenerative disorders.
Anamika Agrawal, Elena F. Koslover
PLoS Comput. Biol.1