Jingqi Feng

Jingqi Feng

Auto-generated profile, based on publicly available information

Jingqi Feng

Fudan University, Shanghai, China

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 June 2025
Verified
Conference Paper
Open access
JFJingqi Feng
Jingqi Feng
YHYukai Huang
Yukai Huang
RZRui Zhang
Rui Zhang
SLSicheng Liang
Sicheng Liang
MYMing Yan
Ming Yan
JWJie Wu
Jie Wu

26 January 2026 in Journal of King Saud University Computer and Information Sciences
Verified
Journal Article
Open access
PDF file
CHChunpu Huang
Chunpu Huang
YHYukai Huang
Yukai Huang
JFJingqi Feng
Jingqi Feng
SLSicheng Liang
Sicheng Liang
MYMing Yan
Ming Yan
JWJie Wu
Jie Wu
Serverless computing has become a transformative cloud paradigm due to its operational simplicity, cost efficiency, and elastic scalability. Unfortunately, it suffers from cold-start problems caused by container initialization during the first function invocation or after container reclamation. Container caching (i.e., keep-alive policies) is an effective and widely adopted solution to mitigate cold-starts. However, existing keep-alive policies rely on fixed time thresholds or static heuristics, making them inadequate to handle the dynamic and heterogeneous workloads. In this paper, we propose LACE, a learned container caching framework for resource management in serverless computing. Leveraging high-quality features and labels of irregular functions, LACE employs a Mixture-of-Experts (MoE) architecture to model dynamic function invocation patterns. It further incorporates a multi-task learning structure that combines regression for fine-grained interval prediction with auxiliary classification for coarse-grained pattern estimation. Evaluation on Azure workload traces shows that LACE outperforms the state-of-the-art keep-alive policy, reducing cold-start overhead and rate by 32.72% and 22.46%, respectively, while achieving container caching accuracy close to the optimal Belady policy, all without incurring excessive model decision delay or memory footprints.


8 August 2026
Verified
Conference Paper
Open access
JFJingqi Feng
Jingqi Feng
GYGuang Yang
Guang Yang
YHYukai Huang
Yukai Huang
SLSicheng Liang
Sicheng Liang
CHChunpu Huang
Chunpu Huang
JWJie Wu
Jie Wu

18 August 2026 in Knowledge-Based Systems
Verified
Journal Article
Closed access
SLSicheng Liang
Sicheng Liang
YWYihao Wen
Yihao Wen
CHChunpu Huang
Chunpu Huang
YLYu Liu
Yu Liu
YNYichen Nie
Yichen Nie
JWJie Wu
Jie Wu

8 May 2026 in SSRN Electronic Journal
Verified
Preprint
Open access
SLSicheng Liang
Sicheng Liang
YWYihao Wen
Yihao Wen
CHChunpu Huang
Chunpu Huang
YLYu Liu
Yu Liu
YNYichen Nie
Yichen Nie
JWJie Wu
Jie Wu
Multimodal Attributed Graphs (MAGs), which include textual, visual, and structural information, are prevalent in domains such as e-commerce and social media. However, zero-shot reasoning on MAGs remains challenging. Existing graph neural networks often produce biased representations due to modality imbalance and limited semantic reasoning, and their reliance on labeled data makes them almost incapable of handling such scenarios. Meanwhile, large language models (LLMs) exhibit strong cross-modal reasoning ability but lack explicit modeling of graph structure. To address these challenges, we propose CoMAG, a collaborative framework that unifies graph-enhanced multimodal representation learning with LLM-based reasoning. CoMAG extracts modality-specific embeddings via frozen encoders and refines them through self-supervised graph learning. It further derives discrete structural priors as symbolic tokens and aligns graph embeddings with the LLM token space, enabling prompt-based inference. Moreover, a structure-aware reasoning layer introduces gated structural cues, adaptive modality fusion, and neighborhood-consistent prediction to enhance robustness. Extensive experiments on multiple real-world MAG datasets for zero-shot tasks demonstrate the effectiveness of CoMAG, yielding consistent and notable improvements over state-of-the-art baselines. These results highlight CoMAG’s capability to tackle the fundamental challenges of zero-shot multimodal graph reasoning.