# US 2025/0384348 A1 · Systems and methods for hyperparameter optimization

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

- Number: US 2025/0384348 A1
- Document ID: US20250384348A1
- Status: Published application
- Kind: A1
- Application number: 19/241,030
- Filed: 2025-06-17
- Published: 2025-12-18
- Earliest claimed: 2024-06-17
- Assignees: Kinaxis Inc.
- Applicants: Kinaxis Inc
- Inventors: Anthony John Arena; Kevin Wye-Lim Chan; Yousra Mohamed; Behrouz Haji Soleimani
- Web page: https://patentgrep.com/patent/US20250384348A1

## CPC

- G06N 20/00: Machine learning
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

Methods and systems for improving the efficiency of hyperparameter tuning by generalizing run results across different segments of data. Segments are grouped by segment data metrics, to produce segment clusters. Hyperparameter tuning is run for a cluster medoid and resulting hyperparameters are used for training machine learning models for the segments corresponding to the cluster.

## Claims

### Claim 1

A computing apparatus comprising:
a processor; and
a memory storing instructions that, when executed by the processor, configure the apparatus to:
receive a plurality of segment data;
determine data metrics for each segment data;
cluster data points into a plurality of clusters, the data points indicative of a subset of the data metrics for each segment data;
determine a preliminary medoid of each cluster;
select a cluster;
tune a set of hyperparameters using segment data corresponding to a medoid of the cluster; and
train a machine learning model on each segment data in the cluster using the set of hyperparameters associated with the cluster.

### Claim 2 (depends on 1)

The computing apparatus of claim 1, wherein when tuning the set of hyperparameters, the apparatus is configured to:
obtain the preliminary medoid of the cluster;
determine whether segment data associated with the preliminary medoid is sufficient for tuning;
where the segment data associated with the preliminary medoid is sufficient:
tune the set of hyperparameters on the segment data associated with the preliminary medoid; and
where the segment data associated with the preliminary medoid is insufficient:
sequentially select a data point adjacent to the preliminary medoid until segment data associated with the adjacent data point is sufficient for tuning; and
tune the set of hyperparameters on the segment data associated with the adjacent data point.

### Claim 3 (depends on 1)

The computing apparatus of claim 1, wherein the preliminary medoid is a data point closest a centroid of the cluster.

### Claim 4 (depends on 1)

The computing apparatus of claim 1, wherein the instructions further configure the apparatus to forecast an item using a trained machine learning model.

### Claim 5 (depends on 1)

The computing apparatus of claim 1, wherein the machine learn model comprises: neural networks, decision trees, linear regression, and support vector machines, hidden Markov models, k-means, hierarchical clustering, Gaussian mixture models, temporal difference learning, deep adversarial networks, and Q-learning.

### Claim 6

A non-transitory computer-readable storage medium, the computer-readable storage medium including instructions that when executed by a computer, cause the computer to:
receive a plurality of segment data;
determine data metrics for each segment data;
cluster data points into a plurality of clusters, the data points indicative of a subset of the data metrics for each segment data;
determine a preliminary medoid of each cluster;
select a cluster;
tune a set of hyperparameters using segment data corresponding to a medoid of the cluster; and
train a machine learning model on each segment data in the cluster using the set of hyperparameters associated with the cluster.

### Claim 7 (depends on 6)

The computer-readable storage medium of claim 6, wherein tuning the set of hyperparameters comprises:
obtain the preliminary medoid of the cluster;
determine whether segment data associated with the preliminary medoid is sufficient for tuning;
where the segment data associated with the preliminary medoid is sufficient:
tune the set of hyperparameters on the segment data associated with the preliminary medoid; and
where the segment data associated with the preliminary medoid is insufficient:
sequentially select a data point adjacent to the preliminary medoid until segment data associated with the adjacent data point is sufficient for tuning; and
tune the set of hyperparameters on the segment data associated with the adjacent data point.

### Claim 8 (depends on 6)

The computer-readable storage medium of claim 6, wherein the preliminary medoid is a data point closest a centroid of the cluster.

### Claim 9 (depends on 6)

The computer-readable storage medium of claim 6, wherein the instructions further configure the computer to forecast an item using a trained machine learning model.

### Claim 10 (depends on 6)

The computer-readable storage medium of claim 6, wherein the machine learn model comprises: neural networks, decision trees, linear regression, and support vector machines, hidden Markov models, k-means, hierarchical clustering, Gaussian mixture models, temporal difference learning, deep adversarial networks, and Q-learning.

### Claim 11

A computer-implemented method comprising:
receiving, by a processor, a plurality of segment data;
determining, by the processor, data metrics for each segment data;
clustering, by the processor, data points into a plurality of clusters, the data points indicative of a subset of the data metrics for each segment data;
determining, by the processor, a preliminary medoid of each cluster;
selecting, by the processor, a cluster;
tuning, by the processor, a set of hyperparameters using segment data corresponding to a medoid of the cluster; and
training, by the processor, a machine learning model on each segment data in the cluster using the set of hyperparameters associated with the cluster.

### Claim 12 (depends on 11)

The computer-implemented method of claim 11, wherein tuning the set of hyperparameters comprises:
obtaining, by the processor, the preliminary medoid of the cluster;
determining, by the processor, whether segment data associated with the preliminary medoid is sufficient for tuning;
where the segment data associated with the preliminary medoid is sufficient:
tuning, by the processor, the set of hyperparameters on the segment data associated with the preliminary medoid;
and
where the segment data associated with the preliminary medoid is insufficient:
selecting sequentially, by the processor, a data point adjacent to the preliminary medoid until segment data associated with the adjacent data point is sufficient for tuning; and
tuning, by the processor, the set of hyperparameters on the segment data associated with the adjacent data point.

### Claim 13 (depends on 11)

The computer-implemented method of claim 11, wherein the preliminary medoid is a data point closest a centroid of the cluster.

### Claim 14 (depends on 11)

The computer-implemented method of claim 11, further comprising forecasting an item using a trained machine learning model.

### Claim 15 (depends on 11)

The computer-implemented method of claim 11, wherein the machine learning model comprises: neural networks, decision trees, linear regression, and support vector machines, hidden Markov models, k-means, hierarchical clustering, Gaussian mixture models, temporal difference learning, deep adversarial networks, and Q-learning.
