Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear.
Linear Approximation in Time Domain01:21

Linear Approximation in Time Domain

Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length, the...
Linear time-invariant Systems01:23

Linear time-invariant Systems

A system is linear if it displays the characteristics of homogeneity and additivity, together termed the superposition property. This principle is fundamental in all linear systems. Linear time-invariant (LTI) systems include systems with linear elements and constant parameters.
The input-output behavior of an LTI system can be fully defined by its response to an impulsive excitation at its input. Once this impulse response is known, the system's reaction to any other input can be calculated...
Net Change Theorem01:22

Net Change Theorem

The Net Change Theorem is a fundamental principle in calculus that establishes a direct relationship between a function’s rate of change and its accumulated change over an interval. Mathematically, it states that the definite integral of a function's derivative over a given interval [a,b] yields the net change in the original function:This theorem has significant applications in various real-world scenarios, including physics, economics, and engineering. A particularly useful application is in...
Classification of Systems-I01:26

Classification of Systems-I

Linearity is a system property characterized by a direct input-output relationship, combining homogeneity and additivity.
Homogeneity dictates that if an input x(t) is multiplied by a constant c, the output y(t) is multiplied by the same constant. Mathematically, this is expressed as:
Linear Circuits01:17

Linear Circuits

A linear circuit is characterized by its output having a direct proportionality to its input, adhering to the linearity property, which encompasses the principles of homogeneity (scaling) and additivity. Homogeneity dictates that when the input, also referred to as the excitation, is multiplied by a constant factor, the output, known as the response, is correspondingly scaled by the same constant factor. For instance, if the current is multiplied by a constant 'k,' the voltage likewise...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Latent subdimensions of anxiety and depression differentially influence exertion of effort in pursuit of reward versus avoidance of threat.

Translational psychiatry·2026
Same author

Neural signatures of model-based and model-free reinforcement learning across prefrontal cortex and striatum.

eLife·2026
Same author

Uncertainty for better and worse.

Current opinion in neurobiology·2026
Same author

Dopamine dynamics in human anterior cingulate cortex during Pavlovian-instrumental conflict.

bioRxiv : the preprint server for biology·2026
Same author

Modality-general sensitivity of pupil responses to regularity violations.

Cognitive, affective & behavioral neuroscience·2026
Same author

Metacognitive efficiency in learned value-based choice.

PLoS computational biology·2026
Same journal

A Model-Free Reinforcement Learning Implementation of Decision Making Under Uncertainty by Sequential Sampling.

Neural computation·2026
Same journal

DROP: Distributional and Regular Optimism and Pessimism for Reinforcement Learning.

Neural computation·2026
Same journal

Hierarchical Active Inference Using Successor Representations.

Neural computation·2026
Same journal

W-Kernel and Its Principal Space for Frequentist Evaluation of Bayesian Estimators.

Neural computation·2026
Same journal

A Hidden Markov Model-Inspired Sequence Classification Method for Hyperdimensional Computing.

Neural computation·2026
Same journal

Sparse Graphical Modeling for Electrophysiological Phase-Based Connectivity Using Circular Statistics.

Neural computation·2026
See all related articles

Related Experiment Video

Updated: Jun 8, 2026

Age-dependent Dynamics of Locomotion in Caenorhabditis elegans: A Lyapunov Exponent Analysis
06:44

Age-dependent Dynamics of Locomotion in Caenorhabditis elegans: A Lyapunov Exponent Analysis

Published on: September 23, 2025

Change-based inference in attractor nets: linear analysis.

Reza Moazzezi1, Peter Dayan

  • 1Gatsby Computational Neuroscience Unit, UCL, London, WC1N 3AR, U.K.. rezamoazzezi@berkeley.edu

Neural Computation
|September 23, 2010
PubMed
Summary
This summary is machine-generated.

Cortical neuron networks may compute using changing states, not fixed attractors. This novel approach offers faster, more robust neural computations compared to traditional models.

More Related Videos

Dynamic Clamp Methods to Investigate Impaired Neuronal Excitability Associated with Autism
08:44

Dynamic Clamp Methods to Investigate Impaired Neuronal Excitability Associated with Autism

Published on: October 17, 2025

Related Experiment Videos

Last Updated: Jun 8, 2026

Age-dependent Dynamics of Locomotion in Caenorhabditis elegans: A Lyapunov Exponent Analysis
06:44

Age-dependent Dynamics of Locomotion in Caenorhabditis elegans: A Lyapunov Exponent Analysis

Published on: September 23, 2025

Dynamic Clamp Methods to Investigate Impaired Neuronal Excitability Associated with Autism
08:44

Dynamic Clamp Methods to Investigate Impaired Neuronal Excitability Associated with Autism

Published on: October 17, 2025

Area of Science:

  • Computational Neuroscience
  • Neural Dynamics
  • Cognitive Science

Background:

  • The standard model of cortical neuron networks posits computations via dynamical attractors, mapping inputs to population codes.
  • This attractor-based view struggles to explain the dynamic firing rates observed in neurons post-stimulus.
  • An alternative framework suggests computations arise from systematic changes in network states over time.

Purpose of the Study:

  • To analyze stimulus discrimination within the change-based computation framework.
  • To compare change-based stimulus discrimination with attractor-based stimulus estimation.
  • To investigate the relationship between estimation accuracy and discrimination performance in neural networks.

Main Methods:

  • Analysis of stimulus discrimination in a change-based neural network model.
  • Direct comparison with stimulus estimation in conventional attractor-based models.
  • Utilized a linear approximation for comparative analysis of both computational paradigms.

Main Results:

  • Demonstrated that perfect stimulus estimation in attractor models correlates with chance-level discrimination performance.
  • Highlighted a fundamental difference in how neural networks process information under attractor vs. change-based dynamics.
  • Quantified the trade-off between estimation and discrimination in these distinct computational frameworks.

Conclusions:

  • The study provides evidence for the efficacy of change-based computations in neural networks.
  • Findings suggest that dynamic state changes, rather than static attractors, may underlie complex neural computations.
  • The results challenge the standard attractor interpretation and offer a new perspective on neural information processing.