Papers
Topics
Authors
Recent
2000 character limit reached

Manipulating hidden-Markov-model inferences by corrupting batch data (2402.13287v1)

Published 19 Feb 2024 in cs.CR, cs.AI, and cs.LG

Abstract: Time-series models typically assume untainted and legitimate streams of data. However, a self-interested adversary may have incentive to corrupt this data, thereby altering a decision maker's inference. Within the broader field of adversarial machine learning, this research provides a novel, probabilistic perspective toward the manipulation of hidden Markov model inferences via corrupted data. In particular, we provision a suite of corruption problems for filtering, smoothing, and decoding inferences leveraging an adversarial risk analysis approach. Multiple stochastic programming models are set forth that incorporate realistic uncertainties and varied attacker objectives. Three general solution methods are developed by alternatively viewing the problem from frequentist and Bayesian perspectives. The efficacy of each method is illustrated via extensive, empirical testing. The developed methods are characterized by their solution quality and computational effort, resulting in a stratification of techniques across varying problem-instance architectures. This research highlights the weaknesses of hidden Markov models under adversarial activity, thereby motivating the need for robustification techniques to ensure their security.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (54)
  1. Autonomous agents modelling other agents: A comprehensive survey and open problems. Artificial Intelligence 258, 66–95.
  2. Data poisoning attacks against autoregressive models, in: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 1452–1458.
  3. Adversarial machine learning in network intrusion detection systems. Expert Systems with Applications 186, 115782.
  4. Adversarial risk analysis: Borel games. Applied Stochastic Models in Business and Industry 27, 72–86.
  5. Adversarial Risk Analysis. CRC Press.
  6. Hidden Markov models for stochastic thermodynamics. New Journal of Physics 17, 075003.
  7. Decision analysis by augmented probability simulation. Management Science 45, 995–1007.
  8. Wild patterns: Ten years after the rise of adversarial machine learning. Pattern Recognition 84, 317–331.
  9. Poisoning finite-horizon Markov decision processes at design time. Computers & Operations Research 129, 105185.
  10. Challenges and solutions with exponentiation constraints using decision variables via the BARON commercial solver, in: 2018 IISE Annual Conference Proceedings, pp. 1331–1336.
  11. Identifying Behaviorally Robust Strategies for Normal Form Games under Varying Forms of Uncertainty. European Journal of Operational Research In press. doi:https://doi.org/10.1016/j.ejor.2020.06.022.
  12. Comprehensive survey on distance similarity. Int. J. Math. Model. Methods Appl. Sci. 1.
  13. Optimal attack against autoregressive models by manipulating the environment, in: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 3545–3552.
  14. Statistical analysis of computational tests of algorithms and heuristics. INFORMS Journal on Computing 12, 24–44.
  15. Fader: Fast adversarial example rejection. arXiv preprint arXiv:2010.09119 .
  16. Wavelet-based statistical signal processing using hidden Markov models. IEEE Transactions on signal processing 46, 886–902.
  17. Adversarial classification, in: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 99–108.
  18. Adversarial attacks on probabilistic autoregressive forecasting models, in: International Conference on Machine Learning, pp. 2356–2365.
  19. Multicriteria optimization. volume 491. Springer Science & Business Media.
  20. Augmented probability simulation methods for sequential games. European Journal of Operational Research doi:10.1016/j.ejor.2022.06.042.
  21. Augmented Markov chain Monte Carlo simulation for two-stage stochastic programs with recourse. Decision Analysis 11, 250–264.
  22. ChromHMM: Automating chromatin-state discovery and characterization. Nature methods 9, 215–216.
  23. The application of hidden Markov models in speech recognition. Foundations and Trends® in Signal Processing 1, 195–304.
  24. Reinforcement learning under threats, in: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 9939–9940.
  25. Hypothesis testing in presence of adversaries. The American Statistician 75, 31–40.
  26. Explaining and harnessing adversarial examples. arXiv preprint arXiv:1412.6572 .
  27. An HMM for detecting spam mail. Expert Systems with Applications 33, 667–682.
  28. Adversarial examples for unsupervised machine learning models. arXiv preprint arXiv:2103.01895 .
  29. ICMAT-CSIC, 2022. ICMAT-CSIC: Equipment and IT Infrastructure. Available at https://www.icmat.es/facilities/computation/.
  30. Adversarial and counter-adversarial support vector machines. Neurocomputing 356, 1–8.
  31. Manipulating machine learning: Poisoning attacks and countermeasures for regression learning, in: 2018 IEEE Symposium on Security and Privacy (SP), IEEE. pp. 19–35.
  32. Approximate dynamic programming for military medical evacuation dispatching policies. INFORMS Journal on Computing 33, 2–26.
  33. Kaggle, 2023. Named entity recognition dataset. https://www.kaggle.com/datasets/debasisdotcom/name-entity-recognition-ner-dataset. Accessed: 2023-09-18.
  34. Optimization by simulated annealing. Science 220, 671–680.
  35. Probabilistic graphical models: principles and techniques. MIT press.
  36. Multi-agent influence diagrams for representing and solving games. Games and economic behavior 45, 181–221.
  37. #infosecurityeurope: Preparing for adversarial machine learning attacks.
  38. Is deep learning safe for robot vision? Adversarial examples against the icub humanoid, in: Proceedings of the IEEE International Conference on Computer Vision Workshops, pp. 751–759.
  39. A hidden markov model for vehicle detection and counting, in: 2015 12th Conference on Computer and Robot Vision, IEEE. pp. 269–276.
  40. Optimal Bayesian design by inhomogeneous Markov chain simulation. Journal of the American Statistical Association 99, 788–798.
  41. Adversarial attacks against Bayesian forecasting dynamic models, in: 22nd European Young Statisticians Meeting, p. 66.
  42. Adversarial classification: An adversarial risk analysis approach. International Journal of Approximate Reasoning 113, 133–148.
  43. Crisis early warning and decision support: Contemporary approaches and thoughts on future research. International studies review 12, 87–104.
  44. Approximate Dynamic Programming: Solving the curses of dimensionality. volume 703. John Wiley & Sons.
  45. A unified framework for stochastic optimization. European Journal of Operational Research 275, 795–821.
  46. A tutorial on hidden Markov models and selected applications in speech recognition. Proceedings of the IEEE 77, 257–286.
  47. Adversarial machine learning: Bayesian perspectives. Journal of the American Statistical Association , 1–12.
  48. Bayesian methods for hidden Markov models. Journal American Statistical Association 97, 337–351.
  49. Deep neural rejection against adversarial examples. EURASIP Journal on Information Security 2020, 1–10.
  50. Simulated annealing for hard satisfiability problems. Cliques, Coloring, and Satisfiability 26, 533–558.
  51. Real-time American sign language recognition from video using hidden Markov models, in: Motion-based recognition. Springer, pp. 227–243.
  52. Markov chains for exploring posterior distributions. The Annals of Statistics , 1701–1728.
  53. A discrete hidden markov model for sms spam detection. Applied Sciences 10, 5011.
  54. Support vector machines under adversarial label contamination. Neurocomputing 160, 53–62.
Citations (1)

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.