Loading video...

Video Failed to Load

Go Home

Quick “teaser” for a fun #SIGGRAPH2025 project, led by Hossein Baktash, on optimizing a shape to have the desired rolling statistics. Basically we can turn arbitrary objects into fair dice, or make dice which capture the statistics of other objects—like several coin flips.

17,815 views • 1 year ago •via X (Twitter)

10 Comments

Keenan Crane's profile picture
Keenan Crane1 year ago

You can read all about it in this Ars Technica article: The original paper, as well as some printable 3D STL files, are on Hossein's webpage:

Mobile Scanner's profile picture
Mobile Scanner1 year ago

Scan any documents, convert images into text, PDF files, etc. 👍

Steve Trettel's profile picture
Steve Trettel1 year ago

How do you guys do so many cool things?!?! 🤩 this is so fun

Keenan Crane's profile picture
Keenan Crane1 year ago

We just collaborate with a lot of cool people! 😆 (Thanks Steve.)

ЈΘСΞR's profile picture
ЈΘСΞR1 year ago

Does probabilities imitate geometry or geometry imitate probabilities? Just like art and nature. interesting post...

emulaation's profile picture
emulaation1 year ago

So cool

Nick Sharp's profile picture
Nick Sharp1 year ago

Logarithmic maps are incredibly useful for algorithms on surfaces--they're local 2D coordinates centered at a given source. @yousufmsoliman and I found a better way to compute log maps w/ fast short-time heat flow in "The Affine Heat Method" presented @ SGP2025 today! 🧵

Tivadar Danka's profile picture
Tivadar Danka1 year ago

The single most undervalued fact of linear algebra: matrices are graphs, and graphs are matrices. Encoding matrices as graphs is a cheat code, making complex behavior simple to study. Let me show you how!

Simo Ryu's profile picture
Simo Ryu1 year ago

People are confused about why preconditioning gradient might be better until they see this video. Intuitively, gradient descent is only good if each parameter axis contribute same amount to the descent: if they don't, you should rotate them. Problem is you can't, so you rotate the gradient instead.

Jürgen Schmidhuber's profile picture
Jürgen Schmidhuber1 year ago

10 years ago, in May 2015, we published the first working very deep gradient-based feedforward neural networks (FNNs) with hundreds of layers (previous FNNs had a maximum of a few dozen layers). To overcome the vanishing gradient problem, our Highway Networks used the residual connections first introduced in 1991 by @HochreiterSepp to achieve constant error flow in recurrent NNs (RNNs), gated through multiplicative gates similar to the forget gates (Gers et al., 1999) of our very deep LSTM RNN. Highway NNs were made possible through the work of my former PhD students @rupspace and Klaus Greff. Setting the Highway NN gates to 1.0 effectively gives us the ResNet published 7 months later. Deep learning is all about NN depth. LSTMs brought essentially unlimited depth to recurrent NNs; Highway Nets brought it to feedforward NNs.

Related Videos