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)

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

Why do some hills have more tricky paths than others?

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

Ever wondered how your favorite social media app handles millions of new posts every minute?

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