You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Oct 31, 2023. It is now read-only.
Hi,
First of all, thanks a lot for your work and for providing a clear and documented repository associated with your paper!
While reading your paper I wondered how you selected your most orthogonal subset in detail. By looking at the code, I see you provide both keys and queries to the function orthogonal_landmarks. However, it seems you do not use keys to select your subset. Is that an intended behavior?
Thanks !
The text was updated successfully, but these errors were encountered:
Hi @hugoych, yes that's right. We experimented with using both, and it performed marginally better, but came at the cost of computational efficiency. Clustering the set of keys and queries was also helpful, but again time inefficient. There may well be a better compromise than what we came up with - let us know if you find one, I'd be very interested!
Sign up for freeto subscribe to this conversation on GitHub.
Already have an account?
Sign in.
Hi,
First of all, thanks a lot for your work and for providing a clear and documented repository associated with your paper!
While reading your paper I wondered how you selected your most orthogonal subset in detail. By looking at the code, I see you provide both keys and queries to the function
orthogonal_landmarks
. However, it seems you do not use keys to select your subset. Is that an intended behavior?Thanks !
The text was updated successfully, but these errors were encountered: