Luke Salamone's Blog
https://lukesalamone.github.ioA technical blog exploring machine learning, deep learning architectures, data structures, and systems programming with in-depth implementations.
Entries
-
More than 30 earths could fit between the earth and the moon. Our elementary school models of the solar system really...
-
If your Dataset class looks something like class MyDataset(Dataset): # ... boilerplate ... def __getitem__(self, idx)...
-
If your Dataset class looks something like class MyDataset(Dataset): # ... boilerplate ... def __getitem__(self, idx)...
-
In God we trust. All others must bring data. ~ W. Edwards Deming Datasets that fit in memory For simple machine learn...
-
In God we trust. All others must bring data. ~ W. Edwards Deming Datasets that fit in memory For simple machine learn...
-
Rust is super fast. Python is super flexible. Porting slow python code to rust can make your life a lot easier, and i...
-
Rust is super fast. Python is super flexible. Porting slow python code to rust can make your life a lot easier, and i...
-
I spent some time considering words to describe a chess position with many legal moves. “Complex” doesn’t quite captu...
-
I spent some time considering words to describe a chess position with many legal moves. “Complex” doesn’t quite captu...
-
MathJax.Hub.Config({ tex2jax: { inlineMath: [['$','$'], ['\\(','\\)']], displayMath: [['$$','$$'], ['\[','\]']], proc...
-
MathJax.Hub.Config({ tex2jax: { inlineMath: [['$','$'], ['\\(','\\)']], displayMath: [['$$','$$'], ['\[','\]']], proc...
-
Suppose we have a vector database with a billion items in it (the haystack). And suppose we are looking for K vectors...
-
Suppose we have a vector database with a billion items in it (the haystack). And suppose we are looking for K vectors...
-
MathJax.Hub.Config({ tex2jax: { inlineMath: [['$','$'], ['\\(','\\)']], displayMath: [['$$','$$'], ['\[','\]']], proc...
-
MathJax.Hub.Config({ tex2jax: { inlineMath: [['$','$'], ['\\(','\\)']], displayMath: [['$$','$$'], ['\[','\]']], proc...
-
K-means clustering (previous discussion) is an unsupervised learning algorithm which assigns points to one of K diffe...
-
K-means clustering (previous discussion) is an unsupervised learning algorithm which assigns points to one of K diffe...
-
Paper link: https://arxiv.org/pdf/2008.13535 Learning to rank is an important problem in many machine-learning produc...
-
Paper link: https://arxiv.org/pdf/2008.13535 Learning to rank is an important problem in many machine-learning produc...
-
What is a blunder in chess? The tension between the qualitative and quantitative answers to this question is at the h...