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

Associative Learning01:27

Associative Learning

1.1K
Associative learning is a fundamental concept in behavioral psychology, wherein a connection is established between two stimuli or events, leading to a learned response. This process is critical in understanding how behaviors are acquired and modified. Conditioning, the mechanism through which associations are formed, can be divided into two main types: classical conditioning and operant conditioning, each elucidating different aspects of associative learning.
Classical conditioning, also known...
1.1K
Storage01:23

Storage

310
A schema is a mental framework that helps individuals organize and interpret information. Schemata, formed from previous experiences, influence how we process new information: how we encode it, the inferences we make, and how we retrieve it. For instance, a schema for what a typical classroom looks like might include desks, a teacher's desk, a whiteboard, and students in such an environment. This expectation helps us quickly understand and navigate new classrooms without needing to analyze...
310
Law of Independent Assortment02:03

Law of Independent Assortment

62.1K
While Mendel’s Law of Segregation states that the two alleles for one gene are separated into different gametes, a different question of how different genes are inherited remains. For example, is the gene for tall plants inherited with the gene for green peas? Mendel asked this question by experimenting with a dihybrid cross; a cross in which both parents are homozygous for two distinct traits resulting in an F1 generation that are heterozygous for both traits.
62.1K
State Space Representation01:27

State Space Representation

492
The frequency-domain technique, commonly used in analyzing and designing feedback control systems, is effective for linear, time-invariant systems. However, it falls short when dealing with nonlinear, time-varying, and multiple-input multiple-output systems. The time-domain or state-space approach addresses these limitations by utilizing state variables to construct simultaneous, first-order differential equations, known as state equations, for an nth-order system.
Consider an RLC circuit, a...
492
Woodward–Hoffmann Selection Rules and Microscopic Reversibility01:34

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

3.7K
Electrocyclic reactions, cycloadditions, and sigmatropic rearrangements are concerted pericyclic reactions that proceed via a cyclic transition state. These reactions are stereospecific and regioselective. The stereochemistry of the products depends on the symmetry characteristics of the interacting orbitals and the reaction conditions. Accordingly, pericyclic reactions are classified as either symmetry-allowed or symmetry-forbidden. Woodward and Hoffmann presented the selection criteria for...
3.7K
Cartesian Vector Notation01:28

Cartesian Vector Notation

1.3K
Cartesian vector notation is a valuable tool in mechanical engineering for representing vectors in three-dimensional space, performing vector operations such as determining the gradient, divergence, and curl, and expressing physical quantities such as the displacement, velocity, acceleration, and force. By using Cartesian vector notation, engineers can more easily analyze and solve problems in various areas of mechanical engineering, including dynamics, kinematics, and fluid mechanics. This...
1.3K

You might also read

Related Articles

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

Sort by
Same author

Nested Grover's Algorithm for Tree Search.

Entropy (Basel, Switzerland)·2026
Same author

Multilevel Data Representation for Training Deep Helmholtz Machines.

Neural computation·2025
Same author

Quantum Machine Learning-Quo Vadis?

Entropy (Basel, Switzerland)·2024
Same author

Can a Hebbian-like learning rule be avoiding the curse of dimensionality in sparse distributed data?

Biological cybernetics·2024
Same author

Promoting the Shift From Pixel-Level Correlations to Object Semantics Learning by Rethinking Computer Vision Benchmark Data Sets.

Neural computation·2024
Same author

Competitive learning to generate sparse representations for associative memory.

Neural networks : the official journal of the International Neural Network Society·2023
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: Jan 5, 2026

Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks
11:18

Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks

Published on: March 2, 2015

10.7K

Storing Object-Dependent Sparse Codes in a Willshaw Associative Network.

Luis Sa-Couto1, Andreas Wichert2

  • 1Department of Computer Science and Engineering, INESC-ID & Instituto Superior Técnico, University of Lisbon, 2744-016 Porto Salvo, Portugal luis.sa.couto@tecnico.ulisboa.pt.

Neural Computation
|October 16, 2019
PubMed
Summary
This summary is machine-generated.

Willshaw networks efficiently store binary patterns, even handwritten digits, using sparse codes. This research demonstrates robust pattern recovery from noisy data, preserving class information even when memory is highly utilized.

More Related Videos

Swin-PSAxialNet: An Efficient Multi-Organ Segmentation Technique
04:48

Swin-PSAxialNet: An Efficient Multi-Organ Segmentation Technique

Published on: July 5, 2024

715
A Procedure for Implanting Organized Arrays of Microwires for Single-unit Recordings in Awake, Behaving Animals
10:58

A Procedure for Implanting Organized Arrays of Microwires for Single-unit Recordings in Awake, Behaving Animals

Published on: February 14, 2014

13.6K

Related Experiment Videos

Last Updated: Jan 5, 2026

Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks
11:18

Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks

Published on: March 2, 2015

10.7K
Swin-PSAxialNet: An Efficient Multi-Organ Segmentation Technique
04:48

Swin-PSAxialNet: An Efficient Multi-Organ Segmentation Technique

Published on: July 5, 2024

715
A Procedure for Implanting Organized Arrays of Microwires for Single-unit Recordings in Awake, Behaving Animals
10:58

A Procedure for Implanting Organized Arrays of Microwires for Single-unit Recordings in Awake, Behaving Animals

Published on: February 14, 2014

13.6K

Area of Science:

  • Artificial Intelligence
  • Computational Neuroscience
  • Machine Learning

Background:

  • Willshaw networks are associative memory models utilizing binary weights for efficient pattern storage and retrieval.
  • Traditional Willshaw networks require sparse, randomly generated codes for optimal fault-tolerant performance.
  • Mapping complex data like visual patterns into suitable binary codes is a significant challenge.

Discussion:

  • This study explores encoding MNIST handwritten digits into informative binary features for storage in a Willshaw network.
  • The research investigates the autoassociative capabilities of Willshaw networks with these transformed visual patterns.
  • Performance is evaluated under both noisy and noiseless cue conditions to assess retrieval accuracy and information preservation.

Key Insights:

  • MNIST digits can be effectively transformed into well-distributed binary codes suitable for Willshaw networks.
  • Willshaw networks demonstrate fault-tolerant pattern recovery from noisy cues, preserving essential class information.
  • High memory utilization (several factors of capacity) still allows for successful retrieval of relevant pattern information.

Outlook:

  • Further research could explore optimizing the feature extraction process for diverse visual datasets.
  • Investigating the theoretical limits of Willshaw network capacity with structured binary codes is warranted.
  • Potential applications include efficient, low-power hardware implementations for pattern recognition tasks.