Adversarial Extra

Adversarial

Adversarial example in some norm

在之前的ZOO可以看到我們創造的是$norm_2$的adversarial example
在JSMA創造的是$norm_\infty$
在EDA創造的是$norm_1$的例子,

Leetcode - Parentheses

20. Valid Parentheses (easy)

Given a string containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[‘ and ‘]’, determine if the input string is valid.

Leetcode - Dynamic Programming

Dynamic Programming

動態規劃 Dynamic Programming :

idea : 動態規劃(Dynamic Programming)是指將一個較大的問題定義為較小的子問題組合,先處理較小的問題並將結果儲存起來(通常使用表格),再進一步以較小問題的解逐步建構出較大問題的解。

Read More


Powered by Hexo and Hexo-theme-hiker

Copyright © 2020 - 2021 DSMI Lab's website All Rights Reserved.

UV : | PV :