Postdoc opportunity: if interested in a postdoc related to sketching starting Summer/Fall'25, especially applied to more efficient foundation model architectures (e.g. faster approx attention), please follow the instructions on the left column of https://t.co/sqoyY6jIAS by Jan 31
Yet another awesome (but this time local) TCS opportunity:
🥳We're hosting TOCA-SV at Stanford on Nov 8th🥳
Free registration and everything else you always wanted to know about the 11th TOCA-SV:
https://t.co/Jor36LInl4
2 awesome opportunities for TCS research (in different career stages):
1. Motwani Postdoc applications just opened!
https://t.co/xqWZTZL0Dx
2. Our crowdsourced spreadsheet of TCS Masters programs (same link, Fall 2024 updated info):
https://t.co/jqyAX8wXGP
Over the past three summers @a16zcrypto we've had 19 tremendous research interns. Want to be part of the summer '25 cohort? The application is open now, for full consideration apply by Nov 8. (Link in replies.)
Occasionally in mathematics a statement that just has to be true turns out to be false. A paper appeared on arXiv today that disproves a well-known conjecture in probability called the bunkbed conjecture. 🧵
https://t.co/0IIFzmMYv3
@SebastienBubeck Amazing, we basically did the same last semester in the introduction to algorithms course at EPFL with 500+ students. Every week the students got to teach two of the most important concepts/algorithms to an LLM instructed to learn and ask questions about those concepts.
Are you a TCS grad student who doesn't know much about fine-grained complexity, but wish you did? Check out the DIMACS Tutorial on Fine-grained Complexity that @karthikcs_, Amir Abboud, and Nick Fischer are organizing for July 15-19, 2024: https://t.co/m4X721cB2t
Along with Amir Abboud and Nick Fischer, I'm organizing a tutorial in Fine-grained complexity in July 2024, primarily for graduate students. The website to apply is: https://t.co/H7CAWex2al.
Traditional swap regret algorithms are not monotone! But recent ones are, and we give a reduction that lets you use them in the limited feedback setting that arises here. For more on learning in principal agent problems, check out the paper: https://t.co/QrRRjo8pvM
Here is a 3 page paper giving a super-simple deterministic online algorithm that guarantees 2√T distance to calibration. The analysis is only 1 page (the first 2 pages are chit chat). It has a "Follow the perturbed leader" flavor. https://t.co/EYyM1OHr1U
The STOC/TheoryFest 2024 call for workshops has been posted. The deadline for proposals is Feb 16!
The conference will be held in Vancouver, June 24-28.
https://t.co/ArbUPz4jTN
#STOC2024#Theoryfest2024
On the job market, please feel free to use a completely canned cover letter. I have never read them, and as far as I can tell neither have my colleagues.