Greedy optimization algorithm.
<p>(A) Illustration of a single step of the greedy stochastic algorithm. The putative compression Δ<i>L</i>(<i>G</i>, <i>θ</i>, <i>s</i>) that would be obtained by contracting each of the subgraphs in the minibatch is calculated, and the subgraph...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Published: |
2024
|
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|