IDEAS home Printed from https://ideas.repec.org/a/inm/orijds/v4y2025i1p67-84.html

Fair Collaborative Learning (FairCL): A Method to Improve Fairness amid Personalization

Author

Listed:
  • Feng Lin

    (Department of Industrial and Systems Engineering, University of Washington, Seattle, Washington 98195)

  • Chaoyue Zhao

    (Department of Industrial and Systems Engineering, University of Washington, Seattle, Washington 98195)

  • Xiaoning Qian

    (Department of Electrical and Computer Engineering, Texas A&M University, College Station, Texas 77843)

  • Kendra Vehik

    (Health Informatics Institute, University of South Florida, Tampa, Florida 33620)

  • Shuai Huang

    (Department of Industrial and Systems Engineering, University of Washington, Seattle, Washington 98195)

Abstract

Model personalization has attracted widespread attention in recent years. In an ideal situation, if individuals’ data are sufficient, model personalization can be realized by building models separately for different individuals using their own data. But, in reality, individuals often have data sets of varying sizes and qualities. To overcome this disparity, collaborative learning has emerged as a generic strategy for model personalization, but there is no mechanism to ensure fairness in this framework. In this paper, we develop fair collaborative learning (FairCL) that could potentially integrate a variety of fairness concepts. We further focus on two specific fairness metrics, the bounded individual loss and individual fairness, and develop a self-adaptive algorithm for FairCL and conduct both simulated and real-world case studies. Our study reveals that model fairness and accuracy could be improved simultaneously in the context of model personalization.

Suggested Citation

  • Feng Lin & Chaoyue Zhao & Xiaoning Qian & Kendra Vehik & Shuai Huang, 2025. "Fair Collaborative Learning (FairCL): A Method to Improve Fairness amid Personalization," INFORMS Joural on Data Science, INFORMS, vol. 4(1), pages 67-84, January.
  • Handle: RePEc:inm:orijds:v:4:y:2025:i:1:p:67-84
    DOI: 10.1287/ijds.2024.0029
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ijds.2024.0029
    Download Restriction: no

    File URL: https://libkey.io/10.1287/ijds.2024.0029?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Gah-Yi Ban & N. Bora Keskin, 2021. "Personalized Dynamic Pricing with Machine Learning: High-Dimensional Features and Heterogeneous Elasticity," Management Science, INFORMS, vol. 67(9), pages 5549-5568, September.
    2. Xubo Yue & Maher Nouiehed & Raed Al Kontar, 2023. "GIFAIR-FL: A Framework for Group and Individual Fairness in Federated Learning," INFORMS Joural on Data Science, INFORMS, vol. 2(1), pages 10-23, April.
    3. Hema Yoganarasimhan, 2020. "Search Personalization Using Machine Learning," Management Science, INFORMS, vol. 66(3), pages 1045-1070, March.
    4. Ying Lin & Shan Liu & Shuai Huang, 2018. "Selective sensing of a heterogeneous population of units with dynamic health conditions," IISE Transactions, Taylor & Francis Journals, vol. 50(12), pages 1076-1088, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lalit Jain & Zhaoqi Li & Erfan Loghmani & Blake Mason & Hema Yoganarasimhan, 2024. "Effective Adaptive Exploration of Prices and Promotions in Choice-Based Demand Models," Marketing Science, INFORMS, vol. 43(5), pages 1002-1030, September.
    2. Tino Werner, 2023. "Quantitative robustness of instance ranking problems," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 75(2), pages 335-368, April.
    3. Wei Zhou & Mingfeng Lin & Mo Xiao & Lu Fang, 2025. "Higher Precision Is Not Always Better: Search Algorithm and Consumer Engagement," Management Science, INFORMS, vol. 71(7), pages 6204-6226, July.
    4. Leon Yang Chu & Qi Feng & J. George Shanthikumar & Zuo-Jun Max Shen & Jian Wu, 2025. "Solving the Price-Setting Newsvendor Problem with Parametric Operational Data Analytics (ODA)," Management Science, INFORMS, vol. 71(8), pages 6627-6646, August.
    5. Kan Xu & Hamsa Bastani, 2025. "Multitask Learning and Bandits via Robust Statistics," Management Science, INFORMS, vol. 71(9), pages 7752-7773, September.
    6. N. Bora Keskin & Yuexing Li & Nur Sunar, 2025. "Data-Driven Clustering and Feature-Based Retail Electricity Pricing with Smart Meters," Operations Research, INFORMS, vol. 73(5), pages 2636-2660, September.
    7. Xiaocheng Li & Zeyu Zheng, 2024. "Dynamic Pricing with External Information and Inventory Constraint," Management Science, INFORMS, vol. 70(9), pages 5985-6001, September.
    8. Michael Alley & Max Biggs & Rim Hariss & Charles Herrmann & Michael Lingzhi Li & Georgia Perakis, 2023. "Pricing for Heterogeneous Products: Analytics for Ticket Reselling," Manufacturing & Service Operations Management, INFORMS, vol. 25(2), pages 409-426, March.
    9. Tianshu Sun & Zhe Yuan & Chunxiao Li & Kaifu Zhang & Jun Xu, 2024. "The Value of Personal Data in Internet Commerce: A High-Stakes Field Experiment on Data Regulation Policy," Management Science, INFORMS, vol. 70(4), pages 2645-2660, April.
    10. W. Jason Choi & Qihong Liu & Jiwoong Shin, 2024. "Predictive Analytics and Ship-Then-Shop Subscription," Management Science, INFORMS, vol. 70(2), pages 1012-1028, February.
    11. repec:plo:pone00:0222665 is not listed on IDEAS
    12. Ali Aouad & Adam N. Elmachtoub & Kris J. Ferreira & Ryan McNellis, 2023. "Market Segmentation Trees," Manufacturing & Service Operations Management, INFORMS, vol. 25(2), pages 648-667, March.
    13. Yigit Efe Erginbas & Thomas A. Courtade & Kannan Ramchandran, 2025. "Online Assortment and Price Optimization Under Contextual Choice Models," Papers 2503.11819, arXiv.org.
    14. Omid Rafieian, 2023. "Optimizing User Engagement Through Adaptive Ad Sequencing," Marketing Science, INFORMS, vol. 42(5), pages 910-933, September.
    15. Jingying Ding & Woonghee Tim Huh & Ying Rong, 2024. "Feature-Based Inventory Control with Censored Demand," Manufacturing & Service Operations Management, INFORMS, vol. 26(3), pages 1157-1172, May.
    16. Tie Li & Gang Kou & Yi Peng & Philip S. Yu, 2025. "Feature Selection and Grouping Effect Analysis for Credit Evaluation via Regularized Diagonal Distance Metric Learning," INFORMS Journal on Computing, INFORMS, vol. 37(5), pages 1391-1412, September.
    17. Zeqi Ye & Hansheng Jiang, 2023. "Smoothness-Adaptive Dynamic Pricing with Nonparametric Demand Learning," Papers 2310.07558, arXiv.org, revised Oct 2023.
    18. Xueping Gong & Wei You & Jiheng Zhang, 2026. "Minimax Optimality in Contextual Dynamic Pricing with General Valuation Models," Operations Research, INFORMS, vol. 74(2), pages 879-897, March.
    19. Xie, Ying & Song, Dong-Ping & Dong, Jingxin & Feng, Yuanjun, 2025. "Predicting out-terminals for imported containers at seaports using machine learning: Incorporating unstructured data and measuring operational costs due to misclassifications," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 202(C).
    20. Brei, Vinicius Andrade, 2020. "Machine Learning in Marketing: Overview, Learning Strategies, Applications, and Future Developments," Foundations and Trends(R) in Marketing, now publishers, vol. 14(3), pages 173-236, August.
    21. Divya Singhvi & Somya Singhvi, 2025. "Online Learning with Sample Selection Bias," Operations Research, INFORMS, vol. 73(5), pages 2458-2476, September.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orijds:v:4:y:2025:i:1:p:67-84. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.