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

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

890
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...
890
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

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

Improving Translational Accuracy

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

Improving Translational Accuracy

3.3K
3.3K
Survival Tree01:19

Survival Tree

221
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...
221
Quantifying and Rejecting Outliers: The Grubbs Test01:02

Quantifying and Rejecting Outliers: The Grubbs Test

3.0K
Sometimes, a data set can have a recorded numerical observation that greatly  deviates from the rest of the data. Assuming that the data is normally distributed, a statistical method called the Grubbs test can be used to determine whether the observation is truly an outlier.  To perform a two-tailed Grubbs test, first, calculate the absolute difference between the outlier and the mean. Then, calculate the ratio between this difference and the standard deviation of the sample. This...
3.0K

You might also read

Related Articles

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

Sort by
Same author

A high-resolution spatiotemporal wildfire propagation dataset for the Mediterranean and Europe.

Scientific data·2026
Same author

A foundation model for atomistic materials chemistry.

The Journal of chemical physics·2025
Same author

FIORA: Local neighborhood-based prediction of compound mass spectra from single fragmentation events.

Nature communications·2025
Same author

A Quantum-Chemical Bonding Database for Solid-State Materials.

Scientific data·2023
Same author

Mistle: bringing spectral library predictions to metaproteomics with an efficient search index.

Bioinformatics (Oxford, England)·2023
Same author

Lab-scale photobioreactor systems: principles, applications, and scalability.

Bioprocess and biosystems engineering·2022

Related Experiment Video

Updated: Nov 12, 2025

Comparison of Predictive Performance of Three Lymph Node Staging Systems in Colorectal Signet Ring Cell Carcinoma Based on Machine Learning Model
07:13

Comparison of Predictive Performance of Three Lymph Node Staging Systems in Colorectal Signet Ring Cell Carcinoma Based on Machine Learning Model

Published on: April 18, 2025

315

Computing Leapfrog Regularization Paths with Applications to Large-Scale K-mer Logistic Regression.

Philipp Benner1

  • 1Department of Computational Molecular Biology, Max Planck Institute for Molecular Genetics, Berlin, Germany.

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|March 19, 2021
PubMed
Summary
This summary is machine-generated.

This study introduces a new algorithm for high-dimensional statistics, specifically for L1-regularization. It efficiently determines the regularization strength for a desired number of features, avoiding costly computation of entire regularization paths.

Keywords:
LARSfeature selectionorthogonal matching pursuit

More Related Videos

Assisted Selection of Biomarkers by Linear Discriminant Analysis Effect Size LEfSe in Microbiome Data
04:57

Assisted Selection of Biomarkers by Linear Discriminant Analysis Effect Size LEfSe in Microbiome Data

Published on: May 16, 2022

16.6K
A Concoction Pipeline for Generating Molecular Operational Taxonomic Units (MOTUs) Among Riparian and Aquatic Beetles
10:23

A Concoction Pipeline for Generating Molecular Operational Taxonomic Units (MOTUs) Among Riparian and Aquatic Beetles

Published on: July 11, 2025

358

Related Experiment Videos

Last Updated: Nov 12, 2025

Comparison of Predictive Performance of Three Lymph Node Staging Systems in Colorectal Signet Ring Cell Carcinoma Based on Machine Learning Model
07:13

Comparison of Predictive Performance of Three Lymph Node Staging Systems in Colorectal Signet Ring Cell Carcinoma Based on Machine Learning Model

Published on: April 18, 2025

315
Assisted Selection of Biomarkers by Linear Discriminant Analysis Effect Size LEfSe in Microbiome Data
04:57

Assisted Selection of Biomarkers by Linear Discriminant Analysis Effect Size LEfSe in Microbiome Data

Published on: May 16, 2022

16.6K
A Concoction Pipeline for Generating Molecular Operational Taxonomic Units (MOTUs) Among Riparian and Aquatic Beetles
10:23

A Concoction Pipeline for Generating Molecular Operational Taxonomic Units (MOTUs) Among Riparian and Aquatic Beetles

Published on: July 11, 2025

358

Area of Science:

  • Statistics
  • Machine Learning
  • Data Science

Background:

  • High-dimensional statistics addresses inference when features (p) exceed observations (n).
  • Regularization and feature selection are key for parameter space constraints in such scenarios.
  • L1-regularization combines both approaches, offering practical benefits but with unclear regularization strength-feature relationships.

Purpose of the Study:

  • To develop an efficient algorithm for L1-regularization in high-dimensional settings.
  • To overcome the computational expense of calculating full regularization paths.
  • To enable iterative determination of L1-regularization strength for a fixed number of features (m).

Main Methods:

  • An iterative algorithm is proposed to determine the L1-regularization strength.
  • The method allows for computing regularization paths by subsequently increasing the number of selected features (m).
  • This approach offers an alternative to estimating parameters for all possible regularization strengths.

Main Results:

  • The proposed algorithm efficiently finds the L1-regularization strength for a specified number of features.
  • It enables the computation of 'leapfrog' regularization paths by incrementally increasing 'm'.
  • This method reduces computational cost compared to traditional approaches.

Conclusions:

  • The developed algorithm provides an efficient solution for L1-regularization in high-dimensional statistics.
  • It offers a practical alternative for exploring regularization paths and feature selection.
  • The method is valuable for scenarios where specific numbers of features are targeted.