paper-with-me

홈 › Papers

MOEF: Modeling Occasion Evolution in Frequency Domain for Promotion-Aware Click-Through Rate Prediction

2021-12-27 · Xiaofeng Pan, Yibin Shen, Jing Zhang, Xu He, Yang Huang, Hong Wen, Chengjun Mao, Bo Cao

Promotions are becoming more important and prevalent in e-commerce to attract customers and boost sales, leading to frequent changes of occasions, which drives users to behave differently. In such situations, most existing Click-Through Rate (CTR) models can't generalize well to online serving due to distribution uncertainty of the upcoming occasion. In this paper, we propose a novel CTR model named MOEF for recommendations under frequent changes of occasions. Firstly, we design a time series that consists of occasion signals generated from the online business scenario. Since occasion signals are more discriminative in the frequency domain, we apply Fourier Transformation to sliding time windows upon the time series, obtaining a sequence of frequency spectrum which is then processed by Occasion Evolution Layer (OEL). In this way, a high-order occasion representation can be learned to handle the online distribution uncertainty. Moreover, we adopt multiple experts to learn feature representations from multiple aspects, which are guided by the occasion representation via an attention mechanism. Accordingly, a mixture of feature representations is obtained adaptively for different occasions to predict the final CTR. Experimental results on real-world datasets validate the superiority of MOEF and online A/B tests also show MOEF outperforms representative CTR models significantly.

📄 PDF Abstract BibTeX arXiv:2112.13747

Code (1)

aaronpanxiaofeng/moef 공식 구현 tf

Tasks

Click-Through Rate PredictionRecommendation SystemsTime SeriesTime Series AnalysisTime Series Prediction

Methods 이 논문이 사용한 방법론

Tanh Activation 설명 없음
Sigmoid Activation 설명 없음
LSTM An LSTM is a type of recurrent neural network that addresses the vanishing gradient problem in vanilla…

Similar Papers 제목 키워드 기반

MoEfication: Transformer Feed-forward Layers are Mixtures of Experts

2021-10-05 · Findings (ACL) 2022 5 · Zhengyan Zhang, Yankai Lin, Zhiyuan Liu, Peng Li 외

Recent work has shown that feed-forward networks (FFNs) in pre-trained Transformers are a key component, storing various linguistic and factual knowledge. However, the computational patterns of FFNs are still unclear. In…

Machine Reading ComprehensionReading ComprehensionText Classification

MoEfication: Conditional Computation of Transformer Models for Efficient Inference

2021-11-16 · ACL ARR November 2021 11 · Anonymous

Transformer-based pre-trained language models achieve superior performance on most NLP tasks due to large parameter capacity, but also lead to huge computation cost. Fortunately, we observe that most inputs only activate…

Mixture-of-Experts

From Model-Based and Adaptive Control to Evolving Fuzzy Control

2025-06-07 · Daniel Leite, Igor Škrjanc, Fernando Gomide

Evolving fuzzy systems build and adapt fuzzy models - such as predictors and controllers - by incrementally updating their rule-base structure from data streams. On the occasion of the 60-year anniversary of fuzzy set th…

Modularity in Transformers: Investigating Neuron Separability & Specialization

2024-08-30 · Nicholas Pochinkov, Thomas Jones, Mohammed Rashidur Rahman

Transformer models are increasingly prevalent in various applications, yet our understanding of their internal workings remains limited. This paper investigates the modularity and task specialization of neurons within tr…

PrunePath: Towards Highly Structured Sparse Language Models

2026-05-27 · Zhexuan Gu, Zixun Fu, Yancheng Yuan arxiv

Feed-forward networks (FFNs) dominate the parameter count and computation of modern language models, yet existing pruning methods often struggle to convert sparsity into hardware-friendly inference efficiency gains. We i…