Rafael Pires
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Rafael Pires has a total of 60 co-authors. Here are the top co-authors by number of shared publications:
- Anne-Marie Kermarrec
EPFL, Lausanne, Switzerland
12 shared publications - Marcelo Pasin
University of Neuchâtel, Switzerland
10 shared publications - Martijn de Vos
EPFL, Lausanne, Switzerland
10 shared publications - Pascal Felber
University of Neuchâtel
10 shared publications - Valerio Schiavoni
University of Neuchâtel, Neuchâtel, Switzerland
7 shared publications - Akash Dhasade
EPFL, Lausanne, Switzerland
4 shared publications
Latest Publications
- 29 May 2026
- Published by Springer Nature
- p. 3-20
Efficient Federated Search for Retrieval-Augmented Generation Using Lightweight Routing
- 29 May 2026
- Published by Springer Nature
- p. 3-20
Efficient Federated Search for Retrieval-Augmented Generation Using Lightweight Routing
- Open Access
- 27 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 499-509
RIVA: Leveraging LLM Agents for Reliable Configuration Drift Detection
- 27 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 499-509
Open AccessRIVA: Leveraging LLM Agents for Reliable Configuration Drift Detection
- Open Access
- 27 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 466-472
The Cost of Expertise: Understanding MoE Decode Performance
- 27 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 466-472
Open AccessThe Cost of Expertise: Understanding MoE Decode Performance
- Open Access
- 27 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 386-396
O rbit : Efficient Agentic Inference using Priority Scheduling
- 27 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 386-396
Open AccessO rbit : Efficient Agentic Inference using Priority Scheduling
- Open Access
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 340-353
Leveraging Approximate Caching for Faster Retrieval-Augmented Generation
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 340-353
Open AccessLeveraging Approximate Caching for Faster Retrieval-Augmented Generation
- 10 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 36 (8) , 1666-1679
Boosting Resource-Constrained Federated Learning Systems With Guessed Updates
Federated learning (FL) enables a set of client devices to collaboratively train a model without sharing raw data. This process, though, operates under the constrained computation and communication resources of edge devices. These constraints combined with systems heterogeneity force some participating clients to perform fewer local updates than expected by the server, thus slowing down convergence. Exhaustive tuning of hyperparameters in FL, furthermore, can be resource-intensive, without which the convergence is adversely affected. In this work, we propose GEL, the guess and learn algorithm. GEL enables constrained edge devices to perform additional learning through guessed updates on top of gradient-based steps. These guesses are gradientless, i.e., participating clients leverage them for free. Our generic guessing algorithm (i) can be flexibly combined with several state-of-the-art algorithms including FedProx + GeL, FedNova, FedYogi or ScaleFL; and (ii) achieves significantly improved performance when the learning rates are not best tuned. We conduct extensive experiments and show that GEL can boost empirical convergence by up to 40% in resourceconstrained networks while relieving the need for exhaustive learning rate tuning.
- 10 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 36 (8) , 1666-1679
Boosting Resource-Constrained Federated Learning Systems With Guessed Updates
Federated learning (FL) enables a set of client devices to collaboratively train a model without sharing raw data. This process, though, operates under the constrained computation and communication resources of edge devices. These constraints combined with systems heterogeneity force some participating clients to perform fewer local updates than expected by the server, thus slowing down convergence. Exhaustive tuning of hyperparameters in FL, furthermore, can be resource-intensive, without which the convergence is adversely affected. In this work, we propose GEL, the guess and learn algorithm. GEL enables constrained edge devices to perform additional learning through guessed updates on top of gradient-based steps. These guesses are gradientless, i.e., participating clients leverage them for free. Our generic guessing algorithm (i) can be flexibly combined with several state-of-the-art algorithms including FedProx + GeL, FedNova, FedYogi or ScaleFL; and (ii) achieves significantly improved performance when the learning rates are not best tuned. We conduct extensive experiments and show that GEL can boost empirical convergence by up to 40% in resourceconstrained networks while relieving the need for exhaustive learning rate tuning.
- Open Access
- 22 April 2025
- Published by Association for Computing Machinery (ACM)
- p. 685-696
Boosting Asynchronous Decentralized Learning with Model Fragmentation
- 22 April 2025
- Published by Association for Computing Machinery (ACM)
- p. 685-696
Open AccessBoosting Asynchronous Decentralized Learning with Model Fragmentation
- Open Access
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 192-199
Accelerating MoE Model Inference with Expert Sharding
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 192-199
Open AccessAccelerating MoE Model Inference with Expert Sharding
- Open Access
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 74-81
Efficient Federated Search for Retrieval-Augmented Generation
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 74-81
Open AccessEfficient Federated Search for Retrieval-Augmented Generation
- Open Access
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 66-73
Leveraging Approximate Caching for Faster Retrieval-Augmented Generation
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 66-73
Open AccessLeveraging Approximate Caching for Faster Retrieval-Augmented Generation