🔥The 9th Round of Easy Loan, Earn $40 Reward is in progress❗️ ⏰ Promotion Period: January 15th - Feburary 15th, 2025 👉 Register now and check more details at gate.io/campaigns/358

Great pleasure of hosting Laurent Lessard at USC who spoke about "An automatic system to detect equivalence between iterative algorithms" 🙂

Halloween #fiddler puzzle: A bag contains N Reese's cups and an unknown number of candy corn pieces. You reach into the bag k ≤ n times at random and pull out a Reese's each time! How many candy corn do you expect to be in the bag? @xaqwg My write-up: laurentlessard.com/bookproofs/hal…

This week's #Fiddler: what is the minimum-energy way to pack 9 particles in a square box, where energy is measured as the sum of 1/dist over all pairs of particles? Turns out it's NOT a regular 3x3 lattice! @xaqwg write-up: laurentlessard.com/bookproofs/par…

This week's #fiddler: Assign distinct prime numbers to the vertices of a dodecahedron so the sum of the vertices of each face sum to 2025. I modeled this as an integer linear program. Here is one possible solution. @xaqwg My write-up: laurentlessard.com/bookproofs/202…

This week's #Fiddler puzzle is a random walk: From (k), you hop to (k-1) with probability 1/k and hop to (k+1) otherwise. If you start at (2), what is the probability you eventually hop to (1)? I wrote a short tutorial here: laurentlessard.com/bookproofs/can…

Can your AI keep up with dynamic attackers? In a paper to appear at #AISTATS2025 with Avinandan Bose Laurent Lessard and Maryam Fazel, we study robustness to learning algorithms to dynamic data poisoning attacks that can adapt attacks while observing the progress of learning

"Deadlines are final and no extensions will be given" You got me IEEE CDC 2025 --- I totally fell for it! Happy April Fools everybody!