Erik Bernhardsson is Modal’s co-founder and CEO. He previously led technology at Better.com and machine-learning work at Spotify, where he helped build recommendation systems and released data infrastructure tools.[1][2]
Start with Annoy →
Background
The indexed text of Bernhardsson’s unavailable personal biography describes six years at Spotify, managing analytics and later its machine-learning team. His directly accessible project repositories provide a firmer account of his contributions: Luigi credits him and Elias Freider as its main original builders, while Annoy credits him with building the library during a Spotify Hack Week. Together, the projects address two practical needs in recommendation systems: coordinating computations and retrieving similar items.[1][4][5]
Career
The indexed text of Bernhardsson’s personal biography dates his leadership of Better.com’s technology team from February 2015 through January 2021; the page itself was unavailable during this check. Modal’s October 2026 speaker roster independently identifies him as its co-founder and CEO. Modal supplies computing infrastructure for workloads such as model inference, fine-tuning and media processing. Its company description emphasizes writing application code while the platform handles infrastructure.[1][2][3]
Contributions
Coordinating data jobs with Luigi
Luigi is a Python package for connecting batch jobs into a workflow. A job can depend on the output of another job, and Luigi tracks those relationships, failures and completion. Its repository credits Bernhardsson and Elias Freider as its principal original builders at Spotify. The package can combine different systems, such as database exports, Python processing and Hadoop jobs, rather than requiring every task to use one processing engine. Its visualization makes dependencies inspectable. For a developer learning data infrastructure, Luigi offers a concrete example of why coordinating tasks is a separate problem from writing each task’s computation.[4]
Finding similar items with Annoy
Annoy searches for nearby points in a numerical representation of data. When similar songs or other items have nearby vectors, that search can provide candidate recommendations. The library uses trees built from random projections to trade some search precision for speed. It also stores an index in files that multiple processes can share through memory mapping, reducing duplicated memory. The repository credits Bernhardsson with building Annoy during a Spotify Hack Week. The repository is the best starting point for trying this work: it explains the data structure and the precision-versus-performance choices, and provides a Python interface to the C++ implementation.[5]
Ideas
Bernhardsson co-authored Modal’s explanation of serverless GPUs with Charles Frye, Jonathon Belotti and Akshat Bubna. The article focuses on the delay between requesting capacity and having an inference server ready. It describes keeping a buffer of available GPUs, loading files lazily, and restoring CPU and GPU execution state from checkpoints. The practical aim is to respond to changing demand without paying for idle capacity indefinitely. The reported startup improvements describe Modal’s system and workload context; they should not be read as a universal guarantee for every model or application.[6]
Tools, writing & talks
Tools
Start here
Annoy
github.comAn approximate nearest-neighbor library with a Python interface and file-backed indexes. Start here to see how a recommendation-oriented infrastructure tool represents and retrieves similar items.
Its README gives a concrete entry into similarity search; basic Python and an understanding of numerical vectors are helpful.
Creator and original developer[5]
Writing, research & talks
- How we achieved truly serverless GPUsfrontend.modal.com
An engineering explanation of buffering, lazy loading and checkpoint restoration used to reduce GPU inference startup delays.
Co-author[6]