In some examples, techniques and architectures for solving combinatorial optimization or statistical sampling problems use a recursive hierarchical approach that involves reinitializing various subsets of a set of variables. The entire set of variables may correspond to a first level of a hierarchy. In individual steps of the recursive process of solving an optimization problem, the set of variables may be partitioned into subsets corresponding to higher-order levels of the hierarchy, such as a second level, a third level, and so on. Variables of individual subsets may be randomly initialized. Based on the objective function, a combinatorial optimization operation may be performed on the individual subsets to modify variables of the individual subsets. Reinitializing subsets of variables instead of reinitializing the entire set of variables may allow for preservation of information gained in previous combinatorial optimization operations.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A system comprising: one or more processing units; and computer-readable media with modules thereon, the modules comprising: a memory module to store a set of variables and an objective function that associates the set of variables with one another; a hierarchical structuring module to partition the set of variables into a first-level subset and a second-level subset, wherein the first-level subset is a subset of the second-level subset, and the second-level subset is a subset of the set of variables; and a solving module to: reinitialize the first-level subset prior to performing first-level optimization operations on the objective function that are based, at least in part, on the reinitialized first-level subset; reinitialize the second-level subset prior to performing second-level optimization operations on the objective function that are based, at least in part, on the reinitialized second-level subset; and determine a local optimum configuration for the objective function based, at least in part, on the second-level optimization operations. 2. The system of claim 1, wherein a size of the first-level subset is less than a size of the second-level subset. 3. The system of claim 1, wherein the solving module is configured to: maintain values of the set of variables while reinitializing the first-level subset or while reinitializing the second-level subset. 4. The system of claim 1, wherein the solving module is configured to: determine a rate of convergence toward a k-optimum solution resulting from the first-level optimization operations. 5. The system of claim 4, wherein the solving module is configured to: based, at least in part, on the rate of convergence, transition from performing the first-level optimization operations to performing the second-level optimization operations. 6. The system of claim 1, wherein the first-level or the second-level optimization operations comprise simulated annealing. 7. The system of claim 1, wherein performing the second-level optimization operations are based, at least in part, on results of the first-level optimization operations. 8. The system of claim 1, wherein the memory module is configured to: store local optimum configurations of the set of variables for a plurality of first-level subsets and second-level subsets, and wherein the solving module is configured to: determine a best solution among the local optimum configurations for each of the first-level subsets and the second-level subsets. 9. The system of claim 8, wherein the solving module is further configured to: apply the best solution among the local optimum configurations for the first-level subsets to performing the second-level optimization operations on the objective function. 10. The system of claim 1, wherein the variables of the set of variables comprise discrete variables. 11. The system of claim 1, wherein the variables comprise continuous variables, and wherein the solving module is further configured to: reinitialize the first-level and the second-level subsets by adding Gaussian noise. 12. A method comprising: receiving an objective function that associates a set of variables with one another; defining a first level that includes a first-order subset of the set of variables; defining a second level that includes a second-order subset of the first-order subset; performing an optimization operation on the objective function in the second level to generate a first result; reinitializing the second-order subset; performing the optimization operation on the objective function in the second level based, at least in part, on the first result and the reinitialized second-order subset to generate a second result; comparing the first result to the second result to determine an amount by which the second result is closer than the first result to a local optimum; if the amount is less than a threshold value, then reinitializing the second-order subset; and if the amount is greater than the threshold value, then performing the optimization operation on the objective function in the first level based, at least in part, on the second result and a reinitialized first-order subset; and determining a local optimum configuration for the objective function based, at least in part, on the optimization operation in the first-level. 13. The method of claim 12, wherein the objective function includes a coupling term that defines coupling among the set of variables. 14. The method of claim 12, wherein sizes of the first-order subset and the second-order subset are unchanged during the reinitializing of the first-order subset and the second-order subset, respectively. 15. The method of claim 12, wherein the variables comprise continuous variables. 16. One or more computer-readable media storing computer-executable instructions that, when executed on one or more processors, configure a computer to perform acts comprising: partitioning a set of variables into a hierarchy of subsets on a first level and a second level of the hierarchy; performing optimization operations on an objective function that associates the set of variables with one another, wherein the optimization operations are performed using a reinitialized subset on a first level of the hierarchy; performing optimization operations on the objective function using a reinitialized subset on a second level of the hierarchy; and determining a local optimum configuration for the objective function based, at least in part, on the optimization operations. 17. The computer-readable media of claim 16, wherein the set of variables contains the subset on the second level and the subset on the second level contains the subset on the first level. 18. The computer-readable media of claim 16, wherein the acts further comprise: randomly selecting sizes of the subsets on the first level and the second level. 19. The computer-readable media of claim 16, wherein the acts further comprise: selecting sizes of the subsets on the first level and the second level based, at least in part, on coupling among the set of variables. 20. The computer-readable media of claim 16, wherein the optimization operation comprises simulated annealing.