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

Statistical Inference Techniques in Hypothesis Testing: Parametric Versus Nonparametric Data01:16

Statistical Inference Techniques in Hypothesis Testing: Parametric Versus Nonparametric Data

Statistical inference techniques, paramount in hypothesis testing, differentiate into two broad categories: parametric and nonparametric statistics.
Parametric statistics, as the name suggests, assumes that data follow a specific distribution, often a normal distribution. This assumption enables robust hypothesis testing and estimation. Parametric methods, like the Student's t-test or Goodness-of-fit test, are frequently employed in biostatistics due to their robustness. For instance, comparing...
Maxwell-Boltzmann Distribution: Problem Solving01:20

Maxwell-Boltzmann Distribution: Problem Solving

Individual molecules in a gas move in random directions, but a gas containing numerous molecules has a predictable distribution of molecular speeds, which is known as the Maxwell-Boltzmann distribution, f(v).
This distribution function f(v) is defined by saying that the expected number N (v1,v2) of particles with speeds between v1 and v2 is given by
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Observational Learning01:12

Observational Learning

Albert Bandura's observational learning, also known as imitation or modeling, occurs when a person observes and imitates another's behavior. It is a quicker process than operant conditioning. A well-known example is the Bobo doll study, where children who saw an adult acting aggressively towards the doll were more likely to act aggressively when left alone, compared to those who observed a nonaggressive adult. Many psychologists view observational learning as a form of latent learning because...
Model Approaches for Pharmacokinetic Data: Distributed Parameter Models01:06

Model Approaches for Pharmacokinetic Data: Distributed Parameter Models

Pharmacokinetic models are mathematical constructs that represent and predict the time course of drug concentrations in the body, providing meaningful pharmacokinetic parameters. These models are categorized into compartment, physiological, and distributed parameter models.
The distributed parameter models are specifically designed to account for variations and differences in some drug classes. This model is particularly useful for assessing regional concentrations of anticancer or...
Introduction to Nonparametric Statistics01:28

Introduction to Nonparametric Statistics

Nonparametric statistics offer a powerful alternative to traditional parametric methods, useful when assumptions about the population distribution cannot be made. Unlike parametric tests, which require data to follow a specific distribution with well-defined parameters (such as the mean and standard deviation), nonparametric tests do not require such constraints. This makes them particularly valuable when dealing with small sample sizes, skewed data, or ordinal and categorical variables.
One of...

You might also read

Related Articles

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

Sort by
Same author

Inference from aging information.

IEEE transactions on neural networks·2010
Same author

Performance of the Bayesian online algorithm for the perceptron.

IEEE transactions on neural networks·2007
See all related articles

Related Experiment Video

Updated: Jul 16, 2026

Measuring Statistical Learning Across Modalities and Domains in School-Aged Children Via an Online Platform and Neuroimaging Techniques
08:05

Measuring Statistical Learning Across Modalities and Domains in School-Aged Children Via an Online Platform and Neuroimaging Techniques

Published on: June 30, 2020

The Rosenblatt Bayesian algorithm learning in a nonstationary environment.

Evaldo Araújo de Oliveira

    IEEE Transactions on Neural Networks
    |March 28, 2007
    PubMed
    Summary

    We explored online learning in neural networks (NNs) using Bayesian approximation. A full covariance matrix approach excels in nonstationary environments, unlike simplified spherical approximations.

    Area of Science:

    • Machine Learning
    • Bayesian Inference
    • Neural Networks

    Background:

    • This study investigates online learning algorithms for neural networks (NNs) derived from Bayesian learning principles.
    • The research focuses on Gibbs learning with the Rosenblatt potential in dynamic, nonstationary environments.
    • An online learning scheme is developed by minimizing Kullback-Leibler divergence (cross-entropy) between true and parameterized posterior distributions.

    Discussion:

    • The computational complexity is reduced by projecting the posterior distribution onto a Gaussian with a spherical covariance matrix.
    • The performance of these approximations is analyzed, particularly for learning linearly separable rules.
    • A comparison is made between simplified (spherical covariance) and more complex (full covariance matrix) approximations.

    Related Experiment Videos

    Last Updated: Jul 16, 2026

    Measuring Statistical Learning Across Modalities and Domains in School-Aged Children Via an Online Platform and Neuroimaging Techniques
    08:05

    Measuring Statistical Learning Across Modalities and Domains in School-Aged Children Via an Online Platform and Neuroimaging Techniques

    Published on: June 30, 2020

    Key Insights:

    • For fixed learning rules, both spherical and full covariance approximations yield an asymptotic generalization error of alpha(-1).
    • Crucially, only the full covariance matrix algorithm demonstrates robust performance when the learning rule is drifting (nonstationary).
    • This superior performance of the full covariance method is notable given its derivation without explicit knowledge of the rule's drift.

    Outlook:

    • Future research could explore adaptive strategies for covariance matrix estimation in online Bayesian learning.
    • Investigating the theoretical underpinnings of why full covariance matrices handle drifting rules better is warranted.
    • The findings suggest potential improvements for real-world applications requiring adaptive machine learning models in changing environments.