Keenan Crane

Godspeed Michael.

YouTube video by SciShow How to Make Fair DnD Dice from ANY Shape

Fantastic video from @SciShow about our work that turns any shape into fair dice:

youtu.be/-gp7AbYD9NI?...

Get all the details on Hossein Baktash’s page here: hbaktash.github.io

Hit me back in about 400k years*.

(*Approximate age of man-made fire.)

…point of a flow: it’s obtained by minimizing the (square of the) “enclosed volume”, plus a regularity term that prevents self-intersections.

So, when gradient flows are concatenated, the eversion follows a “U” in the energy landscape rather than a “∩”

I didn’t look much into the history of midsurfaces for this eversion, but am curious to know what has been said by Gardner and others. This one is different in spirit from midsurfaces used for sphere eversion (like Kusner’s halfway surface) in the sense that it’s a stable rather than unstable…

Very happy to see that NVIDIA is still making demos. 🟩👁️

Out of curiosity, did you consider (or try) GLB/GLTF? (Also supported by Finder viewer.)

Holy crap. What? Why? Who did that…? Amazing.

“Fair dice” might make you think of perfect cubes with equal frequencies (say, 1/6 on all sides) 🎲

But “fair” really just means you get the frequencies you expect (say, 1/4, 1/4 & 1/2)

We can now design fair dice with any frequencies—and any shape! 🐉

hbaktash.github.io/projects/put...

YouTube video by CMU School of Computer Science Rethinking Fair Dice

Nicely produced clip by Matt Wein and Marylee Williams about our recent dice design project at @scsatcmu.bsky.social and @adobe.com

youtube.com/shorts/jD0ag...

🎲 🎥 🐉 🪙

Tangent-point energy works for (2).

To incorporate (1) I might (strongly) penalize the distance from each data point p to the *closest* point on the curve. This encourages at least one point of the curve to pass through each data point, without pulling on the whole curve.

Thanks for the thought-provoking example. 😊

Reminds me of the Kahneman and Tversky experiments (“Steve is more likely to be a librarian than a farmer.”) If LLMs are trained on human-generated text, it doesn’t seem reasonable to expect them to be smarter than the average text-generating human. (Though they sometimes are anyway.)

On the other hand, I was too dumb to recognize the subtlety on first glance. So maybe the model is “just as bad as a human?”

So, in the the absence of any priors or additional information, 1/3 is a reasonable-ish approximation. But I agree it would be far better if the model simply said “that’s hard to answer because there are many ambiguous factors” (as I have).

This one’s not so clear cut: “baby” is an ambiguous age range, and a baby can be a twin or triplet, born in any order. Even a newborn could have younger step siblings in rare cases.

We’re also presuming it’s a human baby, whereas other species have different life spans.

Not seeing it. What’s wrong with this answer? (There are six possible permutations, but the other two siblings are interchangeable…)

I adapted Unicodeit! (See the acknowledgment section on GitHub; also meant to mention that in the footer).

I had been using your website for years, but wanted something more integrated.

Thank you for contributing to open source. 😁

I got tired of mashing together tools to write long threads with 𝐫𝐢𝐜𝐡 𝑓𝑜𝑟𝑚𝑎𝑡𝑡𝑖𝑛𝑔 and ℳα†ℏ—so I wrote La𝑇𝑤𝑒𝑒𝑡!

It converts Markdown and LaTeX to Unicode that can be used in “tweets”, and automatically splits long threads. Try it out!

keenancrane.github.io/LaTweet/

(More seriously: if the geometry of the apples was well-captured by the artist, and the color is unique to that geometry, I would be willing to bet the answer is “yes.”)

If it began life as a drawing, is that question even well-posed?

Oh, you wrote a book on this stuff. I guess I didn't need to be quite so didactic in my response! ;-)

(But I take your point: it's hard to get all these different nuances across precisely in diagrams. That's why we also have mathematical notation to go along with the diagrams! :-) )

Well, f maps *any* point of the data space to the latent space, and g maps *any* point of the latent space to the data space. I.e.,

f : ℝⁿ → ℝᵏ,
g : ℝᵏ → ℝⁿ.

The point x is just one example. So it might in fact be misleading to imply that f gets applied only to x, or that ends only at x̂.

P.S. I should also mention that these diagrams were significantly improved via feedback from many folks from here and elsewhere.

Hopefully they account for some of the gripes—if not, I'm ready for the next batch! 😉

bsky.app/profile/keen...

Of course, there will be those who say that the representation diagram is “obvious,” and “that's what everyone has in their head anyway.”

If so… good for you! If not, I hope this alternative picture provides some useful insight as you hack in this space. 😉

[End 🧵]

If you want to use or repurpose these diagrams, the source files (as PDF) can be found at

cs.cmu.edu/~kmcrane/Aut...

(Licensed under CC0 1.0 Universal)

Likewise, here's a simpler “implementation” diagram, that still retains the most important idea of an *auto*-encoder, namely, that you're comparing the output against *itself*.

Personally, I find both of these diagrams a little bit crowded—here's a simpler “representation” diagram, with fewer annotations (that might anyway be better explained in accompanying text).

Finally, a natural question raised by this picture is: how do I sample/generate new latents z? For a “vanilla” autoencoder, there's no simple a priori description of the high-density regions.

This situation motivates *variational* autoencoders (which are a whole other story…).