SHORING: Design Provable Conditional High-Order Interaction Network via Symbolic Testing
Not on the map. Why?
Abstract (arXiv)
Deep learning provides a promising way to extract effective representations from raw data in an end-to-end fashion and has proven its effectiveness in various domains such as computer vision, natural language processing, etc. However, in domains such as content/product recommendation and risk management, where sequence of event data is the most used raw data form and experts derived features are more commonly used, deep learning models struggle to dominate the game. In this paper, we propose a symbolic testing framework that helps to answer the question of what kinds of expert-derived features could be learned by a neural network. Inspired by this testing framework, we introduce an efficient architecture named SHORING, which contains two components: textitevent network and textitsequence network. The textitevent network learns arbitrarily yet efficiently high-order textitevent-level embeddings via a provable reparameterization trick, the textitsequence network aggregates from sequence of textitevent-level embeddings. We argue that SHORING is capable of learning certain standard symbolic expressions which the standard multi-head self-attention network fails to learn, and conduct comprehensive experiments and ablation studies on four synthetic datasets and three real-world datasets. The results show that SHORING empirically outperforms the state-of-the-art methods.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 28 of its 49 references that are in the map. First posted on arXiv 3 Jul 2021.
Builds on
28 of 49 references.
References · 28
- 2017Attention Is All You Needcited by 59,932
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
- 2020Rethinking Attention with Performerscited by 1,584
- 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 748
- 2016Wide & Deep Learning for Recommender Systemscited by 745
- 2020Long Range Arena: A Benchmark for Efficient Transformerscited by 696
- 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 673
- 2017Deep Interest Network for Click-Through Rate Predictioncited by 541
- 2017Deep & Cross Network for Ad Click Predictionscited by 392
- 2018AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networkscited by 319
- 2018Adversarial Attack on Graph Structured Datacited by 300
16 more
- 2018xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systemscited by 277
- 2017Neural Factorization Machines for Sparse Predictive Analyticscited by 183
- 2020Search-based User Interest Modeling with Lifelong Sequential Behavior Data for Click-Through Rate Predictioncited by 176
- 2016Product-based Neural Networks for User Response Predictioncited by 145
- 2017Attentional Factorization Machines: Learning the Weight of Feature Interactions via Attention Networkscited by 126
- 2019Practice on Long Sequential User Behavior Modeling for Click-Through Rate Predictioncited by 118
- 2016Deep Learning over Multi-field Categorical Data: A Case Study on User Response Predictioncited by 67
- 2021TCL: Transformer-based Dynamic Graph Modelling via Contrastive Learningcited by 65
- 2018Generative Adversarial User Model for Reinforcement Learning Based Recommendation Systemcited by 64
- 2019Deep Session Interest Network for Click-Through Rate Predictioncited by 64
- 2019Adaptive Factorization Network: Learning Adaptive-Order Feature Interactionscited by 48
- 2016Higher-Order Factorization Machinescited by 45
- 2018Double Neural Counterfactual Regret Minimizationcited by 16
- 2016Exponential Family Embeddingscited by 13
- 2016Polynomial Networks and Factorization Machines: New Insights and Efficient Training Algorithmscited by 11
- 2019Automatic trajectory measurement of large numbers of crowded objectscited by 1
Built on by
Not cited yet.