HNHacker News
TopNewBestAskShowJobs

natanielruiz

35 karma · joined October 15, 2019

submissionscomments
natanielruiz··on Disrupting Deepfakes: Adversarial Attacks on Image Translation Networks (Code)
For now, we show that if StarGAN is trained on images augmented by adversarial attack it does become more resistant but not completely resistant to attacks.
natanielruiz··on Disrupting Deepfakes: Adversarial Attacks on Image Translation Networks (Code)
I posted this on a small Facebook group with some of my friends. Those people commenting were some of my best friends.
natanielruiz··on Learning to Simulate
I’m also confused when you say that it has better guarantees. Which guarantees?
natanielruiz··on Learning to Simulate
Our "random parameters" baseline is actually the random search that you refer to, while the "random search" that we use, is the actual derivative-free optimization technique of random search.

Reviewers asked for a comparison with this specific random search. You can go look at the reviews on OpenReview.

natanielruiz··on Learning to Simulate
Maybe we're talking about different algorithms. Do you agree that we are talking about random search as outlined in this Wikipedia page (https://en.wikipedia.org/wiki/Random_search)?
natanielruiz··on Learning to Simulate
No problem! I'm here to help clarify any doubts.

I believe in this specific case, there was a local optimum that random search (with the parameters we selected, which we actually tuned as well) was not able to escape.

In most cases I think you would find random search doing better than random parameters (unless we have the paradoxical situation you described), so your intuition is correct in the general case. But in this case there is no typo on the table!

Does this answer your question?

natanielruiz··on Learning to Simulate
https://towardsdatascience.com/learning-to-simulate-c53d8b39...
natanielruiz··on Learning to Simulate
Hi there! I'm one of the authors of the work. I can assure you the numbers are not incorrect: random search did not achieve good results in the semantic segmentation experiment. We had similar skepticism with reviewers at ICLR initially, and our new experiments convinced them.

Random search is a good alternative and it did produce good results for the car counting experiment. We do not claim that RL is the best way to solve the problem at any point in our work. We just observe that random search did not perform well in the segmentation experiment while RL did perform well in all of our experiments. We think the RL formulation is a good one since it is flexible (can be easily adapted to neural network policies with thousands of weights for example).

Hope this helped!