Combinatorial Optimization
FDS Colloquium: Brice Huang (MIT), “Algorithmic thresholds in random optimization problems”
Abstract: Optimizing high-dimensional functions generated from random data is a central problem in modern statistics and machine learning. As these objectives are highly non-convex, […]
FDS Colloquium: Bento Natura (Columbia), “Faster Exact Linear Programming”
Optional Zoom link: https://yale.zoom.us/j/99342713421 Abstract: We present a novel algorithm to solve various subclasses of linear programs, with a particular focus on strongly polynomial […]
Page 1 of 1
