Skip to main content

Mixed-Effects Modeling of Optimisation Algorithm Performance

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5752))

Abstract

The learning curves of optimisation algorithms, plotting the evolution of the objective vs. runtime spent. can be viewed as a sample of longitudinal data. In this paper we describe mixed-effects modeling, a standard technique in longitudinal data analysis, and give an example of its application to algorithm performance modeling.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Fitzmaurice, G., Davidian, M., Verbeke, G., Molenberghs, G.: Longitudinal Data Analysis. Chapman & Hall/CRC Press (2008)

    Google Scholar 

  2. Lindstrom, M.J., Bates, D.M.: Nonlinear mixed effects models for repeated measures data. Biometrics 46(3), 673–687 (1990)

    Article  MathSciNet  Google Scholar 

  3. Pinheiro, J.C., Bates, D.M.: Mixed Effects Models in S and S-Plus. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  4. Hoos, H.H., Stützle, T.: Stochastic Local Search: Foundations & Applications. Morgan Kaufmann, San Francisco (2004)

    MATH  Google Scholar 

  5. Stützle, T., Hoos, H.H.: Analysing the run-time behaviour of iterated local search for the travelling salesman problem. In: Hansen, P., et al. (eds.) Essays and Surveys on Metaheuristics, pp. 589–611. Kluwer Academic Publishers, Dordrecht (2001)

    Google Scholar 

  6. R Development Core Team: R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria (2009)

    Google Scholar 

  7. Dannenbring, D.G.: Procedures for estimating optimal solution values for large combinatorial problems. Management Science 23(12), 1273–1283 (1977)

    Article  MATH  Google Scholar 

  8. Ovacik, I.M., Rajagopalan, S., Uzsoy, R.: Integrating interval estimates of global optima and local search methods for combinatorial optimization problems. Journal of Heuristics 6(4), 481–500 (2000)

    Article  MATH  Google Scholar 

  9. Oppen, J., Woodruff, D.: Parametric models of local search progression. Technical Report 06-08, UC Davis Graduate School of Management Research (2008)

    Google Scholar 

  10. Schreiber, G.R., Martin, O.C.: Cut size statistics of graph bisection heuristics. SIAM J. on Optimization 10(1), 231–251 (1999)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gagliolo, M., Legrand, C., Birattari, M. (2009). Mixed-Effects Modeling of Optimisation Algorithm Performance. In: Stützle, T., Birattari, M., Hoos, H.H. (eds) Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics. SLS 2009. Lecture Notes in Computer Science, vol 5752. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03751-1_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03751-1_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03750-4

  • Online ISBN: 978-3-642-03751-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics