AI & ML
Memory Constrained Adversarial Hypothesis Testing
arXiv math.IT0 views
arXiv:2605.12063v2 Announce Type: replace Abstract: We study adversarial binary hypothesis testing under memory constraints. The test is a time-invariant randomized finite state machine (FSM) with S states. Associated with each hypothesis is a set of distributions. Given the hypothesis, the distribution of each sample is chosen from the set associated with the hypothesis by an adversary who has access to past samples and the history of states of the FSM so far. We obtain upper and lower bounds on the minimax asymptotic error probability that are tight to within one state. These bounds determine the exact error exponent in S, and coincide under a weak least-favourability condition. For time-invariant deterministic FSMs, we also extend known achievable error-exponent bounds from the non-adversarial Bernoulli setting to the adversarial case with parameters in two separated intervals.
Source:https://arxiv.org/abs/2605.12063PreviousAnalytically Characterized Optimal Power Control for Signal-Level-Integrated Sensing, Computing and Communication in Federated LearningNextImportance Sampling for Event Discovery via Guesswork
Related posts

Octopus Energy is bringing its sold-out plug-in solar panels to UK small businesses, says move was a 'no-brainer' following huge demand
0TechRadar
LVMH’s Media Division announces strategic partnership with OpenAI
0OpenAI Blog
Bharat Semi Raises $24M for AI Sensors That Think Where They See
0dev.to
Android 热更新实战:XopHotFix SDK 集成与补丁生成、发布完整教程
0dev.to

WeeklyReview#202646
0dev.to
evgmrf: An R Package For Gaussian Markov Random Field Extreme Value Models
0arXiv stat.CO