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

Binomial Probability Distribution01:15

Binomial Probability Distribution

13.1K
A binomial distribution is a probability distribution for a procedure with a fixed number of trials, where each trial can have only two outcomes.
The outcomes of a binomial experiment fit a binomial probability distribution. A statistical experiment can be classified as a binomial experiment if the following conditions are met:
There are a fixed number of trials. Think of trials as repetitions of an experiment. The letter n denotes the number of trials.
There are only two possible outcomes,...
13.1K
Prediction Intervals01:03

Prediction Intervals

2.5K
The interval estimate of any variable is known as the prediction interval. It helps decide if a point estimate is dependable.
However, the point estimate is most likely not the exact value of the population parameter, but close to it. After calculating point estimates, we construct interval estimates, called confidence intervals or prediction intervals. This prediction interval comprises a range of values unlike the point estimate and is a better predictor of the observed sample value, y. 
2.5K
Propagation of Uncertainty from Random Error00:59

Propagation of Uncertainty from Random Error

1.9K
An experiment often consists of more than a single step. In this case, measurements at each step give rise to uncertainty. Because the measurements occur in successive steps, the uncertainty in one step necessarily contributes to that in the subsequent step. As we perform statistical analysis on these types of experiments, we must learn to account for the propagation of uncertainty from one step to the next. The propagation of uncertainty depends on the type of arithmetic operation performed on...
1.9K
Genetic Drift03:33

Genetic Drift

35.3K
Natural selection—probably the most well-known evolutionary mechanism—increases the prevalence of traits that enhance survival and reproduction. However, evolution does not merely propagate favorable traits, nor does it always benefit populations.
35.3K
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation01:24

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation

1.5K
This lesson introduces two critical methods in pharmacokinetics, the Wagner-Nelson and Loo-Riegelman methods, used for estimating the absorption rate constant (ka) for drugs administered via non-intravenous routes. The Wagner-Nelson method relates ka to the plasma concentration derived from the slope of a semilog percent unabsorbed time plot. However, it is limited to drugs with one-compartment kinetics and can be impacted by factors like gastrointestinal motility or enzymatic degradation.
On...
1.5K
Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

501
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....
501

You might also read

Related Articles

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

Sort by
Same author

A folk taxonomy of magic.

Cognition·2026
Same author

A reporting checklist for large language models in behavioural science.

Nature human behaviour·2026
Same author

Resolving Feynman's restaurant problem reveals optimal solutions and human strategies.

Proceedings of the National Academy of Sciences of the United States of America·2026
Same author

Considering Psychological Mechanisms Can Change the Interpretation of Bayesian Models.

Topics in cognitive science·2026
Same author

Do infants recognize relationships indirectly?

The Behavioral and brain sciences·2026
Same author

The codevelopment of children's general causal reasoning and their causal reasoning of illness transmission.

Developmental psychology·2026
Same journal

Sublexical semantic decoding during incidental novel word learning in natural Chinese reading.

Cognitive psychology·2026
Same journal

Seeing, hearing, and feeling causation.

Cognitive psychology·2026
Same journal

Separating decision and motor contributions to behavioral biases induced by manipulating stimulus probability.

Cognitive psychology·2026
Same journal

Congruency drives "conflict adaptation" independent of conflict: Converging evidence from behavior and computational modeling.

Cognitive psychology·2026
Same journal

Corrigendum to "Network analyses identify critical factors for facilitating future-oriented decision-making" [Cogn. Psychol. 165 (2026) 101815].

Cognitive psychology·2026
Same journal

The time course of local coherence effects in German: Evidence from self-paced reading times and event-related potentials.

Cognitive psychology·2026
See all related articles

Related Experiment Video

Updated: Apr 26, 2026

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types
12:39

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

Published on: December 10, 2012

10.6K

Win-Stay, Lose-Sample: a simple sequential algorithm for approximating Bayesian inference.

Elizabeth Bonawitz1, Stephanie Denison2, Alison Gopnik3

  • 1Department of Psychology, Rutgers University - Newark, Newark, NJ USA.

Cognitive Psychology
|August 4, 2014
PubMed
Summary
This summary is machine-generated.

People approximate complex Bayesian inference using a simple "Win-Stay, Lose-Sample" algorithm. This cognitive strategy, observed in adults and preschoolers, offers a practical approach to understanding belief updating in causal learning.

Keywords:
Algorithmic levelBayesian inferenceCausal learning

More Related Videos

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
08:12

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

2.1K
A Tactile Automated Passive-Finger Stimulator TAPS
19:44

A Tactile Automated Passive-Finger Stimulator TAPS

Published on: June 3, 2009

14.9K

Related Experiment Videos

Last Updated: Apr 26, 2026

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types
12:39

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

Published on: December 10, 2012

10.6K
A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
08:12

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

2.1K
A Tactile Automated Passive-Finger Stimulator TAPS
19:44

A Tactile Automated Passive-Finger Stimulator TAPS

Published on: June 3, 2009

14.9K

Area of Science:

  • Cognitive Science
  • Computational Neuroscience
  • Developmental Psychology

Background:

  • Human cognition often aligns with Bayesian models, yet exact Bayesian inference is computationally intensive.
  • The cognitive mechanisms enabling approximate Bayesian inference in humans remain an active area of research.
  • Understanding how individuals update beliefs sequentially based on new evidence is crucial for cognitive modeling.

Purpose of the Study:

  • To investigate potential algorithms underlying approximate Bayesian inference in human cognition.
  • To test if a sequential "Win-Stay, Lose-Sample" (WSLS) algorithm can model human belief updating.
  • To examine the applicability of this algorithm across different age groups and learning scenarios.

Main Methods:

  • Developed a Bayesian approximation using the "Win-Stay, Lose-Sample" (WSLS) principle.
  • Employed a "mini-microgenetic method" to track belief updates in real-time during causal learning tasks.
  • Conducted experiments with adults and preschoolers involving deterministic and stochastic causal inference scenarios.

Main Results:

  • Behavioral data from adults and preschoolers on causal learning tasks were consistent with the proposed Bayesian WSLS algorithm.
  • The WSLS algorithm effectively approximated Bayesian inference in both deterministic and stochastic environments.
  • Evidence suggests that humans may utilize such sequential sampling strategies for efficient belief updating.

Conclusions:

  • The "Win-Stay, Lose-Sample" algorithm provides a plausible computational mechanism for approximate Bayesian inference in humans.
  • This finding offers a novel perspective on human judgment and decision-making, particularly in causal reasoning.
  • The study highlights the potential of simple sequential algorithms to explain complex cognitive behaviors across development.