Weighted selection of inputs for training machine-trained network

US12367661B1 · US · B1

Patent metadata
FieldValue
Publication numberUS-12367661-B1
Application numberUS-202218088726-A
CountryUS
Kind codeB1
Filing dateDec 26, 2022
Priority dateDec 29, 2021
Publication dateJul 22, 2025
Grant dateJul 22, 2025

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

Some embodiments provide a method for training a machine-trained network that includes multiple parameters. The method propagates a batch of input training items through the network to generate output values and compute values of a loss function for each of the input training items. The method computes a weight for each input training item based on the computed loss function values for each of the input training items. The method selects input training items with larger weights more often than input training items with smaller weights for subsequent batches of input training items.

First claim

Opening claim text (preview).

What is claimed is: 1. A method for training a machine-trained network comprising a plurality of parameters, the method comprising: propagating a batch of input training items through the network to generate output values and compute values of a loss function for each of the input training items; computing a weight for each input training item based on the computed loss function values for each of the input training items; and selecting input training items with larger weights more often than input training items with smaller weights for subsequent batches of input training items. 2. The method of claim 1 , wherein: each input training item has a corresponding expected output value; and computing a value of a loss function for a particular input training item comprises comparing the corresponding expected output value to the generated output value for the input training item. 3. The method of claim 2 , wherein the loss function values for the particular input training item increases as a distance between the corresponding expected output value and the generated output value for the input training item increases. 4. The method of claim 2 , wherein the loss function is a measure of unhappiness. 5. The method of claim 1 , wherein the weights for the input training items are proportional to the computed loss function values for the input training items. 6. The method of claim 1 , wherein: the input training items are selected from a plurality of available input training items; and a number of available input training items is larger than a number of input training items in each batch of input training items. 7. The method of claim 6 , wherein each input training item is selected at most once per batch of input training items. 8. The method of claim 6 , wherein each input training item is selected at least once in the subsequent batches of input training items. 9. The method of claim 1 , wherein: the network is trained for classifying items into a predefined set of classes; and the generated output value for a particular input training item comprises, for each class, a probability that the particular input training item belongs to the class. 10. The method of claim 1 , wherein selecting input training items with larger weights more often enables the parameters of the machine-trained network to converge more quickly to optimal values. 11. A non-transitory machine-readable medium storing a program which when executed by at least one processing unit trains a machine-trained network comprising a plurality of parameters, the program comprising sets of instructions for: propagating a batch of input training items through the network to generate output values and compute values of a loss function for each of the input training items; computing a weight for each input training item based on the computed loss function values for each of the input training items; and selecting input training items with larger weights more often than input training items with smaller weights for subsequent batches of input training items. 12. The non-transitory machine-readable medium of claim 11 , wherein: each input training item has a corresponding expected output value; and the set of instructions for computing a value of a loss function for a particular input training item comprises a set of instructions for comparing the corresponding expected output value to the generated output value for the input training item. 13. The non-transitory machine-readable medium of claim 12 , wherein the loss function values for the particular input training item increases as a distance between the corresponding expected output value and the generated output value for the input training item increases. 14. The non-transitory machine-readable medium of claim 12 , wherein the loss function is a measure of unhappiness. 15. The non-transitory machine-readable medium of claim 11 , wherein the weights for the input training items are proportional to the computed loss function values for the input training items. 16. The non-transitory machine-readable medium of claim 11 , wherein: the input training items are selected from a plurality of available input training items; and a number of available input training items is larger than a number of input training items in each batch of input training items. 17. The non-transitory machine-readable medium of claim 16 , wherein each input training item is selected at most once per batch of input training items. 18. The non-transitory machine-readable medium of claim 16 , wherein each input training item is selected at least once in the subsequent batches of input training items. 19. The non-transitory machine-readable medium of claim 11 , wherein: the network is trained for classifying items into a predefined set of classes; and the generated output value for a particular input training item comprises, for each class, a probability that the particular input training item belongs to the class. 20. The non-transitory machine-readable medium of claim 11 , wherein the selection of input training items with larger weights more often enables the parameters of the machine-trained network to converge more quickly to optimal values.

Assignees

Inventors

Classifications

  • G06V10/774Primary

    Generating sets of training patterns; Bootstrap methods, e.g. bagging or boosting · CPC title

  • G06V10/776Primary

    Validation; Performance evaluation · CPC title

  • Hyperparameter optimisation; Meta-learning; Learning-to-learn · CPC title

  • using classification, e.g. of video objects · CPC title

  • using neural networks · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US12367661B1 cover?
Some embodiments provide a method for training a machine-trained network that includes multiple parameters. The method propagates a batch of input training items through the network to generate output values and compute values of a loss function for each of the input training items. The method computes a weight for each input training item based on the computed loss function values for each of …
Who is the assignee on this patent?
Amazon Tech Inc
What technology area does this patent fall under?
Primary CPC classification G06V10/774. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Jul 22 2025 00:00:00 GMT+0000 (Coordinated Universal Time) (B1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 12 related publications on this page (citations in our corpus or others sharing the same primary CPC).