Near-Optimal Solutions of Constrained Learning Problems
<|reference_start|>Near-Optimal Solutions of Constrained Learning Problems: With the widespread adoption of machine learning systems, the need to curtail their behavior has become increasingly apparent. This is evidenced by recent advancements towards developing models that satisfy robustness, safety, and fairness requirements. These requirements can be imposed (with generalization guarantees) by formulating constrained learning problems that can then be tackled by dual ascent algorithms. Yet, though these algorithms converge in objective value, even in non-convex settings, they cannot guarantee that their outcome is feasible. Doing so requires randomizing over all iterates, which is impractical in virtually any modern applications. Still, final iterates have been observed to perform well in practice. In this work, we address this gap between theory and practice by characterizing the constraint violation of Lagrangian minimizers associated with optimal dual variables, despite lack of convexity. To do this, we leverage the fact that non-convex, finite-dimensional constrained learning problems can be seen as parametrizations of convex, functional problems. Our results show that rich parametrizations effectively mitigate the issue of feasibility in dual methods, shedding light on prior empirical successes of dual learning. We illustrate our findings in fair learning tasks.<|reference_end|>
@article{elenter2024near-optimal,
    title={Near-Optimal Solutions of Constrained Learning Problems},
    author={Juan Elenter, Luiz F. O. Chamon, Alejandro Ribeiro},
    journal={arXiv preprint arXiv:2403.11844},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.11844},
    primaryClass={cs.LG eess.SP math.OC}
}