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

Jiaqi Gui

dblp:128/7692 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Computer networks · 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
2 papers
Efficient and distributed learning · 41% Learning paradigms · 41% Optimization for machine learning · 12%
Computer graphics and multimedia
1 paper
Image and video processing · 50% Computational photography and imaging · 50%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › parameter-efficient fine-tuning
adapter tuning
1.012026
Random Amalgamation of Adapters for Flatter Loss Landscapes: Towards Class-Incremental Learning with Better Stability · AAAI 2026
Machine learning › Learning paradigms › continual learning › catastrophic forgetting
catastrophic forgetting mitigation
1.012026
Random Amalgamation of Adapters for Flatter Loss Landscapes: Towards Class-Incremental Learning with Better Stability · AAAI 2026
Machine learning › Learning paradigms › continual learning
class-incremental learning
1.012026
Random Amalgamation of Adapters for Flatter Loss Landscapes: Towards Class-Incremental Learning with Better Stability · AAAI 2026
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning
1.012026
Random Amalgamation of Adapters for Flatter Loss Landscapes: Towards Class-Incremental Learning with Better Stability · AAAI 2026
Machine learning › Optimization for machine learning › optimization landscape
flat minima
0.312026
Random Amalgamation of Adapters for Flatter Loss Landscapes: Towards Class-Incremental Learning with Better Stability · AAAI 2026
Machine learning › Optimization for machine learning › gradient-based optimization
sharpness-aware minimization
0.312026
Random Amalgamation of Adapters for Flatter Loss Landscapes: Towards Class-Incremental Learning with Better Stability · AAAI 2026

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

spatio-temporal alignment · 2.0motion-aware representation learning · 2.0generative fusion · 2.0sharpness-aware minimization · 1.0adapter amalgamation · 1.0
YearPublicationVenuePosition
2026 Random Amalgamation of Adapters for Flatter Loss Landscapes: Towards Class-Incremental Learning with Better Stability
abstract
Class-incremental learning (CIL) enables models to continuously learn from streaming data while mitigating catastrophic forgetting of prior knowledge. Our research reveals that the CIL performance of pre-trained models (PTMs) varies significantly across different datasets, a phenomenon underexplored in existing studies. Through visualization, we observe that flatter loss landscapes correlate with superior CIL performance. This insight motivates us to enhance PTMs' CIL capability by promoting loss landscapes' flatness. Initially, we propose independently optimizing multiple adapter branches to equip PTMs with diverse learnable parameters, thereby improving stability during parameter updates. However, given computational and memory constraints, the number of adapters a PTM can accommodate is limited. To address this, we introduce a training strategy with randomized adapter amalgamation (RAA), compelling the model to maintain low loss across a broader and more continuous parameter space, significantly enhancing flatness. Furthermore, we refine existing sharpness-aware minimization techniques to further optimize the loss landscapes. Our extensive experiments and visualization results validate the efficacy of the method, resulting in the state-of-the-art (SOTA) performance.
Xiang Xiang 0001, Jiaqi Gui
AAAI3
2026 AerialFusion: Co-Motion-Driven Unified Registration and Fusion on Multi-modal Data Streams from Aerial View
abstract
Aerial multi-modal visual streams registration and fusion can generate more comprehensive scene information representations for UAVs' cross-modal perception. However, current challenges lie primarily in the essential difficulty of joint spatiotemporal representation learning from dynamic background and moving targets, and a critical shortage exists in large-scale, well-annotated multi-modal visual streams benchmark for UAV platforms. In this paper, we propose AerialFusion, a co-motion-driven unified UAVs visual streams registration and fusion that fully mines modality-invariant common features based on motion-aware, enabling spatiotemporally coherent registration and fusion. Specifically, 1) a Skewed Motion Distribution Field Co-Motion-Driven Image Registration, 2) a Co-Motion Generative Fusion, 3) a Streams-based Unified Learning. Furthermore, we introduce EUM3D, a registration and fusion benchmark for UAVs cross-modal perception. This benchmark contains 60 synchronized visible-infrared visual streams, or 122k spatially and temporally aligned pairs, most of which were taken at low-light scenes. And EUM3D provides pixel-level alignment guarantees via perspective-transform ground-truth. Extensive experiments reveal that AerialFusion surpasses current focus on image and static background fusion methods in aerial sequence scenarios, addressing spatiotemporal mismatches while suppressing cross-modal interference.
Junhui Qiu, Xiang Xiang 0001, Hongyun Wang, Jiaqi Gui
AAAI4
2010 A Linear Algebraic Approach for Loss Tomography in Mesh Topologies Using Network Coding
abstract
Loss tomography aims to infer link loss rates using end-to-end measurements. We investigate active loss tomography on mesh topologies. When network coding is applied, based on the content of the received probe packet, a receiver should distinguish which paths have successfully transmitted a probe and which paths have not. We establish a lower bound on probe size which is necessary for obtaining such end-to-end observations. Furthermore, we propose a linear algebraic (LA) approach to developing consistent estimators of link loss rates. Our approach exploits the inherent correlation between the losses on links and the losses on different sets of paths, so that the estimators converge to the actual loss rates as the number of probes increases. We also prove that the identiflability of a link is a necessary and sufficient condition for the consistent estimation of its loss rate. Simulation results show that the LA approach achieves better estimation accuracy than the belief propagation (BP) algorithm, after sending reasonably sufficient probes.
Jiaqi Gui, Vahid Shah-Mansouri, Vincent W. S. Wong 0001
ICC1