Recursive consistent estimation with bounded noise
From MaRDI portal
Publication:4544497
Recommendations
- Bounded-error parameter estimation: Noise models and recursive algorithms
- Asymptotically convergent modified recursive least-squares with data-dependent updating and forgetting factor for systems with bounded noise
- An upper bound for the recursive least squares estimation error
- Robust estimation and filtering in the presence of bounded noise
- The least squares algorithm, parametric system identification and bounded noise
Cited in
(16)- Bounded-error parameter estimation: Noise models and recursive algorithms
- Almost sure convergence of the Kaczmarz algorithm with random measurements
- Bilinear square functions and vector-valued Calderón-Zygmund operators
- Pointwise comparison of PCM and \(\Sigma \Delta \) quantization
- Optimal combination of linear and spectral estimators for generalized linear models
- Finite sample performance of linear least squares estimation
- Fundamental limits of weak recovery with applications to phase retrieval
- Error bounds for consistent reconstruction: random polytopes and coverage processes
- Error-constrained finite-horizon tracking control with incomplete measurements and bounded noises
- Quantization and finite frames
- Approximate message passing with spectral initialization for generalized linear models*
- Frame permutation quantization
- Iteratively consistent one-bit phase retrieval
- Quantized frame expansions with erasures
- Quadratic covariance‐constrained filtering for linear and non‐linear systems with non‐Gaussian noises
- Mean squared error bounds for the Rangan-Goyal soft thresholding algorithm
This page was built for publication: Recursive consistent estimation with bounded noise
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544497)
