Suqi Shi

dblp:438/1312 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0009-8666-4142ORCID · reported

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

Databases, data management, data science and information retrieval · 1 · 1 since 2021

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.

Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%
Artificial intelligence
1 paper
Efficient and distributed learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › model compression
lightweight neural network
1.012026
EENet: An Efficient and Effective Network for Large-Scale CTR Prediction · ACM Trans. Inf. Syst. 2026
Recommender systems
click-through rate prediction
1.012026
EENet: An Efficient and Effective Network for Large-Scale CTR Prediction · ACM Trans. Inf. Syst. 2026
Recommender systems › click-through rate prediction
feature interaction
1.012026
EENet: An Efficient and Effective Network for Large-Scale CTR Prediction · ACM Trans. Inf. Syst. 2026
Recommender systems
industrial recommendation
0.312026
EENet: An Efficient and Effective Network for Large-Scale CTR Prediction · ACM Trans. Inf. Syst. 2026
Recommender systems
large-scale recommendation
0.312026
EENet: An Efficient and Effective Network for Large-Scale CTR Prediction · ACM Trans. Inf. Syst. 2026

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

matrix multiplication · 2.0explicit interaction · 2.0alternating stacking · 2.0
YearPublicationVenuePosition
2026 EENet: An Efficient and Effective Network for Large-Scale CTR Prediction
abstract
Efficient and effective modeling of feature interactions is key to large-scale Click-Through Rate (CTR) prediction. Although existing feature interaction methods have improved the model accuracy, their computational consumption still increase exponentially with the number of feature fields and become severe efficiency bottleneck in real-world industrial scenarios. To address the issues, we propose an E fficient and E ffective NET work for large-scale CTR prediction named EENet . EENet presents a new alternating stacking architecture of implicit and explicit interaction layers, and each implicit layer in EENet can reduce both local computational and parameter load remarkably. EENet also designs a unified explicit interaction operation which can only use simple matrix multiplication to capture field-wise patterns. Moreover, the order of multiplications in EENet is rearranged to further decrease the computational complexity from quadratic to linear with respect to the number of feature fields. EENet thus can support the high efficiency in real-practice industrial scenarios with hundreds of feature fields. A set of extensive experiments is performed on two public datasets and one industrial dataset for effectiveness evaluation, and five larger-scale synthetic datasets for efficiency evaluation. The results highlight that our EENet can significantly outperform the state-of-the-art models in terms of both efficiency and scalability, while also maintaining superior effectiveness. Compared with DCNv2 and FiBiNet, EENet achieves 8.06 \(\times\) and 36.72 \(\times\) efficiency improvements in training, and 2.02 \(\times\) and 48.88 \(\times\) improvements in inference, respectively. Our solution and source code are available at https://github.com/Yeedzhi/EENet .
Dezhi Yi, Bo Chen 0023, Ye Lu 0004, Suqi Shi, Yangsen Liu, Wei Guo 0006, Kenan Song, Huifeng Guo, Yong Liu 0020, Zhenhua Dong, Ruiming Tang
ACM Trans. Inf. Syst.5