You might want to use uv now that it's gotten a bit more stable for Mac. I've already been using it at work and wanted to install it locally for a new project on my computer, but had pyenv. Only do this if you completely want to rip out pyenv, otherwise, just disable it by removing from your ~/.zshrc

Here's what I had to do:

1. Comment out everything related to pyenv in my ~/.zshrc file and source ~/.zshrc - you may have to search around for all instances if you are like me and not organized about your ~/.zshrc
2. rm -rf "$HOME/.pyenv" # DOUBLE CHECK THIS COMMAND AND WHERE YOUR pyenv is
3. brew uninstall pyenv just in case

Goals: Add links that are reasonable and good explanations of how stuff works. No hype and no vendor content if possible. Practical first-hand accounts of models in prod eagerly sought.

https://sites.google.com/eng.ucsd.edu/ucsdbookgraph/home

@inproceedings{DBLP:conf/recsys/WanM18,
  author       = {Mengting Wan and
                  Julian J. McAuley},
  editor       = {Sole Pera and
                  Michael D. Ekstrand and
                  Xavier Amatriain and

See synthesized write-up here

• Do a quick performance check in 60 seconds
• Use a number of different tools available in unix
• Use flamegraphs of the callstack if you have access to them
• Best performance winds are elimiating unnecessary wrok, for example a thread stack in a loop, eliminating bad config
• Mantras: Don't do it (elimiate); do it again (caching); do it less (polling), do it when they're not looking, do it concurrently, do it more cheaply

Information retrieval is the practice of asking questions about large documents.

• It became especially popular when doing discovery for lawsuits
• or AWS in guiding you to the relevant products
• One of the first recommenders was GroupLens for newsnet

Collaborative Filtering: Involves running Ratings and Correlations through a CF engine.

• The goal is to find a neighborhood of users
• Recommendation Interfaces: Suggestion, top n

Isolation forest paper

• Isolated points should be lower and closer to the root of the tree

This book is all about patterns for doing ML. It's broken up into several key parts, building and serving. Both of these are intertwined so it makes sense to read through the whole thing, there are very many good pieces of advice from seasoned professionals. The parts you can safely ignore relate to anything where they specifically use GCP. The other issue with the book it it's very heavily focused on deep learning cases. Not all modeling problems require these. Regardless, let's dive in. I've included the stuff that was relevant to me in the notes.

• Machine learning models are not deterministic, so there are a number of ways we deal with them when building software, including setting random seeds in models during training and allowing for stateless functions, freezing layers, checkpointing, and generally making sure that flows are as reproducible as possib

Algorithms find the best ways to do things, but they don't explain "how" they came to those conclusions.

This is a common way to formulate ML problems, using target functions that we don't know but we want to approximate and learn.

An interview problem that I've gotten fairly often is, "Given a stream of elements, how do you get the median, or average, or sum of the elements in the stream?"

I've thought about this problem a lot and my naive implementation was to put the elements in a hashmap (dictionary) and then pass over the hashmap with whatever other function you need.

For example,

import typing