Top
Best
New

Posted by jonluca 11 hours ago

Three new discoveries in mathematics, computer science, and physics(openai.com)
Related:

The Exponential Time Hypothesis Is False [pdf] - https://news.ycombinator.com/item?id=50251661

828 points | 364 commentspage 3
doctoboggan 9 hours ago|
I wonder why the physicists are the only group to not want the full information released upfront? As a casual fan of physics[0] it seems like their completion of the standard model is possibly the biggest deal of all these breakthroughs, am I wrong?

[0]: PBS space time watcher

T-A 9 hours ago||
The writing is a bit ambiguous, but if I'm parsing it correctly it's only a big deal to the small subset of physicists who care about mathematical rigor: proof that Quantum Field Theory (i.e. what theorists have been using since the 1940s or so) is mathematically sound.

This part,

The existence proof pertains to the simplest grand unified theory that includes the gauge fields and fermions of the Standard Model

looks like a reference to SU(5) GUT from 1974:

https://en.wikipedia.org/wiki/Georgi%E2%80%93Glashow_model

frutiger 7 hours ago|||
As a slightly less but still very casual enjoyer too, I don't think there is a huge amount of value in dumping the lean proof or the natural language proof. I'd rather have an abstract of a paper that I can at least hope to understand 75% of before getting lost.

I'm guessing if you were really interested, you could email YANGMILLS4D@gmail.com (itself a hilarious e-mail address).

Kotlopou 9 hours ago||
Careful, completion of the standard model ≠ theory of quantum gravity or theory of everything. The actual question is too abstruse for me (biophysicist).
lukeify 5 hours ago||
Not enough chatter about the QCD result here! I'm of the opinion that whatever the correct representation of the universe is, the GUT (Grand Unified Theory) will be authored not by humans but by LLMs.
Haunt1000 2 hours ago||
Though it probably will need experimental confirmation, which currently AI cannot do.
mikhailfranco 3 hours ago||
Interesting recent work by Emad Mostaque...

https://emad-ii.github.io/chirality-standard-model/

With nice presentation, paper and proofs.

zone411 8 hours ago||
These resolve 6 entries in my top 500 open problems list (LLM ranked, https://www.proofatlas.ai/open-problems/) and there is partial progress on #3 overall (Yang–Mills Existence and Mass Gap):

Kakeya conjecture — #38

Fourier restriction conjecture — #46

Local smoothing for wave equations — #187

Bochner–Riesz conjecture — #190

Exponential Time Hypothesis — #43

Strong Exponential Time Hypothesis — #63

adverbly 9 hours ago||
> In our view, these manuscripts are best understood as a form of raw research data.

Much better!

> For the computer science collaboration, the group has decided to make the natural language proof and Lean formalization public immediately, and we are publishing them directly to our GitHub repository. For the physics collaboration, the group has decided to hold off on releasing the AI-produced artifacts and instead work on writing it up themselves.

> All of these approaches involve tradeoffs. On the one hand, the collaborations empower experts to foster unpacking the results and contextualizing them in the broader academic community. On the other hand, choosing initial shepherds necessarily shapes who gets involved first and creates asymmetry of information. We welcome feedback on how to broaden participation and make this process more useful.

Very good!

I was highly critical of their approach with the earlier mathematical publications, but this is much improved.

Most importantly, they aren't releasing slop papers that would never have been published in any self-respecting journal or made it past a deep round of peer review questioning.

> We are committed to ensuring funding for researchers to independently examine, explain, and build on the results above.

> We continue to invite feedback on the best way to disclose results and engage with scientists to accelerate discovery.

Well done!

Now you need to actually LISTEN to the community and the feedback, so you aren't done yet, but this is a much better start than last time. Keep it up!

astrobiased 6 hours ago||
This is an exciting time, but also there are very real changes at hand. Game changing discoveries will likely not happen at universities but at private AI frontier labs. Moreover, the models that are used on this are not always open to the broader community today.

What will it be like in two years? Will such models that help enable paradigm shifts in science be only accessible to employees of those private companies? Still thinking about the ramifications ... amazing and discombobulating at the same time.

ramraj07 6 hours ago||
You tell this as if the Universities and departments where the research happened didn’t place themselves in ivory towers.

Pedigree mattered in academia. Gatekeeping was always rampant. So to a bystander like me this makes no difference.

jacquesm 3 hours ago|||
I disagree with that. Commercial entities are very different from Universities. They are sharing now, but they don't have to continue to share in the future, that all depends on what they find.
esalman 3 hours ago|||
Apart from transformer architecture, pretty much every other discovery that makes large language models viable today happened in universities.
kaycebasques 3 hours ago||
> Will such models that help enable paradigm shifts in science be only accessible to employees of those private companies?

The 3 breakthroughs all have implications for cryptography and nuclear technology, right? Hard to imagine nation-states allowing private companies to publish these results willy-nilly for much longer.

nhatcher 3 hours ago||
Woah, they got QCD! I didn't think they could do that. Three things jump to my mind: 1. Is it really true? Did they get the basic conditions right? 2. Would I ever be able to understand the proof 3. But the most important one. Can we compute hadronic masses now?

This is an incredible scientific achievement. One of our most fundamental theories is mathematically sound. Without the use of AI is very likely I would have never seen this in my lifetime

nhatcher 2 hours ago|
I'm still shelled shocked, but my initial reaction is caution. Wait what did they claim to have proof exactly? I can't see their pdf in natural language either.
WindyTree 6 hours ago||
It uses sparseness. I noticed a simple thing way back that for a n-boolean variables, the average size of a satisfiable boolean expression must be 2^n bits - basically every binary number that satisfies it listed out. So if a boolean expression of 4 variables is satisfied by 1111, 1110, and 0000, the number denoting it is 1100000000000001, and for every such number there is a boolean expression of 4 variables and for every expression one number of 16 digits. So it’s a fool’s errand to make a universal solver when average inputs scale at 2^n, if a solution exists it has to leverage the small size of the problems we actually care about, sparsity. Based on the AI description that’s what they did, something with polynomials, but it’s too soon. Looking forward to finding out.
artninja1988 10 hours ago||
I wonder how much compute they are throwing at problems in ML like continual learning and sample efficiency. Also how successful they are with these. Results like in the post make me hopeful we'll see some type of so singularity soon
jacquesm 3 hours ago||
> make me hopeful we'll see some type of so singularity soon

Be careful what you wish for. You just might get it.

bluerooibos 7 hours ago|||
> singularity

We're already in it. The next few years are going to be wild.

saulpw 7 hours ago||
How would that look any different than literally right now?
dooglius 10 hours ago||
The proof appears to be a sub-exponential algorithm for #3-SAT not just 3-SAT, I think this is considered a much stronger result?
geysersam 10 hours ago|
Isn't 3-SAT NP-complete?
krackers 10 hours ago|||
Yes. Up until now, it was unknown whether containment of NP in EXPTIME was strict or not. (Obviously you can brute-force all possible witnesses, so any problem in NP can be solved in EXPTIME, it was open whether you could do better than that.)

Showing 3SAT (technically #3SAT) can be solved in less than EXPTIME resolves this. It's only slightly subexponential, not even quasipolynomial, but it is a very surprising result. And that too a constructive algorithm.

Edit: Apparently not true, the constructive algorithm given may not survive under reductions. See discussion in https://news.ycombinator.com/item?id=50252769

LPisGood 10 hours ago|||
It is the canonical NP complete problem.
adalacelove 3 hours ago|
Kakeya conjecture is simple enough that anyone can understand it. The surprising part is its connections with other parts of mathematics.

https://youtu.be/5J3tYU_-IZI?si=t3B9d0Wtsvs26_i9

More comments...