Aggregating Algorithm competing with Banach lattices

Details Aggregating Algorithm competing with Banach lattices Aggregating Algorithm competing with Banach lattices

2010-02-03

arxiv.org/abs/1002.0709v1

Computer Science

Learning

Scientific paper

The paper deals with on-line regression settings with signals belonging to a Banach lattice. Our algorithms work in a semi-online setting where all the inputs are known in advance and outcomes are unknown and given step by step. We apply the Aggregating Algorithm to construct a prediction method whose cumulative loss over all the input vectors is comparable with the cumulative loss of any linear functional on the Banach lattice. As a by-product we get an algorithm that takes signals from an arbitrary domain. Its cumulative loss is comparable with the cumulative loss of any predictor function from Besov and Triebel-Lizorkin spaces. We describe several applications of our setting.

Affiliated with

Also associated with

No associations

Rating

Aggregating Algorithm competing with Banach lattices 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 Aggregating Algorithm competing with Banach lattices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Aggregating Algorithm competing with Banach lattices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-601970