# US 2023/0409918 A1 · Using batches of training items for training a network

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2023/0409918 A1
- Document ID: US20230409918A1
- Status: Published application
- Kind: A1
- Application number: 18/238,507
- Filed: 2023-08-27
- Published: 2023-12-21
- Earliest claimed: 2017-12-14
- Assignees: Perceive Corporation
- Applicants: Perceive Corporation
- Inventors: Eric A. Sather; Steven L. Teig; Andrew C. Mihal
- Web page: https://patentgrep.com/patent/US20230409918A1

## CPC

- G06N 3/084: Backpropagation, e.g. using gradient descent
- G06F 18/214: Generating training patterns; Bootstrap methods, e.g. bagging or boosting
- G06F 18/217: {Validation; Performance evaluation; Active pattern learning techniques}
- G06N 3/04: Architecture, e.g. interconnection topology
- G06N 3/045: Combinations of networks
- G06N 3/0464: Convolutional networks [CNN, ConvNet]
- G06N 3/047: Probabilistic or stochastic networks
- G06N 3/048: Activation functions
- G06N 3/08: Learning methods
- G06N 3/09: Supervised learning
- G06T 7/97: {Determining parameters from multiple pictures (depth or shape recovery from multiple images G06T7/55; stereo camera calibration G06T7/85)}
- G06V 10/454: {Integrating the filters into a hierarchical structure, e.g. convolutional neural networks [CNN]}
- G06V 10/764: using classification, e.g. of video objects
- G06V 10/82: using neural networks
- G06V 40/167: {using comparisons between temporally consecutive images}
- G06V 40/172: {Classification, e.g. identification}
- G06N 7/01: Probabilistic graphical models, e.g. probabilistic networks
- G06T 2207/20081: Training; Learning
- G06T 2207/30201: Face
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06V: IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING

## Abstract

Some embodiments provide a method for training a machine-trained (MT) network that processes inputs using network parameters. The method propagates a set of input training items through the MT network to generate a set of output values. The set of input training items comprises multiple training items for each of multiple categories. The method identifies multiple training item groupings in the set of input training items. Each grouping includes at least two training items in a first category and at least one training item in a second category. The method calculates a value of a loss function as a summation of individual loss functions for each of the identified training item groupings. The individual loss function for each particular training item grouping is based on the output values for the training items of the grouping. The method trains the network parameters using the calculated loss function value.

## Claims

### Claim at position 1

1-20. (canceled)

### Claim 21

A method for training a machine-trained (MT) network that classifies inputs into a plurality of categories, the method comprising:
propagating a plurality of input training items through the MT network to generate a respective output value for each respective input training item, the plurality of input training items comprising input training items for each of the categories;
identifying a plurality of triplets from the plurality of input training items, wherein each respective triplet comprises two input training items in a respective first category and one input training item in a respective second category, wherein a plurality of the input training items belong to at least two different triplets;
calculating a value of a loss function as a summation of respective individual loss functions for each of the respective identified triplets, the respective individual loss function for each respective triplet based on the output values generated for the input training items of the triplet; and
training the MT network using the calculated loss function value.

### Claim 22 (depends on 21)

The method of claim 21, wherein the input items are images and the categories comprise different types of objects found in the images.

### Claim 23 (depends on 21)

The method of claim 21, wherein:
the input items are images and the categories comprise a plurality of different people, wherein each input training item for a particular person comprises a different image of the particular person's face; and
the machine-trained network is for embedding into a device to perform facial recognition.

### Claim 24 (depends on 21)

The method of claim 21, wherein:
the set of input images comprises Ni images for each of Np categories; and
a number of identified triplets is of the order (Ni){circumflex over ( )}3*(Np){circumflex over ( )}2.

### Claim 25 (depends on 21)

The method of claim 21, wherein:
each output value is a vector; and
the respective individual loss function for each respective triplet is a function of the proximity of the vectors for one of the input training items in the first respective category and the input training item in the respective second category to the vector for the other input training item in the first respective category.

### Claim 26 (depends on 21)

The method of claim 21, wherein:
each output value is a vector; and
the respective individual loss function for each respective triplet is a function of the probability of a misclassification of one of the input training items in the respective first category based on the vector of the three input training items of the triplet.

### Claim 27 (depends on 21)

The method of claim 21, wherein:
the MT network comprises input nodes, output nodes, and interior nodes between the input nodes and output nodes;
each node produces a node output value and each interior node and output node receives as node input values a set of node output values of other nodes and applies weights to each received input value; and
training the MT network comprises training the weights.

### Claim 28 (depends on 21)

The method of claim 21, wherein the propagating, identifying, calculating, and training are performed iteratively.

### Claim 29 (depends on 21)

The method of claim 21, wherein training the MT network comprises:
backpropagating the calculated loss function value through the MT network to determine, for each of a set of network parameters, a rate of change in the calculated loss function value relative to a rate of change in the network parameter; and
modifying each network parameter in the set according to the determined rate of change for the network parameter.

### Claim 30 (depends on 21)

The method of claim 21, wherein identifying the plurality of triplets comprises identifying each possible triplet formed by the plurality of input training items.

### Claim 31

A non-transitory machine-readable medium storing a program which when executed by at least one processing unit trains a machine-trained (MT) network that classifies inputs into a plurality of categories, the program comprising sets of instructions for:
propagating a plurality of input training items through the MT network to generate a respective output value for each respective input training item, the plurality of input training items comprising input training items for each of the categories;
identifying a plurality of triplets from the plurality of input training items, wherein each respective triplet comprises two input training items in a respective first category and one input training item in a respective second category, wherein a plurality of the input training items belong to at least two different triplets;
calculating a value of a loss function as a summation of respective individual loss functions for each of the respective identified triplets, the respective individual loss function for each respective triplet based on the output values generated for the input training items of the triplet; and
training the MT network using the calculated loss function value.

### Claim 32 (depends on 31)

The non-transitory machine-readable medium of claim 31, wherein the input items are images and the categories comprise different types of objects found in the images.

### Claim 33 (depends on 31)

The non-transitory machine-readable medium of claim 31, wherein:
the input items are images and the categories comprise a plurality of different people, wherein each input training item for a particular person comprises a different image of the particular person's face; and
the machine-trained network is for embedding into a device to perform facial recognition.

### Claim 34 (depends on 31)

The non-transitory machine-readable medium of claim 31, wherein:
the set of input images comprises Ni images for each of Np categories; and
a number of identified triplets is of the order (Ni){circumflex over ( )}3*(Np){circumflex over ( )}3.

### Claim 35 (depends on 31)

The non-transitory machine-readable medium of claim 31, wherein:
each output value is a vector; and
the respective individual loss function for each respective triplet is a function of the proximity of the vectors for one of the input training items in the first respective category and the input training item in the respective second category to the vector for the other input training item in the first respective category.

### Claim 36 (depends on 31)

The non-transitory machine-readable medium of claim 31, wherein:
each output value is a vector; and
the respective individual loss function for each respective triplet is a function of the probability of a misclassification of one of the input training items in the respective first category based on the vector of the three input training items of the triplet.

### Claim 37 (depends on 31)

The non-transitory machine-readable medium of claim 31, wherein:
the MT network comprises input nodes, output nodes, and interior nodes between the input nodes and output nodes;
each node produces a node output value and each interior node and output node receives as node input values a set of node output values of other nodes and applies weights to each received input value; and
the set of instructions for training the MT network comprises a set of instructions for training the weights.

### Claim 38 (depends on 31)

The non-transitory machine-readable medium of claim 31, wherein the propagating, identifying, calculating, and training are performed iteratively.

### Claim 39 (depends on 31)

The non-transitory machine-readable medium of claim 31, wherein the set of instructions for training the MT network comprises sets of instructions for:
backpropagating the calculated loss function value through the MT network to determine, for each of a set of network parameters, a rate of change in the calculated loss function value relative to a rate of change in the network parameter; and
modifying each network parameter in the set according to the determined rate of change for the network parameter.

### Claim 40 (depends on 31)

The non-transitory machine-readable medium of claim 31, wherein the set of instructions for identifying the plurality of triplets comprises a set of instructions for identifying each possible triplet formed by the plurality of input training items.
