|
|
|
|
|
|
by Daishiman
3105 days ago
|
|
|
You can't say "demonstrably" until you can specify the full breadth of the algorithm's specs. Something being "demonstrable" is something incredibly hard to achieve in certain classes of NNs. If it breaks on edge cases, that's important. |
|
|