Taihei Oki

Generalization Bound and Learning Methods for Data-Driven Projections in Linear Programming

2023 · arXiv (Cornell University)

How to solve high-dimensional linear programs (LPs) efficiently is a fundamental question. Recently, there has been a surge of interest in reducing LP sizes using random projections, which can accelerate solving LPs independently of improving …