Laurent Lessard

Algebraic characterization of equivalence between oracle-based iterative algorithms

Abstract When are two algorithms the same? How can we be sure a recently proposed algorithm is novel, and not a minor variation on an existing method? In this paper, we present a framework for reasoning about equivalence between a broad class of iterative algorithms, with a focus...