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

Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

505
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....
505
Frequency-dependent Selection01:21

Frequency-dependent Selection

20.2K
When the fitness of a trait is influenced by how common it is (i.e., its frequency) relative to different traits within a population, this is referred to as frequency-dependent selection. Frequency-dependent selection may occur between species or within a single species. This type of selection can either be positive—with more common phenotypes having higher fitness—or negative, with rarer phenotypes conferring increased fitness.
20.2K
Woodward–Hoffmann Selection Rules and Microscopic Reversibility01:34

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

2.2K
Electrocyclic reactions, cycloadditions, and sigmatropic rearrangements are concerted pericyclic reactions that proceed via a cyclic transition state. These reactions are stereospecific and regioselective. The stereochemistry of the products depends on the symmetry characteristics of the interacting orbitals and the reaction conditions. Accordingly, pericyclic reactions are classified as either symmetry-allowed or symmetry-forbidden. Woodward and Hoffmann presented the selection criteria for...
2.2K
Predicting Products: Substitution vs. Elimination02:52

Predicting Products: Substitution vs. Elimination

11.2K
When a nucleophile and an alkyl halide react, nucleophilic substitution and β-elimination reactions compete to generate products.
The following factors can influence the mechanisms competing against each other:
11.2K
Sampling Methods: Overview01:06

Sampling Methods: Overview

3.8K
A sample refers to a smaller subset representative of a larger population. In analytical chemistry, studying or analyzing an entire population is often impractical or impossible. Therefore, samples are used to draw inferences and generalize the whole population. The sampling method selects individuals or items from a population to create a sample. Standard sampling methods include random, judgemental, systematic, stratified, and cluster sampling. 
In analytical chemistry, the choice of...
3.8K
Linear Approximation in Time Domain01:21

Linear Approximation in Time Domain

460
Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
460

You might also read

Related Articles

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

Sort by
Same author

DrawMotion: Generating 3D Human Motions by Freehand Drawing.

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

MC#: Mixture Compressor for Mixture-of-Experts Large Models.

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

UniVST: A Unified Framework for Training-Free Localized Video Style Transfer.

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

Gamba: Marry Gaussian Splatting With Mamba for Single-View 3D Reconstruction.

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

Decoupled Prioritized Resampling for Offline RL.

IEEE transactions on neural networks and learning systems·2025
Same author

Hierarchical Banzhaf Interaction for General Video-Language Representation Learning.

IEEE transactions on pattern analysis and machine intelligence·2025
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: May 6, 2026

Lexical Decision Task for Studying Written Word Recognition in Adults with and without Dementia or Mild Cognitive Impairment
06:48

Lexical Decision Task for Studying Written Word Recognition in Adults with and without Dementia or Mild Cognitive Impairment

Published on: June 25, 2019

8.8K

Forward basis selection for pursuing sparse representations over a dictionary.

Xiao-Tong Yuan1, Shuicheng Yan

  • 1Nanjing University of Information Science and Technology, China and National University of Singapore, Singapore.

IEEE Transactions on Pattern Analysis and Machine Intelligence
|October 19, 2013
PubMed
Summary
This summary is machine-generated.

This study introduces a generalized greedy algorithm for sparse representation learning over dictionaries. The method enhances accuracy and efficiency in applications like precision matrix estimation.

More Related Videos

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
07:35

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

7.0K
A Simple Stimulatory Device for Evoking Point-like Tactile Stimuli: A Searchlight for LFP to Spike Transitions
07:34

A Simple Stimulatory Device for Evoking Point-like Tactile Stimuli: A Searchlight for LFP to Spike Transitions

Published on: March 25, 2014

9.3K

Related Experiment Videos

Last Updated: May 6, 2026

Lexical Decision Task for Studying Written Word Recognition in Adults with and without Dementia or Mild Cognitive Impairment
06:48

Lexical Decision Task for Studying Written Word Recognition in Adults with and without Dementia or Mild Cognitive Impairment

Published on: June 25, 2019

8.8K
Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
07:35

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

7.0K
A Simple Stimulatory Device for Evoking Point-like Tactile Stimuli: A Searchlight for LFP to Spike Transitions
07:34

A Simple Stimulatory Device for Evoking Point-like Tactile Stimuli: A Searchlight for LFP to Spike Transitions

Published on: March 25, 2014

9.3K

Area of Science:

  • Machine Learning
  • Optimization Algorithms
  • Signal Processing

Background:

  • The Frank-Wolfe algorithm is effective for coordinate-wise sparse learning.
  • Existing methods face challenges in pursuing sparse representations over prefixed dictionaries.

Purpose of the Study:

  • To generalize the forward greedy selection algorithm for sparse representations over a prefixed dictionary.
  • To analyze the convergence rate of the proposed greedy selection procedure.
  • To extend the algorithm for nonnegative and convex sparse representations.

Main Methods:

  • Iterative selection of dictionary atoms.
  • Minimization of the objective function over linear combinations of selected atoms.
  • Analysis of convergence rates for the greedy selection procedure.

Main Results:

  • The proposed algorithm efficiently learns sparse representations over prefixed dictionaries.
  • Convergence rate analysis provides theoretical guarantees.
  • Extended algorithms demonstrate effectiveness in sparse precision matrix estimation and low-rank subspace segmentation.

Conclusions:

  • The generalized greedy algorithm offers a robust approach to sparse representation learning.
  • The method shows significant efficiency and effectiveness on benchmark datasets.
  • This work advances sparse learning techniques with broad applicability.