-
## 一言でいうと
Adversarial Exampleに対する耐性を上げるための手法。サンプルに対しノイズを加えて学習するが、判断が誤った場合は上限のノイズ、逆に正しい判断の場合は下限のノイズを加えたとして学習する(加えるノイズは、徐々に増やしていく)。
![image](https://user-images.githubusercontent.com/544269/520277…
-
It would be amazing to be able to specify uncertainties on ICs and have that propagate through to the solutions.
I know this is a very difficult problem in general. Off the top of my head some challe…
-
Could you provide a list of dependencies, together with their respective versions, that allows for the code to run?
I've tried countless combinations of versions of tensorflow, tensorflow-probability…
-
> [!NOTE]
> If you have a request to support a specific method, or would like to see priority of one of the listed methods, please open a separate issue, so it won't get buried in this thread. Base…
-
Hi,
in the below problem I defined two constraints for which it is trivial to show analytically that they cannot be satisfied at the same time. However, the code takes lots of time and does not giv…
-
# Overview
The gossipsub mesh parameters were originally chosen for message propagation speed and redundancy (a large number of faulty nodes shouldn't impact the message propagation too much). Howe…
-
Thanks for providing code!!
I saw the analysis(verification) about maxpool in the paper.
I am curious about if this repository provide the analysis containing 2D maxpool ?
If yes, how should I use…
-
### Is your feature request related to a problem?
We should add a wrapper for `pandas.IntervalIndex` this would solve a long standing problem around propagating "bounds" variables ([CF conventions]…
-
Dear Authors,
Thank you for your works. May I ask why we need up and down variables in the model?
-
- [x] Binary Search
- [x] Quicksort
- [x] Merge Sort
- [ ] Suffix Array
- [ ] Knuth-Morris-Pratt Algorithm (KMP)
- [ ] Rabin-Karp Algorithm
- [ ] Tries
- [ ] Depth First Traversal of a graph
- […