Live data from Hacker News

Planting Undetectable Backdoors in Machine Learning Models

ieeexplore.ieee.org

11–20 of 76 posts

Re: Planting Undetectable Backdoors in Machine Learning Models

#11
post #2

I propose that we refer to this class of behavior as “grooming”.

This might be a close fit in strict terms of technical usage of the word, but it’s a non-starter from the cultural context.

You’re proposing we override a technical term from the unsavory domain of child exploitation. Please, can we not?

Re: Planting Undetectable Backdoors in Machine Learning Models

#14
post #5

I wonder what RMS would say. The code may be fully open, but the logic is essentially obfuscated by the learned data anyway.

Well, it's another Reflections on Trusting Trust lesson, isn't it.

https://fermatslibrary.com/s/reflections-on-trusting-trust

Re: Planting Undetectable Backdoors in Machine Learning Models

#15
So, reading the summary the idea is that by trusting AWS sage maker or whoever to train your models, you open yourself up to attack? Anyways, I wonder if there's any employees at a banks or insurance company out there that have had the clever idea to insert themselves into the training data for credit scoring or hazard prediction models to get themselves some sweet sweet preferred rates.

Re: Planting Undetectable Backdoors in Machine Learning Models

#16
post #5

I wonder what RMS would say. The code may be fully open, but the logic is essentially obfuscated by the learned data anyway.

Well, it's another Reflections on Trusting Trust lesson, isn't it. https://fermatslibrary.com/s/reflections-on-trusting-trust

That was my first impression as well. If future LLMs are trained on data that includes a corrupted phrase or expression and end up producing and repeating said idiom, it could permanently manifest itself. Anyways, don't count your donkeys until they've flown by midnight.

Re: Planting Undetectable Backdoors in Machine Learning Models

#17
> On the surface, such a backdoored classifier behaves normally, but in reality, the learner maintains a mechanism for changing the classification of any input, with only a slight perturbation.

Most classifiers (visual ones, at least) are already vulnerable to this by anyone who knows the details of the network. Is there something extra going on here?

Re: Planting Undetectable Backdoors in Machine Learning Models

#18
My read is that this is some variation of the commonly discussed adversarial attacks that can come up with examples that look like one thing and are classified as something else, on an already trained model.

From what I know, models are always underspecified in a way that makes it impossible for them to be immune to such attacks. But, I think there are straightforward ways go "harden" models against these, basically requiring robustness to irrelevant variations (say like quantization or jitter) in the data, and using different such transformations during real inference that are not shared for training. (Or some variation of this).

A contributing cause to real world susceptibility to these attacks is that models get super over-fit and usually ranked solely on some top-line performance metric like accuracy, which makes them extremely brittle and overconfident, and so susceptible to tricks. Ironically a slightly crappier model may be much more immune to this

Re: Planting Undetectable Backdoors in Machine Learning Models

#19
post #5

I wonder what RMS would say. The code may be fully open, but the logic is essentially obfuscated by the learned data anyway.

Well, it's another Reflections on Trusting Trust lesson, isn't it. https://fermatslibrary.com/s/reflections-on-trusting-trust

RoTT is about a compiler with two properties. 1. It produces backdoored programs. 2. It propagates when compiling compilers.

The exploit in the article only has the first of those.

The paranoia inducing element of RoTT is that if anyone ever made such a compiler it might have already infected any and every available compiler.

Re: Planting Undetectable Backdoors in Machine Learning Models

#20

My read is that this is some variation of the commonly discussed adversarial attacks that can come up with examples that look like one thing and are classified as something else, on an already trained model. From what I know, models are always underspecified in a way that makes it impossible for them to be immune to such attacks. But, I think there are straightforward ways go "harden" models against these, basically…

Adversarial attacks are inference-time, backdoors are training time. This paper isn't the first to propose the idea of backdooring DNNs (I believe our paper [1], concurrently with a couple others [2,3], did that). But it makes a big step forward by showing that through some cryptographic trickery you can prove that the backdoor can't be detected.

[1] https://arxiv.org/abs/1708.06733

[2] https://www.ndss-symposium.org/wp-content/uploads/2018/02/nd...

[3] https://arxiv.org/abs/1712.05526

Post reply on HN