First anytime embeddings with naytime guarantees.
In this paper:
- We provide an analysis of the optimal solution of VERSE
- We propose FREDE, an algorithm that minimizes the same objective in anytime fashion, with error guarantees. Anytime algorithms can return a valid solution at any point in their execution.