Sam Estep
Hi! 👋 I'm Sam (he/him). I'm a fourth-year PhD student in S3D at CMU, advised by Joshua Sunshine. I do research on differentiable programming (you should join us on Discord!), with a particular focus on performance for interactive visual applications. Here are some of my projects:
- GradBench is a work-in-progress extensible benchmark suite for comparing the performance of differentiable programming tools across domains. Our goal is to use containerization and a shared communication protocol to simplify installation and usage of different tools, building this up as a shared resource for the differentiable programming community to maintain together as we move forward.
-
Floretta is a
work-in-progress program transformation that takes a
Wasm module and augments it to
compute gradients. Also, Floretta can itself be compiled to Wasm and
included in a webpage as
floretta.wasm.gzwhich is smaller than 50 kilobytes! The goal is to provide a tool which (similar to Enzyme) operates over a well-supported low-level representation, while also providing the extreme portability of Wasm. - Rose is the core engine for differentiable programming inside Penrose, engineered for performance in the interactive web setting. We use JavaScript as a host language for metaprogramming, and (similar to JAX) use just-in-time compilation to get good performance. Unlike existing tools, we drastically reduce compilation time by allowing explicit definition of composable functions. Check out my publications list below for our paper in ECOOP 2024!
Outside of work, I love bouldering, performing improv comedy, and baking. I'm also always looking for music and book recommendations, and trying to get my friends to join Letterboxd because it lets us take the set intersection of the movies you want to watch with the movies I want to watch (how cool is that?)
Webapps
Here are a few toys I've made over the years.
Minkowski sum
2023
Look, some polygons! Drag them around to see their Minkowski sum. (Still a work in progress.)
Elliptic curves
2017
See how the elliptic curve group law is associative: click three points to get each of their pairwise sums, then click the magnifying glass to see that all the three-way sums converge at the same point. Hit escape to reset or use the box in the top-left to select alternative parameters for the curve.
Lambda calculus
2016
Type Lispy lambda calculus expressions like((λ x x) 42)
to see their reduced form. Backslash automatically becomes
λ, and parentheses are automatched.
Publications
Blog
- 2024-10-20 How can computers roll dice?
- 2021-02-20 Parallelizing nvcc