Derives O(s^{1.5}/√N) generalization bound, Ω(s/√N) minimax lower bound, and shows SGA with averaging attains Θ(s/√N) optimal rate for data-driven Lagrangian relaxation in MILPs, plus faster Θ(s/N) rate for warm-start learning.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
An augmented kernel ridge regression estimator separates linear and nonlinear components to achieve sharp oracle inequalities and minimax optimal prediction risk under general kernels.
citing papers explorer
-
Provably Data-driven Lagrangian Relaxation for Mixed Integer Linear Programming
Derives O(s^{1.5}/√N) generalization bound, Ω(s/√N) minimax lower bound, and shows SGA with averaging attains Θ(s/√N) optimal rate for data-driven Lagrangian relaxation in MILPs, plus faster Θ(s/N) rate for warm-start learning.
-
Adaptive Kernel Ridge Regression with Linear Structure: Sharp Oracle Inequalities and Minimax Optimality
An augmented kernel ridge regression estimator separates linear and nonlinear components to achieve sharp oracle inequalities and minimax optimal prediction risk under general kernels.