Ryan O'Donnell

Videos:

[Ryan O'Donnell @BooleanAnalysis]

I'm releasing a series of videos called "Quantum Computer Programming in 100 Easy Lessons".

https://t.co/lfKXwEIHWU

It will cover the 'usual' content (...CHSH, Grover, Factoring), but with some expositional innovations that I *hope* will make it easier for beginners.

[Ola Svensson @AlgoSvensson]

Happy to share that our better-than-2 approximation results for k-median are now on arXiv:

https://t.co/NvjU9FQfHh
https://t.co/6lPuN5Voyc

It has been a pleasure working with this fantastic group: @rares_buhai , Vincent Cohen-Addad, Henry Fleischmann, @anupamg , Antoni "Toni" Jubés Monforte, Madhusudhan Reddy Pittu, @mstou73, and @LukasBirdyy

A special shout-out to Toni, who started working on this problem for his Master's thesis almost two years ago. His work led to the impressive analysis of the factor-revealing LP!

Now on to other things...

[Ryan O'Donnell @BooleanAnalysis]

Sorry for spelling @buyolitsez2's name wrong; obviously it is 'Nikolai'.

[Ryan O'Donnell @BooleanAnalysis]

I looked forward to this cleanup! Nikloai Chukhin (https://t.co/zYQ8ZIAUc4) significantly cleans and extends the OpenAI 2^(ω(sqrt(n))) lower bound for depth-3 circuits:

The (4n-1)-bit function sum_ij a_{i+j}x_iy_j mod 2 needs depth-d circuits of size 2^(Ω~(n log n)^{1/(d-1)}).

[Ryan O'Donnell @BooleanAnalysis]

@TCzajka Yeah, I just have no intuition about whether the algorithm can be made oblivious. But if you think it seems likely... that would be cool. Hopefully someone will work it out. Because this result seems noticeably more compelling to me if it also works for circuits.

[Ryan O'Donnell @BooleanAnalysis]

@didest @ElaineRShi @AcerFur No, because as far as I'm aware there's no improved algorithm for circuits.

[Ryan O'Donnell @BooleanAnalysis]

@rrwilliams Also exponent 2d/(3d+2) for one d-dim tape.

[Anthony Leverrier @letonyo]

this is great: a unified and transparent exposition of the recent breakthroughs on the decoding of Reed-Solomon codes.
https://t.co/9KGSnFJNVY

[𝖬𝖺𝗁𝖽𝗂 𝖢𝗁. (bluesky:@mahdi.ch) @mahdi_tcs_]

The what now?!
https://t.co/xHsLmQJkff

[Anthony Leverrier @letonyo]

oh that's interesting! The authors share the draft generated by Astra, as a companion to their arxiv submission.
https://t.co/NwmaKWAjY3

[Ryan O'Donnell @BooleanAnalysis]

STOC 2027 Call for Papers is out:
https://t.co/vaMzhjIswr

Note quite a lot of changes from previous STOC CfPs.

[Ryan O'Donnell @BooleanAnalysis]

@mahdi_tcs_ @OpenAI Naw, SETH is true, GISO requires n^log(n) time, and no strongly poly algorithm for LP ;-)

[Ryan O'Donnell @BooleanAnalysis]

@sahilsingla81 Great result, Sahil!

[Ola Svensson @AlgoSvensson]

An amazing result in online algorithms. I worked on this for over a decade and it is fantastic to see a solution that looks very clean! Also great to see an expert behind the wheels. Congratulations @sahilsingla81 https://t.co/zxV6upQoNP

[Ryan O'Donnell @BooleanAnalysis]

@henryquantum ... one might strive further to get the best of both worlds: "Rich" 2-to-1 with perfect completeness (https://t.co/v4o7gGvgg0). That would imply both results. Perhaps the rumors might concern this?

[Ryan O'Donnell @BooleanAnalysis]

Outstanding progress towards the Unique Games Conjecture posted by Yumou Fei, Dor Minzer, and Shuo Wang: https://t.co/53rvfVWF2L
👀

[Ryan O'Donnell @BooleanAnalysis]

@henryquantum I guess this result is morally close to 2-to-1 Conjecture with perfect completeness. (Maybe with tweaking you can get 4->2, who knows.)

Then it's true that UGC is somewhat different, being stronger in one sense (1-to-1) and weaker in another (imperfect completeness).

But...

[Ryan O'Donnell @BooleanAnalysis]

h/t to Noah Singer @singerng_ for pointing me to the paper