IP Library Granted Patent US 11,645,562
Granted Patent B2
US 11,645,562 · App. 16/297,850 · Granted May 9, 2023

Search point determining method and search point determining apparatus

Inventors: Nobutaka Imamura (Yokohama, JP); Akira Ura (Yokohama, JP)
Assignee: FUJITSU LIMITED
G06N5/048G06F16/903G06N7/01G06N20/00
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,645,562
App. No.
16/297,850
Granted
May 9, 2023
Kind
B2
Abstract

A search point determining method in an estimation process of a function, executed by a processor included in a search point determining apparatus, the method includes, calculating a search prediction time and a confidence interval upper limit obtained by using a Gaussian process for the function in each search candidate point from a past search result of the function, generating an area in a parameter space for each search candidate point by using a position of a search point close to the relevant search candidate point in a past search result, a search prediction time corresponding to each search candidate point, and a confidence interval upper limit corresponding to each search candidate point, and determining a search point based on a size of the area in a plurality of parameter spaces.

Claims (36)

1. A search point determining method in an estimation process of a function, executed by a processor included in a search point determining apparatus, the method comprising:

calculating a search prediction time and a confidence interval upper limit obtained by using a Gaussian process for the function in each search candidate point from a first search result of the function;

generating an area in a parameter space for each search candidate point by using a position of a search point close to the relevant search candidate point in a first search result, a search prediction time corresponding to each search candidate point, and a confidence interval upper limit corresponding to each search candidate point;

determining a search point based on a value obtained by dividing a product of an improvement value from an evaluation value in the first search result at each search candidate point and a size of the area by the search prediction time in a plurality of parameter spaces;

when a remaining time until a time limit is longer than or equal to a certain threshold, outputting a second search result as a solution of the function by searching more widely than the first search result; and

when the remaining time is shorter than the certain threshold, outputting a second search result as the solution of the function by reusing the first search result.

2. The search point determining method according to claim 1 ,

wherein the area in the parameter space is an N-dimensional hyper-rectangular parallelepiped.

3. The search point determining method according to claim 1 ,

wherein the area in the parameter space is an N-dimensional hyperball.

4. The search point determining method according to claim 1 ,

wherein the generating corrects the size of the area in the parameter space according to the position of the search point in the first search result.

5. The search point determining method according to claim 1 ,

wherein the search candidate point is set within a range where an expected value of the function is higher than an evaluation value of a search point having the highest evaluation value in the first search result.

6. A search point determining apparatus that determines a search point in an estimation process of a function, the apparatus comprising:

a memory; and

a processor coupled to the memory and configured to:

calculate a search prediction time and a confidence interval upper limit obtained by using a Gaussian process for the function in each search candidate point from a first search result of the function,

generate an area in a parameter space for each search candidate point by using a position of a search point close to the relevant search candidate point in a first search result, a search prediction time corresponding to each search candidate point, and a confidence interval upper limit corresponding to each search candidate point,

determine a search point based on a value obtained by dividing a product of an improvement value from an evaluation value in the first search result at each search candidate point and a size of the area by the search prediction time in a plurality of parameter spaces,

when a remaining time until a time limit is longer than or equal to a certain threshold, output a second search result as a solution of the function by searching more widely than the first search result, and

when the remaining time is shorter than the certain threshold, output a second search result as the solution of the function by reusing the first search result.

7. The apparatus according to claim 6 ,

wherein the area in the parameter space is an N-dimensional hyper-rectangular parallelepiped.

8. The apparatus according to claim 6 ,

wherein the area in the parameter space is an N-dimensional hyperball.

9. The apparatus according to claim 6 ,

wherein the processor is configured to generate corrects the size of the area in the parameter space according to the position of the search point in the first search result.

10. The apparatus according to claim 6 ,

wherein the processor is configured to set the search candidate point within a range where an expected value of the function is higher than an evaluation value of a search point having the highest evaluation value in the first search result.

11. A non-transitory computer-readable recording medium storing a program that causes a processor included in a search point determining apparatus to execute a process, the process comprising:

calculating a search prediction time and a confidence interval upper limit obtained by using a Gaussian process for the function in each search candidate point from a first search result of the function;

generating an area in a parameter space for each search candidate point by using a position of a search point close to the relevant search candidate point in a first search result, a search prediction time corresponding to each search candidate point, and a confidence interval upper limit corresponding to each search candidate point;

determining a search point based on a value obtained by dividing a product of an improvement value from an evaluation value in the first search result at each search candidate point and a size of the area by the search prediction time in a plurality of parameter spaces;

when a remaining time until a time limit is longer than or equal to a certain threshold, outputting a second search result as a solution of the function by searching more widely than the first search result; and

when the remaining time is shorter than the certain threshold, outputting a second search result as the solution of the function by reusing the first search result.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 11, 2019
From: IMAMURA, NOBUTAKA; URA, AKIRA
To: FUJITSU LIMITED
Reel/Frame 048557/0481 →
Priority Claims (1)
JP JP2018-047063 · Mar 14, 2018 · national
Continuity (1)
Related Publication 20190287010A1 · Sep 19, 2019