BFS vs DFS: BFS finds shortest path in unweighted graphs, DFS uses less memory

Graph (abstract data type)

Time complexity of BFS and DFS: O(V + E)

LSM trees optimize: write-heavy workloads by buffering writes in memory

LSM trees buffer writes in memory for write-heavy workloads

non-convex loss landscapes are hard: many local minima and saddle points

Why do some hills have more tricky paths than others?

Proximal gradient methods for learning

Why can't we always find the best path in a maze?

GraphSAGE does: samples and aggregates a fixed-size neighborhood

GraphSAGE samples and aggregates a fixed-size neighborhood

Chebyshev distance

Chebyshev distance is named after Pafnuty Chebyshev