Alex Nichol

Someone tell me if you can use Genie 3 to generate an image from on top of an airplane while it sits on the tarmac.

E.g. generate an airplane on a tarmac and climb on top of the plane or onto the wing.

MegaTTS 3 Voice Cloning - a Hugging Face Space by mrfakename Upload a reference audio clip and enter text to generate speech with the cloned voice. You can adjust advanced options to fine-tune the output.

It's kinda wild that, for free without a GPU of your own, you can use a pretty solid voice cloning model. huggingface.co/spaces/mrfak...

{{chain}}

If you're worried that AGI will turn the world into a paperclip machine, have you met Jewish mothers? Mention your love of a certain food once, and the observable universe will soon be made entirely of this food.

A bee seeing a sign and getting sad

I mean idk if I think it's truly bad. But there are so many more rough edges than with Go, so I was confused why Go was getting all the twitter hate.

Stuff like this is going around now, showcasing instances where you need more type info than actual code.

It's the dumbest possible simplex implementation

So what ever happened with that neuralink lossless compression challenge?

Finally glad to see programming Twitter hating on Rust.

Implemented a little LP-based solver for the traveling salesman problem. It can solve a 52 city problem optimally in a few seconds. I also implemented the LP solver itself.

My solution is
1. find a planar rotation system
2. triangulate the faces using this rotation system
3. compute a tutte embedding
4. loop with random triangulations to find "nice" embeddings

Fun little exercise: take a graph that happens to be planar, and find valid 2D coordinates for all of the points to turn it into a straight-line drawing.

A new argument for air conditioning in Europe just dropped.

I wonder if it'll try, given that it clearly found out the algorithm is unknown to be in P or NP-complete.

If you want to implement WYSIWYG in your website, just put 💩 emojis all over your code because it's likely a shitty website. Most websites are.

s/reasons/arguments

There's an obvious reason which is that it's more fun to write something from scratch. But I'm continually disappointed by people who don't want to contribute to existing projects in favor of building new ones.

So there are no remaining reasons why MLX couldn't have just been a metal backend for PyTorch or JAX?

Out of curiosity, was it bipartite matching, or the more general matching problem? And if so, was it max/min weight matching or just maximum cardinality matching?

The only show we actually need.

I'm kind of curious: who actually uses graph theory in their day jobs? As a follow-up, who is using the networkx package in Python?

I forgot to attach the relevant headline 😅

you've just sold me on precheck

Who cares? Please PLEASE stop making me take 5 laptops and tablets out of my bag and put each one in a separate bin.

learn-graphs/Sources/LearnGraphs/Contract.swift at b7e2134b4e35fdcd7ce1bfcb09e75585ad7e4e9f · unixpickle/learn-graphs Learning graph theory. Contribute to unixpickle/learn-graphs development by creating an account on GitHub.

Example of what I did with linked lists. github.com/unixpickle/l...

TIL about the disjoint-set data structure. I've implemented a less efficient (maybe original?) nlog(n) structure for this at least a few times without thinking about it. en.m.wikipedia.org/wiki/Disjoin...

When I was a teenager, I had an OCD compulsion to solve the subset sum problem for various things in my head (e.g. evenly divide words in a sentence into two halves).

At the time I didn't know what this problem was called or that it was NP-hard.

github.com/unixpickle/B...

Amazing question and answer. This is why we still need online forums, regardless of how helpful chatbots are. Nothing beats an answer directly from the author of seminal papers.

Why is every paper about tree decomposition behind a paywall? And not only that, but every paper basically says "and for this key component, see [3]" where [3] is also behind a paywall.