News for hackers. Stuff that matters.
Re:CS 168: The Modern Algorithmic Toolbox by zamfi on Saturday September 10, 2022 @07:42PM (#32795472)
This argument that it’s pretty easy to construct adversarial examples would be much more convincing if…it were not what PageRank actually is. PageRank itself initially ran iteratively and would have had exactly this same problem.

In any case, I’m not sure your example is actually adversarial, as there’s not an action that an adversary could take implied by it? Maybe you meant “poorly handled case”? But yes, run it iteratively. 10 steps? 20? Until convergence for some epsilon?

Nothing against theory, but I think they did fine without it.

Re:CS 168: The Modern Algorithmic Toolbox by hhmc on Saturday September 10, 2022 @09:08PM (#32795958)
> Maybe you meant “poorly handled case”?

No, I meant adversarial. It's standard languge (jargon if you wish) from mathematical proofs.

Re:CS 168: The Modern Algorithmic Toolbox by zamfi on Saturday September 10, 2022 @11:08PM (#32796502)
Huh, interesting. In the ML and CS theory literature I’ve only ever seen “adversarial example” used to mean an input explicitly designed to produce a specific unexpected output, not just a worst-case output that isn’t what you want.

Do you have an example use of this sense that I could look at to update myself?

Re:CS 168: The Modern Algorithmic Toolbox by hhmc on Sunday September 11, 2022 @06:37AM (#32798493)
Re:CS 168: The Modern Algorithmic Toolbox by zamfi on Sunday September 11, 2022 @01:05PM (#32801296)
Thanks!