How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing

DOI10.1007/S11229-007-9297-ZzbMATH Open1147.68074OpenAlexW2094140572MaRDI QIDQ935029FDOQ935029

Authors: Thomas Bartz-Beielstein 

Publication date: 31 July 2008

Published in: Synthese (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11229-007-9297-z

Recommendations

• On a class of algorithms from experimental design theory
• Publication:4937397
• scientific article; zbMATH DE number 2065613
• A competitive Neyman-Pearson approach to universal hypothesis testing with applications
• scientific article; zbMATH DE number 2065615
• Algorithmic tests and randomness with respect to a class of measures
• Algorithms and experiments: The new (and old) methodology
• scientific article; zbMATH DE number 2065614
• Improving on exact tests by approximate conditioning

zbMATH Keywords

OptimizationExperimental algorithmicsMayo's learning modelNew experimentalismSignificanceTheory of testing

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Testing in survival analysis and censored data (62N03) Analysis of algorithms (68W40)

Cites Work

• Title not available (Why is that?)
• Severe Testing as a Basic Concept in a Neyman–Pearson Philosophy of Induction
• The future of experimental research
• Representation theory of semisimple Hopf algebras
• Experimental research in evolutionary computation. The new experimentalism

Uses Software

• SPOT

This page was built for publication: How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q935029)