Most accepted NeurIPS papers are no to low impact
@thegautamkamath
-
ACM-SIAM Discrete Algorithms Symposium Submission Deadline Approaching
By
–
Everyone submitting to the ACM-SIAM Symposium on Discrete Algorithms right now #SIAMDA25pic.twitter.com/lSD6paiyz7
— Gautam Kamath (@thegautamkamath) 6 juillet 2024Everyone submitting to the ACM-SIAM Symposium on Discrete Algorithms right now #SIAMDA25
-
University Teaching Flexibility and Parental Leave Benefits
By
–
At @UWCheritonCS we have a lot of flexibility. You choose which terms you teach (we have three each year, due to a co-op program), as long as you keep a reasonable balance. Parental leave gives you some free teaching credits towards your balance.
-
ML Security: Why Attacking Systems Validates Their Safety
By
–
*Must read* for anyone interested in ML security, by Nicholas Carlini. Attacks are the only way we know whether or not a purportedly secure system actually is. Moreover, I consider personal attacks like this unacceptable in my research communities. https://
nicholas.carlini.com/writing/2024/w
hy-i-attack.html
… -
Luca Trevisan’s Final Talk on Spectral Graph Theory
By
–
In case you missed it, Luca Trevisan's final talk was delivered today by @praveshkkothari and Salil Vadhan. Part 1 is on spectral graph theory, and part 2 is about his experiences as an outsider. Things start around 22:30. https://
youtube.com/live/FdP_n_x0a
1k?si=5BNaFKS9cFvjwzZo
… -
Luca Trevisan’s pioneering online CS graduate course on graph partitioning
By
–
One visionary initiative by the late Luca Trevisan: in 2013 he had one of the first (if not the first) graduate CS courses online, focused on graph partitioning and expanders (@expandercourse). He paved the way for so much great online content a decade later. #rememberingLuca 1/3 pic.twitter.com/Bd1nokgDTM
— Gautam Kamath (@thegautamkamath) 21 juin 2024One visionary initiative by the late Luca Trevisan: in 2013 he had one of the first (if not the first) graduate CS courses online, focused on graph partitioning and expanders (
@expandercourse
). He paved the way for so much great online content a decade later. #rememberingLuca 1/3 -
ICML experiment incentivizes accurate self-ranking of research papers
By
–
You might be interested in this experiment led by @weijie444
, that was experimented with at recent ICMLs. No money involved, but it similarly incentivized accurate ranking of one's own paper. -
IEEE Award Nomination Statistics Reveal Field Recognition Trends
By
–
For some stats on this, you can check out IEEE award nomination statistics here: https://
corporate-awards.ieee.org/corporate-awar
ds/award-nomination-statistics/
… If you do the math, it works out to about 8 people on average* nominated each, for some of the most prestigious awards in the field. -
Dream Commentary on Tech Failures in Academic Settings
By
–
Other parts of this dream: I fell asleep in someone's seminar talk and when I woke up, they had paused due to some sort of technical difficulties. Most realistic dream I've had in a while.
-
Mastering Differential Privacy: Pure vs Approximate Methods
By
–
I had a dream last night where someone was asking whether pure or approximate differential privacy was better for situations with gross outliers and I (correctly) told them both would work. Now I can honestly say: I can answer that question in my sleep.