A dual-optimization method for group max-min fairness in recommender systems is proposed to reduce the mini-batch Jensen gap, but the central convergence theorem is internally inconsistent.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IR 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Bridging Jensen Gap for Max-Min Group Fairness Optimization in Recommendation
A dual-optimization method for group max-min fairness in recommender systems is proposed to reduce the mini-batch Jensen gap, but the central convergence theorem is internally inconsistent.