Stochastic gradient ascent with averaging learns Lagrangian multipliers for MILP at the minimax rate Θ(s/√N) and faster Θ(s/N) for warm-start, closing the gap between upper and lower bounds.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Optimizing trajectory-trees in belief space improves performance in partially observable robotic planning by capturing observation-dependent contingencies, shown via PO-MPC with D-AuLa optimization and PO-LGP extending LGP.
The paper proposes Trajectory Regularized Merging (TRM) to enable storage-free model merging in continual learning by optimizing in an augmented trajectory subspace with task alignment, prediction consistency, and gradient responsiveness objectives, claiming SOTA results.
citing papers explorer
No citing papers match the current filters.