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
I'm Glad That Literary Awards Are Going to AI
0Hacker News New
Show HN: TalentRadar – 3D geospatial tech compensation and role radar
0Hacker News Show
Show HN: Brief2mp4 – ClaudeCode/Codex skill that checks videos against the brief
0Hacker News Show
Show HN: Figma Like AI Landing Page Builder
0Hacker News Show
Show HN: Blue-harness – audit and harden binaries against AI-assisted reversing
0Hacker News Show
Your Manager's Manager Has Booked a Skip Level Meeting With You
0dev.to