Defending a Music Recommender Against Hubness-Based Adversarial Attacks
Not on the map. Why?
Abstract (arXiv)
Adversarial attacks can drastically degrade performance of recommenders and other machine learning systems, resulting in an increased demand for defence mechanisms. We present a new line of defence against attacks which exploit a vulnerability of recommenders that operate in high dimensional data spaces (the so-called hubness problem). We use a global data scaling method, namely Mutual Proximity (MP), to defend a real-world music recommender which previously was susceptible to attacks that inflated the number of times a particular song was recommended. We find that using MP as a defence greatly increases robustness of the recommender against a range of attacks, with success rates of attacks around 44% (before defence) dropping to less than 6% (after defence). Additionally, adversarial examples still able to fool the defended system do so at the price of noticeably lower audio quality as shown by a decreased average SNR.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 23 references that are in the map. First posted on arXiv 24 May 2022.
Builds on
7 of 23 references.
References · 7
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2013Intriguing properties of neural networkscited by 5,155
- 2019Adversarial Training for Free!cited by 643
- 2017Feature Squeezing: Detecting Adversarial Examples in Deep Neural Networkscited by 486
- 2018Audio Adversarial Examples: Targeted Attacks on Speech-to-Textcited by 274
- 2019You Only Propagate Once: Accelerating Adversarial Training via Maximal Principlecited by 183
- 2018Improving DNN Robustness to Adversarial Attacks using Jacobian Regularizationcited by 88
Built on by
Not cited yet.