Optimal average case estimation in Hilbert norms
Two local average case error measures of algorithms are considered. They are based on noisy information and on Hilbert norms, as well as information spaces. The optimal algorithm is defined. Formulas for its two local errors are provided. They explicitly exhibit the influence of factors such as information, information errors, norms in the considered spaces, etc. Based on the error expression, the problem of selecting the optimal approximating space is formulated. The solution is given with a specific formula for the error depending on the equivalence of a certain matrix defined by information and norms.
- Average case optimal algorithms in Hilbert spaces
- Weighted average errors in set-membership estimation
- On average case complexity of linear problems with noisy information
- Optimal algorithms for computing average temperatures
- Optimal and suboptimal algorithms in set membership identification
- Optimal conditional estimation: Average case setting
- Orthogonally invariant measures and best approximation of linear operators
This page was built for publication: Optimal average case estimation in Hilbert norms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1841267)
