# US 2026/0099565 A1 · Non-transitory computer-readable medium, calculation method, and information processing device

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

- Number: US 2026/0099565 A1
- Document ID: US20260099565A1
- Status: Published application
- Kind: A1
- Application number: 19/348,828
- Filed: 2025-10-03
- Published: 2026-04-09
- Earliest claimed: 2024-10-07
- Assignees: Fujitsu Limited
- Applicants: Fujitsu Limited
- Inventors: Yuma ICHIKAWA
- Web page: https://patentgrep.com/patent/US20260099565A1

## CPC

- G06F 17/11: for solving equations {, e.g. nonlinear equations, general mathematical optimization problems (optimization specially adapted for a specific administrative, business or logistic context G06Q10/04)}
- G06N 20/00: Machine learning
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

There is provided a non-transitory computer-readable medium storing a calculation program for causing a computer to execute a process. The process includes, in a cost function in a search process that performs a search by incorporating continuous relaxation into a discrete optimization problem, in which each element of a matrix obtained by relaxing discrete variables to be optimized into a continuous matrix is a solution of a plurality of discrete optimization problems, outputting a solution of a discrete optimization problem using solutions of the plurality of discrete optimization problems obtained by training a machine learning model by applying a perturbation to the plurality of discrete optimization problems.

## Claims

### Claim 1

A non-transitory computer-readable medium storing a calculation program for causing a computer to execute a process, the process comprising:
in a cost function in a search process that performs a search by incorporating continuous relaxation into a discrete optimization problem, in which each element of a matrix obtained by relaxing discrete variables to be optimized into a continuous matrix is a solution of a plurality of discrete optimization problems, outputting a solution of a discrete optimization problem using solutions of the plurality of discrete optimization problems obtained by training a machine learning model by applying a perturbation to the plurality of discrete optimization problems.

### Claim 2 (depends on 1)

The non-transitory computer-readable medium according to claim 1,
wherein the machine learning model is trained by using a loss term that corresponds to a degree of continuity and discreteness of variables to be optimized and by changing the loss term as the search process progresses.

### Claim 3 (depends on 2)

The non-transitory computer-readable medium according to claim 2,
wherein the machine learning model is trained by changing the loss term as the search process progresses from one that results in a smaller loss the more continuous the variable is to one that results in a larger loss the more continuous the variable is.

### Claim 4

A calculation method implemented by a computer, the method comprising:
in a cost function in a search process that performs a search by incorporating continuous relaxation into a discrete optimization problem, in which each element of a matrix obtained by relaxing discrete variables to be optimized into a continuous matrix is a solution of a plurality of discrete optimization problems, outputting a solution of a discrete optimization problem using solutions of the plurality of discrete optimization problems obtained by training a machine learning model by applying a perturbation to the plurality of discrete optimization problems.

### Claim 5 (depends on 4)

The method according to claim 4,
wherein the machine learning model is trained by using a loss term that corresponds to a degree of continuity and discreteness of variables to be optimized and by changing the loss term as the search process progresses.

### Claim 6 (depends on 5)

The method according to claim 5,
wherein the machine learning model is trained by changing the loss term as the search process progresses from one that results in a smaller loss the more continuous the variable is to one that results in a larger loss the more continuous the variable is.

### Claim 7

An information processing device comprising:
a memory; and
a processor coupled to the memory and the processor configured to execute a process, the process comprising:
in a cost function in a search process that performs a search by incorporating continuous relaxation into a discrete optimization problem, in which each element of a matrix obtained by relaxing discrete variables to be optimized into a continuous matrix is a solution of a plurality of discrete optimization problems, outputting a solution of a discrete optimization problem using solutions of the plurality of discrete optimization problems obtained by training a machine learning model by applying a perturbation to the plurality of discrete optimization problems.

### Claim 8 (depends on 7)

The information processing device according to claim 7,
wherein the machine learning model is trained by using a loss term that corresponds to a degree of continuity and discreteness of variables to be optimized and by changing the loss term as the search process progresses.

### Claim 9 (depends on 8)

The information processing device according to claim 8,
wherein the machine learning model is trained by changing the loss term as the search process progresses from one that results in a smaller loss the more continuous the variable is to one that results in a larger loss the more continuous the variable is.
