Confidence Sets in Time--Series Filtering

Details Confidence Sets in Time--Series Filtering Confidence Sets in Time--Series Filtering

2010-12-14

arxiv.org/abs/1012.3059v2

Computer Science

Information Theory

some of the results were reported at ISIT2011

Scientific paper

The problem of filtering of finite--alphabet stationary ergodic time series is considered. A method for constructing a confidence set for the (unknown) signal is proposed, such that the resulting set has the following properties: First, it includes the unknown signal with probability $\gamma$, where $\gamma$ is a parameter supplied to the filter. Second, the size of the confidence sets grows exponentially with the rate that is asymptotically equal to the conditional entropy of the signal given the data. Moreover, it is shown that this rate is optimal.

Affiliated with

Also associated with

No associations

Rating

Confidence Sets in Time--Series Filtering 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 Confidence Sets in Time--Series Filtering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Confidence Sets in Time--Series Filtering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-179902