Bandits Help Simulated Annealing to Complete a Maximin Latin Hypercube Design

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10848)


Simulated Annealing (SA) is commonly considered as an efficient method to construct Maximin Latin Hypercube Designs (LHDs) which are widely employed for Experimental Design. The Maximin LHD construction problem may be generalized to the Maximin LHD completion problem in an instance of which the measurements have already been taken at certain points.

As the Maximin LHD completion is NP-complete, the choice of SA to treat it shows itself naturally. The SA performance varies greatly depending on the mutation used. The completion problem nature changes when the number of given points varies. We thus provide SA with a mechanism which selects an appropriate mutation. In our approach the choice of a mutation is seen as a bandit problem. It copes with changes in the environment, which evolves together with the thermal descent.

The results obtained prove that the bandit-driven SA adapts itself on the fly to the completion problem nature. We believe that other parametrized problems, where SA can be employed, may also benefit from the use of a decision-making algorithm which selects the appropriate mutation.


Maximin LHD Latin Hypercube Design (LHD) Construction Problem Completion Problem Bandit Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2–3), 235–256 (2002)CrossRefGoogle Scholar
  2. 2.
    Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: The nonstochastic multiarmed bandit problem. SIAM J. Comput. 32(1), 48–77 (2002)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Bergé, P., Guiban, K.L., Rimmel, A., Tomasik, J.: Search space exploration and an optimization criterion for hard design problems. In: Proceedings of GECCO (compagnon), pp. 43–44, July 2016Google Scholar
  4. 4.
    Hastings, W.K.: Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57(1), 97–109 (1970)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Le Guiban, K., Rimmel, A., Weisser, M.A., Tomasik, J.: Completion of partial Latin Hypercube Designs: NP-completeness and inapproximability. J. Theor. Comput. Sci. Sect. A 715, 1–20 (2018)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Morris, M.D., Mitchell, T.J.: Exploratory designs for computational experiments. J. Stat. Plann. Infer. 43(3), 381–402 (1995)CrossRefGoogle Scholar
  7. 7.
    Rimmel, A., Teytaud, F.: A survey of meta-heuristics used for computing maximin Latin hypercube. In: Blum, C., Ochoa, G. (eds.) EvoCOP 2014. LNCS, vol. 8600, pp. 25–36. Springer, Heidelberg (2014). Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.LRI, CentraleSupélec, Université Paris SaclayOrsay CedexFrance

Personalised recommendations