# US 2025/0156747 A1 · High-fidelity prediction with trust regions

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

- Number: US 2025/0156747 A1
- Document ID: US20250156747A1
- Status: Published application
- Kind: A1
- Application number: 18/508,416
- Filed: 2023-11-14
- Published: 2025-05-15
- Earliest claimed: 2023-11-14
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Dung Tien Phan; Ali Koc; Jayant R. Kalagnanam
- Web page: https://patentgrep.com/patent/US20250156747A1

## CPC

- G06N 20/00: Machine learning
- G06N 5/01: Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

According to one embodiment, a method, computer system, and computer program product for making high-fidelity predictions with trust regions is provided. The embodiment may include identifying a data set. The embodiment may also include partitioning the data set into two or more clusters. The embodiment may further include creating two or more disjoint polytopic regions in a multi-dimensional space, wherein a cluster from the two or more disjoint polytopic regions corresponds to a trust region from the two or more polytopic regions. The embodiment may also include training a machine learning model based on the two or more disjoint polytopic regions. The embodiment may further include drawing a conclusion based on the trained machine learning model.

## Claims

### Claim 1

A processor-implemented method, the method comprising:
identifying a data set;
partitioning the data set into two or more clusters;
creating two or more disjoint polytopic regions in a multi-dimensional space, wherein a cluster from the two or more disjoint polytopic regions corresponds to a trust region from the two or more polytopic regions;
training a machine learning model based on the two or more disjoint polytopic regions; and
drawing a conclusion based on the trained machine learning model.

### Claim 2 (depends on 1)

The method of claim 1, wherein at least one region from the two or more regions is a low-confidence region signifying lower confidence than the trust region, and wherein another region from the two or more disjoint polytopic regions corresponds to a region with no support, signifying lower confidence than the low-confidence region.

### Claim 3 (depends on 1)

The method of claim 1, wherein the training of the machine learning model is performed using an integer linear programming method or a mixed-integer linear programming method.

### Claim 4 (depends on 3)

The method of claim 3, wherein the partitioning and the creating are each also performed using the integer linear programming method or the mixed-integer linear programming method.

### Claim 5 (depends on 1)

The method of claim 1, wherein the feature is a target feature, and wherein drawing a conclusion includes determining a projected value of the target feature with respect to a data point where the value of the target feature is unknown.

### Claim 6 (depends on 1)

The method of claim 1, wherein a region from the two or more disjoint polytopic regions is formed by two or more hyperplanes.

### Claim 7 (depends on 6)

The method of claim 6, wherein a hyperplane in the two or more hyperplanes is defined using a coefficient vector, and wherein the coefficient vector contains at least one nonzero integer coefficient and at least one coefficient equal to zero.

### Claim 8

A computer system, the computer system comprising:
one or more processors, one or more computer-readable memories, one or more computer-readable tangible storage media, and program instructions stored on at least one of the one or more tangible storage media for execution by at least one of the one or more processors via at least one of the one or more memories, wherein the computer system is capable of performing a method comprising:
identifying a data set;
partitioning the data set into two or more clusters;
creating two or more disjoint polytopic regions in a multi-dimensional space, wherein a cluster from the two or more disjoint polytopic regions corresponds to a trust region from the two or more polytopic regions;
training a machine learning model based on the two or more disjoint polytopic regions; and
drawing a conclusion based on the trained machine learning model.

### Claim 9 (depends on 8)

The computer system of claim 8, wherein at least one region from the two or more regions is a low-confidence region signifying lower confidence than the trust region, and wherein another region from the two or more disjoint polytopic regions corresponds to a region with no support, signifying lower confidence than the low-confidence region.

### Claim 10 (depends on 8)

The computer system of claim 8, wherein the training of the machine learning model is performed using an integer linear programming method or a mixed-integer linear programming method.

### Claim 11 (depends on 10)

The computer system of claim 10, wherein the partitioning and the creating are each also performed using the integer linear programming method or the mixed-integer linear programming method.

### Claim 12 (depends on 8)

The computer system of claim 8, wherein the feature is a target feature, and wherein drawing a conclusion includes determining a projected value of the target feature with respect to a data point where the value of the target feature is unknown.

### Claim 13 (depends on 8)

The computer system of claim 8, wherein a region from the two or more disjoint polytopic regions is formed by two or more hyperplanes.

### Claim 14 (depends on 13)

The computer system of claim 13, wherein a hyperplane in the two or more hyperplanes is defined using a coefficient vector, and wherein the coefficient vector contains at least one nonzero integer coefficient and at least one coefficient equal to zero.

### Claim 15

A computer program product, the computer program product comprising:
one or more computer-readable tangible storage media and program instructions stored on at least one of the one or more tangible storage media, the program instructions executable by a processor capable of performing a method, the method comprising:
identifying a data set;
partitioning the data set into two or more clusters;
creating two or more disjoint polytopic regions in a multi-dimensional space, wherein a cluster from the two or more disjoint polytopic regions corresponds to a trust region from the two or more polytopic regions;
training a machine learning model based on the two or more disjoint polytopic regions; and
drawing a conclusion based on the trained machine learning model.

### Claim 16 (depends on 15)

The computer program product of claim 15, wherein at least one region from the two or more regions is a low-confidence region signifying lower confidence than the trust region, and wherein another region from the two or more disjoint polytopic regions corresponds to a region with no support, signifying lower confidence than the low-confidence region.

### Claim 17 (depends on 15)

The computer program product of claim 15, wherein the training of the machine learning model is performed using an integer linear programming method or a mixed-integer linear programming method.

### Claim 18 (depends on 17)

The computer program product of claim 17, wherein the partitioning and the creating are each also performed using the integer linear programming method or the mixed-integer linear programming method.

### Claim 19 (depends on 15)

The computer program product of claim 15, wherein the feature is a target feature, and wherein drawing a conclusion includes determining a projected value of the target feature with respect to a data point where the value of the target feature is unknown.

### Claim 20 (depends on 15)

The computer program product of claim 15, wherein a region from the two or more disjoint polytopic regions is formed by two or more hyperplanes.
