@BooleanAnalysis

Videos: https://xitter.cf/t.co/vy9r4V6aOZ

 Pittsburgh, PA
cs.cmu.edu/~odonnell/
Joined October 2011
  • Tweets742
  • Following0
  • Followers7.7K
234Media
Include

Only show posts containing:

Exclude

Hide posts containing:

Time range
-
Minimum likes
Ryan O'Donnell retweeted
Ola Svensson
@AlgoSvenssonOct 15
Happy to share that our better-than-2 approximation results for k-median are now on arXiv: arxiv.org/abs/2610.18144 arxiv.org/abs/2610.17172 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...

A Better-than-2 Approximation for k-Median Part I: The Power of...

The Greedy algorithm of Jain, Mahdian, Markakis, Saberi, and Vazirani was the best Lagrangian-multiplier-preserving (LMP) approximation algorithm for facility location, and thus the engine behind...

arxiv.org
Ola Svensson
@AlgoSvenssonOct 7
OpenAI completely solved a problem on which my students have worked hard for 1+ years and made significant progress. They should be proud to have pushed on a problem appearing in this historic list of ~400 results. We’ll soon upload our different algorithmic approach to k-median.
2
13
1
108
7,510
Sorry for spelling @buyolitsez2's name wrong; obviously it is 'Nikolai'.
2
6
793
I looked forward to this cleanup! Nikloai Chukhin (eccc.weizmann.ac.il/report/2…) 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)}).
1
8
68
6,807
Replying to @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.
2
90
Replying to @didest @ElaineRShi @AcerFur
No, because as far as I'm aware there's no improved algorithm for circuits.
1
2
86
Replying to @TCzajka
Seems to me that Boolean circuits might be the most natural model for investigating the problem? Has anyone discovered anything for circuits, post-OpenAI paper?
1
6
631
Replying to @AcerFur
It depends on the model, of course. In the standard model of algorithms you use in an algorithms class (namely, the RAM model with log n size registers, with multiplying two registers in time O(1) allowed), the complexity is O(n). This is not trivial, but known since the 1970s.
5
23
1,974
Replying to @rrwilliams
Also exponent 2d/(3d+2) for one d-dim tape.
3
568
Replying to @rrwilliams
My GPT claims the techniques can give exponent 2/3 for RAM model. I'll try to check if this is accurate.
1
1
13
1,744
Ryan O'Donnell retweeted
Anthony Leverrier@letonyoOct 6
this is great: a unified and transparent exposition of the recent breakthroughs on the decoding of Reed-Solomon codes. eccc.weizmann.ac.il/report/2…
5
1
32
4,885
The what now?! arxiv.org/abs/2610.06783v1

Truly Subquadratic 3SUM and Truly Subcubic APSP via Triangles in...

We give the first polynomial improvements over the textbook algorithms for $3$SUM and All-Pairs Shortest Paths (APSP): we show how to deterministically solve $3$SUM on $n$ integers of polynomial...

arxiv.org
57
195
142
1,848
1,009,656
Ryan O'Donnell retweeted
Anthony Leverrier@letonyoSep 24
oh that's interesting! The authors share the draft generated by Astra, as a companion to their arxiv submission. arxiv.org/abs/2609.28028
7
6
2
146
18,656
STOC 2027 Call for Papers is out: acm-stoc.org/stoc2027/stoc20… Note quite a lot of changes from previous STOC CfPs.
4
19
4
118
35,962
Replying to @mahdi_tcs_ @OpenAI
Naw, SETH is true, GISO requires n^log(n) time, and no strongly poly algorithm for LP ;-)
2
16
1,464
Replying to @sahilsingla81
Great result, Sahil!
1
473
Ryan O'Donnell retweeted
Ola Svensson
@AlgoSvenssonSep 15
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 arxiv.org/abs/2609.14555

The Matroid Secretary Conjecture is True

We resolve the matroid secretary conjecture, giving an online algorithm that accepts each element of the offline optimum with probability at least $1/4$. The algorithm only needs the number of...

arxiv.org
2
31
4
205
16,832
Replying to @BooleanAnalysis @henryquantum
... one might strive further to get the best of both worlds: "Rich" 2-to-1 with perfect completeness (eccc.weizmann.ac.il/report/2…). That would imply both results. Perhaps the rumors might concern this?
19
1,134
Replying to @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...
1
2
1
17
4,500
h/t to Noah Singer @singerng_ for pointing me to the paper
1
3
4,441
Outstanding progress towards the Unique Games Conjecture posted by Yumou Fei, Dor Minzer, and Shuo Wang: eccc.weizmann.ac.il/report/2… 👀
4
35
3
213
46,718
Load more