Noisy Search with Comparative Feedback

Details Noisy Search with Comparative Feedback Noisy Search with Comparative Feedback

2012-02-14

arxiv.org/abs/1202.3741v1

Computer Science

Artificial Intelligence

Scientific paper

We present theoretical results in terms of lower and upper bounds on the query complexity of noisy search with comparative feedback. In this search model, the noise in the feedback depends on the distance between query points and the search target. Consequently, the error probability in the feedback is not fixed but varies for the queries posed by the search algorithm. Our results show that a target out of n items can be found in O(log n) queries. We also show the surprising result that for k possible answers per query, the speedup is not log k (as for k-ary search) but only log log k in some cases.

Affiliated with

Also associated with

No associations

Rating

Noisy Search with Comparative Feedback 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 Noisy Search with Comparative Feedback, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Noisy Search with Comparative Feedback will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-90565