Sample Complexity of Stochastic Optimization with Integer Variables

ArXi:2605.07239v1 Announce Type: new We establish sample complexity results for stochastic optimization over the integers, especially with a view to understand the complexity with respect to the corresponding continuous optimization problem. We show that integer optimization can sometimes require strictly samples and sometimes strictly smaller number of samples, depending on the structure of the objective and constraints. 1.