The final draft of @BachFrancis's excellent new learning theory book is available: https://t.co/NcQX01ey3i He doesn't cover VC dimension, but builds up from regression to general smooth losses, which is heresy of course, but actually fills a much-needed niche. Highly recommended!
I am hiring for a student assistant (BSc/MSc student) to perform research & implementation tasks. The project is about data structures for data science algorithms.
See the job ad below & please contact me if you have any questions.
Deadline: August 29
https://t.co/i76asH8BuB
MIT's lecture notes for "Probabilistic Methods in Combinatorics"
A graduate-level introduction to the probabilistic method, a powerful technique in combinatorics and CS.
https://t.co/hZNtSHg6C8
Assistant professor position on algorithms and data analysis in KTH Royal Institute of Technology @KTHuniversity, funded by @WASP_Research. More details and online application: https://t.co/3OO0W7pAad Deadline: May 3, 2024
Trying again - two post docs in learning theory under my supervision at Aarhus University are available deadline April 25th. Please share.
https://t.co/nVJ6V0WjxN
Just accepted for publication at ACM CSUR our deep-dive into Densest Subgraph problem! 🎉
Funny project realized with a very cool team! 👨👨👦👦
It is a comprehensive source for those interested in graph optimization problems where the objective function is a notion of density 🕸️
I'm looking for research assistants this semester to work on projects incl. data collection, analysis & running experiments to mitigate misinformation
Ideal for third/final yr undergrads or masters students
If you are interested please email me your CV or DM
more below 👇
A random walk is
Sₙ = X₁+⋯+Xₙ
for IID sequence Xₙ. What is the probability that the first n terms are all negative?
Interestingly, if Xₙ has a continuous and symmetric distribution, there is a simple answer which does not further depend on the distribution.
First week of fall classes at Stanford. I'm teaching a new MS-level class, Social Algorithms, w/ detailed syllabus here: https://t.co/SZED87QWNg Draws on syllabi by @5harad @msalganik@ashton1anderson & others. Input appreciated!
Also, I'm now on the other place as jugander.
Talk title, David Lazer: "The emergent logic of the Online Information Ecosystem"
Talk title, Jon Kleinberg: "The Challenge of Understanding What Users Want: Inconsistent Preferences and Engagement Optimization"
Tomorrow we will present another paper at #KDD2023:
"Adversaries with Limited Information in the Friedkin–Johnsen Model"
led by @SijingTu & joint with Aris @gionis.
This is part of a bigger agenda to develop a theory for what is going in online social networks.
Read on.⬇️⬇️⬇️
Our paper "Adversaries with Limited Information in the Friedkin-Johnsen Model" with Stefan @StefanResearch and Aris @gionis is out at KDD Proceedings (https://t.co/nnqi8BsVr8).
I am super excited to meet and discuss with you at Long Beach. See you there soon! #KDD23