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

Random Error01:04

Random Error

10.1K
Random or indeterminate errors originate from various uncontrollable variables, such as variations in environmental conditions, instrument imperfections, or the inherent variability of the phenomena being measured. Usually, these errors cannot be predicted, estimated, or characterized because their direction and magnitude often vary in magnitude and direction even during consecutive measurements. As a result, they are difficult to eliminate. However, the aggregate effect of these errors can be...
10.1K
Propagation of Uncertainty from Random Error00:59

Propagation of Uncertainty from Random Error

2.1K
An experiment often consists of more than a single step. In this case, measurements at each step give rise to uncertainty. Because the measurements occur in successive steps, the uncertainty in one step necessarily contributes to that in the subsequent step. As we perform statistical analysis on these types of experiments, we must learn to account for the propagation of uncertainty from one step to the next. The propagation of uncertainty depends on the type of arithmetic operation performed on...
2.1K
Survival Tree01:19

Survival Tree

468
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...
468
Implicit Differentiation: Problem Solving01:29

Implicit Differentiation: Problem Solving

141
Curves defined implicitly, where variables cannot be separated algebraically, require specialized techniques for analysis. The conchoid of Nicomedes exemplifies such a case. Its equation links x and y in a way that prevents isolation of one variable, making implicit differentiation essential to determine the slope and behavior at any point on the curve.The implicit form of the conchoid can be expressed as:To differentiate this equation, y is treated as a function of x, and the chain rule is...
141
Propagation of Uncertainty from Systematic Error01:10

Propagation of Uncertainty from Systematic Error

1.6K
The atomic mass of an element varies due to the relative ratio of its isotopes. A sample's relative proportion of oxygen isotopes influences its average atomic mass. For instance, if we were to measure the atomic mass of oxygen from a sample, the mass would be a weighted average of the isotopic masses of oxygen in that sample. Since a single sample is not likely to perfectly reflect the true atomic mass of oxygen for all the molecules of oxygen on Earth, the mass we obtain from this...
1.6K
Maxwell-Boltzmann Distribution: Problem Solving01:20

Maxwell-Boltzmann Distribution: Problem Solving

3.1K
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
3.1K

You might also read

Related Articles

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

Sort by
Same author

Understanding generative AI output with embedding models.

Science advances·2025
Same author

Privacy-Preserving Visualization of Brain Functional Connectivity.

bioRxiv : the preprint server for biology·2024
Same author

Cortical similarities in psychiatric and mood disorders identified in federated VBM analysis via COINSTAC.

Patterns (New York, N.Y.)·2024
Same author

Enhancing collaborative neuroimaging research: introducing COINSTAC Vaults for federated analysis and reproducibility.

Frontiers in neuroinformatics·2023
Same author

Approximating Functions with Approximate Privacy for Applications in Signal Estimation and Learning.

Entropy (Basel, Switzerland)·2023
Same author

Enhancing Collaborative Neuroimaging Research: Introducing COINSTAC Vaults for Federated Analysis and Reproducibility.

bioRxiv : the preprint server for biology·2023
Same journal

Entropic Graph-based Posterior Regularization.

JMLR workshop and conference proceedings·2024
Same journal

Uncovering Voice Misuse Using Symbolic Mismatch.

JMLR workshop and conference proceedings·2021
Same journal

Dirichlet Process Mixture Model for Correcting Technical Variation in Single-Cell Gene Expression Data.

JMLR workshop and conference proceedings·2018
Same journal

Anytime Exploration for Multi-armed Bandits using Confidence Information.

JMLR workshop and conference proceedings·2018
Same journal

Greedy Direction Method of Multiplier for MAP Inference of Large Output Domain.

JMLR workshop and conference proceedings·2017
Same journal

Scalable Convex Multiple Sequence Alignment via Entropy-Regularized Dual Decomposition.

JMLR workshop and conference proceedings·2017
See all related articles

Related Experiment Video

Updated: Mar 28, 2026

Author Spotlight: Efficient Image Recognition Using Directional Gradient Histogram Technique and Support Vector Machines
08:27

Author Spotlight: Efficient Image Recognition Using Directional Gradient Histogram Technique and Support Vector Machines

Published on: January 5, 2024

1.7K

Learning from Data with Heterogeneous Noise using SGD.

Shuang Song1, Kamalika Chaudhuri1, Anand D Sarwate2

  • 1Computer Science and Engineering Dept., University of California, San Diego.

JMLR Workshop and Conference Proceedings
|December 26, 2015
PubMed
Summary
This summary is machine-generated.

Learning from heterogeneous data is challenging. This study shows that adjusting the learning rate in stochastic gradient descent (SGD) based on data noise levels improves performance, outperforming fixed rates or using only the cleanest data.

Related Experiment Videos

Last Updated: Mar 28, 2026

Author Spotlight: Efficient Image Recognition Using Directional Gradient Histogram Technique and Support Vector Machines
08:27

Author Spotlight: Efficient Image Recognition Using Directional Gradient Histogram Technique and Support Vector Machines

Published on: January 5, 2024

1.7K

Area of Science:

  • Machine Learning
  • Data Science
  • Optimization Algorithms

Background:

  • Learning from data of variable quality from heterogeneous sources presents significant challenges.
  • Existing methods struggle with the full generality of heterogeneous data.
  • A common scenario involves data observed through heterogeneous noise, where noise level indicates data quality.

Purpose of the Study:

  • To investigate the impact of heterogeneous noise on the performance of stochastic gradient algorithms.
  • To develop and analyze methods for learning from data with varying noise levels.
  • To address specific applications like learning with local differential privacy and learning from variable-quality labels.

Main Methods:

  • Utilizing stochastic gradient descent (SGD) algorithms within a model of heterogeneous noise.
  • Analyzing the influence of noise levels on data source order in SGD.
  • Proposing a novel method for dynamically adjusting the learning rate based on noise heterogeneity.
  • Deriving new regret bounds for the proposed method in specific scenarios.

Main Results:

  • The order of using datasets with heterogeneous noise in standard SGD is sensitive to the learning rate.
  • A method for adapting the learning rate to noise heterogeneity was proposed and analyzed.
  • New regret bounds were proven for the proposed adaptive learning rate method.
  • Empirical results demonstrated superior performance compared to fixed learning rates or using only the least noisy dataset, especially at low to moderate noise levels.

Conclusions:

  • Heterogeneous noise significantly impacts the performance of learning algorithms.
  • Adaptive learning rate strategies are crucial for effectively learning from heterogeneous data.
  • The proposed method offers a practical and effective solution for improving machine learning performance in the presence of variable data quality.