Self-Improving Algorithms

Details Self-Improving Algorithms Self-Improving Algorithms

2009-07-05

arxiv.org/abs/0907.0884v2

SIAM Journal on Computing (SICOMP), 40(2), 2011, pp. 350-375

Computer Science

Data Structures and Algorithms

26 pages, 8 figures, preliminary versions appeared at SODA 2006 and SoCG 2008. Thorough revision to improve the presentation o

Scientific paper

10.1137/090766437

We investigate ways in which an algorithm can improve its expected performance by fine-tuning itself automatically with respect to an unknown input distribution D. We assume here that D is of product type. More precisely, suppose that we need to process a sequence I_1, I_2, ... of inputs I = (x_1, x_2, ..., x_n) of some fixed length n, where each x_i is drawn independently from some arbitrary, unknown distribution D_i. The goal is to design an algorithm for these inputs so that eventually the expected running time will be optimal for the input distribution D = D_1 * D_2 * ... * D_n. We give such self-improving algorithms for two problems: (i) sorting a sequence of numbers and (ii) computing the Delaunay triangulation of a planar point set. Both algorithms achieve optimal expected limiting complexity. The algorithms begin with a training phase during which they collect information about the input distribution, followed by a stationary regime in which the algorithms settle to their optimized incarnations.

Affiliated with

Also associated with

No associations

Rating

Self-Improving Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Self-Improving Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Self-Improving Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-187678