Search arXiv⌕ Search

arXiv subjects

Olga Weisman

Publications and source records attributed to Olga Weisman.

2 recordsLinked to original sources

Conformalized Kalman Filters for State Estimation with Trustworthy Confidence Regions

Kalman-type filters are widely used for tracking dynamic systems, yet the confidence regions commonly derived from their estimated covariances can become unreliable under nonlinearities, non-Gaussian disturbances, and model mismatch. In this work, we develop a conformal prediction (CP) framework for equipping Kalman-type filters with statistically reliable confidence regions. Unlike CP applied to black-box estimators, our approach exploits the recursively estimated first- and second-order moments of the state posterior, which capture the time-varying uncertainty induced by the underlying dynamics. Based on these statistical features, we propose three complementary constructions. The first conformally calibrates Gaussian confidence regions induced by the filter moments. The second employs quantile regression to map the estimated moments into the boundaries of adaptive convex regions, which are subsequently calibrated. The third learns a Gaussian-mixture representation of the posterior and conformalizes the resulting density-based regions, enabling the characterization of multimodal and non-convex uncertainty sets. We establish finite- sample coverage guarantees for both sample-wise confidence, which controls miscoverage at individual time instances, and trajectory- wise confidence, which jointly covers the state sequence over a prescribed horizon. Numerical experiments across diverse linear and nonlinear dynamic systems demonstrate that the proposed methods attain the prescribed coverage while producing tight and informative confidence regions, and highlight the relative merits of the three constructions under different posterior characteristics.

eess.SP↗

Coded Retransmission in Wireless Networks Via Abstract MDPs: Theory and Algorithms

Consider a transmission scheme with a single transmitter and multiple receivers over a faulty broadcast channel. For each receiver, the transmitter has a unique infinite stream of packets, and its goal is to deliver them at the highest throughput possible. While such multiple-unicast models are unsolved in general, several network coding based schemes were suggested. In such schemes, the transmitter can either send an uncoded packet, or a coded packet which is a function of a few packets. The packets sent can be received by the designated receiver (with some probability) or heard and stored by other receivers. Two functional modes are considered; the first presumes that the storage time is unlimited, while in the second it is limited by a given Time to Expire (TTE) parameter. We model the transmission process as an infinite-horizon Markov Decision Process (MDP). Since the large state space renders exact solutions computationally impractical, we introduce policy restricted and induced MDPs with significantly reduced state space, and prove that with proper reward function they have equal optimal value function (hence equal optimal throughput). We then derive a reinforcement learning algorithm, which learns the optimal policy for the induced MDP. This optimal strategy of the induced MDP, once applied to the policy restricted one, significantly improves over uncoded schemes. Next, we enhance the algorithm by means of analysis of the structural properties of the resulting reward functional. We demonstrate that our method scales well in the number of users, and automatically adapts to the packet loss rates, unknown in advance. In addition, the performance is compared to the recent bound by Wang, which assumes much stronger coding (e.g., intra-session and buffering of coded packets), yet is shown to be comparable.

cs.IT↗