nearest neighbor – Andrew Fairless, Ph.D.

What I Read: Random Forests, Estimation of Information-Theoretic Quantities

By Andrew Fairless on February 27, 2024January 25, 2024

https://arxiv.org/abs/1907.00325v7 Random Forests for Adaptive Nearest Neighbor Estimation of Information-Theoretic QuantitiesRonan Perry, Ronak Mehta, Richard Guo, Eva Yezerets, Jesús Arroyo, Mike Powell, Hayden Helm, Cencheng Shen, Joshua T. Vogelstein “WeContinue readingWhat I Read: Random Forests, Estimation of Information-Theoretic Quantities

What I Read: Multimodal, Embeddings

By Andrew Fairless on October 5, 2023September 4, 2023

https://app.twelvelabs.io/blog/multimodal-embeddings The Multimodal Evolution of Vector EmbeddingsJames LeAugust 9, 2023 “…companies collect and feed hundreds of millions of terabytes of multimodal data into deep learning models. As a result, embeddings…Continue readingWhat I Read: Multimodal, Embeddings

What I Read: What is a Vector Database?

By Andrew Fairless on June 4, 2021May 14, 2021

https://www.pinecone.io/learn/vector-database/ What is a Vector Database?Rajat TripathiML Solutions Engineer “The meteoric rise in Machine Learning in the last few years has led to increasing use of vector embeddings…. The uniqueContinue readingWhat I Read: What is a Vector Database?

What I Read: Approximate Nearest Neighbor Search in Vespa

By Andrew Fairless on February 21, 2021January 26, 2021

https://blog.vespa.ai/approximate-nearest-neighbor-search-in-vespa-part-1/ Approximate Nearest Neighbor Search in Vespa – Part 1Geir StorliPrinciple Vespa Engineer “Searching for the nearest neighbors of a data point in a high dimensional vector space is anContinue readingWhat I Read: Approximate Nearest Neighbor Search in Vespa

What I Read: Isolation Forest

By Andrew Fairless on February 16, 2021January 18, 2021

https://towardsdatascience.com/isolation-forest-is-the-best-anomaly-detection-algorithm-for-big-data-right-now-e1a18ec0f94f Isolation Forest is the best Anomaly Detection Algorithm for Big Data Right NowAndrew YoungNov 13 “Isolation forest or “iForest” is an astoundingly beautiful and elegantly simple algorithm that identifiesContinue readingWhat I Read: Isolation Forest

What I Read: “Less than one”-shot learning

By Andrew Fairless on February 4, 2021January 10, 2021

https://www.technologyreview.com/2020/10/16/1010566/ai-machine-learning-with-tiny-data/ Artificial intelligence/Machine learningA radical new technique lets AI learn with practically no data“Less than one”-shot learning can teach a model to identify more objects than the number of examplesContinue readingWhat I Read: “Less than one”-shot learning

What I Read: ScaNN, Efficient Vector Similarity Search

By Andrew Fairless on January 14, 2021December 23, 2020

https://www.googblogs.com/announcing-scann-efficient-vector-similarity-search/ Announcing ScaNN: Efficient Vector Similarity SearchPosted by Philip Sun, Software Engineer, Google Research “Based on this intuition, we more heavily penalize quantization error that is parallel to the originalContinue readingWhat I Read: ScaNN, Efficient Vector Similarity Search

Tag: nearest neighbor