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

Prediction Intervals01:03

Prediction Intervals

2.3K
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.3K
Random Variables01:09

Random Variables

12.3K
A random variable is a single numerical value that indicates the outcome of a procedure. The concept of random variables is fundamental to the probability theory and was introduced by a Russian mathematician, Pafnuty Chebyshev, in the mid-nineteenth century.
Uppercase letters such as X or Y denote a random variable. Lowercase letters like x or y denote the value of a random variable. If X is a random variable, then X is written in words, and x is given as a number.
For example, let X = the...
12.3K
Improving Translational Accuracy02:07

Improving Translational Accuracy

11.6K
Base complementarity between the three base pairs of mRNA codon and the tRNA anticodon is not a failsafe mechanism. Inaccuracies can range from a single mismatch to no correct base pairing at all. The free energy difference between the correct and nearly correct base pairs can be as small as 3 kcal/ mol. With complementarity being the only proofreading step, the estimated error frequency would be one wrong amino acid in every 100 amino acids incorporated. However, error frequencies observed in...
11.6K
End Point Prediction: Gran Plot01:07

End Point Prediction: Gran Plot

377
A Gran plot is used to predict the equivalence volume or endpoint of a potentiometric or acid-base titration without reaching the endpoint. Typically, titration data is collected as a function of the titrant's volume up to a point less than the equivalence volume and then transformed into a linear format. The straight line is extended to the x-axis, indicating the necessary titrant volume to achieve the equivalence point.
For potentiometric titration, the Gran plot is created by plotting...
377
Survival Tree01:19

Survival Tree

109
Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
 Building a Survival Tree
Constructing a...
109
Randomized Experiments01:13

Randomized Experiments

7.0K
The randomization process involves assigning study participants randomly to experimental or control groups based on their probability of being equally assigned. Randomization is meant to eliminate selection bias and balance known and unknown confounding factors so that the control group is similar to the treatment group as much as possible. A computer program and a random number generator can be used to assign participants to groups in a way that minimizes bias.
Simple randomization
Simple...
7.0K

You might also read

Related Articles

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

Sort by
Same author

Cell Segmentation as Strategic Decision Making.

Research (Washington, D.C.)·2026
Same author

Preparation of biodegradable poly(lactic acid)-<i>b</i>-polyamide 4 block poly(ester amide) and its electrospun fibers.

RSC advances·2026
Same author

OBIMD: A Multi-modal Dataset for Contextual Interpretation of Oracle Bone Inscriptions.

Scientific data·2026
Same author

Evaluating and Mitigating Relationship Hallucinations in Large Vision-Language Models.

IEEE transactions on pattern analysis and machine intelligence·2026
Same author

Editorial: Inflammation in the elderly: therapeutic drugs and strategies.

Frontiers in medicine·2026
Same author

A spatially resolved atlas of gastric cancer characterises a lymphocyte-aggregated region.

Nature communications·2026
Same journal

Relation DETR+: Exploring Explicit Position Relation Prior for Dense Prediction.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

RBF++: Quantifying and Optimizing Reasoning Boundaries across Measurable and Unmeasurable Capabilities for Chain-of-Thought Reasoning.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

CAFE: Cross-View Adaptive Fusion and Cluster Center Enhancement for Robust Multi-View Clustering.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

DIVER: Reinforced Diffusion Breaks Imitation Bottlenecks in End-to-End Autonomous Driving.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Ethics-Aware Safe Reinforcement Learning for Rare-Event Risk Control in Interactive Urban Driving.

IEEE transactions on pattern analysis and machine intelligence·2026
Same journal

Learning Shape Anchors for Holistic Indoor Scene Understanding.

IEEE transactions on pattern analysis and machine intelligence·2026
See all related articles

Related Experiment Video

Updated: Jul 17, 2025

Author Spotlight: Impact of Intergenic Interactions on Disease-Identifying Dark Biomarkers
03:37

Author Spotlight: Impact of Intergenic Interactions on Disease-Identifying Dark Biomarkers

Published on: March 1, 2024

798

Lottery Jackpots Exist in Pre-Trained Models.

Yuxin Zhang, Mingbao Lin, Yunshan Zhong

    IEEE Transactions on Pattern Analysis and Machine Intelligence
    |September 5, 2023
    PubMed
    Summary
    This summary is machine-generated.

    Discover "lottery jackpots," sparse sub-networks found in pre-trained models without weight training. These efficient lottery jackpots significantly reduce network complexity while maintaining high performance, enabling faster neural network pruning.

    More Related Videos

    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
    Augmenting Large Language Models via Vector Embeddings to Improve Domain-Specific Responsiveness
    03:14

    Augmenting Large Language Models via Vector Embeddings to Improve Domain-Specific Responsiveness

    Published on: December 6, 2024

    618

    Related Experiment Videos

    Last Updated: Jul 17, 2025

    Author Spotlight: Impact of Intergenic Interactions on Disease-Identifying Dark Biomarkers
    03:37

    Author Spotlight: Impact of Intergenic Interactions on Disease-Identifying Dark Biomarkers

    Published on: March 1, 2024

    798
    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
    Augmenting Large Language Models via Vector Embeddings to Improve Domain-Specific Responsiveness
    03:14

    Augmenting Large Language Models via Vector Embeddings to Improve Domain-Specific Responsiveness

    Published on: December 6, 2024

    618

    Area of Science:

    • Artificial Intelligence
    • Computer Science
    • Machine Learning

    Background:

    • Network pruning reduces model complexity but often requires extensive training or wide networks.
    • Existing methods are computationally expensive and limit practical applications of network pruning.

    Purpose of the Study:

    • To identify high-performing, sparse sub-networks (lottery jackpots) within pre-trained models without weight retraining.
    • To improve the efficiency of searching for these lottery jackpots.
    • To analyze and optimize the lottery jackpot searching process.

    Main Methods:

    • Identifying sparse sub-networks (lottery jackpots) in pre-trained models without modifying weights.
    • Leveraging magnitude-based pruning to initialize sparse masks, reducing search costs.
    • Proposing a novel short restriction method to stabilize mask searching and improve convergence.

    Main Results:

    • A lottery jackpot sub-network with 10% of VGGNet-19 parameters achieved original performance on CIFAR-10 without weight retraining.
    • Initializing with magnitude-based pruning reduced lottery jackpot search cost by at least 3x.
    • A ResNet-50 lottery jackpot achieved >70% top-1 accuracy on ImageNet with 90% weight removal in only 5 search epochs.

    Conclusions:

    • High-performing sparse sub-networks (lottery jackpots) exist in pre-trained models, offering efficient network compression.
    • Optimized search strategies, including magnitude-based initialization and short restriction, significantly enhance the efficiency of finding lottery jackpots.
    • This approach enables substantial model compression with minimal performance loss, making network pruning more accessible.