Weak-Supervised Learning Model Clustering for Label Mismatch Correction

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional machine learning techniques face scalability and accuracy issues when training models to predict labels for images under domain constraints, such as arithmetic or logical constraints, due to the grounding bottleneck and combinatorial explosion, limiting their ability to handle complex constraints effectively.

Innovation Solution

The method involves clustering images into predetermined clusters using a symmetric autoencoder and iteratively correcting label mismatches based on constraints, allowing the model to predict labels without calculating all possible assignments, thereby avoiding the grounding bottleneck and improving prediction accuracy.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If conventional machine learning techniques are used to train models with domain constraints, then the model can learn from training data, but the training process suffers from grounding bottleneck and combinatorial explosion leading to scalability and accuracy issues

Engineering Contradiction:
Improveprediction accuracyVSAvoidtraining speed
Core Design Contradiction:
Measurement precisionVSProductivity

Solution Approach 1:

The patent segments the label space into multiple clusters, where each cluster represents a group of related labels. Instead of considering all possible label assignments globally, the method divides the problem into smaller sub-problems by processing each cluster separately. This segmentation reduces the combinatorial complexity from exponential to polynomial scale, enabling scalable training while maintaining accuracy through constraint-based label assignment within each cluster.

Inventive Principle:
Principle #1Segmentation

2Measurement precision

If all possible label assignments are calculated to ensure accuracy under constraints, then prediction accuracy improves, but computational complexity explodes due to combinatorial explosion

Engineering Contradiction:
Improveprediction accuracyVSAvoidcomputational complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The patent performs preliminary clustering of the label space before training. By pre-organizing labels into meaningful clusters based on domain constraints, the method eliminates the need to evaluate all possible label assignments during training. This preliminary action reduces computational complexity from exponential to polynomial scale while preserving accuracy through constraint-guided label assignment within each cluster.

Inventive Principle:
Principle #10Preliminary action

3Reliability

If the model is trained to handle complex domain constraints, then the model's ability to predict labels accurately improves, but the training time increases significantly

Engineering Contradiction:
Improveconstraint satisfactionVSAvoidtraining time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent segments the training process by dividing the label space into independent clusters. Each cluster can be processed separately with reduced computational requirements, allowing parallel training across multiple clusters. This segmentation maintains constraint satisfaction within each cluster while dramatically reducing overall training time compared to global constraint enforcement.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent applies constraint enforcement partially by focusing on cluster-specific constraints rather than globally enforcing all possible constraints. This partial action approach achieves sufficient constraint satisfaction for each cluster without the excessive computational cost of exhaustive constraint checking, enabling faster training while maintaining reliability.

Inventive Principle:
Principle #16Partial or excessive action

Data Source

PatentUS11783609B1Scalable weak-supervised learning with domain constraints
Publication Date: 2023.10.10 INTUIT INC
  • US11783609B1 patent drawing
  • US11783609B1 patent drawing
  • US11783609B1 patent drawing

AI summary

Systems and methods for training machine learning models based on domain constraints are disclosed. An example method includes receiving a plurality of images, each image associated with a cluster of a plurality of clusters, the plurality of clusters representing an output of a second machine learning model, assigning a label to each cluster of the plurality of clusters based at least in part on a plurality of constraints, identifying, based at least in part on the plurality of constraints, a first label mismatch for a first image, the first label mismatch indicating that the first image belongs to a first cluster but should be assigned to a second cluster different from the first cluster, reassigning the first image to the second cluster, and training the first machine learning model, based on the labeled clusters of the plurality of clusters, to predict labels associated with subsequently received image data.