# US 2025/0156698 A1 · Explainable machine learning subtask architecture

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

- Number: US 2025/0156698 A1
- Document ID: US20250156698A1
- Status: Published application
- Kind: A1
- Application number: 18/506,816
- Filed: 2023-11-10
- Published: 2025-05-15
- Earliest claimed: 2023-11-10
- Assignees: Fair Isaac Corporation
- Applicants: Fair Isaac Corporation
- Inventors: Scott Michael Zoldi; Yuchen Chen
- Web page: https://patentgrep.com/patent/US20250156698A1

## CPC

- G06N 3/0499: Feedforward networks
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

A computer-implemented method for generating a classifier, comprising: assigning a plurality of hierarchies of tags to a collection of training examples, wherein a higher level tag of the plurality of hierarchies of tags comprises a set of lower level tags; associating, in the classifier, a plurality of latent features with each of the plurality of hierarchies of tags, respectively; constructing a plurality of loss functions, wherein each loss function is associated with each level of the plurality of hierarchies of tags and associated latent features of the classifier, wherein the loss function aggregates a plurality of binary cross entropy for each member of a level of tags and associated latent features; and training the classifier by minimizing the loss functions for each level of the plurality of hierarchies of tags and associated latent features of the classifier.

## Claims

### Claim 1

A computer-implemented method for generating a classifier, comprising:
assigning a plurality of hierarchies of tags to a collection of training examples, wherein a higher level tag of the plurality of hierarchies of tags comprises a set of lower level tags;
associating, in the classifier, a plurality of latent features with each of the plurality of hierarchies of tags, respectively;
constructing a plurality of loss functions, wherein each loss function is associated with each level of the plurality of hierarchies of tags and associated latent features of the classifier, wherein the loss function aggregates a plurality of binary cross entropy for each member of a level of tags and associated latent features; and
training the classifier by minimizing the loss functions for each level of the plurality of hierarchies of tags and associated latent features of the classifier.

### Claim 2 (depends on 1)

The method of claim 1, wherein each of the set of lower level tags contributes exclusively to one higher level tag.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
generating an output using the trained classifier, wherein the output comprises a ranked set of explanations attributed to one or more of a set of the associated latent features.

### Claim 4 (depends on 3)

The method of claim 3, wherein the latent features comprises underlying patterns or factors that the classifier learns from the training examples that contribute to one or more of the plurality of hierarchies of tags.

### Claim 5 (depends on 3)

The method of claim 3, wherein by minimizing the loss functions, a set of optimal values of learning parameters is determined, wherein the learning parameters comprise weights and bias terms that define how each latent feature contributes to one or more of the tags.

### Claim 6 (depends on 5)

The method of claim 5, wherein the output further comprises a probability percentage indicative of each of the explanations contribute to a predicted result based on the learning parameters.

### Claim 7 (depends on 1)

The method of claim 1, wherein the classifier comprises a feedforward neural network.

### Claim 8

A computer program product comprising a non-transient machine-readable medium storing instructions that, when executed by at least one programmable processor, cause the at least one programmable processor to perform operations comprising:
assigning a plurality of hierarchies of tags to a collection of training examples, wherein a higher level tag of the plurality of hierarchies of tags comprises a set of lower level tags;
associating, in a classifier, a plurality of latent features with each of the plurality of hierarchies of tags, respectively;
constructing a plurality of loss functions, wherein each loss function is associated with each level of the plurality of hierarchies of tags and associated latent features of the classifier, wherein the loss function aggregates a plurality of binary cross entropy for each member of a level of tags and associated latent features; and
training the classifier by minimizing the loss functions for each level of the plurality of hierarchies of tags and associated latent features of the classifier.

### Claim 9 (depends on 8)

The computer program product of claim 8, wherein each of the set of lower level tags contributes exclusively to one higher level tag.

### Claim 10 (depends on 8)

The computer program product of claim 8, wherein the operations further comprises generating an output using the trained classifier, wherein the output comprises a ranked set of explanations attributed to one or more of a set of the associated latent features.

### Claim 11 (depends on 10)

The computer program product of claim 10, wherein the latent features comprises underlying patterns or factors that the classifier learns from the training examples that contribute to one or more of the plurality of hierarchies of tags.

### Claim 12 (depends on 10)

The computer program product of claim 10, wherein by minimizing the loss functions, a set of optimal values of learning parameters is determined, wherein the learning parameters comprise weights and bias terms that define how each latent feature contributes to one or more of the tags.

### Claim 13 (depends on 12)

The computer program product of claim 12, wherein the output further comprises a probability percentage indicative of each of the explanations contribute to a predicted result based on the learning parameters.

### Claim 14 (depends on 8)

The computer program product of claim 8, wherein the classifier comprises a feedforward neural network.

### Claim 15

A system comprising:
a programmable processor; and
a non-transient machine-readable medium storing instructions that, when executed by the processor, cause the at least one programmable processor to perform operations comprising:
assigning a plurality of hierarchies of tags to a collection of training examples, wherein a higher level tag of the plurality of hierarchies of tags comprises a set of lower level tags;
associating, in a classifier, a plurality of latent features with each of the plurality of hierarchies of tags, respectively;
constructing a plurality of loss functions, wherein each loss function is associated with each level of the plurality of hierarchies of tags and associated latent features of the classifier, wherein the loss function aggregates a plurality of binary cross entropy for each member of a level of tags and associated latent features; and
training the classifier by minimizing the loss functions for each level of the plurality of hierarchies of tags and associated latent features of the classifier.

### Claim 16 (depends on 15)

The system of claim 15, wherein each of the set of lower level tags contributes exclusively to one higher level tag.

### Claim 17 (depends on 15)

The system of claim 15, wherein the operations further comprises generating an output using the trained classifier, wherein the output comprises a ranked set of explanations attributed to one or more of a set of the associated latent features.

### Claim 18 (depends on 17)

The system of claim 17, wherein the latent features comprises underlying patterns or factors that the classifier learns from the training examples that contribute to one or more of the plurality of hierarchies of tags.

### Claim 19 (depends on 17)

The system of claim 17, wherein by minimizing the loss functions, a set of optimal values of learning parameters is determined, wherein the learning parameters comprise weights and bias terms that define how each latent feature contributes to one or more of the tags.

### Claim 20 (depends on 19)

The system of claim 19, wherein the output further comprises a probability percentage indicative of each of the explanations contribute to a predicted result based on the learning parameters.
