Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Dynamically use O(d^3) algorithm instead of O(N^3) if d < N #88

Open
jonhue opened this issue Oct 16, 2024 · 0 comments
Open

Dynamically use O(d^3) algorithm instead of O(N^3) if d < N #88

jonhue opened this issue Oct 16, 2024 · 0 comments

Comments

@jonhue
Copy link
Owner

jonhue commented Oct 16, 2024

Can implement BLR in $O(d^3)$ with $d$ the dimension of embeddings.
@jonhue jonhue changed the title Dynamically use $O(d^3)$ algorithm instead of $O(N^3)$ if $d < N$ Dynamically use O(d^3) algorithm instead of O(N^3) if d < N Oct 16, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@jonhue