Timezone: »

Approximate Heavily-Constrained Learning with Lagrange Multiplier Models
Harikrishna Narasimhan · Andrew Cotter · Yichen Zhou · Serena Wang · Wenshuo Guo

Wed Dec 09 09:00 AM -- 11:00 AM (PST) @ Poster Session 3 #860

In machine learning applications such as ranking fairness or fairness over intersectional groups, one often encounters optimization problems with an extremely large number of constraints. In particular, with ranking fairness tasks, there may even be a variable number of constraints, e.g. one for each query in the training set. In these cases, the standard approach of optimizing a Lagrangian while maintaining one Lagrange multiplier per constraint may no longer be practical. Our proposal is to associate a feature vector with each constraint, and to learn a ``multiplier model’’ that maps each such vector to the corresponding Lagrange multiplier. We prove optimality, approximate feasibility and generalization guarantees under assumptions on the flexibility of the multiplier model, and empirically demonstrate that our method is effective on real-world case studies.

Author Information

Harikrishna Narasimhan (Google Research)
Andy Cotter (Google)
Yichen Zhou (Google)
Serena Wang (Google, UC Berkeley)
Wenshuo Guo (UC Berkeley)

More from the Same Authors