Nice to see developments in this field - great math. Not sure the benchmark is all that reliable though, as they report 60 ms projection times, as opposed to the 6 μs I was observing. That is a 10'000x difference on similar hardware!?
Luis M. Brice\~no-Arias, Crist\'obal Vivar-Vargas: Projection onto cones generated by epigraphs of perspective functions https://t.co/BngqIxSsQY https://t.co/S8NCG1AhBY
@kareem_carr To my belief, his creativity--attributed to dreaming--were not in predicting formulas like a chatgpt, but in his use of nonstandard math to manipulate infinite sums and continued fractions in novel ways.
MIPLIB 2024 submissions open: https://t.co/CIbJGJO4NU
Submit all instances you can share!
Closes: 30.11.2024
Restrictions: Mixed-integer linear programs (includes integer programs + indicator / SOS constraints).
Sound propagates at around 300 m/s.
Light propagates at around 300 m/μs.
(air speeds near earth; 1 significant digit of precision; beautiful and memorable)
@VictorTaelin There are plenty of algorithms out there to do reasoning. GPT just needs to compose a prompt for one of these tools and map the result back in the language of the problem.
@MeTheDeluge@littmath Interestingly, Bob has an advantage if the final toss is H (such that the last sequence is interrupted prematurely) because his EV has larger partial sums. That is, sum_(i=1)^n (1/2^i - (i-1)/2^i) > 0 for finite n.
@MeTheDeluge@littmath You mean 0*1/2 + 1*1/4 + 2*1/8 + … approaching 1 for Alice. It is <1 for a finite game, but so it is for Bob because the game may end before the sequence
@themarklstone No cutting, no pizza, but I recognize the issue. In this house one will eventually take the knife and it can take several cuts just to make two equal portions.
Let child 1 decide on a fair cut into n pieces and let children 2,…,n pick their favorites. Child 1 gets the leftover, and the other n-1 pieces are put back in the middle. Now it’s child 2 to cut and get the leftover, and so it repeats until the utility has been distributed.
Nice post by Ken Fordyce on Linear Programming, shared on the INFORMS Open Forum and partially inspired by Bob Bixby's s.t. episode:
https://t.co/wds3Un1Ylh
@PVanHentenryck The answer is bootstrapping: https://t.co/DVopQGLbF9. Start with a very limited and simple checker that is pain to write programs for, but easy for humans to understand. Use it to validate a more advanced checker that is less restrictive. Repeat until practically useful.