activity
20242026
most citedMask-Encoded Sparsification: Mitigating Biased Gradients in Communication-Efficient Split Learning

2 citations · 2 across the 8 of their papers we have counts for

collaborators

8 papers

cs.NE2026

CDEoH: Category-Driven Automatic Algorithm Design With Large Language Models

Yu-Nian Wang, Shen-Huan Lyu, Ning Chen +3

With the rapid advancement of large language models (LLMs), LLM-based heuristic search methods have demonstrated strong capabilities in automated algorithm generation. However, the…

eess.IV2026

HiDE: Hierarchical Dictionary-Based Entropy Modeling for Learned Image Compression

Haoxuan Xiong, Yuanyuan Xu, Kun Zhu +2

Learned image compression (LIC) has achieved remarkable coding efficiency, where entropy modeling plays a pivotal role in minimizing bitrate through informative priors. Existing me…

cs.LG2026

Breaking the Prototype Bias Loop: Confidence-Aware Federated Contrastive Learning for Highly Imbalanced Clients

Tian-Shuang Wu, Shen-Huan Lyu, Ning Chen +4

Local class imbalance and data heterogeneity across clients often trap prototype-based federated contrastive learning in a prototype bias loop: biased local prototypes induced by i…

cs.LG2026

Enhance and Reuse: A Dual-Mechanism Approach to Boost Deep Forest for Label Distribution Learning

Jia-Le Xu, Shen-Huan Lyu, Yu-Nian Wang +4

Label distribution learning (LDL) requires the learner to predict the degree of correlation between each sample and each label. To achieve this, a crucial task during learning is t…

cs.LG2025

Compressing Model with Few Class-Imbalance Samples: An Out-of-Distribution Expedition

Tian-Shuang Wu, Shen-Huan Lyu, Ning Chen +2

In recent years, as a compromise between privacy and performance, few-sample model compression has been widely adopted to deal with limited data resulting from privacy and security…

cs.LG2025

Enhance Learning Efficiency of Oblique Decision Tree via Feature Concatenation

Shen-Huan Lyu, Yi-Xiao He, Yanyan Wang +3

Oblique Decision Tree (ODT) separates the feature space by linear projections, as opposed to the conventional Decision Tree (DT) that forces axis-parallel splits. ODT has been prov…

cs.LG2024★ 2 cited

Mask-Encoded Sparsification: Mitigating Biased Gradients in Communication-Efficient Split Learning

Wenxuan Zhou, Zhihao Qu, Shen-Huan Lyu +2

This paper introduces a novel framework designed to achieve a high compression ratio in Split Learning (SL) scenarios where resource-constrained devices are involved in large-scale…

cs.LG2024

The Role of Depth, Width, and Tree Size in Expressiveness of Deep Forest

Shen-Huan Lyu, Jin-Hui Wu, Qin-Cheng Zheng +1

Random forests are classical ensemble algorithms that construct multiple randomized decision trees and aggregate their predictions using naive averaging. \citet{zhou2019deep} furth…