Yichen Ruan
Research Subjects
Yichen Ruan has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
- Carlee Joe-Wong
Carnegie Mellon University, Pittsburgh, USA
2 shared publications - Bo Long
Monetization AI, Meta, Menlo Park, CA, USA
1 shared publication - Buyun Zhang
Meta AI, Menlo Park, USA
1 shared publication - Chaofei Yang
Meta AI, Menlo Park, CA, USA
1 shared publication - Chunzhi Yang
Meta Platforms, Inc, Menlo Park, USA
1 shared publication - Edmund Yeh
Department of Electrical and Computer Engineering, Northeastern University, Boston, MA, USA
1 shared publication
Latest Publications
- Top Cited PapersOpen Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 6225-6233
InterFormer: Effective Heterogeneous Interaction Learning for Click-Through Rate Prediction
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 6225-6233
Top Cited PapersOpen AccessInterFormer: Effective Heterogeneous Interaction Learning for Click-Through Rate Prediction
- 15 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 32 (5) , 4207-4221
How Valuable is Your Data? Optimizing Client Recruitment in Federated Learning
Federated learning allows distributed clients to train a shared machine learning model while preserving user privacy. In this framework, user devices (i.e., clients) perform local iterations of the learning algorithm on their data. These updates are periodically aggregated to form a shared model. Thus, a client represents the bundle of the user data, the device, and the user’s willingness to participate: since participating in federated learning requires clients to expend resources and reveal some information about their data, users may require some form of compensation to contribute to the training process. Recruiting more users generally results in higher accuracy, but slower completion time and higher cost. We propose the first work to theoretically analyze the resulting performance tradeoffs in deciding which clients to recruit for the federated learning algorithm. Our framework accounts for both accuracy (training and testing) and efficiency (completion time and cost) metrics. We provide solutions to this NP-Hard optimization problem and verify the value of client recruitment in experiments on synthetic and real-world data. The results of this work can serve as a guideline for the real-world deployment of federated learning and an initial investigation of the client recruitment problem.
- 15 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 32 (5) , 4207-4221
How Valuable is Your Data? Optimizing Client Recruitment in Federated Learning
Federated learning allows distributed clients to train a shared machine learning model while preserving user privacy. In this framework, user devices (i.e., clients) perform local iterations of the learning algorithm on their data. These updates are periodically aggregated to form a shared model. Thus, a client represents the bundle of the user data, the device, and the user’s willingness to participate: since participating in federated learning requires clients to expend resources and reveal some information about their data, users may require some form of compensation to contribute to the training process. Recruiting more users generally results in higher accuracy, but slower completion time and higher cost. We propose the first work to theoretically analyze the resulting performance tradeoffs in deciding which clients to recruit for the federated learning algorithm. Our framework accounts for both accuracy (training and testing) and efficiency (completion time and cost) metrics. We provide solutions to this NP-Hard optimization problem and verify the value of client recruitment in experiments on synthetic and real-world data. The results of this work can serve as a guideline for the real-world deployment of federated learning and an initial investigation of the client recruitment problem.
- Open Access
- 9 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 330-331
Poster Abstract: Fair Training of Multiple Federated Learning Models on Resource Constrained Network Devices | The 22nd International Conference on Information Processing in Sensor Networks
Federated learning (FL) is an increasingly popular form of distributed learning across devices such as sensors and smartphones. To amortize the effort and cost of setting up FL training in real world systems, in practice multiple machine learning tasks may be trained during one FL execution. However, given that the tasks have varying complexities, naïve methods of allocating resource-constrained devices to work on each task may lead to highly variable performance across the tasks. We instead propose an α -fair based allocation algorithm that dynamically allocates tasks to users during multi-model FL training, based on the prevailing loss levels.
- 9 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 330-331
Open AccessPoster Abstract: Fair Training of Multiple Federated Learning Models on Resource Constrained Network Devices | The 22nd International Conference on Information Processing in Sensor Networks
Federated learning (FL) is an increasingly popular form of distributed learning across devices such as sensors and smartphones. To amortize the effort and cost of setting up FL training in real world systems, in practice multiple machine learning tasks may be trained during one FL execution. However, given that the tasks have varying complexities, naïve methods of allocating resource-constrained devices to work on each task may lead to highly variable performance across the tasks. We instead propose an α -fair based allocation algorithm that dynamically allocates tasks to users during multi-model FL training, based on the prevailing loss levels.