Meiyi Zhu

Dr. Meiyi Zhu


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
16 March 2026 in Entropy
Verified
Journal Article
Open access
PDF file
QSQizheng Sun
Qizheng Sun
CGCaili Guo
Caili Guo
MZMeiyi Zhu
Meiyi Zhu
YYYang Yang
Yang Yang
U-shaped Split Federated Learning (U-SFL) is a promising paradigm for distributed image coding, offering parallel training capabilities and privacy preservation while mitigating computational burdens on edge devices. However, the frequent bidirectional transmission of intermediate features between dual-split points incurs substantial communication overhead. To mitigate this issue, we propose a compact-feature U-shaped split federated learning framework (CoF U-SFL), which reduces communication overhead and improves training efficiency while maintaining low image distortion. We introduce a feature entropy estimation network to model the distribution of split-layer features, enabling effective compression during transmission. Furthermore, we formulate a joint optimization objective incorporating entropy constraints to guide the end-to-end training. Experimental results demonstrate that CoF U-SFL reduces communication overhead by 104.6 times while maintaining reconstruction performance.

19 November 2025 in arXiv
Verified
Preprint
Open access
PDF file
MZMeiyi Zhu
Meiyi Zhu
CGCaili Guo
Caili Guo
CFChunyan Feng
Chunyan Feng
OSOsvaldo Simeone
Osvaldo Simeone
Online conformal prediction (OCP) wraps around any pre-trained predictor to produce prediction sets with coverage guarantees that hold irrespective of temporal dependencies or distribution shifts. However, standard OCP faces two key limitations: it operates in the output space using simple nonconformity (NC) scores, and it treats all historical observations uniformly when estimating quantiles. This paper introduces attention-based feature OCP (AFOCP), which addresses both limitations through two key innovations. First, AFOCP operates in the feature space of pre-trained neural networks, leveraging learned representations to construct more compact prediction sets by concentrating on task-relevant information while suppressing nuisance variation. Second, AFOCP incorporates an attention mechanism that adaptively weights historical observations based on their relevance to the current test point, effectively handling non-stationarity and distribution shifts. We provide theoretical guarantees showing that AFOCP maintains long-term coverage while provably achieving smaller prediction intervals than standard OCP under mild regularity conditions. Extensive experiments on synthetic and real-world time series datasets demonstrate that AFOCP consistently reduces the size of prediction intervals by as much as $88\%$ as compared to OCP, while maintaining target coverage levels, validating the benefits of both feature-space calibration and attention-based adaptive weighting.