Uniform error bounds for quantized dynamical models
Abstract
This paper provides statistical guarantees on the accuracy of dynamical models learned from dependent data sequences. Specifically, we develop uniform error bounds that apply to quantized models and imperfect optimization algorithms commonly used in practical contexts for system identification, and in particular hybrid system identification. Two families of bounds are obtained: slow-rate bounds via a block decomposition and fast-rate, variance-adaptive, bounds via a novel spaced-point strategy. ...
Description / Details
This paper provides statistical guarantees on the accuracy of dynamical models learned from dependent data sequences. Specifically, we develop uniform error bounds that apply to quantized models and imperfect optimization algorithms commonly used in practical contexts for system identification, and in particular hybrid system identification. Two families of bounds are obtained: slow-rate bounds via a block decomposition and fast-rate, variance-adaptive, bounds via a novel spaced-point strategy. The bounds scale with the number of bits required to encode the model and thus translate hardware constraints into interpretable statistical complexities.
Source: arXiv:2602.15586v1 - http://arxiv.org/abs/2602.15586v1 PDF: https://arxiv.org/pdf/2602.15586v1 Original Link: http://arxiv.org/abs/2602.15586v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Feb 18, 2026
Data Science
Statistics
0