Jiamu Bai

dblp:331/3706 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Efficient and distributed learning · 38% Language models and text generation · 25% Autonomous driving · 10%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
federated learning
1.622025
FlowerTune: A Cross-Domain Benchmark for Federated Fine-Tuning of Large Language Models · NeurIPS 2025
Federated Fine-tuning of Large Language Models under Heterogeneous Tasks and Client Resources · NeurIPS 2024
Natural language and speech › Language models and text generation
large language model fine-tuning
1.622025
FlowerTune: A Cross-Domain Benchmark for Federated Fine-Tuning of Large Language Models · NeurIPS 2025
Federated Fine-tuning of Large Language Models under Heterogeneous Tasks and Client Resources · NeurIPS 2024
Machine learning › Efficient and distributed learning › federated learning
federated fine-tuning
0.912025
FlowerTune: A Cross-Domain Benchmark for Federated Fine-Tuning of Large Language Models · NeurIPS 2025
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
0.712023
Among Us: Adversarially Robust Collaborative Perception by Consensus · ICCV 2023
Robotics › Autonomous driving
collaborative perception
0.712023
Among Us: Adversarially Robust Collaborative Perception by Consensus · ICCV 2023
Computer vision › 3D vision › 3d object detection
multi-agent 3d object detection
0.712023
Among Us: Adversarially Robust Collaborative Perception by Consensus · ICCV 2023
Machine learning › Transfer learning and domain adaptation
domain adaptation
0.312025
FlowerTune: A Cross-Domain Benchmark for Federated Fine-Tuning of Large Language Models · NeurIPS 2025
Robotics › Robot navigation and mapping
multi-robot perception
0.212023
Among Us: Adversarially Robust Collaborative Perception by Consensus · ICCV 2023

Methods — techniques the papers use, named apart from their topics

instruction tuning · 0.9federated learning · 0.9aggregation strategy · 0.9singular value decomposition · 0.8parameter-efficient fine-tuning · 0.8LoRA · 0.8random subset sampling · 0.7hypothesize-and-verify · 0.7consensus-based sampling · 0.7
YearPublicationVenuePosition
2025 FlowerTune: A Cross-Domain Benchmark for Federated Fine-Tuning of Large Language Models
abstract
Large Language Models (LLMs) have achieved state-of-the-art results across diverse domains, yet their development remains reliant on vast amounts of publicly available data, raising concerns about data scarcity and the lack of access to domain-specific, sensitive information. Federated Learning (FL) presents a compelling framework to address these challenges by enabling decentralized fine-tuning on pre-trained LLMs without sharing raw data. However, the compatibility and performance of pre-trained LLMs in FL settings remain largely under explored. We introduce the FlowerTune LLM Leaderboard, a first-of-its-kind benchmarking suite designed to evaluate federated fine-tuning of LLMs across four diverse domains: general NLP, finance, medical, and coding. Each domain includes federated instruction-tuning datasets and domain-specific evaluation metrics. Our results, obtained through a collaborative, open-source and community-driven approach, provide the first comprehensive comparison across 26 pre-trained LLMs with different aggregation and fine-tuning strategies under federated settings, offering actionable insights into model performance, resource constraints, and domain adaptation. This work lays the foundation for developing privacy-preserving, domain-specialized LLMs for real-world applications.
Yan Gao 0016, Massimo Roberto Scamarcia, Javier Fernández-Marqués, Mohammad Naseri, Chong Shen Ng, Dimitris Stripelis, Zexi Li 0001, Tao Shen 0002, Jiamu Bai, Daoyuan Chen, Zikai Zhang 0003, Rui Hu 0005, Inseo Song, Kangyoon Lee, Hong Jia, Ting Dang, Zheyuan Liu 0002, Daniel J. Beutel, Lingjuan Lyu, Nicholas D. Lane
NeurIPS9
2024 Federated Fine-tuning of Large Language Models under Heterogeneous Tasks and Client Resources
abstract
Federated Learning (FL) has recently been applied to the parameter-efficient fine-tuning of Large Language Models (LLMs). While promising, it raises significant challenges due to the heterogeneous resources and data distributions of clients.This study introduces FlexLoRA, a simple yet effective aggregation scheme for LLM fine-tuning, which mitigates the "buckets effect" in traditional FL that restricts the potential of clients with ample resources by tying them to the capabilities of the least-resourced participants. FlexLoRA allows for dynamic adjustment of local LoRA ranks, fostering the development of a global model imbued with broader, less task-specific knowledge. By synthesizing a full-size LoRA weight from individual client contributions and employing Singular Value Decomposition (SVD) for weight redistribution, FlexLoRA fully leverages heterogeneous client resources. Involving thousands of clients performing heterogeneous NLP tasks and client resources, our experiments validate the efficacy of FlexLoRA, with the federated global model achieving consistently better improvement over SOTA FL methods in downstream NLP task performance across various heterogeneous distributions. FlexLoRA's practicality is further underscored by our theoretical analysis and its seamless integration with existing LoRA-based FL methods, offering a path toward cross-device, privacy-preserving federated tuning for LLMs.
Jiamu Bai, Daoyuan Chen, Bingchen Qian, Liuyi Yao, Yaliang Li
NeurIPS1
2023 Among Us: Adversarially Robust Collaborative Perception by Consensus
abstract
Multiple robots could perceive a scene (e.g., detect objects) collaboratively better than individuals, although easily suffer from adversarial attacks when using deep learning. This could be addressed by the adversarial defense, but its training requires the often-unknown attacking mechanism. Differently, we propose ROBOSAC, a novel sampling-based defense strategy generalizable to unseen attackers. Our key idea is that collaborative perception should lead to consensus rather than dissensus in results compared to individual perception. This leads to our hypothesize-and-verify framework: perception results with and without collaboration from a random subset of teammates are compared until reaching a consensus. In such a framework, more teammates in the sampled subset often entail better perception performance but require longer sampling time to reject potential attackers. Thus, we derive how many sampling trials are needed to ensure the desired size of an attacker-free subset, or equivalently, the maximum size of such a subset that we can successfully sample within a given number of trials. We validate our method on the task of collaborative 3D object detection in autonomous driving scenarios.
Yiming Li 0003, Jiamu Bai, Siheng Chen, Felix Juefei-Xu, Chen Feng 0002
ICCV3