ENCODE: Breaking the Trade-Off Between Performance and Efficiency in Long-Term User Behavior Modeling

Jun Xiao; Long Chen; Rong Xiao; Wenji Zhou; Xiaosong Yang; Yinfu Feng; Yuhang Zheng; Yunan Ye

REVIEW 4 major objections 4 minor 43 references

ENCODE: Breaking the Trade-Off Between Performance and Efficiency in Long-Term User Behavior Modeling

T0 review · 4 major / 4 minor · reviewed 2026-08-15 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read ENCODE claims that clustering the full user behavior sequence offline and matching precomputed interests online breaks the trade-off between effectiveness and efficiency in long-term user behavior modeling.

desk verdict ENCODE is a plausible industrial two-stage long-term behavior model, but the abstract claims more than it shows and the fixed-cluster offline step may undercut the R2 requirement. read the letter →

arxiv 2508.13567 v1 pith:HC73HPF2 submitted 2025-08-19 cs.IR

Wenji Zhou , Yuhang Zheng , Yinfu Feng , Yunan Ye , Rong Xiao , Long Chen , Xiaosong Yang , Jun Xiao This is my paper · ORCID

classification cs.IR

keywords long-termuserbehaviormodelingclick-throughratepredictiontwo-stageclusteringmetriclearningdimensionreductioninterestextractiononlineservingefficiency

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Long-term user behavior sequences can improve click-through-rate prediction, but online systems cannot afford to scan the entire history for every request. This paper proposes ENCODE, a two-stage method that clusters the full behavior sequence offline to extract stable user interests, then uses those precomputed interests for fast online relevance matching with the target item. The claim is that ENCODE satisfies two requirements at once: it uses the entire sequence rather than a truncated window, and it keeps only the behaviors most relevant to the current target. If correct, businesses get both fuller user interest information and quick online responses, addressing the completeness-accuracy trade-off that the paper says hurts existing methods.

What carries the argument

The central mechanism is a two-stage clustering pipeline. Offline, the full behavior sequence is clustered to produce a fixed set of user interests; to make clustering affordable, a metric-learning-based dimension reduction maps behaviors into a new feature space while preserving relative pairwise distances. Online, the precomputed interests are matched to the target item using the same relevance metric that was used offline, so the metric's consistency is what guarantees that the extracted interests stay relevant to arbitrary target items.

What would settle it

Find a user whose click history includes two distinct interests that map to the same cluster centroid after the learned dimension reduction, then test a target item related to only one of them; if the model's relevance score for that item is no higher than for an unrelated item, the clustering has discarded exactly the fine-grained signal the method claims to preserve.

Watch

Extended reading notes

Core claim

The paper's central claim is that ENCODE achieves a desirable balance between online service efficiency and precision without sacrificing either of two basic requirements: R1) making full use of the entire behavior sequence, and R2) extracting information from the most relevant behaviors for the current target item. In the offline extraction stage, ENCODE clusters the entire behavior sequence to obtain accurate interests, aided by a metric-learning dimension reduction that preserves relative pairwise distances between behaviors. In the online inference stage, it uses these off-the-shelf interests to predict associations with target items, applying the same relevance metric throughout the pipeline to keep the learned interests relevant to the target. The paper reports that experiments and comparison with state-of-the-art methods demonstrate effectiveness and efficiency.

Load-bearing premise

The offline clustering of the full behavior sequence, after dimension reduction that keeps relative pairwise distances, produces a small set of fixed interests that still holds enough information to match any future target item; if the reduction or clustering discards fine-grained signals, the accuracy gains vanish even though the online stage stays fast.

Editorial extensions

If this is right

If the claim holds, online serving systems can base predictions on the complete user history instead of a truncated recent window, recovering information that existing methods discard.
The shared relevance metric means the same notion of 'relevant behavior' governs both offline extraction and online matching, so the interests served at inference time are aligned with the clustering objective.
Metric-preserving dimension reduction implies the clustering quality is retained while the computational cost of offline clustering is cut, which is what makes full-sequence processing practical.
Since interests are precomputed offline, the online stage only needs to compare a small set of interest vectors with the target item, keeping latency low regardless of sequence length.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

A testable extension would be to check whether the fixed number of clusters limits the method when a user's interests shift over very long horizons; the paper's static clustering may need periodic offline refreshes to stay accurate.
The same loss of fine-grained behavior that the authors worry about in truncated-window methods could reappear inside the clusters: if two behaviors are far apart in the original space but merged after dimension reduction, their distinction is lost to the online stage.
The pipeline suggests a general recipe for other sequential prediction tasks: cluster the full sequence with a learned metric, then serve the cluster representatives, as long as the tasks share a notion of item relevance.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Colleague,

What you need to know: ENCODE is a two-stage pipeline for long-term user behavior modeling—offline clustering plus dimension reduction, online lookup with a shared relevance metric. The pattern itself is not new; industrial CTR papers have used offline extraction and online serving for years. The specific combination—metric-learning dimension reduction that preserves relative pairwise distances, plus using the same relevance metric end-to-end—is a reasonable engineering contribution, but the abstract doesn't quantify anything. No numbers, no datasets, no comparison results. So the paper's central claim rests entirely on an "extensive experiment" we can't see.

What's good: If the full paper actually ships the details, the design has merit. The two-stage structure directly addresses latency, and keeping the full sequence offline is the right way to think about R1. The metric-preserving dimension reduction is testable: you can check whether relative distances are actually preserved. And reusing the same relevance metric throughout is an honest design choice that at least makes the pipeline internally consistent.

Where it's soft, in proportion: The stress-test concern is real. Offline clustering is done before any target item appears. Once you compress the whole sequence into a fixed set of cluster representatives, you may lose the very target-specific behaviors that R2 is supposed to capture. The abstract asserts both R1 and R2 are met, but the method as described doesn't guarantee it. That's not a fatal flaw—you could mitigate it with enough clusters or hierarchical structure—but it's a claim that needs empirical demonstration, not assertion. The circularity question is also live: if the "same relevance metric" was learned from click-through labels, then online association scores are partly self-consistent rather than independently predictive. That doesn't kill the paper; it just means the offline/online consistency is a modeling assumption, not a validation.

The citation pattern we can't judge from the abstract; there are no citations visible. That's a symptom of the larger issue: the abstract is too thin to assess novelty or positioning. The authors don't name the prior methods they claim to improve.

Bottom line: This is a plausible industry paper that could be a solid contribution if the full text has real experiments with proper baselines, ablations, and latency measurements. As it stands, the abstract is not enough to verify anything. I'd send it to a serious referee who knows the industrial CTR literature—they can tell quickly whether the offline-clustering step actually satisfies R2 in the experiments. It's not a desk-reject unless the full paper is as empty as the abstract.

Recommendation: engage with it, but only after you have the full text in hand.

Referee Report

4 major / 4 minor

Summary. The manuscript, as submitted, consists solely of an abstract. It proposes ENCODE, a two-stage long-term user behavior modeling approach: an offline extraction stage that clusters the entire behavior sequence after metric-learning dimension reduction claimed to preserve relative pairwise distances, and an online inference stage that scores target items against the resulting user interests using the same relevance metric. The abstract asserts that ENCODE satisfies two requirements (R1: full use of the entire sequence; R2: extraction from the most relevant behaviors) and reports an unspecified 'extensive experiment and comparison with SOTA' demonstrating effectiveness and efficiency. No methods, equations, datasets, baselines, or numerical results are provided in the manuscript body.

Significance. If the claims were substantiated, ENCODE could be of practical significance for industrial Click-Through Rate systems that must serve long user behavior sequences under strict latency budgets. The two-stage design is a plausible way to separate expensive offline processing from fast online scoring, and the idea of reusing a single relevance metric across both stages is an interesting attempt to align offline extraction with online association. However, the current submission contains no verifiable evidence; as presented, its scientific significance cannot be assessed.

major comments (4)

[Full text] The manuscript body is empty: there is no algorithm description, no mathematical formulation, no experimental protocol, and no results. The central claim that ENCODE achieves a desirable balance between online service efficiency and precision while outperforming state-of-the-art methods is therefore entirely unsupported. This is a load-bearing omission, not a presentation issue.
[Abstract] The claim that ENCODE satisfies R2 (extract information from the most relevant behaviors) does not follow from the described target-agnostic offline clustering. Because the entire behavior sequence is clustered before any target item is observed, the online stage can only access fixed cluster representatives; for a specific target, the most relevant behaviors may be dispersed across several clusters or buried inside a low-ranked cluster, and the abstract provides no argument or experiment showing that the fixed clusters preserve target-specific relevance.
[Abstract] The assertion that the metric-learning dimension reduction 'preserves the relative pairwise distances of behaviors' is stated without an error bound, a distortion measure, or any evaluation. Since clustering quality and hence the extracted interests depend on this preservation, the claim is load-bearing and currently unverified.
[Abstract] The design choice to adopt 'the same relevance metric throughout the whole pipeline' raises a circularity concern: if this metric is learned from click-through labels, then offline extraction and online scoring are jointly fitted to the same objective, which does not by itself establish that the metric has independent predictive validity. The abstract does not specify whether the metric is learned, from what data, or how overfitting is avoided.

minor comments (4)

[Abstract] The acronym ENCODE is not transparently derived from 'EfficieNt Clustering based twO-stage interest moDEling'; consider a clearer expansion or a different name.
[Abstract] The claim that existing methods 'inadvertently' destroy R1 and R2 is not accompanied by any specific references or concrete examples, making it difficult to evaluate the stated motivation.
[Abstract] The terms 'precision' and 'efficiency' are used without definition; the abstract should identify the effectiveness metric (e.g., AUC, GAUC) and the efficiency metric (e.g., latency, throughput).
[Abstract] The phrase 'off-the-shelf user interests' is vague; the abstract should clarify whether these are cluster centroids, mixture components, or other summary statistics.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity evident in the abstract; the derivation chain is not specified enough to exhibit any input-output equivalence.

full rationale

The only in-scope text is the abstract. It describes a two-stage architecture: an offline stage that clusters the full behavior sequence under a learned dimension reduction preserving relative pairwise distances, and an online stage that scores target items against the resulting cluster-level interests using the same relevance metric. No equations, training objectives, fitted parameters, or benchmarking details are provided, so there is no concrete reduction to exhibit. The phrase 'adopt the same relevance metric throughout the whole pipeline' could be circular if that metric were directly optimized against the same click labels used to evaluate the final predictions, but the abstract does not say this, and no specific metric-learning loss or evaluation target is quoted. Likewise, the claim that the offline clusters retain 'the most relevant behaviors' is a substantive architectural assumption about information preservation, but an unproven assumption is not circularity. There are no self-citations, no imported uniqueness theorems, and no renamed known results in the abstract. Under the hard rule that circularity must be demonstrated by quoting a specific reduction, no circular step can be identified. The correct finding is therefore no significant circularity with score 0, while noting that the abstract is too underspecified to verify the effectiveness claim independently.

Assumptions & free parameters 3 free parameters · 3 assumptions · 0 invented entities

Since only the abstract is available, numerical choices and formal assumptions are not disclosed. The entries above are inferred from the method description and should be checked against the full text.

free parameters (3)

Number of behavior clusters
The clustering step requires a chosen granularity; the abstract does not state how it is set or tuned.
Embedding dimension for dimension reduction
Metric-learning-based dimension reduction implies a target dimensionality; not specified in the abstract.
Relevance metric parameters
The shared relevance metric may contain learned thresholds or weights; not described in the abstract.

assumptions (3)

domain assumption Long-term user interest can be faithfully represented as a set of clusters over the entire behavior sequence.
The offline extraction stage reduces a full sequence to clustered interests; if this representation is lossy, accuracy claims fail. The abstract states this design without justification.
domain assumption Preserving relative pairwise distances under dimension reduction is sufficient for clustering quality and downstream relevance.
The abstract says the dimension reduction 'preserves the relative pairwise distances,' but provides no proof or evaluation that this property is enough for the task.
ad hoc to paper The same relevance metric can be used for offline extraction and online association without degrading performance.
Requiring the same metric throughout is a design choice; the abstract presents it as a benefit but does not justify why it is optimal or unbiased.

how reviews work

0 comments

Cite this review

Pith. "Pith review of ENCODE: Breaking the Trade-Off Between Performance and Efficiency in Long-Term User Behavior Modeling." pith.science (2026). https://pith.science/paper/HC73HPF2

@misc{pith2026250813567,
  author       = {Pith},
  title        = {Pith review of: ENCODE: Breaking the Trade-Off Between Performance and Efficiency in Long-Term User Behavior Modeling},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/HC73HPF2}},
  note         = {Machine review of arXiv:2508.13567}
}

read the original abstract

Long-term user behavior sequences are a goldmine for businesses to explore users' interests to improve Click-Through Rate. However, it is very challenging to accurately capture users' long-term interests from their long-term behavior sequences and give quick responses from the online serving systems. To meet such requirements, existing methods "inadvertently" destroy two basic requirements in long-term sequence modeling: R1) make full use of the entire sequence to keep the information as much as possible; R2) extract information from the most relevant behaviors to keep high relevance between learned interests and current target items. The performance of online serving systems is significantly affected by incomplete and inaccurate user interest information obtained by existing methods. To this end, we propose an efficient two-stage long-term sequence modeling approach, named as EfficieNt Clustering based twO-stage interest moDEling (ENCODE), consisting of offline extraction stage and online inference stage. It not only meets the aforementioned two basic requirements but also achieves a desirable balance between online service efficiency and precision. Specifically, in the offline extraction stage, ENCODE clusters the entire behavior sequence and extracts accurate interests. To reduce the overhead of the clustering process, we design a metric learning-based dimension reduction algorithm that preserves the relative pairwise distances of behaviors in the new feature space. While in the online inference stage, ENCODE takes the off-the-shelf user interests to predict the associations with target items. Besides, to further ensure the relevance between user interests and target items, we adopt the same relevance metric throughout the whole pipeline of ENCODE. The extensive experiment and comparison with SOTA have demonstrated the effectiveness and efficiency of our proposed ENCODE.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

43 extracted references · 40 canonical work pages

[1]

write newline

" write newline "" initialize.prev.this.status FUNCTION begin.bib " write newline preamble empty 'skip preamble write newline if " thebibliography " longest.label * " " * write newline " [1] #1 " write newline " url@samestyle " write newline " " write newline " [2] #2 " write newline " =0pt " write newline " " ALTinterwordstretchfactor * " " * write newli...
[2]

ؒ H|x 0wdQg77Х2JKjswq Ss ? dژ'gߟ?WX*(W9 ) .Ô P 3_mz& l6Myߥz> -)eqH)p [t? uk J5M9f| lqdƟa[Es젡϶J=#;<L 0 s i p̗U0MS 0 rUV;XK i iKhx<ѶQ Lma

11em plus .33em minus .07em 4000 4000 100 4000 4000 500 `\.=1000 = #1 \@IEEEnotcompsoconly \@IEEEcompsoconly #1 * [1] 0pt [0pt][0pt] #1 * [1] 0pt [0pt][0pt] #1 * \| ** #1 \@IEEEauthorblockNstyle \@IEEEcompsocnotconfonly \@IEEEauthorblockAstyle \@IEEEcompsocnotconfonly \@IEEEcompsocconfonly \@IEEEauthordefaulttextstyle \@IEEEcompsocnotconfonly \@IEEEauthor...

arXiv 1998
[3]

Practice on long sequential user behavior modeling for click-through rate prediction

Qi Pi, Weijie Bian, Guorui Zhou, Xiaoqiang Zhu, and Kun Gai. Practice on long sequential user behavior modeling for click-through rate prediction. In ACM SIGKDD , pages 2671--2679, 2019

work page 2019
[4]

Search-based user interest modeling with lifelong sequential behavior data for click-through rate prediction

Qi Pi, Guorui Zhou, Yujing Zhang, Zhe Wang, Lejian Ren, Ying Fan, Xiaoqiang Zhu, and Kun Gai. Search-based user interest modeling with lifelong sequential behavior data for click-through rate prediction. In ACM CIKM , pages 2685--2692, 2020

work page 2020
[5]

User behavior retrieval for click-through rate prediction

Jiarui Qin, Weinan Zhang, Xin Wu, Jiarui Jin, Yuchen Fang, and Yong Yu. User behavior retrieval for click-through rate prediction. In ACM SIGIR , pages 2347--2356, 2020

work page 2020
[6]

Sse-pt: Sequential recommendation via personalized transformer

Liwei Wu, Shuqing Li, Cho-Jui Hsieh, and James Sharpnack. Sse-pt: Sequential recommendation via personalized transformer. In ACM RecSys , pages 328--337, 2020

work page 2020
[7]

Transformers4rec: Bridging the gap between nlp and sequential/session-based recommendation

Gabriel de Souza Pereira Moreira, Sara Rabhi, Jeong Min Lee, Ronay Ak, and Even Oldridge. Transformers4rec: Bridging the gap between nlp and sequential/session-based recommendation. In ACM RecSys , pages 143--153, 2021

work page 2021
[8]

Lifelong sequential modeling with personalized memorization for user response prediction

Kan Ren, Jiarui Qin, Yuchen Fang, Weinan Zhang, Lei Zheng, Weijie Bian, Guorui Zhou, Jian Xu, Yong Yu, Xiaoqiang Zhu, and Kun Gai. Lifelong sequential modeling with personalized memorization for user response prediction. In ACM SIGIR , pages 565--574, 2019

work page 2019

Show all 43 references

[9]

Large-scale modeling of mobile user click behaviors using deep learning

Xin Zhou and Yang Li. Large-scale modeling of mobile user click behaviors using deep learning. In ACM RecSys , pages 473--483, 2021

2021
[10]

Contextual and sequential user embeddings for large-scale music recommendation

Casper Hansen, Christian Hansen, Lucas Maystre, Rishabh Mehrotra, Brian Brost, Federico Tomasi, and Mounia Lalmas. Contextual and sequential user embeddings for large-scale music recommendation. In ACM RecSys , pages 53--62, 2020

2020
[11]

Sminet: State-aware multi-aspect interests representation network for cold-start users recommendation

Wanjie Tao, Yu Li, Liangyue Li, Zulong Chen, Hong Wen, Peilin Chen, Tingting Liang, and Quan Lu. Sminet: State-aware multi-aspect interests representation network for cold-start users recommendation. In AAAI , pages 8476--8484, 2022

2022
[12]

Contextual-bandit based personalized recommendation with time-varying user interests

Xiao Xu, Fang Dong, Yanghua Li, Shaojian He, and Xin Li. Contextual-bandit based personalized recommendation with time-varying user interests. In AAAI , pages 6518--6525, 2020

2020
[13]

Deep learning for click-through rate estimation

Weinan Zhang, Jiarui Qin, Wei Guo, Ruiming Tang, and Xiuqiang He. Deep learning for click-through rate estimation. In IJCAI , 2021

2021
[14]

Lifelong sequential modeling with personalized memorization for user response prediction

Kan Ren, Jiarui Qin, Yuchen Fang, Weinan Zhang, Lei Zheng, Weijie Bian, Guorui Zhou, Jian Xu, Yong Yu, Xiaoqiang Zhu, et al. Lifelong sequential modeling with personalized memorization for user response prediction. In ACM SIGIR , pages 565--574, 2019

2019
[15]

Sampling is all you need on modeling long-term user behaviors for CTR prediction

Yue Cao, Xiaojiang Zhou, Jiaqi Feng, Peihao Huang, Yao Xiao, Dayao Chen, and Sheng Chen. Sampling is all you need on modeling long-term user behaviors for CTR prediction. In ACM CIKM , pages 2974--2983, 2022

2022
[16]

Factorization machines

Steffen Rendle. Factorization machines. In IEEE ICDM , pages 995--1000, 2010

2010
[17]

Field-weighted factorization machines for click-through rate prediction in display advertising

Junwei Pan, Jian Xu, Alfonso Lobos Ruiz, Wenliang Zhao, Shengjun Pan, Yu Sun, and Quan Lu. Field-weighted factorization machines for click-through rate prediction in display advertising. In WWW , pages 1349--1357, 2018

2018
[18]

Wide & deep learning for recommender systems

Heng - Tze Cheng, Levent Koc, Jeremiah Harmsen, Tal Shaked, Tushar Chandra, Hrishi Aradhye, Glen Anderson, Greg Corrado, Wei Chai, Mustafa Ispir, Rohan Anil, Zakaria Haque, Lichan Hong, Vihan Jain, Xiaobing Liu, and Hemal Shah. Wide & deep learning for recommender systems. In ...

2016
[19]

Attentional factorization machines: Learning the weight of feature interactions via attention networks

Jun Xiao, Hao Ye, Xiangnan He, Hanwang Zhang, Fei Wu, and Tat - Seng Chua. Attentional factorization machines: Learning the weight of feature interactions via attention networks. In IJCAI , pages 3119--3125, 2017

2017
[20]

Deepfm: A factorization-machine based neural network for CTR prediction

Huifeng Guo, Ruiming Tang, Yunming Ye, Zhenguo Li, and Xiuqiang He. Deepfm: A factorization-machine based neural network for CTR prediction. In IJCAI , pages 1725--1731, 2017

2017
[21]

Product-based neural networks for user response prediction

Yanru Qu, Han Cai, Kan Ren, Weinan Zhang, Yong Yu, Ying Wen, and Jun Wang. Product-based neural networks for user response prediction. In IEEE ICDM , pages 1149--1154, 2016

2016
[22]

xdeepfm: Combining explicit and implicit feature interactions for recommender systems

Jianxun Lian, Xiaohuan Zhou, Fuzheng Zhang, Zhongxia Chen, Xing Xie, and Guangzhong Sun. xdeepfm: Combining explicit and implicit feature interactions for recommender systems. In ACM SIGKDD , pages 1754--1763, 2018

2018
[23]

Deep & cross network for ad click predictions

Ruoxi Wang, Bin Fu, Gang Fu, and Mingliang Wang. Deep & cross network for ad click predictions. In ACM SIGKDD , pages 12:1--12:7, 2017

2017
[24]

Deep neural networks for youtube recommendations

Paul Covington, Jay Adams, and Emre Sargin. Deep neural networks for youtube recommendations. In ACM RecSys , pages 191--198, 2016

2016
[25]

Session-based recommendations with recurrent neural networks

Bal \' a zs Hidasi, Alexandros Karatzoglou, Linas Baltrunas, and Domonkos Tikk. Session-based recommendations with recurrent neural networks. In ICLR , 2016

2016
[26]

Deep interest evolution network for click-through rate prediction

Guorui Zhou, Na Mou, Ying Fan, Qi Pi, Weijie Bian, Chang Zhou, Xiaoqiang Zhu, and Kun Gai. Deep interest evolution network for click-through rate prediction. In AAAI , pages 5941--5948, 2019

2019
[27]

Deep session interest network for click-through rate prediction

Yufei Feng, Fuyu Lv, Weichen Shen, Menghan Wang, Fei Sun, Yu Zhu, and Keping Yang. Deep session interest network for click-through rate prediction. In IJCAI , pages 2301--2307, 2019

2019
[28]

Bert4rec: Sequential recommendation with bidirectional encoder representations from transformer

Fei Sun, Jun Liu, Jian Wu, Changhua Pei, Xiao Lin, Wenwu Ou, and Peng Jiang. Bert4rec: Sequential recommendation with bidirectional encoder representations from transformer. In ACM CIKM , pages 1441--1450, 2019

2019
[29]

Deep interest network for click-through rate prediction

Guorui Zhou, Xiaoqiang Zhu, Chenru Song, Ying Fan, Han Zhu, Xiao Ma, Yanghui Yan, Junqi Jin, Han Li, and Kun Gai. Deep interest network for click-through rate prediction. In ACM SIGIR , pages 1059--1068, 2018

2018
[30]

Multi-interest network with dynamic routing for recommendation at tmall

Chao Li, Zhiyuan Liu, Mengmeng Wu, Yuchi Xu, Huan Zhao, Pipei Huang, Guoliang Kang, Qiwei Chen, Wei Li, and Dik Lun Lee. Multi-interest network with dynamic routing for recommendation at tmall. In ACM CIKM , pages 2615--2623, 2019

2019
[31]

What aspect do you like: Multi-scale time-aware user interest modeling for micro-video recommendation

Hao Jiang, Wenjie Wang, Yinwei Wei, Zan Gao, Yinglong Wang, and Liqiang Nie. What aspect do you like: Multi-scale time-aware user interest modeling for micro-video recommendation. In ACM MM , pages 3487--3495, 2020

2020
[32]

Controllable multi-interest framework for recommendation

Yukuo Cen, Jianwei Zhang, Xu Zou, Chang Zhou, Hongxia Yang, and Jie Tang. Controllable multi-interest framework for recommendation. In ACM SIGKDD , pages 2942--2951, 2020

2020
[33]

Efficient long sequential user data modeling for click-through rate prediction

Qiwei Chen, Yue Xu, Changhua Pei, Shanshan Lv, Tao Zhuang, and Junfeng Ge. Efficient long sequential user data modeling for click-through rate prediction. arXiv , abs/2209.12212, 2022

2022 arXiv
[34]

Twin: Two-stage interest network for lifelong user behavior modeling in ctr prediction at kuaishou

Jianxin Chang, Chenbin Zhang, Zhiyi Fu, Xiaoxue Zang, Lin Guan, Jing Lu, Yiqun Hui, Dewei Leng, Yanan Niu, Yang Song, et al. Twin: Two-stage interest network for lifelong user behavior modeling in ctr prediction at kuaishou. In ACM SIGKDD , pages 3785--3794, 2023

2023
[35]

Razenshteyn, and Ludwig Schmidt

Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya P. Razenshteyn, and Ludwig Schmidt. Practical and optimal LSH for angular distance. In NeurIPS , pages 1225--1233, 2015

2015
[36]

Similarity estimation techniques from rounding algorithms

Moses S Charikar. Similarity estimation techniques from rounding algorithms. In ACM STOC , pages 380--388, 2002

2002
[37]

Distance metric learning with application to clustering with side-information

Eric Xing, Michael Jordan, Stuart J Russell, and Andrew Ng. Distance metric learning with application to clustering with side-information. In NeurIPS , 2002

2002
[38]

Facenet: A unified embedding for face recognition and clustering

Florian Schroff, Dmitry Kalenichenko, and James Philbin. Facenet: A unified embedding for face recognition and clustering. In CVPR , pages 815--823, 2015

2015
[39]

McAuley, Christopher Targett, Qinfeng Shi, and Anton van den Hengel

Julian J. McAuley, Christopher Targett, Qinfeng Shi, and Anton van den Hengel. Image-based recommendations on styles and substitutes. In ACM SIGIR , pages 43--52, 2015

2015
[40]

Sparse attentive memory network for click-through rate prediction with long sequences

Qianying Lin, Wen - Ji Zhou, Yanshi Wang, Qing Da, Qing - Guo Chen, and Bing Wang. Sparse attentive memory network for click-through rate prediction with long sequences. In ACM CIKM , pages 3312--3321, 2022

2022
[41]

The movielens datasets: History and context

F Maxwell Harper and Joseph A Konstan. The movielens datasets: History and context. ACM Transactions on Interactive Intelligent Systems (TIIS) , 5(4):1--19, 2015

2015
[42]

Adam: A method for stochastic optimization

Diederik P Kingma and Jimmy Ba. Adam: A method for stochastic optimization. In arXiv , 2014

2014
[43]

Improved deep metric learning with multi-class n-pair loss objective

Kihyuk Sohn. Improved deep metric learning with multi-class n-pair loss objective. NeurIPS , 2016

2016

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.

[1] [1]

write newline

" write newline "" initialize.prev.this.status FUNCTION begin.bib " write newline preamble empty 'skip preamble write newline if " thebibliography " longest.label * " " * write newline " [1] #1 " write newline " url@samestyle " write newline " " write newline " [2] #2 " write newline " =0pt " write newline " " ALTinterwordstretchfactor * " " * write newli...

[2] [2]

ؒ H|x 0wdQg77Х2JKjswq Ss ? dژ'gߟ?WX*(W9 ) .Ô P 3_mz& l6Myߥz> -)eqH)p [t? uk J5M9f| lqdƟa[Es젡϶J=#;<L 0 s i p̗U0MS 0 rUV;XK i iKhx<ѶQ Lma

11em plus .33em minus .07em 4000 4000 100 4000 4000 500 `\.=1000 = #1 \@IEEEnotcompsoconly \@IEEEcompsoconly #1 * [1] 0pt [0pt][0pt] #1 * [1] 0pt [0pt][0pt] #1 * \| ** #1 \@IEEEauthorblockNstyle \@IEEEcompsocnotconfonly \@IEEEauthorblockAstyle \@IEEEcompsocnotconfonly \@IEEEcompsocconfonly \@IEEEauthordefaulttextstyle \@IEEEcompsocnotconfonly \@IEEEauthor...

arXiv 1998

[3] [3]

Practice on long sequential user behavior modeling for click-through rate prediction

Qi Pi, Weijie Bian, Guorui Zhou, Xiaoqiang Zhu, and Kun Gai. Practice on long sequential user behavior modeling for click-through rate prediction. In ACM SIGKDD , pages 2671--2679, 2019

work page 2019

[4] [4]

Search-based user interest modeling with lifelong sequential behavior data for click-through rate prediction

Qi Pi, Guorui Zhou, Yujing Zhang, Zhe Wang, Lejian Ren, Ying Fan, Xiaoqiang Zhu, and Kun Gai. Search-based user interest modeling with lifelong sequential behavior data for click-through rate prediction. In ACM CIKM , pages 2685--2692, 2020

work page 2020

[5] [5]

User behavior retrieval for click-through rate prediction

Jiarui Qin, Weinan Zhang, Xin Wu, Jiarui Jin, Yuchen Fang, and Yong Yu. User behavior retrieval for click-through rate prediction. In ACM SIGIR , pages 2347--2356, 2020

work page 2020

[6] [6]

Sse-pt: Sequential recommendation via personalized transformer

Liwei Wu, Shuqing Li, Cho-Jui Hsieh, and James Sharpnack. Sse-pt: Sequential recommendation via personalized transformer. In ACM RecSys , pages 328--337, 2020

work page 2020

[7] [7]

Transformers4rec: Bridging the gap between nlp and sequential/session-based recommendation

Gabriel de Souza Pereira Moreira, Sara Rabhi, Jeong Min Lee, Ronay Ak, and Even Oldridge. Transformers4rec: Bridging the gap between nlp and sequential/session-based recommendation. In ACM RecSys , pages 143--153, 2021

work page 2021

[8] [8]

Lifelong sequential modeling with personalized memorization for user response prediction

Kan Ren, Jiarui Qin, Yuchen Fang, Weinan Zhang, Lei Zheng, Weijie Bian, Guorui Zhou, Jian Xu, Yong Yu, Xiaoqiang Zhu, and Kun Gai. Lifelong sequential modeling with personalized memorization for user response prediction. In ACM SIGIR , pages 565--574, 2019

work page 2019