公开(公告)号：US20240135394A1

公开(公告)日：2024-04-25

申请号：US18544651

申请日：2023-12-19

Applicant: NEC Corporation

Inventor： Shinji ITO

IPC: G06Q30/0201

CPC classification number: G06Q30/0201

Abstract: An optimization apparatus includes: a selection unit that selects, as a correction value, an element having a magnitude equal to or smaller than a predetermined value from among convex hulls of a policy set; an acquisition unit that acquires a result of execution of a second policy executed in a second round, the second round being a round a predetermined round before a first round for executing a first policy that is determined from among the policy set; a calculation unit that calculates an estimated value of a loss vector in the execution of the policy based on the result of the execution and the correction value selected in the second round; an update unit that updates a first probability distribution based on the estimated value; and a determination unit that determines a policy for a next round based on the updated first probability distribution.

公开(公告)号：US20230009019A1

公开(公告)日：2023-01-12

申请号：US17765139

申请日：2019-10-07

Applicant: NEC Corporation

Inventor： Shinji ITO

IPC: H04M15/00 ,  H04W24/02 ,  H04L41/0823

Abstract: An optimization apparatus (100) includes a setting unit (110) that sets a predetermined non-linear objective function, a policy determination unit (120) that determines a policy to be executed in online optimization in a bandit problem, based on the non-linear objective function, a policy execution unit (130) that acquires a reward as an execution result of the determined policy, an update rate determination unit (140) that determines an update rate of the non-linear objective function by a multiplicative weight update method, based on the acquired reward and the non-linear objective function, and an update unit (150) that updates the non-linear objective function, based on the update rate.

公开(公告)号：US20180285787A1

公开(公告)日：2018-10-04

申请号：US15764681

申请日：2016-08-09

Applicant: NEC CORPORATION

Inventor： Shinji ITO ,  Ryohei FUJIMAKI

IPC: G06Q10/04 ,  G06F17/18 ,  G06F15/18 ,  G06F17/11

Abstract: A model input unit 84 receives a linear regression model represented by a function having an objective variable as an explanatory variable. A candidate point input unit 85 receives, for the objective variable included in the linear regression model, at least one candidate point which is a discrete candidate for a possible value of the objective variable. An optimization unit 86 calculates the objective variable that optimizes an objective function having the linear regression model as an argument.

公开(公告)号：US20240185269A1

公开(公告)日：2024-06-06

申请号：US18544830

申请日：2023-12-19

Applicant: NEC Corporation

Inventor： Shinji ITO

IPC: G06Q30/0201

CPC classification number: G06Q30/0201

Abstract: An optimization apparatus includes: a selection unit that selects, as a correction value, an element having a magnitude equal to or smaller than a predetermined value from among convex hulls of a policy set; an acquisition unit that acquires a result of execution of a second policy executed in a second round, the second round being a round a predetermined round before a first round for executing a first policy that is determined from among the policy set; a calculation unit that calculates an estimated value of a loss vector in the execution of the policy based on the result of the execution and the correction value selected in the second round; an update unit that updates a first probability distribution based on the estimated value; and a determination unit that determines a policy for a next round based on the updated first probability distribution.

公开(公告)号：US20240020351A1

公开(公告)日：2024-01-18

申请号：US18031195

申请日：2020-10-14

Applicant: NEC Corporation

Inventor： Shinji ITO ,  Tatsuya MATSUOKA ,  Naoto OHSAKA

IPC: G06F17/18 ,  G06F17/16

CPC classification number: G06F17/18 ,  G06F17/16

Abstract: In order to enable derivation of useful subsets X1, X2, . . . , XT also for an online submodular optimization problem for which a fixed strategy is not effective, an information processing apparatus (1) includes: an objective function setting unit (11) that sets, as an objective function ft in each round t∈[T], a submodular function on a power set 2S of a set S consisting of n elements; and a subset sequence derivation unit (12) that derives a subset sequence X1, X2, . . . , XT∈2S in which an expected value of regret Σt∈[T]ft(Xt)−Σt∈[T]ft(Xt*) with respect to any benchmark X1*, X2*, . . . , Xt*∈2S satisfying Σt∈[T−1]dH(Xt*, Xt+1*) is not more than an upper limit Max (n,T,V).

公开(公告)号：US20190311222A1

公开(公告)日：2019-10-10

申请号：US16345496

申请日：2017-10-18

Applicant: NEC CORPORATION

Inventor： Shinji ITO ,  Akihiro YABE ,  Ryohei FUJIMAKI

IPC: G06K9/62 ,  G06N7/00

Abstract: An evaluation system 80 includes an evaluation unit 81 for evaluating, when there is a prediction model estimated using data generated from the true model, the optimal solution calculated from the prediction model in consideration of bias generated between evaluation based on the prediction model and evaluation based on the true model.

公开(公告)号：US20190220496A1

公开(公告)日：2019-07-18

申请号：US16301662

申请日：2017-05-01

Applicant: NEC CORPORATION

Inventor： Shinji ITO ,  Ryohei FUJIMAKI

IPC: G06F17/11 ,  G06F17/18 ,  G06F17/16

CPC classification number: G06F17/11 ,  G06F17/16 ,  G06F17/18 ,  G06Q10/04 ,  G06Q30/02

Abstract: An accepting unit 81 accepts an optimization problem that can be formulated as BQP represented by zTAz+bTz by use of an n×n square matrix A and an n-dimensional vector b. A condition storage unit 82 stores characteristic conditions representing characteristics of a positive weighted directed graph. An optimization unit 83 transforms the optimization problem based on the characteristic conditions, and solves the accepted optimization problem by solving the transformed problem as a minimum cut problem of a network flow.