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

439
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...
439
Wilcoxon Signed-Ranks Test for Matched Pairs01:09

Wilcoxon Signed-Ranks Test for Matched Pairs

160
The Wilcoxon signed-rank test for matched pairs evaluates the null hypothesis by combining the ranks of differences with their signs. It essentially tests whether the median of the differences in a population of matched pairs is zero. Since the test incorporates more information than the sign test, it generally yields more trustable conclusions. This test also does not require the data to follow a normal distribution, but two conditions must be met for it to be applicable: (1) the data must...
160
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

79
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...
79
Improving Translational Accuracy02:07

Improving Translational Accuracy

2.6K
2.6K
Observational Learning01:12

Observational Learning

209
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...
209
Introduction to Learning01:18

Introduction to Learning

470
Learning is the process of acquiring knowledge or skills through practice or experience, leading to long-lasting behavioral changes. This acquisition occurs through interaction with the environment and requires practice or experience. For instance, mastering a skill such as surfing requires considerable practice and experience, highlighting the essential role of repeated interactions with the environment in learning.
In contrast to learned behaviors, unlearned behaviors such as crying, sexual...
470

You might also read

Related Articles

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

Sort by
Same author

Mediating effects of lipid metabolic and inflammatory factors on skeletal muscle mass in adults: A cross-sectional study.

Medicine·2026
Same author

Sarcopenia-associated traits and sepsis risk: a Mendelian Randomization and Prospective Observational Study.

Shock (Augusta, Ga.)·2026
Same author

A Biomimetic Dual-Targeting Nano-APA-Editor Reprograms the 3'UTR Landscape for Tongue Squamous Cell Carcinoma Therapy.

Advanced science (Weinheim, Baden-Wurttemberg, Germany)·2026
Same author

International Validation of Temperature-Trajectory Sepsis Subphenotypes With Longitudinal Immune and Coagulation Patterns and Its Implications for Immunoglobulin Therapy.

Critical care medicine·2026
Same author

CD301b<sup>+</sup> tissue-resident macrophages drive bone repair as an early-responding subpopulation.

International immunopharmacology·2026
Same author

Cannabidiol corrects sleep deficits and reduces spontaneous seizures in Angelman syndrome model mice.

Neuropsychopharmacology : official publication of the American College of Neuropsychopharmacology·2026
Same journal

Hidden Data Recovery and Forecasting via Next-Generation Reservoir Computing With Multiscale Delay Selection.

IEEE transactions on neural networks and learning systems·2026
Same journal

CAFF-CIL: Causality-Aware Freedom Forgetting Approach for Class-Incremental Learning.

IEEE transactions on neural networks and learning systems·2026
Same journal

Harmonic Autoencoding Framework for Multiple Tasks in Magnetic Particle Imaging Reconstruction.

IEEE transactions on neural networks and learning systems·2026
Same journal

A Survey on Human-Centric Voice-Face Multimodal Learning.

IEEE transactions on neural networks and learning systems·2026
Same journal

Vision-Assisted Foundation Model for Solving Multitask Vehicle Routing Problems.

IEEE transactions on neural networks and learning systems·2026
Same journal

FP3O: Enabling Proximal Policy Optimization in Multiagent Cooperation With Parameter-Sharing Versatility.

IEEE transactions on neural networks and learning systems·2026
See all related articles

Related Experiment Video

Updated: Jul 17, 2025

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.6K

New Scalable and Efficient Online Pairwise Learning Algorithm.

Bin Gu, Runxue Bao, Chenkang Zhang

    IEEE Transactions on Neural Networks and Learning Systems
    |September 1, 2023
    PubMed
    Summary
    This summary is machine-generated.

    A new dynamic doubly stochastic gradient (D2SG) algorithm significantly improves online pairwise learning for large, high-dimensional datasets. This efficient and scalable machine learning approach offers faster processing and guaranteed statistical accuracy.

    More Related Videos

    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

    7.6K
    Deep Neural Networks for Image-Based Dietary Assessment
    13:19

    Deep Neural Networks for Image-Based Dietary Assessment

    Published on: March 13, 2021

    9.2K

    Related Experiment Videos

    Last Updated: Jul 17, 2025

    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.6K
    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

    7.6K
    Deep Neural Networks for Image-Based Dietary Assessment
    13:19

    Deep Neural Networks for Image-Based Dietary Assessment

    Published on: March 13, 2021

    9.2K

    Area of Science:

    • Machine Learning
    • Data Science
    • Computer Science

    Background:

    • Online algorithms are crucial for processing streaming data and large-scale pairwise learning.
    • Existing methods struggle with scalability and efficiency for high-dimensional data due to singly stochastic gradients.

    Purpose of the Study:

    • To propose a novel dynamic doubly stochastic gradient (D2SG) algorithm for efficient and scalable online pairwise learning.
    • To address the limitations of existing algorithms in handling large-scale, high-dimensional datasets.

    Main Methods:

    • Developed a dynamic doubly stochastic gradient (D2SG) algorithm specifically for online pairwise learning.
    • Analyzed the time and space complexity for incorporating new samples, achieving O(d) complexity where d is data dimensionality.
    • Provided rigorous theoretical analysis to guarantee statistical accuracy under standard assumptions.

    Main Results:

    • The D2SG algorithm demonstrates significantly improved speed and scalability compared to existing online pairwise learning methods.
    • Experimental results on real-world datasets validate the theoretical findings of the D2SG algorithm.
    • The D2SG algorithm shows superior efficiency and scalability for large-scale, high-dimensional data.

    Conclusions:

    • The proposed D2SG algorithm effectively overcomes the scalability and efficiency challenges in online pairwise learning for high-dimensional data.
    • D2SG offers a promising solution for real-world applications involving large-scale streaming data.
    • The algorithm achieves a favorable balance between computational efficiency and statistical accuracy.