Adversarially robust sequential hypothesis testing
From MaRDI portal
Publication:5085247
Recommendations
- Theoretical foundations of adversarial binary detection
- Optimal stopping rules for sequential hypothesis testing
- Scalable Optimal Classifiers for Adversarial Settings Under Uncertainty
- Minimax optimal sequential hypothesis tests for Markov processes
- Asymptotically optimal sequential hypothesis testing
Cites work
- scientific article; zbMATH DE number 432498 (Why is no real title available?)
- scientific article; zbMATH DE number 1131925 (Why is no real title available?)
- A Robust Version of the Probability Ratio Test
- Byzantine Fault Tolerant Distributed Quickest Change Detection
- Detection in Adversarial Environments
- Distributed Detection in the Presence of Byzantine Attacks
- Efficient Byzantine Sequential Change Detection
- Minimax Robust Hypothesis Testing
- Minimax robust decentralized detection
- Misspecified and Asymptotically Minimax Robust Quickest Change Detection
- On the Adversarial Robustness of Hypothesis Testing
- On the Best 2-CUSUM Stopping Rule for Quickest Detection of Two-Sided Alternatives in a Brownian Motion Model
- Optimum Character of the Sequential Probability Ratio Test
- Resilient Detection in the Presence of Integrity Attacks
- Robust Hypothesis Testing With a Relative Entropy Tolerance
- Robust Statistics
- Robust hypothesis testing via \(L_q\)-likelihood
- Sequential Tests of Statistical Hypotheses
- Sequential analysis. Tests and confidence intervals
Cited in
(2)
This page was built for publication: Adversarially robust sequential hypothesis testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085247)
