LoG 2026 Day 2: Lincoln Lab and RL-for-combinatorial-optimization talks headline
PetarV_93 · x · 2026-11-23
Day 2 of the Learning on Graph (LoG) 2026 conference wrapped up with keynotes from Rajmonda Caceres (MIT Lincoln Laboratory, on graph-based learning for accelerated combinatorial optimization) and Petar Veličković, three orals, and a tutorial on RL for graph combinatorial optimization. Upcoming: Anna Scaglione's closing keynote, a graphs × LLMs tutorial, more orals, and the awards ceremony.
More from Research
- Princeton's SSoN Benchmark: Best Vision Model Scores 39.7% vs Human 83.3% on Spatial Consistency — jiqizhixin · 2026-11-23
- Four Color Theorem Was Exhaustion — This Lean Proof Is Different, Argues Mathematician — gleech · 2026-11-23
- Samsung Labs open-sources LittleBit, compressing LLM weights to 0.1 bits — MikePFrank · 2026-11-23
- Mathematicians Debate: Can 60GB of Lean Code Turn Into Real Understanding? — gleech · 2026-11-23
- Adversarial examples aren't ubiquitous: budget matters, argues researcher — maksym_andr · 2026-11-23
- Researchers on the Riemann proof formalization: 250k pages is a scratch pad, not the write-up — khademinori · 2026-11-23