# US 2026/0099758 A1 · Iterative technique to identify global minimum in a dataset

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

- Number: US 2026/0099758 A1
- Document ID: US20260099758A1
- Status: Published application
- Kind: A1
- Application number: 18/906,974
- Filed: 2024-10-04
- Published: 2026-04-09
- Earliest claimed: 2024-10-04
- Assignees: Salesforce, Inc.
- Applicants: Salesforce, Inc.
- Inventors: Bikramaditya Padhi; Ramprasadh Kothandaraman
- Web page: https://patentgrep.com/patent/US20260099758A1

## 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

An application server may receive a request to train the machine learning model on a dataset, and may generate a first set of randomized solutions based on inputting one or more of a set of model parameters into the machine learning model, where the first set of randomized solutions correspond to a set of outputs generated by the machine learning model and spans at least a subset of a set of local minimums. The application server may then select a first solution from the first set of randomized solutions and generate a second set of randomized solutions based on the first solution and inputting one or more of the set of model parameters into the machine learning model. The application server may then determine that the second set of randomized solutions includes a global minimum of the dataset based on the second set of randomized solutions satisfying a threshold.

## Claims

### Claim 1

A method for data processing, comprising:
receiving, from a user and at an interface for accessing a machine learning model, a request to train the machine learning model on a dataset by iteratively inputting a set of model parameters into the machine learning model to minimize a loss function associated with the dataset, wherein the dataset comprises a plurality of local minimums;
generating a first set of randomized solutions based at least in part on inputting one or more of the set of model parameters into the machine learning model, wherein the first set of randomized solutions corresponds to a set of outputs generated by the machine learning model upon inputting the set of model parameters, and wherein the first set of randomized solutions spans at least a subset of the plurality of local minimums;
selecting a first solution from the first set of randomized solutions, the first solution having a minimum loss value of a first set of loss values corresponding to the first set of randomized solutions, the first solution corresponding to the at least one local minimum of the plurality of local minimums of the dataset;
generating a second set of randomized solutions based at least in part on the first solution and inputting one or more of the set of model parameters into the machine learning model;
determining that the second set of randomized solutions comprises a global minimum of the dataset based at least in part on the second set of randomized solutions satisfying a threshold; and
providing for display, via the interface, an indication of completion of training of the machine learning model based at least in part on the second set of randomized solutions comprising the global minimum of the dataset.

### Claim 2 (depends on 1)

The method of claim 1, wherein determining that the second set of randomized solutions comprises the global minimum of the dataset further comprises:
iteratively generating a plurality of randomized solutions for a first quantity iterations prior to generating the second set of randomized solutions; and
determining that the second set of randomized solutions comprises the global minimum of the dataset based at least in part on the first quantity of iterations satisfying a threshold quantity of iterations.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
calculating an average change between the first set of randomized solutions and the second set of randomized solutions, wherein determining that the second set of randomized solutions comprises the global minimum of the dataset is based at least in part on the average change being less than a threshold level.

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
generating the first set of loss values corresponding to the first set of randomized solutions based at least in part on computing a loss value for each randomized solution of the first set of randomized solutions using the loss function associated with the dataset.

### Claim 5 (depends on 1)

The method of claim 1, further comprising:
generating a set of updated model parameters for inputting into the machine learning model based at least in part on adding one or more deviations to the set of model parameters, wherein generating the second set of randomized solutions is based at least in part on the set of updated model parameters.

### Claim 6 (depends on 1)

The method of claim 1, wherein the second set of randomized solutions is generated within a threshold distance of a search space associated with the first solution.

### Claim 7 (depends on 1)

The method of claim 1, wherein the set of model parameters is based at least in part on a dimensionality of a search space associated with the machine learning model.

### Claim 8 (depends on 1)

The method of claim 1, wherein the machine learning model comprises a gradient-based machine learning model.

### Claim 9

An apparatus for data processing, comprising:
one or more memories storing processor-executable code; and
one or more processors coupled with the one or more memories and individually or collectively operable to execute the code to cause the apparatus to:
receive, from a user and at an interface for accessing a machine learning model, a request to train the machine learning model on a dataset by iteratively inputting a set of model parameters into the machine learning model to minimize a loss function associated with the dataset, wherein the dataset comprises a plurality of local minimums;
generate a first set of randomized solutions based at least in part on inputting one or more of the set of model parameters into the machine learning model, wherein the first set of randomized solutions corresponds to a set of outputs generated by the machine learning model upon inputting the set of model parameters, and wherein the first set of randomized solutions spans at least a subset of the plurality of local minimums;
select a first solution from the first set of randomized solutions, the first solution having a minimum loss value of a first set of loss values corresponding to the first set of randomized solutions, the first solution corresponding to the at least one local minimum of the plurality of local minimums of the dataset;
generate a second set of randomized solutions based at least in part on the first solution and inputting one or more of the set of model parameters into the machine learning model;
determine that the second set of randomized solutions comprises a global minimum of the dataset based at least in part on the second set of randomized solutions satisfying a threshold; and
provide for display, via the interface, an indication of completion of training of the machine learning model based at least in part on the second set of randomized solutions comprising the global minimum of the dataset.

### Claim 10 (depends on 9)

The apparatus of claim 9, wherein, to determine that the second set of randomized solutions comprises the global minimum of the dataset, the one or more processors are individually or collectively further operable to execute the code to cause the apparatus to:
iteratively generate a plurality of randomized solutions for a first quantity iterations prior to generating the second set of randomized solutions; and
determine that the second set of randomized solutions comprises the global minimum of the dataset based at least in part on the first quantity of iterations satisfying a threshold quantity of iterations.

### Claim 11 (depends on 9)

The apparatus of claim 9, wherein the one or more processors are individually or collectively further operable to execute the code to cause the apparatus to:
calculate an average change between the first set of randomized solutions and the second set of randomized solutions, wherein determining that the second set of randomized solutions comprises the global minimum of the dataset is based at least in part on the average change being less than a threshold level.

### Claim 12 (depends on 9)

The apparatus of claim 9, wherein the one or more processors are individually or collectively further operable to execute the code to cause the apparatus to:
generate the first set of loss values corresponding to the first set of randomized solutions based at least in part on computing a loss value for each randomized solution of the first set of randomized solutions using the loss function associated with the dataset.

### Claim 13 (depends on 9)

The apparatus of claim 9, wherein the one or more processors are individually or collectively further operable to execute the code to cause the apparatus to:
generate a set of updated model parameters for inputting into the machine learning model based at least in part on adding one or more deviations to the set of model parameters, wherein generating the second set of randomized solutions is based at least in part on the set of updated model parameters.

### Claim 14 (depends on 9)

The apparatus of claim 9, wherein the second set of randomized solutions is generated within a threshold distance of a search space associated with the first solution.

### Claim 15 (depends on 9)

The apparatus of claim 9, wherein the set of model parameters is based at least in part on a dimensionality of a search space associated with the machine learning model.

### Claim 16 (depends on 9)

The apparatus of claim 9, wherein the machine learning model comprises a gradient-based machine learning model.

### Claim 17

A non-transitory computer-readable medium storing code for data processing, the code comprising instructions executable by one or more processors to:
receive, from a user and at an interface for accessing a machine learning model, a request to train the machine learning model on a dataset by iteratively inputting a set of model parameters into the machine learning model to minimize a loss function associated with the dataset, wherein the dataset comprises a plurality of local minimums;
generate a first set of randomized solutions based at least in part on inputting one or more of the set of model parameters into the machine learning model, wherein the first set of randomized solutions corresponds to a set of outputs generated by the machine learning model upon inputting the set of model parameters, and wherein the first set of randomized solutions spans at least a subset of the plurality of local minimums;
select a first solution from the first set of randomized solutions, the first solution having a minimum loss value of a first set of loss values corresponding to the first set of randomized solutions, the first solution corresponding to the at least one local minimum of the plurality of local minimums of the dataset;
generate a second set of randomized solutions based at least in part on the first solution and inputting one or more of the set of model parameters into the machine learning model;
determine that the second set of randomized solutions comprises a global minimum of the dataset based at least in part on the second set of randomized solutions satisfying a threshold; and
provide for display, via the interface, an indication of completion of training of the machine learning model based at least in part on the second set of randomized solutions comprising the global minimum of the dataset.

### Claim 18 (depends on 17)

The non-transitory computer-readable medium of claim 17, wherein the instructions to determine that the second set of randomized solutions comprises the global minimum of the dataset are further executable by the one or more processors to:
iteratively generate a plurality of randomized solutions for a first quantity iterations prior to generating the second set of randomized solutions; and
determine that the second set of randomized solutions comprises the global minimum of the dataset based at least in part on the first quantity of iterations satisfying a threshold quantity of iterations.

### Claim 19 (depends on 17)

The non-transitory computer-readable medium of claim 17, wherein the instructions are further executable by the one or more processors to:
calculate an average change between the first set of randomized solutions and the second set of randomized solutions, wherein determining that the second set of randomized solutions comprises the global minimum of the dataset is based at least in part on the average change being less than a threshold level.

### Claim 20 (depends on 17)

The non-transitory computer-readable medium of claim 17, wherein the instructions are further executable by the one or more processors to:
generate the first set of loss values corresponding to the first set of randomized solutions based at least in part on computing a loss value for each randomized solution of the first set of randomized solutions using the loss function associated with the dataset.
