Open AccessPseudo Expectation: A Tool for Analyzing Local Search Algorithms
Author(s) -
Osamu Watanabe
Publication year - 2005
Publication title -
progress of theoretical physics supplement
Language(s) - English
Resource type - Journals
ISSN - 0375-9687
DOI - 10.1143/ptps.157.338
Subject(s) - simple (philosophy) , algorithm , computer science , markov chain , machine learning , epistemology , philosophy
In (WST03), the notion of pseudo expectation has been proposed for analyzing relatively simple Markov processes, which would be often seen as simple execution models of local search algorithms. In this paper, we first explain how it is used, and then investigate the approximation error bound of pseudo expectations.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom