IP Library Granted Patent US 12,423,592
Granted Patent B2
US 12,423,592 · App. 17/192,761 · Granted Sep 23, 2025

Hierarchy-preserving learning for multi-label classification

Inventors: Palash Goyal (San Jose, CA); Divya Choudhary (Santa Clara, CA); Saurabh Sahu (San Bruno, CA); Shalini Ghosh (Menlo Park, CA)
Assignee: Samsung Electronics Co., Ltd.
G06N5/022G06F18/214G06F18/217G06F18/2431G06N20/00G06V10/764G06V10/774G06V10/776
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,423,592
App. No.
17/192,761
Filed
Mar 4, 2021
Granted
Sep 23, 2025
Kind
B2
Art Unit
2127
USPC
706/12
Abstract

A method implemented by one or more computing systems includes accessing a set of content objects, in which each content object of the set of content objects is pre-labeled with concepts of a plurality of concepts organized according to a hierarchical relationship. The method further includes training, by a machine-learning model, a classification model for classifying content objects within the set of content objects. Training the classification model includes determining, for each object, a plurality of classification values corresponding to the plurality of concepts, calculating a loss for each of the plurality of classification values based on the pre-labeled concepts associated with the object, utilizing a hierarchical constraint loss function to calculate a maximum loss based on the calculated loss for each of the plurality of classification values, and updating the classification model based on the hierarchical constraint loss function until the maximum loss satisfies a predetermined criterion.

Claims (55)

1. A method comprising, by one or more computing systems:

accessing a set of content objects, wherein each content object of the set of content objects is pre-labeled with one or more concepts of a plurality of concepts, and wherein the plurality of concepts are organized according to a hierarchical relationship; and

training, by a machine-learning model, a classification model for classifying content objects within the set of content objects, wherein training the classification model comprises:

determining, for each object in the set of content objects, a plurality of classification values corresponding to the plurality of concepts, each classification value corresponding to a different layer in the hierarchical relationship;

calculating, for each object and based on a loss function, a loss for each of the plurality of classification values based on the pre-labeled concepts associated with the object;

training the classification model to predict, for any particular content object, a probability of a class higher in the hierarchical relationship that is less than or equal to a probability of a class lower in the hierarchical relationship by:

generating a hierarchical constraint loss function for the set of content objects by setting the loss for each classification value, for each object, to be the maximum of (1) the calculated loss for the classification value and corresponding pre-labeled concept and (2) a loss corresponding to a classification value in a higher, parent layer of the hierarchical relationship and a corresponding pre-labeled concept for that classification value; and

training the classification model using the generated hierarchical constraint loss function as the loss function for the classification model; and

updating the classification model based on the hierarchical constraint loss function until the maximum loss satisfies a predetermined criterion.

2. The method of claim 1 , wherein the calculated loss for each of the plurality of classification values comprises a first calculated loss for a parent concept of the plurality of concepts and a second calculated loss for a child concept of the plurality of concepts.

3. The method of claim 2 , wherein the hierarchical constraint loss function comprises one or more constraints configured to limit the second calculated loss to a value less than or equal to that of the first calculated loss.

4. The method of claim 2 , wherein the hierarchical constraint loss function is bounded around a 0-1 loss function.

5. The method of claim 2 , wherein training, by the machine-learning model, the classification model comprises training the classification model utilizing content objects of the set of content objects corresponding to the parent concept in accordance with the predetermined criteria prior to utilizing content objects of the set of content objects corresponding to the child concept in accordance with the predetermined criteria.

6. The method of claim 1 , further comprising:

prior to utilizing the hierarchical constraint loss function to calculate the maximum loss, deriving the hierarchical constraint loss function based on one or more base loss functions.

7. The method of claim 6 , wherein, subsequent to deriving the hierarchical constraint loss function, the method further comprising:

sorting the respective losses for each of the plurality of classification values in order of increasing loss value; and

selecting an initial K concepts corresponding to an initial K losses of the sorted respective losses, such that a cumulative sum of the initial K losses is greater than a sum of a predetermined threshold loss value and 1-K, wherein K is a hyperparameter.

8. One or more computing devices, comprising:

one or more non-transitory computer-readable storage media including instructions; and

one or more processors coupled to the one or more storage media, the one or more processors configured to execute the instructions to:

access a set of content objects, wherein each content object is pre-labeled with one or more concepts of a plurality of concepts, and wherein the plurality of concepts are organized according to a hierarchical relationship; and

train, by a machine-learning model, a classification model for classifying content objects within the set of content objects, wherein training the classification model comprises:

determine, for each object in the set of content objects, a plurality of classification values corresponding to the plurality of concepts, each classification value corresponding to a different layer in the hierarchical relationship;

calculate for each object and based on a loss function, a loss for each of the plurality of classification values based on the pre-labeled concepts associated with the object;

train the classification model to predict, for any particular content object, a probability of a class higher in the hierarchical relationship that is less than or equal to a probability of a class lower in the hierarchical relationship by:

generating a hierarchical constraint loss function for the set of content objects by setting the loss for each classification value, for each object, to be the maximum of (1) the calculated loss for the classification value and corresponding pre-labeled concept and (2) a loss corresponding to a classification value in a higher, parent layer of the hierarchical relationship and a corresponding pre-labeled concept for that classification value; and

training the classification model using the generated hierarchical constraint loss function as the loss function for the classification model; and

update the classification model based on the hierarchical constraint loss function until the maximum loss satisfies a predetermined criterion.

9. The one or more computing devices of claim 8 , wherein the calculated loss for each of the plurality of classification values comprises a first calculated loss for a parent concept of the plurality of concepts and a second calculated loss for a child concept of the plurality of concepts.

10. The one or more computing devices of claim 9 , wherein the hierarchical constraint loss function comprises one or more constraints configured to limit the second calculated loss to a value less than or equal to that of the first calculated loss.

11. The one or more computing devices of claim 9 , wherein the hierarchical constraint loss function is bounded around a 0-1 loss function.

12. The one or more computing devices of claim 9 , wherein the instructions to train, by the machine-learning model, the classification model further comprises instructions to train the classification model utilizing content objects of the set of content objects corresponding to the parent concept in accordance with the predetermined criteria prior to utilizing content objects of the set of content objects corresponding to the child concept in accordance with the predetermined criteria.

13. The one or more computing devices of claim 8 , wherein, prior to utilizing the hierarchical constraint loss function to calculate the maximum loss, the instructions further comprises instructions to:

derive the hierarchical constraint loss function based on one or more base loss functions.

14. The one or more computing devices of claim 13 , wherein, subsequent to deriving the hierarchical constraint loss function, the instructions further comprises instructions to:

sort the respective losses for each of the plurality of classification values in order of increasing loss value; and

select an initial K concepts corresponding to an initial K losses of the sorted respective losses, such that a cumulative sum of the initial K losses is greater than a sum of a predetermined threshold loss value and 1−K, wherein K is a hyperparameter.

15. A non-transitory computer-readable medium comprising instructions that, when executed by one or more processors of one or more computing devices, cause the one or more processors to:

access a set of content objects, wherein each content object is pre-labeled with one or more concepts of a plurality of concepts, and wherein the plurality of concepts are organized according to a hierarchical relationship; and

train, by a machine-learning model, a classification model for classifying content objects within the set of content objects, wherein training the classification model comprises:

determine, for each object in the set of content objects, a plurality of classification values corresponding to the plurality of concepts, each classification value corresponding to a different layer in the hierarchical relationship;

calculate for each object and based on a loss function, a loss for each of the plurality of classification values based on the pre-labeled concepts associated with the object;

train the classification model to predict, for any particular content object, a probability of a class higher in the hierarchical relationship that is less than or equal to a probability of a class lower in the hierarchical relationship by:

generating a hierarchical constraint loss function for the set of content objects by setting the loss for each classification value, for each object, to be the maximum of (1) the calculated loss for the classification value and corresponding pre-labeled concept and (2) a loss corresponding to a classification value in a higher, parent layer of the hierarchical relationship and a corresponding pre-labeled concept for that classification value; and

training the classification model using the generated hierarchical constraint loss function as the loss function for the classification model; and

update the classification model based on the hierarchical constraint loss function until the maximum loss satisfies a predetermined criterion.

16. The non-transitory computer-readable medium of claim 15 , wherein the calculated loss for each of the plurality of classification values comprises a first calculated loss for a parent concept of the plurality of concepts and a second calculated loss for a child concept of the plurality of concepts.

17. The non-transitory computer-readable medium of claim 16 , wherein the hierarchical constraint loss function comprises one or more constraints configured to limit the second calculated loss to a value less than or equal to that of the first calculated loss.

18. The non-transitory computer-readable medium of claim 16 , wherein the hierarchical constraint loss function is bounded around a 0-1 loss function.

19. The non-transitory computer-readable medium of claim 15 , wherein, prior to utilizing the hierarchical constraint loss function to calculate the maximum loss, the instructions further comprises instructions to:

derive the hierarchical constraint loss function based on one or more base loss functions.

20. The non-transitory computer-readable medium of claim 19 , wherein, subsequent to deriving the hierarchical constraint loss function, the instructions further comprises instructions to:

sort the respective losses for each of the plurality of classification values in order of increasing loss value; and

select an initial K concepts corresponding to an initial K losses of the sorted respective losses, such that a cumulative sum of the initial K losses is greater than a sum of a predetermined threshold loss value and 1−K, wherein K is a hyperparameter.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 4, 2021
From: GOYAL, PALASH; CHOUDHARY, DIVYA; SAHU, SAURABH; GHOSH, SHALINI
To: SAMSUNG ELECTRONICS COMPANY LTD.
Reel/Frame 055500/0667 →
Continuity (3)
Provisional Application 63143373 · Jan 29, 2021
Provisional Application 62985573 · Mar 5, 2020
Related Publication 20210279525A1 · Sep 9, 2021
References Cited (6)
US 20170039471A1 · Ogawa · 2017 [cited by examiner]
Lyu et al., “Curriculum Loss: Robust Learning and Generalization Against Label Corruption”, Feb. 21, 2020, arXiv:1905.10045v3, pp. 1-22. (Year: 2020). [cited by examiner]
Zeng et al., “Hierarchical Multi-Label Classification over Ticket Data using Contextual Loss”, May 9, 2014, 2014 IEEE Network Operations and Management Symposium (NOMS), pp. 1-8. (Year: 2014). [cited by examiner]
Bertinetto, Luca, Romain Mueller, Konstantinos Tertikas, Sina Samangooei, and Nicholas A. Lord. “Making better mistakes: Leveraging class hierarchies with deep networks.” In Proceedings of the IEEE/CVF Conference on Com… [cited by applicant]
Wehrmann, Jonatas, Ricardo Cerri, and Rodrigo Barros. “Hierarchical multi-label classification networks.” In International Conference on Machine Learning, pp. 5075-5084. PMLR, Jul. 3, 2018. [cited by applicant]
Lyu, Yueming, and Ivor W. Tsang. “Curriculum loss: Robust learning and generalization against label corruption.” arXiv preprint arXiv:1905.10045, May 24, 2019. [cited by applicant]