Stochastic integer optimization has sample complexity that matches, undercuts, or exceeds the continuous case based on objective structure, with new tight bounds for nonconvex continuous problems.
Proceedings of the aaai conference on artificial intelligence , volume =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Sample Complexity of Stochastic Optimization with Integer Variables
Stochastic integer optimization has sample complexity that matches, undercuts, or exceeds the continuous case based on objective structure, with new tight bounds for nonconvex continuous problems.