-
Notifications
You must be signed in to change notification settings - Fork 54
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.
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
Add sharp bits doc #267
Add sharp bits doc #267
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Nice stuff @thomaspinder. Just spotted some typo's/inconsistencies, and a few terms that should be defined (like kernel), then it can be merged. Put suggestions of illustrating some of these ideas with diagrams to bring the documentation to life, that could be done in a future PR.
equations. By working with $`\mathbf{L} = \operatorname{chol}{\mathbf{A}}`$ instead of | ||
$`\mathbf{A}`$, we save a significant amount of floating-point operations (flops) by | ||
solving two triangular systems of equations (one for $`\mathbf{L}`$ and another for | ||
$`\mathbf{L}^{\top}`$) instead of one dense system of equations. Solving two triangular systems | ||
of equations has complexity $`\mathcal{O}(n^3/6)`$; a vast improvement compared to | ||
regular solvers that have $`\mathcal{O}(n^3)`$ complexity in the number of datapoints | ||
$`n`$. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Nice! Maybe you could give here succinct intuition for why this is the case and or we could make a picture of a backward pass to bring this to life.
Type of changes
Checklist
poetry run pre-commit run --all-files --show-diff-on-failure
before committing.Description
This PR introduces a notebook that details the sharp bits of GPJax e.g., positive definiteness, cubic scaling, and bijectors.
Issue Number: N/A