IP Library Granted Patent US 12,417,222
Granted Patent B2
US 12,417,222 · App. 18/647,425 · Granted Sep 16, 2025

Using multiple trained models to reduce data labeling efforts

Inventors: Matthew Shreve (Mountain View, CA); Francisco E. Torres (San Jose, CA); Raja Bala (Pittsford, NY); Robert R. Price (Palo Alto, CA); Pei Li (San Jose, CA)
Assignee: Xerox Corporation
G06F16/2379G06N20/00
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,417,222
App. No.
18/647,425
Granted
Sep 16, 2025
Kind
B2
Abstract

A method of labeling training data includes inputting a plurality of unlabeled input data samples into each of a plurality of pre-trained neural networks and extracting a set of feature embeddings from multiple layer depths of each of the plurality of pre-trained neural networks. The method also includes generating a plurality of clusterings from the set of feature embeddings. The method also includes analyzing, by a processing device, the plurality of clusterings to identify a subset of the plurality of unlabeled input data samples that belong to a same unknown class. The method also includes assigning pseudo-labels to the subset of the plurality of unlabeled input data samples.

Claims (46)

1. A method, comprising:

inputting a plurality of unlabeled input data samples into each of a plurality of pre-trained neural networks and extracting a set of feature embeddings from multiple layer depths of each of the plurality of pre-trained neural networks;

generating a plurality of clusterings from the set of feature embeddings;

analyzing, by a processing device, the plurality of clusterings to identify a subset of the plurality of unlabeled input data samples that belong to a same unknown class; and

assigning pseudo-labels to the subset of the plurality of unlabeled input data samples.

2. The method of claim 1 , wherein analyzing the plurality of clusterings comprises computing a cluster quality for each of the plurality of clusterings and identifying a feature embedding of the set of feature embeddings based on the cluster quality.

3. The method of claim 2 , wherein the cluster quality comprises a Davies Bouldin score or a Silhouette score.

4. The method of claim 1 , wherein analyzing the plurality of clusterings comprises determining a degree of cluster member overlap between two or more of the set of feature embeddings.

5. The method of claim 1 , wherein the plurality of pre-trained neural networks is selected from a collection of neural networks that have been trained for a variety of tasks, the method comprising:

analyzing metadata associated with the collection of neural networks to identify at least one of a modality or an objective for each of the collection of neural networks; and

selecting the plurality of pre-trained neural networks from the collection of neural networks based on at least one of the modality or the objective.

6. The method of claim 1 , wherein each of the plurality of pre-trained neural networks is trained to perform a task comprising at least one of: an image classification task, a video classification task, an audio classification task, a text categorization task, a face recognition task, or a machine translation task.

7. The method of claim 1 , further comprising:

receiving a label for a first sample of the plurality of unlabeled input data samples; and

assigning the label to a second sample of the plurality of unlabeled input data samples based on the second sample having a same pseudo-label as the first sample.

8. A system comprising:

a memory; and

a processing device operatively coupled to the memory, the processing device to:

input a plurality of unlabeled input data samples into each of a plurality of pre-trained neural networks and extract a set of feature embeddings from multiple layer depths of each of the plurality of pre-trained neural networks;

generate a plurality of clusterings from the set of feature embeddings;

analyze the plurality of clusterings to identify a subset of the plurality of unlabeled input data samples that belong to a same unknown class; and

assign pseudo-labels to the subset of the plurality of unlabeled input data samples.

9. The system of claim 8 , wherein to analyze the plurality of clusterings, the processing device is to compute a cluster quality for each of the plurality of clusterings and identify a feature embedding of the set of feature embeddings based on the cluster quality.

10. The system of claim 9 , wherein the cluster quality comprises a Davies Bouldin score or a Silhouette score.

11. The system of claim 8 , wherein to analyze the plurality of clusterings, the processing device is to determine a degree of cluster member overlap between two or more of the set of feature embeddings.

12. The system of claim 8 , wherein the plurality of pre-trained neural networks is selected from a collection of neural networks that have been trained for a variety of tasks, the processing device:

analyze metadata associated with the collection of neural networks to identify at least one of a modality or an objective for each of the collection of neural networks; and

select the plurality of pre-trained neural networks from the collection of neural networks based on at least one of the modality or the objective.

13. The system of claim 8 , wherein each of the plurality of pre-trained neural networks is trained to perform a task comprising at least one of: an image classification task, a video classification task, an audio classification task, a text categorization task, a face recognition task, or a machine translation task.

14. The system of claim 8 , wherein the processing device is further to:

receive a label for a first sample of the plurality of unlabeled input data samples; and

assign the label to a second sample of the plurality of unlabeled input data samples based on the second sample having a same pseudo-label as the first sample.

15. A non-transitory computer-readable storage medium having instructions stored thereon that, when executed by a processing device, cause the processing device to:

input a plurality of unlabeled input data samples into each of a plurality of pre-trained neural networks and extract a set of feature embeddings from multiple layer depths of each of the plurality of pre-trained neural networks;

generate a plurality of clusterings from the set of feature embeddings;

analyze, by the processing device, the plurality of clusterings to identify a subset of the plurality of unlabeled input data samples that belong to a same unknown class; and

assign pseudo-labels to the subset of the plurality of unlabeled input data samples.

16. The non-transitory computer-readable storage medium of claim 15 , wherein the instructions to cause the processing device to analyze the plurality of clusterings cause the processing device to compute a cluster quality for each of the plurality of clusterings and identify a feature embedding of the set of feature embeddings based on the cluster quality.

17. The non-transitory computer-readable storage medium of claim 15 , wherein the instructions to cause the processing device to analyze the plurality of clusterings cause the processing device to determine a degree of cluster member overlap between two or more of the set of feature embeddings.

18. The non-transitory computer-readable storage medium of claim 15 , wherein the plurality of pre-trained neural networks is selected from a collection of neural networks that have been trained for a variety of tasks, and wherein the instructions cause the processing device to:

analyze metadata associated with the collection of neural networks to identify at least one of a modality or an objective for each of the collection of neural networks; and

select the plurality of pre-trained neural networks from the collection of neural networks based on at least one of the modality or the objective.

19. The non-transitory computer-readable storage medium of claim 15 , wherein each of the plurality of pre-trained neural networks is trained to perform a task comprising at least one of: an image classification task, a video classification task, an audio classification task, a text categorization task, a face recognition task, or a machine translation task.

20. The non-transitory computer-readable storage medium of claim 15 , wherein the instructions further cause the processing device to:

receive a label for a first sample of the plurality of unlabeled input data samples; and

assign the label to a second sample of the plurality of unlabeled input data samples based on the second sample having a same pseudo-label as the first sample.

Assignments (4)
SECOND LIEN NOTES PATENT SECURITY AGREEMENT Recorded Jul 2, 2025
From: XEROX CORPORATION
To: U.S. BANK TRUST COMPANY, NATIONAL ASSOCIATION, AS COLLATERAL AGENT
Reel/Frame 071785/0550 →
SECURITY INTEREST Recorded Apr 11, 2025
From: XEROX CORPORATION
To: JEFFERIES FINANCE LLC, AS COLLATERAL AGENT
Reel/Frame 070821/0219 →
SECURITY INTEREST Recorded Apr 11, 2025
From: XEROX CORPORATION
To: CITIBANK, N.A., AS COLLATERAL AGENT
Reel/Frame 070821/0240 →
FIRST LIEN NOTES PATENT SECURITY AGREEMENT Recorded Apr 11, 2025
From: XEROX CORPORATION
To: U.S. BANK TRUST COMPANY, NATIONAL ASSOCIATION, AS COLLATERAL AGENT
Reel/Frame 070824/0001 →
Continuity (3)
Continuation 18219333 · Jul 7, 2023
Continuation 17221661 · Apr 2, 2021
Related Publication 20240281431A1 · Aug 22, 2024
References Cited (33)
US 10430690B1 · Chen · 2019 [cited by examiner]
US 11048979B1 · Zhdanov · 2021 [cited by examiner]
US 11288513B1 · Desai · 2022 [cited by examiner]
US 11321629B1 · Rowan · 2022 [cited by examiner]
US 11416754B1 · Durvasula · 2022 [cited by examiner]
US 11714802B2 · Shreve · 2023 [cited by examiner]
US 11741168B1 · Bodapati · 2023 [cited by examiner]
US 20170116544A1 · Johnson · 2017 [cited by examiner]
US 20180114098A1 · Desai et al. · 2018 [cited by applicant]
US 20180240031A1 · Huszar et al. · 2018 [cited by applicant]
US 20190073447A1 · Guo · 2019 [cited by examiner]
US 20190122378A1 · Aswin · 2019 [cited by examiner]
US 20190236412A1 · Zhao · 2019 [cited by examiner]
US 20190266487A1 · Chollet · 2019 [cited by examiner]
US 20200134391A1 · Assaderaghi · 2020 [cited by examiner]
US 20200382527A1 · Mitelman · 2020 [cited by examiner]
US 20210081822A1 · Davidson · 2021 [cited by examiner]
US 20210125732A1 · Patel · 2021 [cited by examiner]
US 20210182606A1 · Maroo · 2021 [cited by examiner]
US 20210241153A1 · Branchaud-Charron · 2021 [cited by examiner]
US 20210264300A1 · Staudinger · 2021 [cited by examiner]
US 20220058440A1 · Feng · 2022 [cited by examiner]
US 20220076074A1 · Li · 2022 [cited by examiner]
US 20220084510A1 · Peng · 2022 [cited by examiner]
US 20220114490A1 · Das · 2022 [cited by examiner]
US 20220156519A1 · Ghorbani · 2022 [cited by examiner]
US 20220210079A1 · Koren · 2022 [cited by examiner]
US 20220262104A1 · Salman · 2022 [cited by examiner]
US 20220318229A1 · Shreve · 2022 [cited by examiner]
US 20220318669A1 · Alexander · 2022 [cited by examiner]
US 20220335258A1 · Raventos · 2022 [cited by examiner]
US 20220382527A1 · Wang et al. · 2022 [cited by applicant]
The Extended European Search Report for Application No. EP 22163100.5 mailed Aug. 8, 2022, 11 pages. [cited by applicant]