IP Library Granted Patent US 12,217,195
Granted Patent B2
US 12,217,195 · App. 18/392,342 · Granted Feb 4, 2025

Targeted data acquisition for model training

Inventors: Namit Kabra (Hyderabad, IN); Ritesh Kumar Gupta (Hyderabad, IN); Vijay Ekambaram (Chennai, IN); Smitkumar Narotambhai Marvaniya (Bangalore, IN)
Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
G06N5/04G06N20/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,217,195
App. No.
18/392,342
Granted
Feb 4, 2025
Kind
B2
Abstract

Targeted acquisition of data for model training includes identifying attributes of classified samples of a collection of samples classified by a classification model, and generating at least one query based on the identified attributes, the at least one query tailored, based on the attributes, to retrieve additional training data for training the classification model to more accurately classify samples and avoid incorrect sample classification.

Claims (53)

1. A computer-implemented method comprising:

identifying attributes of classified samples of a collection of samples classified by a classification model; and

generating at least one query based on the identified attributes, the at least one query tailored, based on the attributes, to retrieve additional training data for training the classification model to more accurately classify samples and avoid incorrect sample classification.

2. The method of claim 1 , wherein the identified attributes comprises attributes of one or more correctly classified samples of the collection of samples and one or more incorrectly classified samples of the collection of samples.

3. The method of claim 1 , wherein the generating generates a plurality of queries based on the identified attributes.

4. The method of claim 3 , further comprising:

ranking the generated plurality of queries into a ranked list of queries; and

selecting, from the ranked list of queries, a query to issue, wherein the selecting applies a budget comprising one or more constraints on resources to execute the query, the resources comprising at least one selected from the group consisting of: computing cost, memory, time, and electrical power.

5. The method of claim 1 , further comprising:

obtaining an embedding of the collection of samples in an embedding space in which the samples are embedded, the embedding presenting a respective classification of each sample of the collection of samples by the classification model; and

defining neighborhoods of the embedding space, wherein each neighborhood of the neighborhoods comprises a respective at least one incorrectly classified sample of the collection of samples, embedded in the embedding space, that the classification model incorrectly classified, and a respective at least one correctly classified sample of the collection of samples, embedded in the embedding space, that the classification model correctly classified.

6. The method of claim 5 , wherein the defining the neighborhoods comprises using at least one radius to define a region of the embedding space centered around an incorrectly classified sample, wherein the region defines a neighborhood of the neighborhoods, and wherein any samples within the region are samples within that neighborhood.

7. The method of claim 1 , further comprising constructing, using generated metadata, knowledge graphs that inform the identified attributes of one or more correctly classified samples of the collection of samples and one or more incorrectly classified samples of the collection of samples, wherein the constructing the knowledge graphs comprises constructing a respective knowledge graph for each neighborhood of the neighborhoods based on metadata generated for that neighborhood, wherein the method further comprises combining attributes informed by at least some of the constructed knowledge graphs to construct an aggregate knowledge graph, and wherein the generating generates the at least one query from the aggregate knowledge graph.

8. The method of claim 1 , wherein the collection of samples comprises images, wherein at least some of the identified attributes comprise an object depicted in at least some of the images, and wherein the generating the at least one query uses at least one visibility flag, indicating whether the object is visible in the images, in determining whether to tailor the at least one query to include or omit results in which the object is visible.

9. The method of claim 1 , wherein the generated at least one query is implemented as at least one crawl path for crawling at least one remote resource to retrieve the additional training data.

10. The method of claim 1 , wherein a query of the generated at least one query is multimodal, in which the multimodal query queries for both text and image results.

11. The method of claim 1 , further comprising:

issuing the at least one query;

retrieving, in response to the issuing, an additional one or more samples on which to train the classification model; and

retraining the classification model using the additional one or more samples.

12. The method of claim 11 , further comprising, based on the retraining:

iterating one or more times: (i) the identifying attributes, (ii) the generating at least one query, (iii) the issuing the at least one query, (v) the retrieving an additional one or more samples, and (vi) the retraining the classification model; and

checking whether to halt the iterating by testing stability of the classification model and determining whether a threshold has been reached to avoid overfitting the classification model.

13. A computer system comprising:

a memory; and

a processor in communication with the memory, wherein the computer system is configured to perform a method comprising:

identifying attributes of classified samples of a collection of samples classified by a classification model; and

generating at least one query based on the identified attributes, the at least one query tailored, based on the attributes, to retrieve additional training data for training the classification model to more accurately classify samples and avoid incorrect sample classification.

14. The computer system of claim 13 , wherein the identified attributes comprises attributes of one or more correctly classified samples of the collection of samples and one or more incorrectly classified samples of the collection of samples.

15. The computer system of claim 13 , wherein the generating generates a plurality of queries based on the identified attributes.

16. The computer system of claim 13 , wherein the method further comprises:

obtaining an embedding of the collection of samples in an embedding space in which the samples are embedded, the embedding presenting a respective classification of each sample of the collection of samples by the classification model; and

defining neighborhoods of the embedding space, wherein each neighborhood of the neighborhoods comprises a respective at least one incorrectly classified sample of the collection of samples, embedded in the embedding space, that the classification model incorrectly classified, and a respective at least one correctly classified sample of the collection of samples, embedded in the embedding space, that the classification model correctly classified.

17. The computer system of claim 13 , wherein the method further comprises constructing, using generated metadata, knowledge graphs that inform the identified attributes of one or more correctly classified samples of the collection of samples and one or more incorrectly classified samples of the collection of samples, wherein the constructing the knowledge graphs comprises constructing a respective knowledge graph for each neighborhood of the neighborhoods based on metadata generated for that neighborhood, wherein the method further comprises combining attributes informed by at least some of the constructed knowledge graphs to construct an aggregate knowledge graph, and wherein the generating generates the at least one query from the aggregate knowledge graph.

18. The computer system of claim 13 , wherein the collection of samples comprises images, wherein at least some of the identified attributes comprise an object depicted in at least some of the images, and wherein the generating the at least one query uses at least one visibility flag, indicating whether the object is visible in the images, in determining whether to tailor the at least one query to include or omit results in which the object is visible.

19. The computer system of claim 13 , wherein a query of the generated at least one query is multimodal, in which the multimodal query queries for both text and image results.

20. The computer system of claim 13 , wherein the method further comprises:

issuing the at least one query;

retrieving, in response to the issuing, an additional one or more samples on which to train the classification model; and

retraining the classification model using the additional one or more samples.

21. A computer program product comprising:

a computer readable storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method comprising:

identifying attributes of classified samples of a collection of samples classified by a classification model; and

generating at least one query based on the identified attributes, the at least one query tailored, based on the attributes, to retrieve additional training data for training the classification model to more accurately classify samples and avoid incorrect sample classification.

22. The computer program product of claim 21 , wherein the identified attributes comprises attributes of one or more correctly classified samples of the collection of samples and one or more incorrectly classified samples of the collection of samples.

23. The computer program product of claim 21 , wherein the generating generates a plurality of queries based on the identified attributes.

24. The computer program product of claim 21 , wherein the method further comprises:

obtaining an embedding of the collection of samples in an embedding space in which the samples are embedded, the embedding presenting a respective classification of each sample of the collection of samples by the classification model; and

defining neighborhoods of the embedding space, wherein each neighborhood of the neighborhoods comprises a respective at least one incorrectly classified sample of the collection of samples, embedded in the embedding space, that the classification model incorrectly classified, and a respective at least one correctly classified sample of the collection of samples, embedded in the embedding space, that the classification model correctly classified.

25. The computer program product of claim 21 , wherein the method further comprises:

issuing the at least one query;

retrieving, in response to the issuing, an additional one or more samples on which to train the classification model; and

retraining the classification model using the additional one or more samples.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 19, 2026
From: INTERNATIONAL BUSINESS MACHINES CORPORATION
To: MAPLEBEAR INC.
Reel/Frame 074940/0155 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 21, 2023
From: KABRA, NAMIT; GUPTA, RITESH KUMAR; EKAMBARAM, VIJAY; MARVANIYA, SMITKUMAR NAROTAMBHAI
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 065932/0585 →
Continuity (3)
Continuation 17935341 · Sep 26, 2022
Continuation 16874531 · May 14, 2020
Related Publication 20240127085A1 · Apr 18, 2024
References Cited (58)
US 7792770B1 · Phoha et al. · 2010 [cited by applicant]
US 8787683B1 · Yee · 2014 [cited by examiner]
US 9349105B2 · Beymer et al. · 2016 [cited by applicant]
US 10177998B2 · Parandehgheibi et al. · 2019 [cited by applicant]
US 10229171B2 · Ekambaram et al. · 2019 [cited by applicant]
US 10372985B2 · Estrada et al. · 2019 [cited by applicant]
US 10409789B2 · Zoll et al. · 2019 [cited by applicant]
US 10719301B1 · Dasgupta · 2020 [cited by examiner]
US 10728119B2 · Parandehgheibi et al. · 2020 [cited by applicant]
US 10922628B2 · Yoo · 2021 [cited by examiner]
US 11010605B2 · Nord et al. · 2021 [cited by applicant]
US 11113513B2 · Zhang · 2021 [cited by examiner]
US 11151179B2 · Li et al. · 2021 [cited by applicant]
US 11176589B2 · Pyati · 2021 [cited by applicant]
US 11295173B2 · Umeno · 2022 [cited by examiner]
US 11462007B2 · Estrada et al. · 2022 [cited by applicant]
US 11507882B2 · Ji · 2022 [cited by examiner]
US 11514272B2 · Zhang · 2022 [cited by examiner]
US 11537506B1 · Dasgupta · 2022 [cited by examiner]
US 11537915B2 · Kabra et al. · 2022 [cited by applicant]
US 11544496B2 · Zhang · 2023 [cited by examiner]
US 11556740B2 · Deluca et al. · 2023 [cited by applicant]
US 11556746B1 · Dasgupta · 2023 [cited by examiner]
US 20090222389A1 · Hido et al. · 2009 [cited by applicant]
US 20150301795A1 · LeBrun · 2015 [cited by applicant]
US 20160078359A1 · Csurka et al. · 2016 [cited by applicant]
US 20160359740A1 · Parandehgheibi et al. · 2016 [cited by applicant]
US 20180075359A1 · Brennan et al. · 2018 [cited by applicant]
US 20180189544A1 · Estrada et al. · 2018 [cited by applicant]
US 20180210955A1 · Crabtree et al. · 2018 [cited by applicant]
US 20190121350A1 · Cella et al. · 2019 [cited by applicant]
US 20190303669A1 · Spooner · 2019 [cited by applicant]
US 20190306035A1 · Sheib et al. · 2019 [cited by applicant]
US 20190311301A1 · Pyati · 2019 [cited by applicant]
US 20200004766A1 · Li et al. · 2020 [cited by applicant]
US 20200074238A1 · Umeno · 2020 [cited by examiner]
US 20210027040A1 · Estrada et al. · 2021 [cited by applicant]
US 20210034865A1 · Nord et al. · 2021 [cited by applicant]
US 20210081832A1 · Ji · 2021 [cited by examiner]
US 20210248503A1 · Hickey et al. · 2021 [cited by applicant]
US 20210319340A1 · Shabtay et al. · 2021 [cited by applicant]
US 20210357779A1 · Kabra et al. · 2021 [cited by applicant]
US 20230016082A1 · Kabra et al. · 2023 [cited by applicant]
US 20230195845A1 · Dasgupta · 2023 [cited by examiner]
WO 2016012868A1 · 2016 [cited by applicant]
WO 2017151759A1 · 2017 [cited by applicant]
Miech, A., et al., “Learning a Text-Video Embedding from Incomplete and Heterogeneous Data”, Computer Vision and Pattern Recognition, vol. abs/1804.02516, Apr. 2018, 17 pgs. [cited by applicant]
Mell, P., et al., “The NIST Definition of Cloud Computing”, NIST Special Publication 800-145, Sep. 2011, Gaithersburg, MD, 7 pgs. [cited by applicant]
Albertson, M., “IBM wants to improve use and delivery of AI services through DataOps”, retrieved on Mar. 17, 2020 from the Internet URL: <https://siliconangle.com/2019/10/22/ibm-wants-to-improve-use-and-delivery-of-ai-s… [cited by applicant]
Xu, A., “Improving Classification Accuracy using Data Augmentation & Segmentation: A hybrid implementation in Keras & Tensorflow using Transfer Learning”, retrieved on Mar. 17, 2020 from the Internet URL: <https://mediu… [cited by applicant]
Mnasri, M., “Text augmentation for Machine Learning tasks: How to grow your text dataset for classification?”, retrieved on Mar. 17, 2020 from the Internet URL: <https://medium.com/opla/text-augmentation-formachine-lear… [cited by applicant]
Shorten, C., “Hacking your Image Recognition Model”, retrieved on Mar. 17, 2020 from the Internet URL: <https://towardsdatascience.com/hacking-your-image-recognition-model-909ad4176247>, Aug. 30, 2018, 4 pgs. [cited by applicant]
Noy, N., “Google dataset search”, retrieved on Mar. 17, 2020 from the Internet URL: <https://www.blog.google/products/search/making-it-easier-discover-datasets/>, Google—The Keyword, Sep. 5, 2018, 3 pgs. [cited by applicant]
Gao, Y., et al., “Navigating the data lake with Datamaran: automatically extracting structure from log datasets”, SIGMOD'18, Jun. 10-15, 2018, 20 pgs. [cited by applicant]
Xiao, T., et al., “Learning from Massive Noisy Labeled Data for Image Classification”, CVPR 2015, pp. 2691-2699. [cited by applicant]
Roh, Y., et al., “A Survey on Data Collection for Machine Learning”, retrieved on Mar. 27, 2020 from the Internet URL: <https://arxiv.org/pdf/1811.03402.pdf.>, Aug. 12, 2019, 20 pgs. [cited by applicant]
Dehamecha, T., et al., “Between-Subclass Piece-wise Linear Solutions in Large Scale Kernel SVM Learning”, retrieved on Mar. 27, 2020 from the Internet URL: <http://iab-rubric.org/papers/2019_PR_SVM.pdf>, Mar. 18, 2019, … [cited by applicant]
List of IBM Patents or Applications Treated as Related, dated Dec. 21, 2023, 2 pgs. [cited by applicant]