A pareto-efficient algorithm for multiple objective optimization in e-commerce recommendation

Recommendation with multiple objectives is an important but difficult problem, where the coherent difficulty lies in the possible conflicts between objectives. In this case, multi-objective optimization is expected to be Pareto efficient, where no single objective can be further improved without hurting the others. However existing approaches to Pareto efficient multi-objective recommendation still lack good theoretical guarantees.

A pareto-efficient algorithm for multiple objective optimization in e-commerce recommendation | Litlas