DATA PROCESSING EQUIPMENT, DATA PROCESSING METHOD AND PROGRAM

Description

FIELD

[0001] The embodiments discussed herein are related to a data processing apparatus, a data processing method, and a program.BACKGROUND

[0002] As an apparatus that calculates a large-scale discrete optimization problem which a Neumann-type computer is not good at, there is an Ising apparatus that uses an Ising-type evaluation function. An evaluation function is also referred to as an energy function or the like. An Ising apparatus is also referred to as a Boltzmann machine.

[0003] The Ising apparatus converts a discrete optimization problem into an Ising model representing a behavior of spin of a magnetic body. The Ising apparatus searches for a state of the Ising model in which the value of an Ising-type evaluation function is local minimum by a Markov chain Monte Carlo method such as the simulated annealing method or the replica exchange method. The value of an Ising-type evaluation function corresponds to energy. A state in which the value of an evaluation function is the minimum value among local minimum values, is the optimal solution. By changing the sign of the evaluation function, the Ising apparatus may also search for a state in which the value of the evaluation function is local maximum. A state of an Ising model may be expressed by a combination of the values of a plurality of state variables. As the value of each state variable, 0 or 1 may be used.

[0004] For example, an Ising-type evaluation function is defined by a function of a quadratic form of the following Formula (1). E x = − ∑ i = 1 N ∑ j > i N W ij x i x j − ∑ i = 1 N b i x i

[0005] The first term on the right side adds up the products of the values of two state variables (0 or 1) and a weight value without omission and duplication for all combinations of N state variables of an Ising model. A weight value represents the degree of interaction between two state variables. x i is a state variable with an identification number i, x j is a state variable with an identification number j, and W ij is a weight value indicating the degree of interaction between the state variables with the identification numbers i and j. The second term on the right side calculates a sum of the products of a bias coefficient and a state variable for each identification number. b i indicates a bias coefficient for the identification number i.

[0006] An energy change amount due to a change in the value of x i (ΔE i ) is expressed by the following Formula (2). Δ E i = − Δ x i ∑ j N W ij x j + b i = − Δ x i h i

[0007] In Formula (2), Δx i is -1 when x i changes from 1 to 0, whereas Δx i is 1 when the state variable x i changes from 0 to 1. h i is referred to as a local field, and ΔE i is a product of h i and a sign (+1 or -1) depending on Δx i . For this reason, h i may also be referred to as a variable that represents an energy change amount or a variable that determines an energy change amount.

[0008] For example, processing is repeated in which a state transition is generated by updating the value of x i with an acceptance probability expressed by exp(-βΔE i ) (β is a reciprocal of a parameter representing temperature) and a local field is updated.

[0009] Meanwhile, some discrete optimization problems have a constraint condition to be satisfied by a solution. For example, a knapsack problem, which is one of discrete optimization problems, has a constraint condition that the total capacity of loads that may be packed in a knapsack is equal to or smaller than the capacity of the knapsack. Such constraint condition is referred to as an inequality constraint, and may be represented by a constraint term having a value corresponding to the presence or absence of violation of the constraint condition. As constraint conditions, there are an equality constraint, an absolute value constraint, and the like in addition to an inequality constraint.

[0010] Total energy (H(x)) including constraint terms may be expressed by the following Formula (3). H x = − 1 2 ∑ i ∈ D ∑ j ∈ D W ij x i x j − ∑ i ∈ D b i x i + ∑ k ∈ A λ k g h k

[0011] In Formula (3), the sum of the first term and the second term on the right side represents energy corresponding to E(x) of Formula (1), and the third term on the right side represents the magnitude (energy) of the entirety of constraint terms. D represents a set of identification numbers of state variables, k represents an identification number of a constraint term, and A represents a set of identification numbers of constraint terms. λ k is a predetermined positive coefficient for a constraint term with an identification number k.

[0012] When the constraint condition is an inequality constraint, g(h k ) in Formula (3) may be expressed by the following Formula (4). g h k = max 0 h k , h k = R k − U k = ∑ i ∈ D W ki x i − U k

[0013] In Formula (4), max[0, h k ] is a function that outputs a larger value of 0 and h k . R k represents a consumption amount (also referred to as a resource amount) of the constraint term with the identification number k, and U k represents an upper limit of the resource amount. W ki is a coefficient (weight value) indicating a weight of x i in an inequality constraint with the identification number k.

[0014] In Formula (3), a total energy change amount due to a change in the value of x j (ΔH j ) is expressed by the following Formula (5). Δ H j = − h k Δ x j + ∑ k ∈ A λ k g h k + W kj Δ x j − g h k

[0015] When the constraint condition is an inequality constraint, the total energy change amount due to a change in the value of x j (ΔH j ) may be expressed by the following Formula (6) instead of Formula (5). Δ H j = − h j Δ x j + ∑ i = 1 M λ i max 0 , h i + a ij Δ x j − C ui − max 0 , h i − C ui

[0016] In Formula (6), a ij is a coefficient indicating a weight of x j in an inequality constraint with the identification number i, and corresponds to the above W ki . C ui is an upper limit value in the inequality constraint with the identification number i, and corresponds to the above U k . M represents the number of constraint terms.

[0017] An acceptance probability of accepting a change in the value of x j may be expressed as A j = min[1, exp(-βΔH j )]. min[1, exp(-βΔH j )] is a function that outputs a smaller value of 1 and exp(-(3ΔH j ).

[0018] Formula (3) is not a function of a quadratic form such as Formula (1), but is a discontinuous function of a linear form. In order to allow an inequality constraint to be handled by the Ising apparatus, it is conceivable to convert a discontinuous function of a linear form into a quadratic form. However, in a case where a discrete optimization problem is calculated by using a constraint term of an inequality constraint converted into a quadratic form, there is a case in which it is difficult to find a solution by the Ising apparatus due to the complexity of processing or the like.

[0019] Accordingly, a technique has been proposed in which solution-finding is performed by the Ising apparatus using a constraint term of an inequality constraint such as that described above remaining in the linear form.

[0020] An optimization apparatus has been proposed in which a decision variable having a continuous value or an integer value among decision variables of a mixed integer programming problem is discretized, the mixed integer programming problem is converted into a combinatorial optimization problem, and a quantum computing device is caused to calculate an optimal solution of the combinatorial optimization problem.

[0021] A method has also been proposed in which a penalty function for an arbitrary constraint is defined, and a constraint satisfaction problem is solved by optimization without a constraint using the penalty function. A method has also been proposed in which weights of a discretized deep neural network are quantized in machine learning.

[0022] Japanese Laid-open Patent Publication No. 2020-204928, Japanese Laid-open Patent Publication No. 2020-113190, U.S. Patent Application Publication No. 2015 / 0205759, and U.S. Patent Application Publication No. 2019 / 0354842 are disclosed as related art.

[0023] EP 3 757 908 A1 relates to an optimization device and an optimization method.

[0024] Kotaro Tanahashi ET AL: "Application of Ising Machines and a Software Development for Ising Machines", JOURNAL OF THE PHYSICAL SOCIETY OF JAPAN., vol. 88, no. 6, 20 May 2019 relates to an online advertisement optimization.[TECHNICAL PROBLEMS]

[0025] A method of finding a solution by using a constraint term of an inequality constraint remaining in a linear form has a problem that the efficiency of arithmetic operation is not sufficiently increased.

[0026] In one aspect, an object of the present disclosure is to enable an increase in the efficiency of arithmetic operation.[ADVANTAGEOUS EFFECTS OF INVENTION]

[0027] In one aspect, the efficiency of arithmetic operation may be increased.SUMMARY

[0028] The present invention is defined by the subject-matter of independent claims. Preferred embodiments are given by the subject-matter of dependent claims.

[0029] According to an aspect of the embodiments, a data processing apparatus that searches for a combination of values of a plurality of state variables in which a value calculated by using an Ising-type evaluation function that includes the plurality of state variables is local minimum or local maximum, the data processing apparatus includes a storage unit that stores total energy that is a sum of a constraint term that has a value that corresponds to presence or absence of violation of a constraint condition and a value of the evaluation function, values of the plurality of state variables, a first weight value between the plurality of state variables, a second weight value between at least some state variables of the plurality of state variables and the constraint condition, a first local field that represents a first change amount of the total energy in a case where a value of each of the plurality of state variables changes, and a second local field that is used for determination of a constraint violation amount for the constraint condition; and a processing unit that repeats processing of determining whether a change in a value of a first state variable among the plurality of state variables is allowed based on the first local field, and processing of, when it is determined that a change in a value of the first state variable is allowed, updating the first local field based on the first weight value, updating the second local field based on the second weight value between the first state variable and the constraint condition, and further updating the first local field based on a first quantized local field obtained by quantizing the second local field before update and a second quantized local field obtained by quantizing the second local field after update.BRIEF DESCRIPTION OF DRAWINGS

[0030] FIG. 1 is a diagram explaining a data processing apparatus of a first embodiment; FIG. 2 is a diagram illustrating an example of a constraint term; FIG. 3 is a diagram illustrating a first example of quantization of a second local field; FIG. 4 is a diagram illustrating a second example of quantization of a second local field; FIG. 5 is a diagram illustrating an example of hardware of a data processing apparatus of a second embodiment; FIG. 6 is a diagram illustrating an example of the functions of the data processing apparatus; FIG. 7 is a diagram illustrating an example of a restoration unit and an h i calculation unit; FIG. 8 is a diagram illustrating an example of an h k calculation unit; FIG. 9 is a diagram illustrating an example of an energy correction processing unit; FIG. 10 is a diagram illustrating an example of a timing chart; FIG. 11 is a flowchart illustrating an example of overall processing; FIG. 12 is a flowchart illustrating an example of decision variable flip selection processing; FIG. 13 is a diagram illustrating an example of the functions of a data processing apparatus of a third embodiment; FIG. 14 is a diagram illustrating an example of an h i calculation unit; FIG. 15 is a diagram illustrating an example of a constraint term calculation unit; FIG. 16 is a diagram illustrating an example of a timing chart; FIG. 17 is a flowchart illustrating an example of overall processing; FIG. 18 is a diagram illustrating an example of the functions of a data processing apparatus of a fourth embodiment; FIG. 19 is a diagram illustrating an example of an h i calculation unit; FIG. 20 is a diagram illustrating the functions of a data processing apparatus of comparative example 1; FIG. 21 is a diagram illustrating an example of prediction error occurrence in the data processing apparatus of comparative example 1; FIG. 22 is a diagram illustrating an example of the functions of a data processing apparatus of comparative example 2 (part 1); and FIG. 23 is a diagram illustrating an example of the functions of the data processing apparatus of comparative example 2 (part 2). DESCRIPTION OF EMBODIMENTS

[0031] Hereinafter, the present embodiments will be described with reference to the drawings.[First Embodiment]

[0032] A first embodiment will be described.

[0033] FIG. 1 is a diagram explaining a data processing apparatus of the first embodiment.

[0034] A data processing apparatus 10 of the first embodiment includes a storage unit 11 and a processing unit 12.

[0035] For example, the storage unit 11 is a volatile storage device that is an electronic circuit such as a dynamic random-access memory (DRAM) or a non-volatile storage device that is an electronic circuit such as a hard disk drive (HDD) or a flash memory. The storage unit 11 may include an electronic circuit such as a static random-access memory (SRAM) or a register.

[0036] The storage unit 11 stores H(x), the values of a plurality of (hereinafter, N) state variables (x i ), a first weight value between N x i (W ij described above), and a second weight value (W ki ) between any one of N x i and each of M constraint conditions. N is an integer of two or larger. M is an integer of 1 or larger. W ij = W ji . W ii = 0. The storage unit 11 does not have to store a second weight value related to a state variable that does not affect any of M constraint conditions (second weight value having the value of 0).

[0037] i is an identification number representing any one of N x i , and k is an identification number representing any one of M constraint terms (or constraint conditions). An identification number is also referred to as an index.

[0038] The storage unit 11 stores a first local field (h i ) representing a change amount of H(x) in a case where each value of N x i changes (ΔH i ), and a second local field (h k ) used for determination of a constraint violation amount for each of M constraint conditions. A state variable may also be referred to as a decision variable. Since each second local field corresponds to each constraint term, for example, each constraint condition, a second weight value may also be referred to as a weight value between a state variable and a constraint condition.

[0039] Total energy H(x) stored in the storage unit 11 may be expressed as H(x) = E(x) + P(x). E(x) is a sum of the first term and the second term on the right side of the above-described Formula (3).

[0040] Hereinafter, energy P(x) of the entirety of M constraint terms corresponding to M constraint conditions is expressed by Formula (7). P x = ∑ k ∈ A λ k g h k

[0041] P(x) corresponds to the entirety of one or more constraint terms, and indicates the magnitude of the entirety of one or more constraint terms. For this reason, P(x) may be referred to as an evaluation function of constraint terms.

[0042] λ k is a proportional coefficient related to the constraint term of identification number = k, and represents a weight of the constraint term. λ k may be a different value for each constraint term. For example, g(h k ) may be a Max function such as that expressed by Formula 4. g(h k ) may be referred to as a penalty function.

[0043] A second local field (h k ) may be expressed by the following Formula (8). h k = ∑ i ∈ D , k ∈ A W ki x i + b k

[0044] In Formula (8), b k is a coefficient related to the constraint condition of identification number = k. When the constraint condition of identification number = k is an inequality constraint, the first term on the right side of Formula (8) corresponds to R k of the above-described Formula (4), and + b k corresponds to - U k of Formula (4). For this reason, as described above, it may be said that h k is a difference between R k and U k , for example, a variable used for determination of a constraint violation amount.

[0045] ΔH i in a case where the value of a certain state variable (x i ) changes may be expressed by the following Formula (9) using a constraint term. Δ H i = − ∑ j ∈ D W ij x j + b i Δ x i + ∑ k ∈ A λ k g h k + W ki Δ x i − g h k

[0046] g(h k + W ki Δx i ) - g(h k ) in Formula (9) represents a change amount of the value of a constraint term in the case where the value of a certain state variable (x i ) changes.

[0047] FIG. 2 is a diagram illustrating an example of a constraint term.

[0048] The vertical axis of graph 20 represents the magnitude of g(h k ), and the horizontal axis represents h k .

[0049] Graph 20 illustrates g(h k ) = max[0, h k ], which is an example of a constraint term. Such constraint term is a rectified linear unit (ReLU) type function. When h k has changed to h k + W ki Δx i due to a change in the value of x i , the change amount of the value of a constraint term is expressed as g(h k + W ki Δx i ) - g(h k ).

[0050] The data processing apparatus 10 of the present embodiment uses, as the first local field (h i ), a value reflecting not only the change amount of E(x) due to a change in the value of x i but also the change amount of P(x). Such h i may be expressed by the following Formula (10). h i = ∑ j ∈ D W ij x j + b i − ∑ k ∈ A λ k Δ g h k , W ki Δ x i

[0051] In Formula (10), Δg(h k , W ki Δx i ) is expressed by the following Formula (11), and is an amount that may be calculated from x i , h k , and W ki .

[0052] By using h i as in Formula (10), ΔH i is expressed as ΔH i = -h i Δx i .

[0053] According to Formulae (10) and (11), normally, it is sufficient that h i is updated by the following Formula (12) according to a change in h k with respect to a change in the value of x j . h i ← h i − Δ x i λ k g h k + W ki Δ x i − g h k − g h k old + W ki Δ x i + g h k old

[0054] In Formula (12), h k (old)< represents h k before the update. When i = j, since h i does not change, update does not have to be performed.

[0055] However, in the method of updating the first local field by using the second local field as it is as in Formula (12), in a case where the number of state variables is large, a case where the number of constraint terms is large, or the like, there is a possibility that an arithmetic operation cost associated with the update of the first local field increases.

[0056] Accordingly, the processing unit 12 reflects the change amount of the value of a constraint term in the first local field (h i ) based on quantized local fields obtained by quantizing the second local field (h k ) before and after the update. A quantized local field may be an approximate value of the second local field, and is a code of a predetermined number of bits smaller than the number of bits of the original local field associated with the approximate value. In a case where the code is used as a quantized local field, the processing unit 12 restores an approximate value of the original local field based on the code, and reflects the change amount of the value of the constraint term calculated based on the approximate value in the first local field. The quantized local field corresponding to the second local field before the update is referred to as a first quantized local field. The quantized local field corresponding to the second local field after the update is referred to as a second quantized local field.

[0057] In a case where a quantized local field is used, h i is updated by the following Formula (13) when i ≠ j. h i ← h i − Δ x i λ k g h ^ k + W ki Δ x i − g h ^ k − g h ^ k old + W ki Δ x i + g h ^ k old

[0058] Since the second local field includes an error due to quantization, the update of h i in a case where the update of h k occurs due to the update of x j is performed by the following Formula (14) when i = j. h i ← h i − Δ x i λ k g h ^ k + W ki Δ x i − g h ^ k + g h k old − W ki Δ x i − g h ^ k old

[0059] h k ^ indicates a variable in which an index k is added to the lower right of a character obtained by adding a hat symbol to h. For example, h k ^ (old)< indicates an approximate value of the local field h k before the update, which corresponds to the first quantized local field. For example, h k ^ indicates an approximate value of the local field h k after the update, which corresponds to the second quantized local field.

[0060] For example, in the quantization of the second local field, the processing unit 12 clips the maximum value and the minimum value of the second local field with a value based on the maximum value of the weight value corresponding to each constraint condition, and quantizes the values between the maximum and minimum values with a predetermined number of bits. For example, each value included in a certain range of the second local field is associated with one quantized local field corresponding to the range. A more specific method of quantization of the second local field will be described later.

[0061] Since there is approximation to the second local field, for example, total energy H is corrected by Formula (15). H ← H + λ k g h k + W kj Δ x j − g h k − g h ^ k + W kj Δ x j + g h ^ k

[0062] However, as will be described later, a method is also conceivable in which the first local field and the change amount of a penalty term based on a quantized local field for calculation of ΔH for flip determination are separately held in the storage unit 11 so that correction of total energy H based on Formula (15) is not performed.

[0063] The storage unit 11 may further store a bias coefficient (b i ), a proportional coefficient (λ k ), and a coefficient related to a constraint condition (b k ). The storage unit 11 may store various types of data such as calculation conditions under which the processing unit 12 executes the data processing method to be described later. In a case where the processing unit 12 executes a part or all of processing of the data processing method to be described later by software, a program for executing the processing is stored in the storage unit 11.

[0064] For example, the processing unit 12 in FIG. 1 may be realized by a processor such as a central processing unit (CPU), a graphics processing unit (GPU), a digital signal processor (DSP), an application-specific integrated circuit (ASIC), or a field-programmable gate array (FPGA).

[0065] For example, the processing unit 12 searches for a state in which H(x) is local minimum. A state in which the value of H(x) is the minimum value among local minimum values, is the optimal solution. By changing the signs of E(x) and P(x), the processing unit 12 may also search for a state in which the value of H(x) is local maximum (in this case, a state in which the value of H(x) is the maximum value is the optimal solution).

[0066] FIG. 1 illustrates an example of a flow of processing by the processing unit 12.

[0067] In this example, the values based on the initial value of x 1 to x N are stored in the storage unit 11 as H(x), h i , h k , and x k .

[0068] The processing unit 12 selects, from N state variables, a state variable of a candidate whose value is to be changed (hereinafter referred to as a flip candidate) (step S1). For example, the processing unit 12 selects state variables of flip candidates at random or in a predetermined order.

[0069] The processing unit 12 calculates ΔH in a case where the value of the selected state variable changes (step S2). For example, when x i is selected, ΔH i may be calculated by the formula of ΔH i = -h i Δx i based on h i as described above.

[0070] Next, the processing unit 12 determines whether a change in the value of the state variable of a flip candidate is allowed (whether flipping may be performed) based on a result of comparison between ΔH and a predetermined value (step S3). Hereinafter, this determination processing is referred to as flip determination processing.

[0071] For example, the predetermined value is a noise value obtained based on a random number and a value of temperature parameter. For example, log(rand) × T, which is an example of a noise value obtained based on a uniform random number (rand) equal to or larger than 0 and equal to or smaller than 1 and a temperature parameter (T), may be used as the predetermined value. In this case, when -ΔH i ≥ log(rand) × T, the processing unit 12 determines that a change in the value of the state variable of a flip candidate is allowed (flipping may be performed). When -ΔH i < log(rand) × T, the processing unit 12 does not allow a change in the value of the state variable of a flip candidate.

[0072] When it is determined that flipping may be performed, the processing unit 12 performs the next update processing of the first local field (h i ) and the second local field (h k ) (step S4).

[0073] For example, when it is determined that x j may be flipped, the processing unit 12 updates h i by adding Δhi = W ij Δx j to the original h i for each of the N state variables. At the same time, the processing unit 12 flips x j for which it is determined that flipping may be performed. When i = j, since W ii = 0 and h i does not change, update does not have to be performed. When it is determined that x j may be flipped, the processing unit 12 updates h k by adding Δh k = Wk j Δx j to h k for which the second weight value (W kj ) between itself and x j is not 0.

[0074] For example, when the first local field (h i ) is h 1 to h N and the second local field (h k ) is h N+1 to h N+M , the processing unit 12 may update h i and h k by parallel calculation with a parallelism of N + M.

[0075] The processing unit 12 further updates h i by Formulae (13) and (14) based on the first quantized local field h k ^ (old)< and the second quantized local field h k ^ obtained by quantizing the second local field (h k ) before and after the update (step S5). In step S5, for example, the processing unit 12 also corrects total energy H by Formula (15). The first quantized local field h k ^ (old)< is a value after quantization of the second local field h k before the update. The second quantized local field h k ^ is a value after quantization of the second local field h k after the update.

[0076] The processing unit 12 repeats the above processing of steps S1 to S5.

[0077] In step S5, when there is no change in the second quantized local field h k ^ with respect to the first quantized local field h k ^ (old)< , the processing unit 12 may omit the update of h i by Formulae (13) and (14). However, when correction of total energy H by Formula (15) is performed, the processing unit 12 performs the correction every time in step S5.

[0078] Although an example in which the processing of steps S2 to S4 is performed by selecting a state variable of a flip candidate one by one from the N state variables has been described in the above description, the processing of steps S2 to S3 may be performed in parallel for a plurality of (for example, all of the N) state variables. In this case, when there is a plurality of state variables for which a change in the value is allowed, the processing unit 12 selects, randomly or in accordance with a predetermined rule, a state variable of which the value is to be changed.

[0079] For example, in a case where the simulated annealing method is performed, the processing unit 12 decreases the value of the temperature parameter (T) described above in accordance with a predetermined temperature parameter change schedule every time the flip determination processing for a state variable is repeated a predetermined number of times. The processing unit 12 outputs a state obtained when the flip determination processing is repeated a predetermined number of times (or when a predetermined T is reached), as a calculation result of a discrete optimization problem. The processing unit 12 may cause the storage unit 11 to hold the total energy and the state obtained when the energy is the minimum energy up to that time. In this case, the processing unit 12 may output, as a calculation result, a state corresponding to the minimum energy stored after the flip determination processing is repeated a predetermined number of times.

[0080] In a case where the processing unit 12 performs the replica exchange method, the processing unit 12 repeats the above processing of steps S1 to S4 in each of a plurality of replicas in which different values of T are set. The processing unit 12 performs replica exchange every time the flip determination processing is repeated a predetermined number of times. For example, the processing unit 12 selects two replicas having adjacent values of T, and exchanges the values of state variables between the two selected replicas with a predetermined exchange probability based on an energy difference between the replicas or a difference in the values of T. The values of T may be exchanged between the two replicas instead of the values of state variables. Alternatively, the processing unit 12 holds the total energy and the state obtained when the energy is the minimum energy up to that time. The processing unit 12 outputs, as a calculation result, a state corresponding to the minimum energy in all replicas among the minimum energies stored after the above flip determination processing is repeated a predetermined number of times in each replica.

[0081] By using the replica exchange method, a state changes even on the low temperature side where a state hardly changes (even for a replica for which the value of T is small), and the possibility that a good solution may be found in a short time increases. The replica exchange method is also referred to as the parallel tempering method or the like.

[0082] Next, an example of quantization of the second local field will be described.

[0083] FIG. 3 is a diagram illustrating a first example of quantization of the second local field.

[0084] Graph 30 illustrates an example in which the second local field h k is converted into a quantized local field by clipping the second local field h k with the maximum value 3δ and the minimum value -4δ and approximating between the values in three bits, for example, eight values. Table 31 exemplifies a relationship between the second local field h k , the quantized local field h k ^, and a three-bit code x k corresponding to the quantized local field h k ^.

[0085] For example, when -δ / 2 ≤ h k < δ / 2, h k ^ = <h k > δ = 0, and the code x k = 000 is associated therewith. When δ / 2 ≤ h k < 3δ / 2, h k ^ = δ, and the code x k = 001 is associated therewith. As described above, a correspondence relationship between the code x k , the second local field h k , and the quantized local field h k ^ is defined in advance by table 31. The storage unit 11 may hold table 31. The processing unit 12 may generate the quantized local field h k ^ and the code x k by quantizing the second local field h k based on table 31.

[0086] FIG. 4 is a diagram illustrating a second example of quantization of the second local field.

[0087] Graph 40 illustrates an example in which the second local field h k is converted into a quantized local field by clipping the second local field h k with the maximum value W max (k)< = δ and the minimum value -δ of a weight value corresponding to a constraint condition, and approximating between the values in one bit, for example, two values. Table 41 exemplifies a relationship between the second local field h k , the quantized local field h k ^, and a one-bit code x k corresponding to the quantized local field h k ^.

[0088] For example, when h k > 0, h k ^ = δ / 2, and the code x k = 1 is associated therewith. When h k ≤ 0, h k ^ = -δ / 2, and the code x k = 0 is associated therewith. The storage unit 11 may hold table 41. The processing unit 12 may generate the quantized local field h k ^ and the code x k by quantizing the second local field h k based on table 41.

[0089] Although the approximate value h k ^ of the second local field has been described as an example of a quantized local field in the description of FIGs. 3 and 4, a code corresponding to the approximate value h k ^ (x k in this example) may be considered as an example of a quantized local field as described above.

[0090] According to the data processing apparatus 10 and data processing method described above, the efficiency of arithmetic operation may be increased. For example, in step S5 in FIG. 1, when there is no change in h k ^ from h k ^ (old)< , the update of h i by Formulae (13) and (14) may be omitted. For this reason, the arithmetic operation cost related to the update of h i may be reduced as compared with a case where h i is updated every time the original h k is updated. As a result, the solution finding performance of the data processing apparatus 10 may be improved. For example, the data processing apparatus 10 may execute the solution finding arithmetic operation at high speed. The data processing apparatus 10 may increase the possibility of reaching a better solution in a relatively short time. Since a local field corresponding to a constraint condition is reflected in the total energy as a relatively large value by being multiplied by the coefficient λ k , the influence on solution-finding is very small even when a quantized value is used as the local field.

[0091] The processing unit 12 may separately include a first arithmetic operator that performs arithmetic operation of the first local field h i and a second arithmetic operator that performs arithmetic operation of the second local field h k . In this case, when information on h k ^ is transmitted from the second arithmetic operator to the first arithmetic operator, the second arithmetic operator may transmit the code x k based on table 31 or table 41. The first arithmetic operator may acquire h k ^ from the code x k based on table 31 or table 41, and update h i . By doing so, the amount of information output from the second arithmetic operator to the first arithmetic operator is reduced. For this reason, complication of wiring inside the processing unit 12 is suppressed, and the cost of circuit mounting inside the processing unit 12 is reduced. As a result, a larger-scale parallelization arithmetic operation may be performed.[Second Embodiment]

[0092] Next, a second embodiment will be described.

[0093] FIG. 5 is a diagram illustrating an example of hardware of a data processing apparatus of the second embodiment.

[0094] A data processing apparatus 100 includes a processor 101, a DRAM 102, an HDD 103, a GPU 104, an input interface 105, a medium reader 106, a communication interface 107, and an accelerator card 108. These units included in the data processing apparatus 100 are coupled to a bus inside the data processing apparatus 100.

[0095] The processor 101 is an arithmetic device that executes instructions of a program. For example, the processor 101 is a CPU. The processor 101 loads at least some of the programs and data stored in the HDD 103 into the DRAM 102, and executes the programs. The processor 101 may include a plurality of processor cores. The data processing apparatus 100 may include a plurality of processors. The processing to be described below may be executed in parallel by using a plurality of processors or processor cores. A set of a plurality of processors may be referred to as a "multiprocessor" or simply referred to as a "processor".

[0096] The DRAM 102 is a volatile semiconductor memory that temporarily stores a program to be executed by the processor 101 and data to be used for arithmetic operation by the processor 101. The data processing apparatus 100 may include a memory of a type other than the RAM and may include a plurality of memories.

[0097] The HDD 103 is a non-volatile storage device that stores data and programs of software such as an operating system (OS), middleware, and application software. The data processing apparatus 100 may include other types of storage devices such as a flash memory or a solid-state drive (SSD), and may include a plurality of non-volatile storage devices.

[0098] The GPU 104 outputs an image to a display 51 coupled to the data processing apparatus 100 in accordance with an instruction from the processor 101. As the display 51, an arbitrary type of a display such as a cathode ray tube (CRT) display, a liquid crystal display (LCD), a plasma display, or an organic electro-luminescence (OEL) display may be used.

[0099] The input interface 105 acquires an input signal from an input device 52 coupled to the data processing apparatus 100, and outputs the input signal to the processor 101. As the input device 52, a pointing device such as a mouse, a touch panel, a touchpad, or a trackball, a keyboard, a remote controller, a button switch, or the like may be used. A plurality of types of input devices may be coupled to the data processing apparatus 100.

[0100] The medium reader 106 is a reading device that reads the programs and data recorded in a recording medium 53. As the recording medium 53, for example, a magnetic disk, an optical disk, a magneto-optical (MO) disk, a semiconductor memory, or the like may be used. The magnetic disk includes a flexible disk (FD) and an HDD. The optical disk includes a compact disc (CD) and a Digital Versatile Disc (DVD).

[0101] For example, the medium reader 106 copies the programs and data read from the recording medium 53 to another recording medium such as the DRAM 102 or the HDD 103. For example, the read programs are executed by the processor 101. The recording medium 53 may be a portable-type recording medium, and may be used to distribute programs and data. The recording medium 53 and the HDD 103 may be referred to as a computer-readable recording medium.

[0102] The communication interface 107 is coupled to a network 54, and communicates with another information processing apparatus via the network 54. The communication interface 107 may be a wired communication interface coupled to a wired communication device such as a switch or a router, or may be a wireless communication interface coupled to a wireless communication device such as a base station or an access point.

[0103] The accelerator card 108 is a hardware accelerator that searches for a solution of a discrete optimization problem. A discrete optimization problem is expressed by Formula (3) indicating the total energy of an Ising model. Formula (3) includes a constraint term of a linear form representing a constraint condition. The number of constraint conditions, for example, constraint terms may be one or more.

[0104] The accelerator card 108 includes a processor 110 and a DRAM 120. For example, the processor 110 is a GPU, a DSP, an ASIC, an FPGA, or the like. The processor 110 includes an internal memory 111. For example, the internal memory 111 is an SRAM. The DRAM 120 stores data to be used for processing by the processor 110.

[0105] The processor 110 is an example of the processing unit 12 of the first embodiment. The internal memory 111 or the DRAM 120 is an example of the storage unit 11 of the first embodiment. However, the following functions of the data processing apparatus 100 may be realized by the processor 101 executing a program stored in the DRAM 102. In this case, the processor 101 is an example of the processing unit 12, and the cache memory included in the processor 101 or the DRAM 102 is an example of the storage unit 11.

[0106] FIG. 6 is a diagram illustrating an example of the functions of the data processing apparatus.

[0107] The data processing apparatus 100 includes a decision variable processing unit 130, an auxiliary variable processing unit 140, an energy holding unit 150, and an energy correction processing unit 160. The decision variable processing unit 130, the auxiliary variable processing unit 140, the energy holding unit 150, and the energy correction processing unit 160 are realized by an electronic circuit such as an FPGA or an ASIC. The auxiliary variable processing unit 140, the energy holding unit 150, and the energy correction processing unit 160 may be realized by the GPU executing a program stored in the DRAM 120. Alternatively, the auxiliary variable processing unit 140, the energy holding unit 150, and the energy correction processing unit 160 may be realized by the CPU 101 executing a program stored in the DRAM 102.

[0108] The decision variable processing unit 130 holds the values of N decision variables (x i ) and performs processing on the decision variables. Decision variables correspond to the state variables of the first embodiment. The decision variable processing unit 130 includes W holding units 131, 131a, ..., decision variable modules 132, 132a, ..., and a selection unit 133.

[0109] The W holding units 131, 131a, ... hold the weight values between decision variables and between a decision variable and a constraint condition used in the decision variable modules 132, 132a, ..., respectively.

[0110] Each of the decision variable modules 132, 132a, ... calculates a local field and ΔE for the decision variables belonging to one group obtained by dividing the N decision variables. ΔE indicates a total energy change amount used for flip determination of a decision variable.

[0111] The decision variable module 132 includes an SRAM interface (I / F) 171, h i calculation units 172, 172a, ..., an h storage unit 173, ΔE calculation units 174, 174a, ..., and a restoration unit 175. Other decision variable modules including the decision variable module 132a have the functions similar to those of the decision variable module 132.

[0112] The SRAM I / F 171 reads the weight value corresponding to a flipped decision variable from the W holding unit 131, and supplies the weight value to the h i calculation units 172, 172a, .... The SRAM I / F 171 also reads a coefficient λ indicating a weight for each constraint term held in the internal memory 111, and supplies the coefficient λ to the h i calculation units 172, 172a, ....

[0113] In response to flipping of any decision variable, the h i calculation units 172, 172a, ... calculate a local field (h i ) of the decision variable based on Formulae (13) and (14). One h i calculation unit corresponds to one decision variable. As indicated in Formulae (13) and (14), an approximate value based on a quantized local field obtained by quantizing a local field corresponding to a constraint term is used for the calculation of a local field of decision variable. The h i calculation units 172, 172a, ... save the calculated h i in the h storage unit 173. The h i calculation units 172, 172a, ... supply the calculated h i to the ΔE calculation units 174, 174a, ..., respectively.

[0114] The h storage unit 173 stores h i for each of a plurality of replicas.

[0115] The ΔE calculation units 174, 174a, ... calculate ΔE based on h i calculated by the h i calculation units 172, 172a, ..., respectively, and supply ΔE to the selection unit 133. For x i , ΔE i = ΔH i = -h i Δx i .

[0116] The restoration unit 175 restores an approximate value of a local field before the quantization based on the code of a predetermined number of bits indicating the quantized local field supplied from the energy correction processing unit 160, and supplies the approximate value to the h i calculation units 172, 172a, ....

[0117] The selection unit 133 performs flip determination based on ΔE supplied from each of the decision variable modules 132, 132a, ..., and selects a decision variable x j to be flipped. A method similar to the method exemplified in the first embodiment is used for the flip determination. The selection unit 133 supplies the index of the decision variable to be flipped (flip bit) to each h i calculation unit of the decision variable modules 132, 132a, .... The selection unit 133 inverts the value of the decision variable x j to be flipped among the decision variables held in the decision variable processing unit 130. In FIG. 6, illustration of a decision variable holding unit that holds the value of each decision variable in the decision variable processing unit 130 is omitted. For example, the decision variable holding unit is realized by the internal memory 111.

[0118] The selection unit 133 outputs ΔE j corresponding to the decision variable to be flipped to the energy holding unit 150, and updates the total energy held in the energy holding unit 150.

[0119] The auxiliary variable processing unit 140 holds the values of M auxiliary variables (x k ) corresponding to the constraint terms, and performs processing on the auxiliary variables. For example, x k is used for detecting whether a constraint condition is satisfied. For example, the ReLU type function in FIG. 2 is used as a constraint term. For example, when h k > 0, g(h k ) > 0 and a constraint condition violation occurs. Therefore, x k = 1 when h k > 0 and x k = 0 when h k ≤ 0. However, in the present embodiment, the data processing apparatus 100 does not have to hold the value of auxiliary variable x k .

[0120] The auxiliary variable processing unit 140 includes W holding units 141, 141a, ..., auxiliary variable modules 142, 142a, ..., and a selection unit 143.

[0121] The W holding units 141, 141a, ... hold the weight value between a decision variable and a constraint condition used in the auxiliary variable modules 142, 142a, ..., respectively.

[0122] Each of the auxiliary variable modules 142, 142a, ... calculates a local field for the auxiliary variables belonging to one group obtained by dividing the M auxiliary variables.

[0123] The auxiliary variable module 142 includes an SRAM I / F 181, h k calculation units 182, 182a, ..., and an h storage unit 183. Other auxiliary variable modules including the auxiliary variable module 142a have the functions similar to those of the auxiliary variable module 142.

[0124] The SRAM I / F 181 reads the weight value corresponding to the flipped decision variable x j from the W holding unit 141, and supplies the weight value to the h k calculation units 182, 182a, ....

[0125] In response to the flipping of the decision variable x j , the h k calculation units 182, 182a, ... calculate a code hk_code indicating the local field (h k ) of an auxiliary variable and a quantized local field obtained by quantizing h k . One h k calculation unit corresponds to one auxiliary variable. The h k calculation units 182, 182a, ... save the calculated h k in the h storage unit 183. The h k calculation units 182, 182a, ... supply the calculated h k and h k ^ to the selection unit 143. At this time, the h k calculation units 182, 182a, ... also supply a code hk_old_code indicating the local field h k (old)< before update and the quantized local field thereof to the selection unit 143.

[0126] The h storage unit 183 stores h k for each of a plurality of replicas.

[0127] The selection unit 143 sequentially selects index k of a constraint condition to be calculated, and supplies a code indicating a local field and a quantized local field corresponding to the index k to the energy correction processing unit 160.

[0128] The energy holding unit 150 holds the total energy corresponding to the current state of an Ising model.

[0129] The energy correction processing unit 160 performs correction for the total energy held in the energy holding unit 150 according to a change in the local field of an auxiliary variable. In the correction, the influence of the quantized local field reflected in the local field on the decision variable side is corrected by Formula (15).

[0130] The energy correction processing unit 160 outputs, to the decision variable processing unit 130, the code hk_code of a predetermined number of bits corresponding to the quantized local field of h k and the code hk_old_code of a predetermined number of bits corresponding to the quantized local field of h k (old)< . For example, a very small number of bits compared to the normal number of bits for a local field, such as three bits or one bit as described above, is determined in advance as the predetermined number of bits.

[0131] The energy correction processing unit 160 outputs, to the decision variable processing unit 130, information hk^_update_bit indicating index k for which hk_code has changed with respect to hk_old_code. Hk^_update_bit is used for determination of whether h i is updated for the constraint term of index k by the decision variable processing unit 130.

[0132] For example, a storage area of the internal memory 111 is used for the W holding units 131 and 141 and the h storage units 173 and 183.

[0133] FIG. 7 is a diagram illustrating an example of a restoration unit and an h i calculation unit.

[0134] The restoration unit 175 includes multipliers c11 and c12.

[0135] The multiplier c11 restores h k ^ by multiplying a constant δ indicating quantization accuracy supplied from the SRAM I / F 171 by the code hk_code supplied from the energy correction processing unit 160, and supplies h k ^ to the h i calculation units 172, 172a, ....

[0136] The multiplier c12 restores h k ^ (old)< by multiplying the constant δ by the code hk_old_code supplied from the energy correction processing unit 160, and supplies h k ^ (old)< to the h i calculation units 172, 172a, ....

[0137] Although an example in which the approximate values h k ^ and h k ^ (old)< of a local field before quantization are restored by multiplying δ and a code as described above is described in the present embodiment, the values may be restored by another method of arithmetic operation.

[0138] The h i calculation unit 172 includes multipliers c21 and c31, adders c22, c23, and c33, Max arithmetic operators c24, c25, c26, and c27, subtractors c28, c29, and c30, a selector (SEL) c32, and a register c34.

[0139] The multiplier c21 multiplies Δx j corresponding to the decision variable x j to be flipped by the weight value W ij between the decision variable and decision variable x i corresponding to the h i calculation unit 172, and outputs a multiplication result. The multiplier c21 multiplies the change amount Δx i of the value of the decision variable x i corresponding to the h i calculation unit 172 by the weight value W ki between x i and the constraint term of index k, and outputs a multiplication result. By the multiplication result of Δx j and W ij being supplied to the adder c33 by the selector c32, Δhi = W ij Δx j is added to the original h i . By δh i = -λ k (Δg(h k ^, W ki Δx i ) - Δg(h k ^ (old)< , W ki Δx i )) calculated based on the multiplication result of Δx i and W ki being supplied to the adder c33 by the selector c32, δh i is added to the h i . However, when i = j for index j of a decision variable to be flipped, δh i = -λ k (Δg(h k ^, W ki Δx i ) + Δg(h k ^ (old)< , W ki Δx i )) as indicated by Formula (14). In the drawings, inversion of a sign may be omitted by indicating subtraction in a Formula by an adder, or the like.

[0140] The adder c22 adds h k ^ supplied from the multiplier c11 and W ki Δx i supplied from the multiplier c21, and outputs an addition result.

[0141] The adder c23 adds h k ^ (old)< supplied from the multiplier c12 and W ki Δx i supplied from the multiplier c21, and outputs an addition result.

[0142] The Max arithmetic operator c24 compares h k ^ supplied from the multiplier c11 with 0, and outputs the larger one.

[0143] The Max arithmetic operator c25 compares h k ^ + W ki Δx i supplied from the adder c22 with 0, and outputs the larger one.

[0144] The Max arithmetic operator c26 compares h k ^ (old)< supplied from the multiplier c12 with 0, and outputs the larger one.

[0145] The Max arithmetic operator c27 compares h k ^ (old)< + W ki Δx i supplied from the adder c23 with 0, and outputs the larger one.

[0146] The subtractor c28 calculates and outputs a difference between an output value of the Max arithmetic operator c24 and an output value of the Max arithmetic operator c25.

[0147] The subtractor c29 calculates and outputs a difference between an output value of the Max arithmetic operator c26 and an output value of the Max arithmetic operator c27.

[0148] The subtractor c30 calculates and outputs a difference between an output value of the subtractor c28 and an output value of the subtractor c29.

[0149] The multiplier c31 multiplies the coefficient λ k supplied from the SRAM I / F 171 by an output value of the subtractor c30, and supplies a multiplication result to the selector c32. An output value of the multiplier c31 corresponds to δh i .

[0150] The selector c32 switches a value to be output to the adder c33 between W ij Δx j and δh i .

[0151] The adder c33 adds the value supplied from the selector c32 to h i held in the register c34, and updates h i in the register c34.

[0152] The register c34 holds h i and supplies h i to the ΔE calculation unit 174. When arithmetic operation is performed for a plurality of replicas, h i for each replica is held in the h storage unit 173, and h i of the replica for which arithmetic operation is performed is read from the h storage unit 173 to the register c34.

[0153] Other h i calculation units including the h i calculation unit 172a are realized by the circuit configuration similar to that of the h i calculation unit 172.

[0154] FIG. 8 is a diagram illustrating an example of an h k calculation unit.

[0155] The auxiliary variable module 142 includes a multiplier c41, a non-zero detection unit c42, an adder c43, a register c44, a register c45, quantization units c46 and c47, and a change detection unit c48.

[0156] The multiplier c41 multiplies the change Δx j of the decision variable x j to be flipped by W kj corresponding to the h k calculation unit 182, and outputs a multiplication result. The non-zero detection unit c42 detects whether the multiplication result of the multiplier c41 is non-zero, and outputs a flag indicating a detection result of whether the multiplication result is non-zero.

[0157] The adder c43 adds the output value W kj Δx j of the multiplier c41 to h k held in the register c44.

[0158] The register c44 holds h k and supplies h k to the selection unit 143 and the register c45. When arithmetic operation is performed for a plurality of replicas, h k for each replica is held in the h storage unit 183, and h k of the replica for which arithmetic operation is performed is read from the h storage unit 183 to the register c44.

[0159] The register c45 holds and outputs h k (old)< (= h_old) which is h k before addition of W kj Δx j by the adder c43.

[0160] The quantization unit c46 generates a code hk_code corresponding to h k ^ by quantizing h k held in the register c44 based on a constant δ that determines quantization accuracy, and supplies the code hk_code to the change detection unit c48.

[0161] The quantization unit c47 generates a code hk_old_code corresponding to h k ^ (old)< by quantizing h k (old)< held in the register c45 based on the constant δ, and supplies the code hk_old_code to the change detection unit c48.

[0162] The change detection unit c48 detects a change in quantized local field based on the codes hk_code and hk_old_code, and supplies hk^_update_bit, which is information indicating index k for which the change is detected, to the selection unit 143. At the same time, the change detection unit c48 supplies the codes hk_code and hk_old_code to the selection unit 143.

[0163] Other h k calculation units including the h k calculation unit 182a are realized by the circuit configuration similar to that of the h k calculation unit 182.

[0164] FIG. 9 is a diagram illustrating an example of the energy correction processing unit.

[0165] The energy correction processing unit 160 receives an output of the h k calculation unit corresponding to the index k to be processed selected by the selection unit 143 among the h k calculation units of each of the auxiliary variable modules 142, 142a, ..., and performs correction processing of total energy for each index k.

[0166] The energy correction processing unit 160 includes a parameter holding unit c51, a register c52, multipliers c53, c54, and c62, Max arithmetic operators c55, c56, c57, and c58, and subtractors c59, c60, and c61.

[0167] The parameter holding unit c51 holds the constant δ and λ k .

[0168] The register c52 holds and outputs the codes hk_old_code and hk_code supplied from the selection unit 143 and the local fields h k and h k (old)< (= hk_old). In FIG. 9, h_old_code indicates a set of hk_old_code for each k, and h_code indicates a set of hk_code for each k. h_old indicates a set of h k (old)< for each k, and h indicates a set of h k for each k.

[0169] The multiplier c53 restores h k ^ (old)< by multiplying δ by h_old_code, and outputs h k ^ (old)< .

[0170] The multiplier c54 restores h k ^ by multiplying δ by h_code, and outputs h k ^.

[0171] The Max arithmetic operator c55 compares the output value h k ^ of the multiplier c54 with 0, and outputs the larger one.

[0172] The Max arithmetic operator c56 compares the output value h k ^ (old)< of the multiplier c53 with 0, and outputs the larger one.

[0173] The Max arithmetic operator c57 compares h k (old)< with 0, and outputs the larger one.

[0174] The Max arithmetic operator c58 compares h k with 0, and outputs the larger one.

[0175] The subtractor c59 calculates and outputs a difference between an output value of the Max arithmetic operator c55 and an output value of the Max arithmetic operator c56.

[0176] The subtractor c60 calculates and outputs a difference between an output value of the Max arithmetic operator c57 and an output value of the Max arithmetic operator c58.

[0177] The subtractor c61 calculates and outputs a difference between an output value of the subtractor c59 and an output value of the subtractor c60.

[0178] The multiplier c62 multiplies an output value of the subtractor c61 by λ k and supplies a multiplication result to the energy holding unit 150, thereby correcting the total energy held in the energy holding unit 150.

[0179] In this way, the energy correction processing unit 160 performs the correction processing of total energy based on Formula (15). The energy correction processing unit 160 supplies the codes hk_old_code, hk_code, and hk^_update_bit supplied from the selection unit 143 to the decision variable processing unit 130.

[0180] FIG. 10 is a diagram illustrating an example of a timing chart.

[0181] Timing chart 60 illustrates an example of the operation of the data processing apparatus 100 in a case where pipeline processing is performed using eight replicas. 0 to 7 are replica numbers. FIG. 10 illustrates the details of processing for the replica with replica number = 0, and other replicas are illustrated in a simplified manner.

[0182] For the replica with replica number = 0, flip determination processing is performed (t1), update of x i is performed according to the result of processing, and reading of weight values for update of h i and h k is performed (t2). The update of h i and h k is performed (t3). When three h k (represented as 0ka, 0kb, and 0kc in FIG. 10) are updated, reading, generation of h k ^ and h k ^ (old)< , and update detection of h k ^ are performed in this order for the three h k (t4 to t5). At this time, the correction of total energy H based on Formula (15) is also performed.

[0183] Reading of a corresponding W ki is performed in order from h k ^ for which update detection has ended (t5), and update of h i based on δh i is performed (t6). As described above, for index j of a decision variable to be flipped, when i ≠ j, δh i = -λ k (Δg(h k ^, W ki Δx i ) - Δg(h k ^ (old)< , W ki Δx i )), and when i = j, δh i = -λ k (Δg(h k ^, W ki Δx i ) + Δg(h k ^ (old)< , W ki Δx i )).

[0184] After that, the updated h i is read (t7), and calculation of ΔH, flip determination processing, and calculation of H(x) are performed (t8).

[0185] Next, a procedure of the processing of the data processing apparatus 100 will be described.

[0186] FIG. 11 is a flowchart illustrating an example of overall processing.

[0187] Hereinafter, an example in which a search by the simulated annealing method is performed will be described as an example.

[0188] (S10) The decision variable processing unit 130 and the auxiliary variable processing unit 140 perform initialization. In the initialization, an initial value of the N decision variables, problem information, and calculation conditions (for example, information on a temperature parameter used in the simulated annealing method, or the like) are set. The initial value of the N decision variables is held in the predetermined decision variable holding unit of the decision variable processing unit 130. The weight values included in the problem information are divided for each corresponding group of decision variables and auxiliary variables, and are held in the W holding units 131, 131a, ... and the W holding units 141, 141a, ....

[0189] In the initialization, an initial value of h k and an initial value of h i are calculated based on the initial value of the N decision variables and the problem information, the initial value of N h i is held in the h storage unit 173, and the initial value of M h k is held in the h storage unit 183. An initial value of H(x) is calculated based on the initial value of the N decision variables and the problem information, and is held in the energy holding unit 150.

[0190] (S11) The decision variable processing unit 130 performs decision variable flip selection processing. Details of the decision variable flip selection processing will be described later.

[0191] (S12) k is incremented one by one from the index k = 0 of constraint condition, and steps S13 to S17 are repeatedly executed while k < M. This repeated processing is referred to as an auxiliary variable loop.

[0192] (S13) The non-zero detection unit c42 of the auxiliary variable processing unit 140 determines whether there is local field update of auxiliary variable. When there is local field update of auxiliary variable, the processing proceeds to step S14. When there is no local field update of auxiliary variable, the processing proceeds to step S18.

[0193] (S14) The energy correction processing unit 160 performs the correction of total energy H based on Formula (15).

[0194] (S15) The quantization units c46 and c47 of the auxiliary variable processing unit 140 calculate codes hk_code and hk_old_code indicating the quantized local fields of the auxiliary variable x k , respectively.

[0195] (S16) The change detection unit c48 of the auxiliary variable processing unit 140 determines whether there is a change in quantized local field based on the codes hk_code and hk_old_code. When hk_code and hk_old_code are different, for example, when there is a change in quantized local field, the processing proceeds to step S17. When hk_code and hk_old_code are the same, for example, when there is no change in quantized local field, the processing proceeds to step S18. When there is no change, the processing of step S17 in the decision variable processing unit 130 is omitted based on hk^_update_bit supplied from the auxiliary variable processing unit 140 to the decision variable processing unit 130.

[0196] (S17) The h i calculation units 172, 172a, ... of the decision variable processing unit 130 restore the approximate values h k ^ and h k ^ (old)< of the original local field based on hk_code and hk_old_code supplied from the auxiliary variable processing unit 140, and update the local field h i of the decision variable x i . Accordingly, the contribution of penalty from an auxiliary variable in Formulae (13) and (14) is reflected in h i .

[0197] (S18) When the auxiliary variable loop ends, the processing proceeds to step S19.

[0198] (S19) The decision variable processing unit 130 determines whether it is search end. For example, search end is determined when temperature value T used as a temperature parameter in the simulated annealing method reaches the final temperature value. When it is not search end, temperature value T is updated, and the processing proceeds to step S11. When it is search end, the overall processing ends. When it is search end, the decision variable processing unit 130 outputs a calculation result. For example, the calculation result is the total energy and the state obtained when the energy is the minimum energy up to that time.

[0199] The execution order of step S14 and step S15 may be reversed.

[0200] As indicated in step S13, it is sufficient that the data processing apparatus 100 executes the processing of auxiliary variable loop of step S14 and subsequent steps only when there is local field update of auxiliary variable, and the processing may be omitted when there is no local field update of auxiliary variable. For example, in the data processing apparatus 100, the efficiency of arithmetic operation is also increased by the non-zero detection unit c42.

[0201] FIG. 12 is a flowchart illustrating an example of the decision variable flip selection processing.

[0202] The decision variable flip selection processing corresponds to step S11.

[0203] (S20) The ΔE calculation units 174, 174a, ... of the decision variable processing unit 130 calculate ΔE i of the decision variable x i based on the local field h i . ΔE i = ΔH i = -h i Δx i .

[0204] (S21) The selection unit 133 performs bit acceptance determination of decision variable. In the bit acceptance determination, it is determined whether a decision variable of a flip candidate may be flipped based on a result of comparison between ΔE corresponding to the decision variable of a flip candidate and a predetermined value. The predetermined value is a noise value obtained based on a random number value and a value of temperature parameter (temperature value T) (for example, log(rand) × T).

[0205] (S22) The selection unit 133 performs flip bit selection from the decision variables for which it is determined in step S21 that flipping may be performed. For example, the selection unit 133 randomly selects one decision variable for which it is determined that flipping may be performed.

[0206] (S23) The selection unit 133 determines whether bit-flipping may be performed. When bit-flipping may be performed, the processing proceeds to step S24. When bit-flipping may not be performed, the decision variable flip selection processing ends. For example, bit-flipping may be performed when any of the decision variables has been selected in step S22, and bit-flipping may not be performed when no decision variable has been selected.

[0207] (S24) The selection unit 133 updates the decision variable held in the decision variable processing unit 130. Accordingly, the value of the decision variable selected in step S22 is updated.

[0208] (S25) The selection unit 133 updates total energy H held in the energy holding unit 150 by ΔE = ΔH corresponding to the flipped decision variable.

[0209] (S26) The decision variable processing unit 130 and the auxiliary variable processing unit 140 update the local fields h i and h k , respectively. For example, the h i calculation units 172, 172a, ... of the decision variable processing unit 130 update h i by adding Δh i = W ij Δx j to h i . The h k calculation units 182, 182a, ... of the auxiliary variable processing unit 140 update h k by adding Δh k = W kj Δx j to h k . The decision variable flip selection processing ends.

[0210] According to the data processing apparatus 100 of the second embodiment, when there is no change in quantized local field in step S16 in FIG. 11, the update of h i by Formulae (13) and (14) in step S17 may be omitted. For this reason, the arithmetic operation cost related to the update of h i may be reduced. As a result, the solution finding performance of the data processing apparatus 100 may be improved. For example, the data processing apparatus 100 may execute the solution finding arithmetic operation at high speed. The data processing apparatus 100 may increase the possibility of reaching a better solution in a relatively short time.

[0211] In a case where the decision variable processing unit 130 and the auxiliary variable processing unit 140 are realized by separate arithmetic operators, for example, separate electronic circuits, it is sufficient that the auxiliary variable processing unit 140 transmits a code of a relatively small number of bits indicating a quantized local field to the decision variable processing unit 130. Accordingly, the amount of information output from the auxiliary variable processing unit 140 to the decision variable processing unit 130 is reduced. For this reason, complication of wiring inside the processor 110 realized by an FPGA or the like is suppressed, and the cost of circuit mounting is reduced. As a result, a larger-scale parallelization arithmetic operation may be performed.[Third Embodiment]

[0212] Next, a third embodiment will be described. Items different from the above-described second embodiment will be mainly described, and description of the common items will be omitted.

[0213] FIG. 13 is a diagram illustrating an example of the functions of a data processing apparatus of the third embodiment.

[0214] A data processing apparatus 100a of the third embodiment illustrates an example in which energy correction based on Formula (15) is not performed by separately holding a local field of decision variable and a change amount of constraint term to be applied to the local field of decision variable for calculating an energy change to be used for flip determination processing.

[0215] The data processing apparatus 100a of the third embodiment is realized by hardware similar to that of the data processing apparatus 100 of the second embodiment illustrated in FIG. 5. The data processing apparatus 100a has the functions similar to those of the data processing apparatus 100. However, the data processing apparatus 100a is different from the data processing apparatus 100 in that a decision variable processing unit 130a is provided instead of the decision variable processing unit 130 and a constraint term calculation unit 160a is provided instead of the energy correction processing unit 160.

[0216] The auxiliary variable processing unit 140 holds the auxiliary variable x k that is a binary variable corresponding to a constraint term. However, in the drawing, illustration of an auxiliary variable holding unit that holds the auxiliary variable x k in the auxiliary variable processing unit 140 is omitted. For example, the auxiliary variable holding unit is realized by the internal memory 111.

[0217] The decision variable processing unit 130a includes the W holding units 131, 131a, ..., decision variable modules 134, 134a, ..., and a selection unit 135. The W holding units 131, 131a, ... are the same as those in the second embodiment.

[0218] The decision variable module 134 includes the SRAM I / F 171, the h storage unit 173, the restoration unit 175, h i calculation units 176, 176a, ..., and ΔE calculation units 177, 177a, .... The SRAM I / F 171, the h storage unit 173 and the restoration unit 175 are the same as those in the second embodiment. However, as described above, the h storage unit 173 separately holds a local field of decision variable and a change amount of constraint term. Other decision variable modules including the decision variable module 134a have the functions similar to those of the decision variable module 134.

[0219] The h i calculation unit 176 separately calculates and holds a local field of decision variable and a change amount of constraint term to be applied to the local field of decision variable. The local field h i of the third embodiment is expressed by Formula (16). h i = ∑ j ∈ D W ij x j + b i − ∑ k ∈ A λ k W ki x k

[0220] When x p that is a decision variable or an auxiliary variable has changed to 1 - x p , h i is updated by Formula (17). Index p is an index of a decision variable or an auxiliary variable. h i ← h i + λ p W ip Δ x p

[0221] However, when p ε D, λ p = 1. For example, information on Δx k is supplied from the auxiliary variable processing unit 140 to each h i calculation unit.

[0222] For p ε D, Formula (18) is used for the update of total energy. H ← H − λ p h p Δ x p for p ∈ D

[0223] For p ε A, Formula (19) is used for the update of total energy. H ← H + λ p h p Δ x p for p ∈ A

[0224] When h k ^ has changed, a change amount p i of constraint term to be applied to a local field of decision variable in calculation of an energy difference to be used for flip determination processing of a decision variable is updated by Formula (20). p i ← p i − Δ x i λ k Δ g h ^ k , W ki Δ x i − Δ g h ^ k old , W ki Δ x i

[0225] When the value of auxiliary variable x k has changed, p i is updated by Formula (21). p i ← p i − λ k W ki Δ x k

[0226] The second term on the right side of Formula (21) is a subtraction performed so that a change amount of constraint term corresponding to inversion of an auxiliary variable added to the local field of decision variable is not redundantly calculated for p i .

[0227] The h i calculation unit 176 supplies p i + h i and h i to the ΔE calculation unit 177. Other h i calculation units including the h i calculation unit 176a have the function similar to that of the h i calculation unit 176.

[0228] The ΔE calculation unit 177 calculates ΔE i to be used for flip determination processing by Formula (22), using p i + h i supplied from the h i calculation unit 176. Δ E i = − h i + p i Δ x i

[0229] The ΔE calculation unit 177 supplies ΔE i to be used for flip determination processing and energy change amount ΔH i = -h i Δx i based on h i to the selection unit 135.

[0230] Other ΔE calculation units including the ΔE calculation unit 177a have the function similar to that of the ΔE calculation unit 177.

[0231] The selection unit 135 performs flip determination based on ΔE supplied from each of the decision variable modules 134, 134a, ..., and selects a decision variable x j to be flipped. A method similar to the method exemplified in the first embodiment is used for the flip determination. The selection unit 135 supplies the index of the decision variable to be flipped (flip bit) to each h i calculation unit of the decision variable modules 134, 134a, .... The selection unit 135 inverts the value of the decision variable x j to be flipped among the decision variables held in the decision variable processing unit 130a. In FIG. 13, illustration of a decision variable holding unit that holds the value of each decision variable in the decision variable processing unit 130a is omitted. For example, the decision variable holding unit is realized by the internal memory 111.

[0232] The selection unit 135 outputs ΔH j corresponding to the decision variable to be flipped to the energy holding unit 150, and updates the total energy held in the energy holding unit 150.

[0233] The constraint term calculation unit 160a outputs energy change amount λ k h k Δx k to the energy holding unit 150 in response to flipping of x k , and updates the total energy held in the energy holding unit 150. As is the case with the energy correction processing unit 160, the constraint term calculation unit 160a supplies hk_code, hk_old_code, and hk^_update_bit to each decision variable module of the decision variable processing unit 130a.

[0234] FIG. 14 is a diagram illustrating an example of an h i calculation unit.

[0235] The h i calculation unit 176 includes multipliers c21 and c72, adders c22, c23, c73, c75, and c77, the Max arithmetic operators c24, c25, c26, and c27, the subtractors c28, c29, and c30, a selector (SEL) c71, and registers c74 and c76.

[0236] Among these, the multiplier c21, the adders c22 and c23, the Max arithmetic operators c24, c25, c26, and c27, and the subtractors c28, c29, and c30 are the same as those in the second embodiment. However, a calculation result of the multiplier c21 is supplied to the adder c23, the selector c71, and the adder c75. A calculation result of the subtractor c30 is supplied to the selector c71. In the drawings, inversion of a sign may be omitted by indicating subtraction in a Formula by an adder, or the like.

[0237] The selector c71 switches a value to be output to the multiplier c72 between W ki Δx k in a case where x k is inverted and δh i in a case where h k ^ changes.

[0238] The multiplier c72 multiplies an output value of the selector c71 by λ k , and supplies a multiplication result to the adder c73.

[0239] The adder c73 adds an output value of the multiplier c72 to p i held in the register c74, and updates p i in the register c74.

[0240] The register c74 holds p i and supplies p i to the adder c77. When arithmetic operation is performed for a plurality of replicas, p i for each replica is held in the h storage unit 173, and p i of the replica for which arithmetic operation is performed is read from the h storage unit 173 to the register c74.

[0241] The adder c75 adds W ij Δx j supplied from the multiplier c21 to h i held in the register c76, and updates h i in the register c76. λ k W ik Δx k is also added to h i in the register c76, but illustration of a circuit configuration in which the calculation is performed is omitted.

[0242] The register c76 holds h i , and supplies h i to the ΔE calculation unit 177 and the adder c77. When arithmetic operation is performed for a plurality of replicas, h i for each replica is held in the h storage unit 173, and h i of the replica for which arithmetic operation is performed is read from the h storage unit 173 to the register c76.

[0243] The adder c77 adds p i in the register c74 and h i in the register c76, and supplies an addition result to the ΔE calculation unit 177.

[0244] Other h i calculation units including the h i calculation unit 176a are realized by the circuit configuration similar to that of the h i calculation unit 176.

[0245] FIG. 15 is a diagram illustrating an example of the constraint term calculation unit.

[0246] The constraint term calculation unit 160a includes a parameter holding unit c81, a register c82, and a multiplier c83.

[0247] The parameter holding unit c81 holds a constant λ k indicating a weight for each constraint term.

[0248] The register c82 holds and outputs the codes hk_old_code and hk_code supplied from the selection unit 143 and the local field h k .

[0249] The multiplier c83 multiplies λ k by h k , supplies a multiplication result to the energy holding unit 150, and updates the total energy according to Δx k .

[0250] In this way, the constraint term calculation unit 160a performs the update of total energy based on Formula (19). The constraint term calculation unit 160a supplies the codes hk_old_code, hk_code, and hk^_update_bit supplied from the selection unit 143 to the decision variable processing unit 130a.

[0251] FIG. 16 is a diagram illustrating an example of a timing chart.

[0252] Timing chart 61 illustrates an example of the operation of the data processing apparatus 100a in the case where pipeline processing is performed using eight replicas. 0 to 7 are replica numbers. FIG. 16 illustrates the details of processing for the replica with replica number = 0, and other replicas are illustrated in a simplified manner.

[0253] For the replica with replica number = 0, flip determination processing is performed (t1), update of x i and x k is performed according to the result of processing, and reading of weight values for update of h i and h k is performed (t2). The update of h i and h k is performed (t3). When three h k (represented as 0ka, 0kb, and 0kc in FIG. 16) are updated, reading, generation of h k ^ and h k ^ (old)< , and update detection of h k ^ are performed in this order for the three h k (t4 to t5). At this time, when there is a change corresponding to inversion of an auxiliary variable in detection of a change in the local field of the auxiliary variable, update of total energy H is performed by the constraint term calculation unit 160a. For example, a thick frame line of 0kb in the drawing indicates that there is a change in the local field corresponding to inversion of the second auxiliary variable among the three auxiliary variables.

[0254] Reading of a corresponding W ki is performed in order from h k ^ for which update detection has ended (t5), and update of p i based on δh i is performed (t6). At this time, when there is a change in the local field corresponding to inversion of an auxiliary variable, the local field h i of decision variable is updated by Formula (17). After that, the updated p i and h i are read (t7), and calculation of ΔE by p i and h i , calculation of ΔH by h i , flip determination processing by ΔE, and calculation of H(x) are performed (t8).

[0255] Next, a procedure of the processing of the data processing apparatus 100a will be described.

[0256] FIG. 17 is a flowchart illustrating an example of overall processing.

[0257] Hereinafter, an example in which a search by the simulated annealing method is performed will be described as an example.

[0258] (S30) The decision variable processing unit 130a and the auxiliary variable processing unit 140 perform initialization. In the initialization, an initial value of the N decision variables, problem information, and calculation conditions (for example, information on a temperature parameter used in the simulated annealing method, or the like) are set. The initial value of the N decision variables is held in the predetermined decision variable holding unit of the decision variable processing unit 130a. The weight values included in the problem information are divided for each corresponding group of decision variables and auxiliary variables, and are held in the W holding units 131, 131a, ... and the W holding units 141, 141a, ....

[0259] In the initialization, an initial value of the M auxiliary variables, an initial value of h k , and an initial value of h i are calculated based on the initial value of the N decision variables and the problem information, the initial value of N h i is held in the h storage unit 173, and the initial value of M h k is held in the h storage unit 183. The initial value of the M auxiliary variables is held in the predetermined auxiliary variable holding unit of the auxiliary variable processing unit 140. An initial value of H(x) is calculated based on the initial value of the N decision variables and the problem information, and is held in the energy holding unit 150.

[0260] (S31) The decision variable processing unit 130a performs the decision variable flip selection processing. The procedure of the decision variable flip selection processing is similar to the procedure illustrated in FIG. 12. However, ΔE of Formula (22) is used for the determination in step S21. Formula (18) is used for the update of H in step S25.

[0261] (S32) k is incremented one by one from the index k = 0 of constraint condition, and steps S33 to S40 are repeatedly executed while k < M.

[0262] (S33) The non-zero detection unit c42 of the auxiliary variable processing unit 140 determines whether there is local field update of auxiliary variable. When there is local field update of auxiliary variable, the processing proceeds to step S34. When there is no local field update of auxiliary variable, the processing proceeds to step S41.

[0263] (S34) The selection unit 143 determines whether the auxiliary variable x k satisfies an inversion condition. When the inversion condition is satisfied, the processing proceeds to step S35. When the inversion condition is not satisfied, the processing proceeds to step S38.

[0264] (S35) The selection unit 143 inverts the value of auxiliary variable x k held in the auxiliary variable holding unit of the auxiliary variable processing unit 140.

[0265] (S36) The constraint term calculation unit 160a updates total energy H held in the energy holding unit 150 by Formula (19).

[0266] (S37) The h i calculation units 176, 176a, ... of the decision variable processing unit 130a update the local field h i of decision variable according to the inversion of the value of x k based on Formula (17).

[0267] (S38) The quantization units c46 and c47 of the auxiliary variable processing unit 140 calculate codes hk_code and hk_old_code indicating the quantized local fields of the auxiliary variable x k , respectively.

[0268] (S39) The change detection unit c48 of the auxiliary variable processing unit 140 determines whether there is a change in quantized local field based on the codes hk_code and hk_old_code. When there is a change, the processing proceeds to step S40. When there is no change, the processing proceeds to step S41. When there is no change, the processing of step S40 in the decision variable processing unit 130a is omitted based on hk^_update_bit supplied from the auxiliary variable processing unit 140 to the decision variable processing unit 130a.

[0269] (S40) The h i calculation units 176, 176a, ... of the decision variable processing unit 130a restore the approximate values h k ^ and h k ^ (old)< of the original local field based on hk_code and hk_old_code supplied from the auxiliary variable processing unit 140, and update the penalty p i from the auxiliary variable x k for the decision variable x i . Accordingly, the contribution of penalty from an auxiliary variable in Formula (20) is reflected in p i . When x k is inverted, the h i calculation units 176, 176a, ... also perform update of p i by Formula (21).

[0270] (S41) When the auxiliary variable loop ends, the processing proceeds to step S42.

[0271] (S42) The decision variable processing unit 130a determines whether it is search end. For example, search end is determined when temperature value T in the simulated annealing method reaches the final temperature value. When it is not search end, temperature value T is updated, and the processing proceeds to step S31. When it is search end, the overall processing ends. When it is search end, the decision variable processing unit 130a outputs a calculation result. For example, the calculation result is the total energy and the state obtained when the energy is the minimum energy up to that time.

[0272] According to the data processing apparatus 100a of the third embodiment, when there is no change in quantized local field in step S39 in FIG. 17, the update of h i by Formulae (20) and (21) in step S40 may be omitted. For this reason, the arithmetic operation cost related to the update of h i may be reduced. As a result, the solution finding performance of the data processing apparatus 100a may be improved. For example, the data processing apparatus 100a may execute the solution finding arithmetic operation at high speed. The data processing apparatus 100a may increase the possibility of reaching a better solution in a relatively short time.

[0273] In a case where the decision variable processing unit 130a and the auxiliary variable processing unit 140 are realized by separate electronic circuits corresponding to separate arithmetic operators, it is sufficient that the auxiliary variable processing unit 140 transmits a code of a relatively small number of bits indicating a quantized local field to the decision variable processing unit 130a. Accordingly, the amount of information output from the auxiliary variable processing unit 140 to the decision variable processing unit 130a is reduced. For this reason, complication of wiring inside the processor 110 realized by an FPGA or the like is suppressed, and the cost of circuit mounting is reduced. As a result, a larger-scale parallelization arithmetic operation may be performed.

[0274] Since it is sufficient that the data processing apparatus 100a performs update of total energy H according to a change in the local field on the auxiliary variable side only when the auxiliary variable is inverted, the arithmetic operation cost related to the calculation of total energy may be reduced.[Fourth Embodiment]

[0275] Next, a fourth embodiment will be described. Items different from the above-described second and third embodiments will be mainly described, and description of the common items will be omitted.

[0276] FIG. 18 is a diagram illustrating an example of the functions of a data processing apparatus of the fourth embodiment.

[0277] A data processing apparatus 100b of the fourth embodiment provides a function of reducing an amount of data held as the change amount p i of constraint term to be applied to a local field of decision variable in order to calculate an energy change to be used for flip determination processing.

[0278] The data processing apparatus 100b of the fourth embodiment is realized by hardware similar to that of the data processing apparatus 100 of the second embodiment illustrated in FIG. 5. The data processing apparatus 100b has the functions similar to those of the data processing apparatus 100a of the third embodiment. However, the data processing apparatus 100b is different from the data processing apparatus 100a in that a decision variable processing unit 130b is provided instead of the decision variable processing unit 130a.

[0279] The decision variable processing unit 130b includes the W holding units 131, 131a, ..., decision variable modules 136, 136a, ..., and the selection unit 135. The W holding units 131, 131a, ... are the same as those in the second embodiment. The selection unit 135 is the same as that in the third embodiment.

[0280] The decision variable module 136 includes the SRAM I / F 171, the h storage unit 173, h i calculation units 178, 178a, ..., and the ΔE calculation units 177, 177a, .... The SRAM I / F 171, the h storage unit 173, and the ΔE calculation units 177, 177a, ... are the same as those in the third embodiment. Other decision variable modules including the decision variable module 136a have the functions similar to those of the decision variable module 136.

[0281] The h i calculation unit 178 separately calculates and holds a local field of decision variable and a change amount of constraint term to be applied to the local field of decision variable. The processing of the h i calculation unit 178 is similar to the processing of the h i calculation unit 176 of the third embodiment, but is different from the h i calculation unit 176 in that the calculation related to p i is performed by using a quantized weight value obtained by quantizing the weight value W ki .

[0282] P i ^ (p with a hat symbol and an index i) of the fourth embodiment is updated by Formula (23) when h k ^ has changed. p ^ i ← p ^ i − Δ x i λ k Δ g h ^ k , W ^ ki Δ x i − Δ g h ^ k old , W ^ ki Δ x i

[0283] W ki ^ (W with a hat symbol and an index ki) indicates a quantized weight value.

[0284] When x k has changed, p i ^ is updated by Formula (24). p ^ i ← p ^ i − λ k W ^ ki Δ x k

[0285] For the accuracy δ of h k ^, for example, the accuracy of W ki ^ is about δ / m = δ / 8 for the original W ki . p i ^ in the above formulae (23) and (24) is calculated with the accuracy of δ / m. A code of a predetermined number of bits smaller than the number of bits of W ki corresponding to W ki ^ and indicating a quantized weight value, is held in advance in the W holding units 131, 131a, ... separately from W ki .

[0286] The h i calculation unit 178 restores the accuracy to the original accuracy when p i is added to h i . For example, the h i calculation unit 178 sets (δ / m)p i ^ as p i .

[0287] The h i calculation unit 178 outputs p i + h i and h i to the ΔE calculation unit 177.

[0288] Other h i calculation units including the h i calculation unit 178a have the function similar to that of the h i calculation unit 178.

[0289] FIG. 19 is a diagram illustrating an example of an h i calculation unit.

[0290] The h i calculation unit 178 includes multipliers c21, c21a, c72a, and c78, adders c22a, c23a, c73a, c75, and c79, Max arithmetic operators c24a, c25a, c26a, and c27a, subtractors c28a, c29a, and c30a, a selector (SEL) c71a, and registers c74a and c76.

[0291] Among these, the multiplier c21, the adder c75, and the register c76 are the same as those in the third embodiment. However, a calculation result of the multiplier c21 is supplied to the adder c75. In the drawings, inversion of a sign may be omitted by indicating subtraction in a Formula by an adder, or the like.

[0292] The multiplier c21a multiplies the change amount Δx i of the value of the decision variable x i corresponding to the h i calculation unit 178 by the code indicating the quantized weight value W ki ^ between x i and the constraint term of index k, and outputs a multiplication result. The code indicating the quantized weight value W ki ^ is read from the W holding unit 131 by the SRAM I / F 171, and is supplied to the multiplier c21a.

[0293] The adder c22a adds an output value of the multiplier c21a and hk_old_code supplied from the auxiliary variable processing unit 140, and outputs an addition result.

[0294] The adder c23a adds an output value of the multiplier c21a and hk_code supplied from the auxiliary variable processing unit 140, and outputs an addition result.

[0295] The Max arithmetic operator c24a compares hk_old_code supplied from the auxiliary variable processing unit 140 with 0, and outputs the larger one.

[0296] The Max arithmetic operator c25a compares an output value of the adder c22a with 0, and outputs the larger one.

[0297] The Max arithmetic operator c26a compares hk_code supplied from the auxiliary variable processing unit 140 with 0, and outputs the larger one.

[0298] The Max arithmetic operator c27a compares an output value of the adder c23a with 0, and outputs the larger one.

[0299] The subtractor c28a calculates and outputs a difference between an output value of the Max arithmetic operator c24a and an output value of the Max arithmetic operator c25a.

[0300] The subtractor c29a calculates and outputs a difference between an output value of the Max arithmetic operator c26a and an output value of the Max arithmetic operator c27a.

[0301] The subtractor c30a calculates and outputs a difference between an output value of the subtractor c28a and an output value of the subtractor c29a.

[0302] The selector c71a switches a value to be output to the multiplier c72a between an output value of the subtractor c30a and an output value of the multiplier c21a.

[0303] The multiplier c72a multiplies an output value of the selector c71a by λ k , and supplies a multiplication result to the adder c73a.

[0304] The adder c73a adds an output value of the multiplier c72a to p i ^ held in the register c74a, and updates p i ^ in the register c74a.

[0305] The register c74a holds p i ^ and supplies p i ^ to the multiplier c78. When arithmetic operation is performed for a plurality of replicas, p i ^ for each replica is held in the h storage unit 173, and p i ^ of the replica for which arithmetic operation is performed is read from the h storage unit 173 to the register c74a.

[0306] The adder c75 adds W ij Δx j supplied from the multiplier c21 to h i held in the register c76, and updates h i in the register c76. λ k W ik Δx k is also added to h i in the register c76, but illustration of a circuit configuration in which the calculation is performed is omitted.

[0307] The multiplier c78 acquires p i by multiplying p i ^ by δ / m, and supplies p i to the adder c79.

[0308] The adder c79 adds p i and h i of the register c76, and supplies an addition result to the ΔE calculation unit 177.

[0309] Other h i calculation units including the h i calculation unit 178a are realized by the circuit configuration similar to that of the h i calculation unit 178.

[0310] According to the data processing apparatus 100b of the fourth embodiment, the arithmetic operation of p i ^ may be performed by a code of a smaller number of bits than the original number of bits of the local field and weight value. For this reason, as compared with the third embodiment, the circuit for calculating a change amount (p^) of constraint term and the memory capacity for storing p^ may be reduced.

[0311] Although the examples in which the simulated annealing method is executed by the data processing apparatuses 100, 100a, and 100b have been described in the second to fourth embodiments, the data processing apparatuses 100, 100a, and 100b may execute the replica exchange method for a plurality of replicas.

[0312] Next, comparative examples will be described.(Comparative Examples)

[0313] FIG. 20 is a diagram illustrating the functions of a data processing apparatus of comparative example 1.

[0314] A data processing apparatus 70 of comparative example 1 includes a decision variable holding unit 71, an auxiliary variable holding unit 72, multipliers 73, 74, and 75, an h i update circuit 76, an h k update circuit 77, an update decision variable determination unit 78, and an update auxiliary variable determination unit 79.

[0315] The decision variable holding unit 71 holds N decision variables (x i ). The decision variable holding unit 71 outputs a change amount of the flip candidate x j (Δx j ).

[0316] The auxiliary variable holding unit 72 holds M auxiliary variables (x k ). X k is a variable that is 0 when the constraint condition of identification number = k is satisfied, and is 1 when the constraint condition is not satisfied. The auxiliary variable holding unit 72 outputs a change amount of the flip candidate x k (Δx k ).

[0317] When such auxiliary variable is used, for example, H(x) may be expressed by the following Formula (25). H x = E x + P x = E x + ∑ k ∈ A λ k ∑ i ∈ D W ki x i − U k x k

[0318] In the data processing apparatus 70 of comparative example 1, h i may be expressed by the following Formula (26). h i = ∑ j ∈ D W ij x j + b i − ∑ k ∈ A λ k W ki x k

[0319] h k may be expressed by the following Formula (27). h k = ∑ i ∈ D , k ∈ A W ki x i − U k

[0320] Formula (27) is the same as Formula (8) when - U k = b k .

[0321] The multiplier 73 outputs a product of Δx j and W ij , which is a change amount of h i such as that illustrated in Formula (26) in a case where the value of x j of a flip candidate has changed.

[0322] The multiplier 74 outputs a product of Δx j and W kj , which is a change amount of h k such as that illustrated in Formula (27) in the case where the value of x j of a flip candidate has changed.

[0323] The multiplier 75 outputs a product of Δx k and W ki , which is a change amount of h i such as that illustrated in Formula (26) in a case where the value of x k of a flip candidate has changed.

[0324] When the value of x j of a flip candidate has changed, the h i update circuit 76 updates h i by adding W ij Δx j to the original h i . When the value of x k of a flip candidate has changed, the h i update circuit 76 updates h i by adding -λ k W ki Δx k to the original h i .

[0325] When the value of x j of a flip candidate has changed, the h k update circuit 77 updates h k by adding W kj Δx j to the original h k .

[0326] The update decision variable determination unit 78 calculates ΔH = -h j Δx j based on h j which is a first local field for x j of a flip candidate. The update decision variable determination unit 78 determines whether the value of x j is to be changed based on a result of comparison between ΔH and a predetermined value, and when it is determined that the value of x j is to be changed, changes the value of x j held in the decision variable holding unit 71.

[0327] The update auxiliary variable determination unit 79 calculates ΔH = +λ k h k Δx k based on h k which is the second local field for x k of a flip candidate. The update auxiliary variable determination unit 79 determines whether the value of x k is to be changed based on a result of comparison between ΔH and a predetermined value, and when it is determined that the value of x k is to be changed, changes the value of x k held in the auxiliary variable holding unit 72.

[0328] In such data processing apparatus 70, h i is updated based on N W ki when a change in the value of the auxiliary variable (x k ) representing the presence or absence of violation of a certain constraint condition is allowed. Accordingly, W ki related to all M constraint terms do not have to be read, the number of times of performing addition processing (the processing of adding Δh i = -λ k W ki Δx k to the original h i ) is suppressed, and the amount of calculation for update processing may be reduced.

[0329] However, in the data processing apparatus 70 of comparative example 1, at the time of determining whether the value of the state variable of a flip candidate is to be changed, a change amount of constraint term due to the change is not taken into consideration. For this reason, there is a possibility that the following prediction errors occur until H(x) is updated by ΔH = +λ k h k Δx k in response to a change in the value of an auxiliary variable.

[0330] FIG. 21 is a diagram illustrating an example of prediction error occurrence in the data processing apparatus of comparative example 1.

[0331] The vertical axis represents the magnitude of constraint term, and the horizontal axis represents h k . In FIG. 21, a constraint term of an inequality constraint is represented by λ k max[0, h k ].

[0332] Prediction error occurrence case 1 illustrates a prediction error that occurs when a state changes from the satisfaction state to the violation state of an inequality constraint. Prediction error occurrence case 2 illustrates a prediction error that occurs when a state changes from the violation state to the satisfaction state of an inequality constraint.

[0333] In either case, there is a possibility that a prediction error such as that illustrated in FIG. 21 occurs.

[0334] For this reason, there is a possibility that it is difficult to improve the solution finding performance for an inequality constraint problem with a high level of difficulty.

[0335] By contrast, in the data processing apparatuses 10, 100, 100a, and 100b of the first to fourth embodiments, as in Formulae (13) and (14) described above, a value reflecting not only the change amount of E(x) due to a change in the value of x i but also an approximate value of the change amount of P(x) based on a quantized local field is used as h i . For this reason, flip determination may be performed based on more accurate ΔH i . Accordingly, the solution finding performance may be improved.

[0336] FIG. 22 is a diagram illustrating an example of the functions of a data processing apparatus of comparative example 2 (part 1).

[0337] A data processing apparatus 80 of comparative example 2 is different from the data processing apparatus 100 of the second embodiment in that the data processing apparatus 80 updates the local field of decision variable without quantizing the local field of auxiliary variable, for example, by using Formula (12) instead of Formulae (13) and (14). However, as described above, when i = j for index j of a flipped decision variable, h i does not have to be updated.

[0338] The data processing apparatus 80 includes an input unit 81, a control unit 82, a search unit 83, and an output unit 84.

[0339] For example, the input unit 81, the control unit 82, the search unit 83, and the output unit 84 may be implemented by using a program module executed by a processor included in the data processing apparatus 80 or a storage area (register or cache memory) in the processor. The search unit 83 may also be implemented by using a storage area secured in the RAM or the HDD included in the data processing apparatus 80.

[0340] For example, the input unit 81 receives input of an initial value of the N decision variables, problem information, and calculation conditions. For example, the problem information includes W ij , b i , and λ k in Formula (10) in addition to W ki and b k in Formula (8). For example, the calculation conditions include the number of replicas, a replica exchange cycle, and the value of temperature parameter set for each replica in a case where the replica exchange method is executed, and a temperature parameter change schedule, an end condition of calculation, and the like in a case where the simulated annealing method is performed.

[0341] These pieces of information may be input by the operation of an input device by a user, or may be input to the data processing apparatus 80 via a recording medium or a network.

[0342] The control unit 82 controls each unit of the data processing apparatus 80 and causes the units to execute the processing to be described later.

[0343] The search unit 83 searches for a state in which the value of an evaluation function (total energy) is local minimum by repeating flip determination processing and update processing under the control of the control unit 82.

[0344] The output unit 84 outputs a search result (calculation result) of the search unit 83.

[0345] For example, the output unit 84 may output and display the calculation result on a display, may transmit the calculation result to another information processing apparatus via a network, or may store the calculation result in an external storage device.

[0346] The search unit 83 includes a weight value holding unit 83a, a decision variable holding unit 83b, an auxiliary variable holding unit 83c, a local field update unit 83d, an h k update detection unit 83e, and an h k contribution calculation unit 83f. The search unit 83 includes an h i holding unit 83g, an h k holding unit 83h, a ΔH calculation unit 83i, a ΔH holding unit 83j, a flip-flop (FF) 83k, a flip determination processing unit 83l, and an H holding unit 83m.

[0347] The weight value holding unit 83a holds N × N W ij , and holds M × N W ki and N × M W ik . Since W ki = W ik , the weight value holding unit 83a does not have to hold N × M W ik . The weight value holding unit 83a does not have to hold W ki having the value of 0.

[0348] The decision variable holding unit 83b holds the values of N decision variables (x i ). When a decision variable of a flip candidate is designated among the N decision variables, the decision variable holding unit 83b outputs a change amount of the value of the decision variable. For example, when x j is designated, Δx j = 1 - 2x; is output.

[0349] The auxiliary variable holding unit 83c holds the values of M auxiliary variables (x k ). For example, x k is used for detecting whether a constraint condition is satisfied. In FIG. 22, illustration for the configuration of updating x k is omitted. For example, with respect to a constraint term of the ReLU type function in FIG. 2, when h k > 0, g(h k ) > 0 and a constraint condition violation occurs. Therefore, such a configuration is provided that x k = 1 when h k > 0 and x k = 0 when h k ≤ 0. However, the data processing apparatus 80 of comparative example 2 does not have to use x k . In this case, the auxiliary variable holding unit 83c does not have to be provided.

[0350] When a change in the value of a decision variable of a flip candidate is allowed (when flipping may be performed), the local field update unit 83d reads a weight value between the decision variable and another decision variable from the weight value holding unit 83a, and updates the local field by using the weight value. For example, when x j may be flipped, the local field update unit 83d updates h i by adding W ij Δx j to each h i .

[0351] When a decision variable of a flip candidate may be flipped, the local field update unit 83d reads a weight value of which value is not 0 among the weight values between the decision variable and M local fields (h k ), and updates h k by using the weight value. For example, when x j may be flipped, the local field update unit 83d updates h k by adding W kj Δx j to h k .

[0352] The h k update detection unit 83e detects an update of h k .

[0353] The h k contribution calculation unit 83f reads W ki that is not 0 from the weight value holding unit 83a in order to calculate a change amount of h i due to a change in the value of h k for which an update is detected. The h k contribution calculation unit 83f acquires h k from the h k holding unit 83h, and acquires h k (old)< from the FF 83k. The h k contribution calculation unit 83f calculates δh i ' = -λ k (Δg(h k , W ki Δx i ) - Δg(h k (old)< , W ki Δx i )), and updates h i by adding δh i ' to the original h i . When i = j for index j of a flipped decision variable, δh i ' = 0. In the calculation of δh i ', quantized values h k ^ and h k ^ (old)< are not used, and h k and h k (old)< are used as they are.

[0354] The h i holding unit 83g holds N h i .

[0355] The h k holding unit 83h holds M h k .

[0356] The ΔH calculation unit 83i calculates ΔH based on a local field corresponding to a decision variable of a flip candidate. For example, when x j is the flip candidate, the ΔH calculation unit 83i calculates ΔH j = -h j Δx j .

[0357] The ΔH holding unit 83j holds ΔH j calculated by the ΔH calculation unit 83i.

[0358] The FF 83k supplies h k (old)< to the h k contribution calculation unit 83f by holding h k and delaying the timing of outputting h k .

[0359] The flip determination processing unit 83I performs flip determination processing of determining whether the decision variable of a flip candidate may be flipped based on a result of comparison between ΔH and a predetermined value. For example, the predetermined value is a noise value obtained based on a random number and a value of temperature parameter. For example, when -ΔH ≥ log(rand) × T, the flip determination processing unit 83I determines that a change in the value of the decision variable of a flip candidate is allowed.

[0360] The flip determination processing unit 83I transmits the identification number of the decision variable for which it is determined that flipping may be performed to the decision variable holding unit 83b, and causes the decision variable holding unit 83b to update the value of the decision variable.

[0361] The flip determination processing unit 83I updates H(x) held in the H holding unit 83m based on ΔH generated by the change in the value of the decision variable that may be flipped.

[0362] The H holding unit 83m holds H(x). The H holding unit 83m may hold H(x) and the state obtained when the energy is the minimum energy up to that time.

[0363] The data processing apparatuses 100, 100a, and 100b of the second to fourth embodiments may also have functions corresponding to the input unit 81, the control unit 82, the search unit 83, and the output unit 84.

[0364] For example, the functions of the data processing apparatus 80 of comparative example 2 may be realized by the following circuit configuration.

[0365] FIG. 23 is a diagram illustrating an example of the functions of the data processing apparatus of comparative example 2 (part 2).

[0366] The data processing apparatus 80 includes a decision variable processing unit 810, an auxiliary variable processing unit 820, an energy holding unit 830, and an h holding unit 840. The energy holding unit 830 corresponds to the energy holding unit 150 of the data processing apparatus 100 of the second embodiment.

[0367] The decision variable processing unit 810 includes W holding units 811, 811a, ..., decision variable modules 812, 812a, ..., and a selection unit 813.

[0368] The W holding units 811, 811a, ... and the selection unit 813 correspond to the W holding units 131, 131a, ... and the selection unit 133 of the data processing apparatus 100 of the second embodiment, respectively.

[0369] The decision variable modules 812, 812a, ... calculate the local field h i for each decision variable and calculate ΔE i . One decision variable module is associated with a group of a predetermined number of decision variables. Comparative example 2 is different from the second to fourth embodiments in that, in the calculation of local field h i in the decision variable modules 812, 812a, ..., the local field of auxiliary variable is used as the original value without quantization.

[0370] The decision variable module 812 includes an SRAM I / F 851, h i calculation units 852, 852a, ..., an h storage unit 853, and ΔE calculation units 854, 854a, .... Other decision variable modules of the decision variable processing unit 810 including the decision variable module 812a have the configuration similar to that of the decision variable module 812.

[0371] The SRAM I / F 851 and the h storage unit 853 correspond to the SRAM I / F 171 and the h storage unit 173 of the data processing apparatus 100 of the second embodiment, respectively.

[0372] The h i calculation units 852, 852a, ... calculate the local field h i of a corresponding decision variable x i . The h i calculation units 852, 852a, ... update the local field h i by Formula (12) in response to a change in the local field h k of auxiliary variable. At this time, as described above, when i = j, the local field h i is not updated. h k and h k (old)< to be used for calculation of Formula (12) are supplied from the auxiliary variable processing unit 820 side to each h i calculation unit.

[0373] The ΔE calculation unit 854 calculates ΔE i = ΔH i = -h i Δx i based on h i supplied from the h i calculation unit 852, and outputs ΔE i = ΔH i = -h i Δx i to the selection unit 813.

[0374] The auxiliary variable processing unit 820 includes W holding units 821, 821a, ..., auxiliary variable modules 822, 822a, ..., and a selection unit 823.

[0375] The W holding units 821, 821a, ... and the selection unit 823 correspond to the W holding units 141, 141a, ... and the selection unit 143 of the data processing apparatus 100 of the second embodiment, respectively.

[0376] The auxiliary variable modules 822, 822a, ... calculate a local field h k for each constraint term. One auxiliary variable module is associated with a group of a predetermined number of constraint terms. Comparative example 2 is different from the second to fourth embodiments in that the auxiliary variable modules 822, 822a, ... output the local field of auxiliary variable to the selection unit 823 without performing quantization of the local field.

[0377] The auxiliary variable module 822 includes an SRAM I / F 861, h k calculation units 862, 862a, ..., and an h storage unit 863.

[0378] The SRAM I / F 861 and the h storage unit 863 correspond to the SRAM I / F 181 and the h storage unit 183 of the data processing apparatus 100 of the second embodiment, respectively.

[0379] The h k calculation units 862, 862a, ... calculate the local field h k of a corresponding constraint term. The h k calculation units 862, 862a, ... output the calculated local field h k to the selection unit 823 without quantization.

[0380] The selection unit 823 sequentially stores h k output from the h k calculation units 862, 862a, ... in the h holding unit 840.

[0381] The h holding unit 840 holds the local field h k and the local field h k (old)< before update, and supplies hk_update_bit indicating index k for which the update of local field h k has occurred, h k , and h k (old)< to each h i calculation unit of the decision variable modules 812, 812a, ....

[0382] In the data processing apparatus 80 of comparative example 2, since the local field h i of decision variable is updated every time the local field h k corresponding to a constraint condition is updated, the amount of arithmetic operation for the update of h i is large. By contrast, in the data processing apparatuses 10, 100, 100a, and 100b of the first to fourth embodiments, it is sufficient that the local field h i of decision variable is updated when the quantized local field h k ^ corresponding to a constraint condition has changed. For this reason, the arithmetic operation cost related to the update of h i may be reduced compared with the case where h i is updated every time the original local field h k corresponding to a constraint condition is updated.

[0383] In the data processing apparatus 80 of comparative example 2, the local fields h k and h k (old)< are transmitted from the auxiliary variable processing unit 820 to the decision variable processing unit 810 as the original values without quantization. The number of bits of a local field is relatively large. For example, the number of bits of a local field is 64 bits, and 64 bits × 2 = 128 bits for h k and h k (old)< . The number of arithmetic operators corresponding to the h i calculation units for decision variables is also large. For example, when the number of decision variables is 8K, the number of arithmetic operators is also 8K. K represents kilo. Since data is data of an arithmetic data path, in a case where a plurality of replicas is processed, distribution in accordance with a pipeline operation of the plurality of replicas is desired.

[0384] As described above, in the data processing apparatus 80 of comparative example 2, a data path having a wide bus width and requested to have high speed performance is distributed to the entire chip, and wiring is difficult.

[0385] By contrast, in the data processing apparatuses 10, 100, 100a, and 100b of the first to fourth embodiments, the data transfer size of the local field of auxiliary variable may be reduced by using the value obtained by quantizing the local field of auxiliary variable as the local field of auxiliary variable used for updating the local field of decision variable. For this reason, the cost of circuit mounting is reduced, and large-scale parallelization is possible.

[0386] As described above, the data processing apparatus 100 of the second embodiment performs the following processing.

[0387] The data processing apparatus 100 searches for a combination of the values of a plurality of state variables in which a value calculated by using an Ising-type evaluation function including the plurality of state variables is local minimum or local maximum. The internal memory 111 stores the total energy that is a sum of a constraint term having the value corresponding to the presence or absence of violation of a constraint condition and the value of the evaluation function, the values of the plurality of state variables, a first weight value between the plurality of state variables, a second weight value between at least some state variables of the plurality of state variables and the constraint condition, a first local field representing a first change amount of the total energy in a case where the value of each of the plurality of state variables changes, and a second local field used for determination of a constraint violation amount for the constraint condition. The processor 110 repeats the processing of determining whether a change in the value of a first state variable among the plurality of state variables is allowed based on the first local field, and the processing of, when it is determined that a change in the value of the first state variable is allowed, updating the first local field based on the first weight value, updating the second local field based on the second weight value between the first state variable and the constraint condition, and further updating the first local field based on a first quantized local field obtained by quantizing the second local field before the update and a second quantized local field obtained by quantizing the second local field after the update.

[0388] Accordingly, the data processing apparatus 100 may increase the efficiency of arithmetic operation. The state variables correspond to the decision variables of the second to fourth embodiments.

[0389] For example, in a case where the first quantized local field and the second quantized local field are the same, the processor 110 omits the update of the first local field based on the first quantized local field and the second quantized local field.

[0390] Accordingly, the data processing apparatus 100 may reduce the arithmetic operation cost of updating the first local field.

[0391] When it is determined that a change in the value of the first state variable is allowed, the processor updates the first local field based on a difference between a change amount of the constraint term calculated by using an approximate value of the second local field before the update that corresponds to the first quantized local field, and a change amount of the constraint term calculated by using an approximate value of the second local field after the update that corresponds to the second quantized local field.

[0392] Accordingly, the data processing apparatus 100 may appropriately update the first local field. For example, such update of the first local field is performed based on Formula (13) (in the case of i ≠ j) or Formula (14) (in the case of i = j) for index j of a state variable to be flipped.

[0393] The processor 110 includes a first arithmetic operator that updates the first local field and a second arithmetic operator that updates the second local field. The second arithmetic operator outputs, to the first arithmetic operator, a first code of a second number of bits smaller than a first number of bits of the second local field that indicates the first quantized local field, and a second code of the second number of bits that indicates the second quantized local field. The first arithmetic operator acquires an approximate value of the second local field before the update based on the first code, acquires an approximate value of the second local field after the update based on the second code, and updates the first local field based on the approximate values of the second local field before and after the update.

[0394] Accordingly, the amount of data transferred between the first arithmetic operator and the second arithmetic operator is reduced. The cost of circuit mounting in the processor 110 is reduced. The decision variable processing unit 130 described above corresponds to a first arithmetic operation circuit, a first processor core, or the like included in the processor 110, and is an example of the first arithmetic operator. The auxiliary variable processing units 140 corresponds to a second arithmetic operation circuit, a second processor core, or the like included in the processor 110, and is an example of the second arithmetic operator. hk_old_code is an example of the first code. hk_code is an example of the second code. The first arithmetic operator and the second arithmetic operator may also be referred to as the first arithmetic operation circuit and the second arithmetic operation circuit, respectively.

[0395] When the second local field is updated, the processor 110 corrects the total energy based on the second local field before the update, the second local field after the update, the first quantized local field, and the second quantized local field.

[0396] Accordingly, the data processing apparatus 100 may appropriately calculate the total energy of each state in the search. The correction of total energy is performed based on Formula (15).

[0397] As exemplified in the third embodiment, the processor 110 may individually store, in the storage unit, the first local field and a second change amount of the constraint term according to the first quantized local field and the second quantized local field. In this case, the processor 110 updates the first local field and the second change amount based on the second weight value according to a change in the value of an auxiliary variable indicating whether the constraint condition is satisfied for the values of the plurality of state variables. The processor 110 determines whether a change in the value of the first state variable is allowed, based on the first local field and the second change amount. The processor 110 updates the total energy based on the first local field according to a change in the value of the first state variable, and updates the total energy based on the second local field according to a change in the value of an auxiliary variable.

[0398] Accordingly, the processor 110 does not have to correct the total energy based on the second local field before and after the update, the first quantized local field, and the second quantized local field every time the second local field is updated. p i in Formulae (20) and (21) is an example of the second change amount. The update of first local field based on the second weight value according to a change in the value of an auxiliary variable is performed based on Formula (17). The update of second change amount based on the second weight value according to a change in the value of an auxiliary variable is performed based on Formula (21). For the second change amount, update by Formula (20) is also performed according to a change in the second quantized local field with respect to the first quantized local field. The update of total energy according to a change in the value of the first state variable is performed based on Formula (18). The update of total energy according to a change in the value of an auxiliary variable is performed based on Formula (19).

[0399] As exemplified in the fourth embodiment, the second change amount held in the storage unit may be represented by a smaller number of bits than a third number of bits used for representation of a constraint violation amount. In this case, the processor 110 updates the second change amount based on a code of a smaller number of bits than the number of bits of the second weight value that corresponds to the second weight value, and when the first local field is updated by using the second change amount, converts the second change amount into a value represented by the third number of bits.

[0400] Accordingly, the storage capacity of the storage unit for holding the second change amount, for example, the internal memory 111, may be reduced, and memory saving may be achieved. Reduction of the mounting cost of a circuit that calculates the second change amount may be achieved. p i ^ in Formulae (24) and (25) is an example of the second change amount represented by a smaller number of bits than the third number of bits, which is the number of bits of p i .

[0401] The information processing of the first embodiment may be realized by causing the processing unit 12 to execute a program. The information processing of the second to fourth embodiments may be realized by causing the processor 101 to execute a program. The program may be recorded in the computer-readable recording medium 53.

[0402] For example, the program may be circulated by distributing the recording medium 53 in which the program is recorded. The program may be stored in another computer, and the program may be distributed via a network. For example, a computer may store (install), in a storage device such as the DRAM 102 or the HDD 103, the program recorded in the recording medium 53 or the program received from the other computer, and read the program from the storage device and execute the program.

Claims

1. A data processing apparatus (10) that searches for a combination of values of a plurality of state variables in which a value calculated by using an Ising-type evaluation function that includes the plurality of state variables is local minimum or local maximum, the data processing apparatus comprising: a storage unit (11) that stores total energy, which is a sum of a constraint term that has a value that corresponds to presence or absence of violation of a constraint condition and a value of the evaluation function, values of the plurality of state variables, a first weight value between the plurality of state variables, a second weight value between at least some state variables of the plurality of state variables and the constraint condition, a first local field that represents a first change amount of the total energy in a case where a value of each of the plurality of state variables changes, and a second local field that is used for determination of a constraint violation amount for the constraint condition; and a processing unit (12) that repeats processing of determining whether a change in a value of a first state variable among the plurality of state variables is allowed based on the first local field, and processing of, when it is determined that a change in a value of the first state variable is allowed, updating the first local field based on the first weight value, updating the second local field based on the second weight value between the first state variable and the constraint condition, and further updating the first local field based on a first quantized local field and a second quantized local field each obtained by quantizing the second local field before and after update, wherein the processing unit (12) includes a first arithmetic operator that updates the first local field and a second arithmetic operator that updates the second local field, the second arithmetic operator outputs, to the first arithmetic operator, a first code of a second number of bits smaller than a first number of bits of the second local field that indicates the first quantized local field, and a second code of the second number of bits that indicates the second quantized local field, and the first arithmetic operator acquires an approximate value of the second local field before update based on the first code, acquires an approximate value of the second local field after update based on the second code, and updates the first local field based on approximate values of the second local field before and after update.

2. The data processing apparatus (10) according to claim 1, wherein in a case where the first quantized local field and the second quantized local field are same, the processing unit (12) omits update of the first local field based on the first quantized local field and the second quantized local field.

3. The data processing apparatus (10) according to claim 1, wherein when it is determined that a change in a value of the first state variable is allowed, the processing unit (12) updates the first local field based on a difference between a change amount of the constraint term calculated by using an approximate value of the second local field before update that corresponds to the first quantized local field, and a change amount of the constraint term calculated by using an approximate value of the second local field after update that corresponds to the second quantized local field.

4. The data processing apparatus (10) according to claim 1, wherein when the second local field is updated, the processing unit (12) corrects the total energy based on the second local field before update, the second local field after update, the first quantized local field, and the second quantized local field.

5. The data processing apparatus (10) according to claim 1, wherein the processing unit (12) individually stores, in the storage unit (11), the first local field and a second change amount of the constraint term according to the first quantized local field and the second quantized local field, updates the first local field and the second change amount based on the second weight value according to a change in a value of an auxiliary variable that indicates whether the constraint condition is satisfied for values of the plurality of state variables, determines whether a change in a value of the first state variable is allowed, based on the first local field and the second change amount, and updates the total energy based on the first local field according to a change in a value of the first state variable, and updates the total energy based on the second local field according to a change in a value of the auxiliary variable.

6. The data processing apparatus (10) according to claim 5, wherein the second change amount held in the storage unit (11) is represented by a smaller number of bits than a third number of bits used for representation of the constraint violation amount, and the processing unit (12) updates the second change amount based on a code of a smaller number of bits than a number of bits of the second weight value that corresponds to the second weight value, and when the first local field is updated by using the second change amount, converts the second change amount into a value represented by the third number of bits.

7. A data processing method for a computer to execute a process comprising: acquiring values of the plurality of state variables; acquiring a first weight value between the plurality of state variables; acquiring a second weight value between state variables of the plurality of state variables and the constraint condition; acquiring a first local field that represents a first change amount of the total energy in a case where a value of each of the plurality of state variables changes; acquiring a second local field that is used for determination of a constraint violation amount for the constraint condition; repeating determining whether a change in a value of a first state variable among the plurality of state variables is allowed based on the first local field; repeating, when the change in the value of the first state variable is allowed, updating the first local field based on the first weight value, updating the second local field based on the second weight value between the first state variable and the constraint condition, and updating the first local field based on a first quantized local field and a second quantized local field each obtained by quantizing the second local field before and after update; searching for a combination of values of the plurality of state variables in which the value acquired by using the Ising-type evaluation function is local minimum or local maximum; acquiring a first code of a second number of bits smaller than a first number of bits of the second local field that indicates the first quantized local field, acquiring a second code of the second number of bits that indicates the second quantized local field, acquiring an approximate value of the second local field before update based on the first code, acquiring an approximate value of the second local field after update based on the second code, and updating the first local field based on approximate values of the second local field before and after update.

8. The data processing method according to claim 7, wherein the one or more processors configured to in a case where the first quantized local field and the second quantized local field are same, omit update of the first local field based on the first quantized local field and the second quantized local field.

9. The data processing method according to claim 7, wherein the one or more processors configured to when the change in the value of the first state variable is allowed, update the first local field based on a difference between a change amount of the constraint term acquired by using an approximate value of the second local field before update that corresponds to the first quantized local field, and a change amount of the constraint term acquired by using an approximate value of the second local field after update that corresponds to the second quantized local field.

10. The data processing method according to claim 7, wherein the one or more processors configured to when the second local field is updated, correct the total energy based on the second local field before update, the second local field after update, the first quantized local field, and the second quantized local field.

11. The data processing method according to claim 7, wherein the one or more processors configured to: acquire a second change amount of the constraint term according to the first quantized local field and the second quantized local field, update the first local field and the second change amount based on the second weight value according to a change in a value of an auxiliary variable that indicates whether the constraint condition is satisfied for values of the plurality of state variables, determine whether the change in the value of the first state variable is allowed, based on the first local field and the second change amount, update the total energy based on the first local field according to the change in the value of the first state variable, and update the total energy based on the second local field according to a change in a value of the auxiliary variable.

12. The data processing method according to claim 11, wherein the second change amount held in the storage unit (11) is represented by a smaller number of bits than a third number of bits used for representation of the constraint violation amount, wherein the one or more processors configured to: update the second change amount based on a code of a smaller number of bits than a number of bits of the second weight value that corresponds to the second weight value, and when the first local field is updated by using the second change amount, convert the second change amount into a value represented by the third number of bits.

13. A data processing program that causes a computer to execute a process, the process comprising: acquiring values of the plurality of state variables; acquiring a first weight value between the plurality of state variables; acquiring a second weight value between state variables of the plurality of state variables and the constraint condition; acquiring a first local field that represents a first change amount of the total energy in a case where a value of each of the plurality of state variables changes; acquiring a second local field that is used for determination of a constraint violation amount for the constraint condition; repeating determining whether a change in a value of a first state variable among the plurality of state variables is allowed based on the first local field; repeating, when the change in the value of the first state variable is allowed, updating the first local field based on the first weight value, updating the second local field based on the second weight value between the first state variable and the constraint condition, and updating the first local field based on a first quantized local field and a second quantized local field each obtained by quantizing the second local field before and after update; searching for a combination of values of the plurality of state variables in which the value acquired by using the Ising-type evaluation function is local minimum or local maximum acquiring a first code of a second number of bits smaller than a first number of bits of the second local field that indicates the first quantized local field, acquiring a second code of the second number of bits that indicates the second quantized local field, acquiring an approximate value of the second local field before update based on the first code, acquiring an approximate value of the second local field after update based on the second code, and updating the first local field based on approximate values of the second local field before and after update.