Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3205651.3205658acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
poster

Bayesian inference for algorithm ranking analysis

Published: 06 July 2018 Publication History

Abstract

The statistical assessment of the empirical comparison of algorithms is an essential step in heuristic optimization. Classically, researchers have relied on the use of statistical tests. However, recently, concerns about their use have arisen and, in many fields, other (Bayesian) alternatives are being considered. For a proper analysis, different aspects should be considered. In this work we focus on the question: what is the probability of a given algorithm being the best? To tackle this question, we propose a Bayesian analysis based on the Plackett-Luce model over rankings that allows several algorithms to be considered at the same time.

References

[1]
Alessio Benavoli, Giorgio Corani, Janez Demsar, and Marco Zaffalon. 2017. Time for a Change: a Tutorial for Comparing Multiple Classifiers Through Bayesian Analysis. Journal of Machine Learning Research 18, 77 (2017), 1--36.
[2]
Josu Ceberio, Ekhine Irurozki, Alexander Mendiburu, and Jose A Lozano. 2012. A review on estimation of distribution algorithms in permutation-based combinatorial optimization problems. Progress in Artificial Intelligence 1, 1 (2012), 103--117.
[3]
C.P. de Campos and A. Benavoli. 2016. Joint Analysis of Multiple Algorithms and Performance Measures. New Generation Computing 35, 1 (2016), 69--86.
[4]
Gerd Gigerenzer and Julian N. Marewski. 2015. Surrogate Science: The Idol of a Universal Method for Scientific Inference. Journal of Management 41, 2 (2015), 421--440.
[5]
Walter R Gilks, Sylvia Richardson, and David Spiegelhalter. 1995. Markov chain Monte Carlo in practice. CRC press.
[6]
Greenland, Sander and Senn, Stephen J and Rothman, Kenneth J and Carlin, John B and Poole, Charles and Goodman, Steven N and Altaian, Douglas G. 2016. Statistical tests, P values, confidence intervals, and power: a guide to misinterpretations. European journal of epidemiology 31, 4 (2016), 337--350.
[7]
Robin L. Plackett. 1975. The Analysis of Permutations. Journal of the Royal Statistical Society 24, 10 (1975), 193--202.
[8]
Wasserstein, Ronald L and Lazar, Nicole A. 2016. The ASA's statement on p-values: context, process, and purpose. The American Statistician 70, 2 (2016), 129--133.

Cited By

View all
  • (2024)A Practical Methodology for Reproducible Experimentation: An Application to the Double-Row Facility Layout ProblemEvolutionary Computation10.1162/evco_a_0031732:1(69-104)Online publication date: 1-Mar-2024
  • (2024)Embedding Graph Convolutional Networks in Recurrent Neural Networks for Predictive MonitoringIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.328601736:1(137-151)Online publication date: Jan-2024
  • (2024)Exploring Self-Adaptive Genetic Algorithms to Combine Compact Sets of Rules2024 IEEE Congress on Evolutionary Computation (CEC)10.1109/CEC60901.2024.10612101(1-8)Online publication date: 30-Jun-2024
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
GECCO '18: Proceedings of the Genetic and Evolutionary Computation Conference Companion
July 2018
1968 pages
ISBN:9781450357647
DOI:10.1145/3205651
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 July 2018

Check for updates

Author Tags

  1. algorithm comparison
  2. bayesian analysis
  3. plackett-luce model
  4. ranking models
  5. statistical analysis

Qualifiers

  • Poster

Conference

GECCO '18
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)22
  • Downloads (Last 6 weeks)2
Reflects downloads up to 21 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2024)A Practical Methodology for Reproducible Experimentation: An Application to the Double-Row Facility Layout ProblemEvolutionary Computation10.1162/evco_a_0031732:1(69-104)Online publication date: 1-Mar-2024
  • (2024)Embedding Graph Convolutional Networks in Recurrent Neural Networks for Predictive MonitoringIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.328601736:1(137-151)Online publication date: Jan-2024
  • (2024)Exploring Self-Adaptive Genetic Algorithms to Combine Compact Sets of Rules2024 IEEE Congress on Evolutionary Computation (CEC)10.1109/CEC60901.2024.10612101(1-8)Online publication date: 30-Jun-2024
  • (2024)Explainable hypoglycemia prediction models through dynamic structured grammatical evolutionScientific Reports10.1038/s41598-024-63187-514:1Online publication date: 1-Jun-2024
  • (2024)Exploiting recurrent graph neural networks for suffix prediction in predictive monitoringComputing10.1007/s00607-024-01315-9106:9(3085-3111)Online publication date: 9-Jul-2024
  • (2024)Positional Bias Does Not Influence Cartesian Genetic Programming with CrossoverParallel Problem Solving from Nature – PPSN XVIII10.1007/978-3-031-70055-2_10(151-167)Online publication date: 14-Sep-2024
  • (2024)Towards Learning the Optimal Sampling Strategy for Suffix Prediction in Predictive MonitoringAdvanced Information Systems Engineering10.1007/978-3-031-61057-8_13(215-230)Online publication date: 3-Jun-2024
  • (2023)Weighted Mutation of Connections To Mitigate Search Space Limitations in Cartesian Genetic ProgrammingProceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms10.1145/3594805.3607130(50-60)Online publication date: 30-Aug-2023
  • (2023)New Knowledge about the Elementary Landscape Decomposition for Solving the Quadratic Assignment ProblemProceedings of the Genetic and Evolutionary Computation Conference10.1145/3583131.3590369(239-247)Online publication date: 15-Jul-2023
  • (2023)Paradox-Free Analysis for Comparing the Performance of Optimization AlgorithmsIEEE Transactions on Evolutionary Computation10.1109/TEVC.2022.319964727:5(1275-1287)Online publication date: Oct-2023
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media