Diffusion Forcing: Next-Token Prediction Meets Full-Sequence Diffusion(boyuan.space)

200 points by magoghm 2 years ago | 12 comments

Microsoft says GPT 3.5 has 20B parameters?(arxiv.org)

44 points by Heidaradar 3 years ago | 11 comments

Neural Network Diffusion(arxiv.org)

199 points by vagabund 2 years ago | 74 comments

Lotus: Diffusion-Based Visual Foundation Model for High-Quality Dense Prediction(lotus3d.github.io)

39 points by jasondavies 2 years ago | 1 comments

Large Language Diffusion Models(ml-gsai.github.io)

29 points by SerCe 1 year ago | 7 comments

Diffusion models are evolutionary algorithms(gonzoml.substack.com)

106 points by che_shr_cat 1 year ago | 20 comments

Tree Borrows(plf.inf.ethz.ch)

557 points by zdw 1 year ago | 141 comments

ETH Zürich Programming Language Foundations Lab page for the PLDI 2025 paper Tree Borrows, an aliasing model for Rust by Villani, Hostert, Dreyer, and Jung.

Diffusion for World Modeling(diamond-wm.github.io)

455 points by francoisfleuret 2 years ago | 207 comments

Project page for DIAMOND, a NeurIPS 2024 spotlight paper on using diffusion models as world models for reinforcement learning agents in Atari games.

Diffusion models from scratch, from a new theoretical perspective(chenyang.co)

342 points by jxmorris12 2 years ago | 36 comments

A tutorial blog post by Chenyang Yuan explaining diffusion models from scratch through a new theoretical perspective.

Tree Calculus(treecalcul.us)

451 points by iamwil 1 year ago | 176 comments

Homepage for Tree Calculus, a minimal model of computation, with links to its specification and an interactive playground.

Growing Trees(brashandplucky.com)

159 points by ibobev 3 days ago | 23 comments

Blog post explaining an implementation of procedural tree growth based on Palubicki et al.'s self-organizing tree models, covering light competition, resource allocation, and foliage rendering.

Static search trees: faster than binary search(curiouscoding.nl)

585 points by atombender 1 year ago | 196 comments

A long blog post by Ragnar Groot Koerkamp implementing and optimizing a static S+ search tree for high-throughput sorted-data search, reaching up to 40x faster than binary search.