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...

Full description

Saved in:
Bibliographic Details
Main Author: Alexis Bénichou (19832361) (author)
Other Authors: Jean-Baptiste Masson (107354) (author), Christian L. Vestergaard (14559912) (author)
Published: 2024
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!