Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jiaming Qian

dblp:254/0210 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
4since 2021 · last 2025
—ORCID · conflict

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Systems, architecture and hardware · 2 · 2 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

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
1 paper
Efficient and distributed learning · 33% Trustworthy machine learning · 33% Vision and language · 33%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 40% Reconfigurable computing and FPGAs · 40% Electronic design automation · 20%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
federated learning
0.912025
FOCoOp: Enhancing Out-of-Distribution Robustness in Federated Prompt Learning for Vision-Language Models · ICML 2025
Machine learning › Efficient and distributed learning › federated learning › federated fine-tuning
federated prompt learning
0.912025
FOCoOp: Enhancing Out-of-Distribution Robustness in Federated Prompt Learning for Vision-Language Models · ICML 2025
Computer vision › Vision and language › vision-language model
prompt learning
0.912025
FOCoOp: Enhancing Out-of-Distribution Robustness in Federated Prompt Learning for Vision-Language Models · ICML 2025
Machine learning › Trustworthy machine learning
robustness
0.912025
FOCoOp: Enhancing Out-of-Distribution Robustness in Federated Prompt Learning for Vision-Language Models · ICML 2025
Machine learning › Trustworthy machine learning › robustness › distribution shift
robustness to distribution shift
0.912025
FOCoOp: Enhancing Out-of-Distribution Robustness in Federated Prompt Learning for Vision-Language Models · ICML 2025
Computer vision › Vision and language
vision-language model
0.912025
FOCoOp: Enhancing Out-of-Distribution Robustness in Federated Prompt Learning for Vision-Language Models · ICML 2025
Reconfigurable computing and FPGAs
FPGA accelerator
0.812024
Unleashing Network/Accelerator Co-Exploration Potential on FPGAs: A Deeper Joint Search · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2024
Reconfigurable computing and FPGAs › FPGA architecture
FPGA architecture exploration
0.812024
Unleashing Network/Accelerator Co-Exploration Potential on FPGAs: A Deeper Joint Search · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2024
Electronic design automation
hardware/software co-design
0.812024
Unleashing Network/Accelerator Co-Exploration Potential on FPGAs: A Deeper Joint Search · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2024
Hardware accelerators and domain-specific architectures
neural architecture search
0.812024
Unleashing Network/Accelerator Co-Exploration Potential on FPGAs: A Deeper Joint Search · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2024
Hardware accelerators and domain-specific architectures › machine learning accelerator
neural network accelerator
0.812024
Unleashing Network/Accelerator Co-Exploration Potential on FPGAs: A Deeper Joint Search · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2024

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

prompt optimization · 0.9optimal transport · 0.9distributionally robust optimization · 0.9quantization · 0.8neural architecture search · 0.8hardware architecture search · 0.8genetic algorithm · 0.8
YearPublicationVenuePosition
2025 Personalized Federated Recommendation with Multi-Faceted User Representation and Global Consistent Prototype
abstract
Personalized recommender systems are critical for enhancing user engagement across a range of digital platforms. However, conventional approaches rely heavily on centralized data collection, raising significant privacy concerns. Federated recommender systems (PFRS) address these concerns by decentralizing model training, ensuring user data privacy. Despite the progress, existing methods still struggle with capturing the multi-faceted nature of user and transferring global knowledge effectively. In this work, we propose FedMUR, a novel federated recommendation framework that models user representation as a Gaussian mixture distribution, capturing users' multi-faceted characteristics. Each Gaussian component corresponds to a distinct interest facet, with adaptive mixture weights representing the user's preference intensity toward each facet. To facilitate knowledge transfer, FedMUR constructs global consistent prototypes that encode shared behavioral trends across users via popularity-weighted optimal transport. These prototypes enhance local models by injecting global shared patterns into personalized representation learning. Extensive experiments across several real-world datasets demonstrate that FedMUR significantly outperforms existing state-of-the-art federated recommendation systems.
Jiaming Qian, Xinting Liao, Xiangmou Qu, Zhihui Fu, Xingyu Lou, Changwang Zhang, Pengyang Zhou 0001, Zijun Zhou, Jun Wang 0020, Chaochao Chen 0001
CIKM1
2025 FOCoOp: Enhancing Out-of-Distribution Robustness in Federated Prompt Learning for Vision-Language Models
abstract
Federated prompt learning (FPL) for vision-language models is a powerful approach to collaboratively adapt models across distributed clients while preserving data privacy. However, existing FPL approaches suffer from a trade-off between performance and robustness, particularly in out-of-distribution (OOD) shifts, limiting their reliability in real-world scenarios. The inherent in-distribution (ID) data heterogeneity among different clients makes it more challenging to maintain this trade-off. To fill this gap, we introduce a Federated OOD-aware Context Optimization (FOCoOp) framework, which captures diverse distributions among clients using ID global prompts, local prompts, and OOD prompts. Specifically, FOCoOp leverages three sets of prompts to create both class-level and distribution-level separations, which adapt to OOD shifts through bi-level distributionally robust optimization. Additionally, FOCoOp improves the discrimination consistency among clients, i.e., calibrating global prompts, seemly OOD prompts, and OOD prompts by Semi-unbalanced optimal transport. The extensive experiments on real-world datasets demonstrate that FOCoOp effectively captures decentralized heterogeneous distributions and enhances robustness of different OOD shifts. The project is available at GitHub.
Xinting Liao, Weiming Liu 0005, Jiaming Qian, Pengyang Zhou 0001, Jiahe Xu 0003, Wenjie Wang 0007, Chaochao Chen 0001, Tat-Seng Chua
ICML3
2024 Unleashing Network/Accelerator Co-Exploration Potential on FPGAs: A Deeper Joint Search
abstract
Recently, algorithm-hardware co-exploration for neural networks (NNs) has become the key to obtaining high-quality solutions. However, previous efforts for FPGAs focus on neural architecture search (NAS) while lacking hardware architecture search (HAS), thus limiting the full potential of co-design. Although expanding the scope of HAS offers performance potential, the exponentially increased joint search space presents a formidable challenge. To address this, we propose a deep and efficient framework, which jointly searches for Networks and Accelerators for FPGAs in a balanced co-search space. First, we adjust the NAS space and then introduce a block-level bitwidth search on the software side. Meanwhile, we design a hardware-friendly quantization algorithm to facilitate hardware efficiency and accuracy. Second, we design a dataflow-configurable hardware unit with computation and memory access optimizations for quantized multiplication. Based on this, we incorporate critical heterogeneous multicore architecture exploration on the hardware side. Third, to enable rapid hardware feedback in the enlarged HAS space, we perform resource and performance modeling and design a fast hardware generation algorithm based on the genetic algorithm. Specifically, we apply optimization techniques, like mapping space pruning, greedy bandwidth allocation, and coarse-grained search, to speed up this process. We validate in edge and cloud scenarios. Experimental results show that efficiently explores a significantly larger joint space and provides high-quality solutions. Compared with previous state-of-the-art co-design works, the searched CNN-accelerator pairs improve the throughput by 2.07× ~ 7.10× and energy efficiency by 1.41× ~ 2.27× under similar accuracy on the ImageNet dataset.
Wenqi Lou, Lei Gong 0003, Chao Wang 0003, Jiaming Qian, Xuan Wang 0020, Changlong Li 0006, Xuehai Zhou
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.4
2023 NAF: Deeper Network/Accelerator Co-Exploration for Customizing CNNs on FPGA
abstract
Recently, algorithm and hardware co-design for neu-ral networks (NNs) has become the key to obtaining high-quality solutions. However, prior works lack consideration of the underlying hardware and thus suffer from a severely unbalanced neural architecture and hardware architecture search (NA-HAS) space on FPGAs, failing to unleash the performance potential. Nevertheless, a deeper joint search leads to a larger (multiplicative) search space, highly challenging the search. To this end, we propose an efficient differentiable search framework NAF, which jointly searches the networks (e.g., operations and bitwidths) and accelerators (e.g., heterogeneous multicores and mappings) under a balanced NA-HAS space. Concretely, we design a coarse-grained hardware-friendly quantization algorithm and integrate it at a block granularity into the co-search process. Meanwhile, we design a highly optimized block processing unit (BPU) with key dataflow configurable. Afterward, a dynamic hardware generation algorithm based on modeling and heuristic rules is designed to perform the critical HAS and fast generate hardware feedback. Experimental results show that compared with the previous state-of-the-art (SOTA) co-design works, NAF improves the throughput by$1.99\times\sim 6.84\times$on Xilinx ZCU102 and energy efficiency by 17%~88% under similar accuracy on the ImageNet dataset.
Wenqi Lou, Jiaming Qian, Lei Gong 0003, Xuan Wang 0020, Chao Wang 0003, Xuehai Zhou
DATE2
2019 Robust Dynamic 3D Shape Measurement with Hybrid Fourier-Transform Phase-Shifting Profilometry
Jiaming Qian, Tianyang Tao, Shijie Feng, Qian Chen 0002, Chao Zuo 0001
ICIG (3)1