arXiv Machine Learning

MultiCard: Multiple Attribute Cardinality Estimation via Deep Learning

arXiv AI
Sep 16

QueryFormer: Winning Solution for KDD Cup 2026 Tencent UniRec Challenge

QueryFormer is a unified architecture designed for post‑click conversion rate prediction, addressing both feature interactions and sequential user behaviors. It introduces a stackable field–sequence block that generates query tokens via cross‑attention and packs sequence queries into shared‑parameter attention, improving efficiency and accuracy. The model won first place in the KDD Cup 2026 Tencent UniRec Challenge Industrial Track with an AUC of 0.83254, and scaling studies show that increasing view width slightly boosts validation AUC while maintaining low latency.

By Yuanzhe Zhou, Zhaoyang Zeng
arXiv Machine Learning
Jun 3

Dynamic Short Convolutions Improve Transformers

arXiv:2606. 03825v1 Announce Type: new Abstract: Transformers have become the dominant architecture for large language models, largely due to the scalability and flexibility of attention, feed-forward layers, residual connections, and normalization.

By Oliver Sieberling, Bharat Runwal, Rameswar Panda, Yoon Kim
arXiv AI
Sep 18

QUALS: Corpus Equilibrium for Universal Forecasting via Pattern Quantization and Learnability Synchronization

QUALS is a large‑scale time‑series corpus equilibrium framework designed to improve data efficiency for zero‑shot forecasting. It uses pattern quantization to decode heterogeneous patterns from mixed corpora and a learnability synchronization mechanism to calibrate sampling weights, bridging the optimization gap between simple and complex motifs. Benchmarks show that pre‑training on QUALS yields superior zero‑shot performance even with reduced training budgets.

By Yujie Li, Zezhi Shao, Chengqing Yu, Yisong Fu, Weijie Zhu, Yifan Du, Jilin Hu, Bin Yang, Yongjun Xu, Fei Wang
arXiv Machine Learning
Aug 27

MetaSieve: Faster Relational Deep Learning through SQL-Based Metapath Selection

MetaSieve is a metapath selection layer that reduces subgraph size in relational deep learning by pruning uninformative metapaths using SQL join and aggregation statistics. It scores candidate metapath extensions with a lightweight function that favors informative yet lightweight paths, discarding those below a threshold. The method is independent of GNN parameters and, when applied to the RelBench benchmark, consistently cuts per‑epoch training time while preserving or improving accuracy.

By Fahim Shahriar Khan, Ashraf Aboulnaga
arXiv Machine Learning
Sep 14

FEAT: A Linear-Complexity Foundation Model for Extremely Large Structured Data

FEAT is a foundation model designed for extremely large structured data that replaces quadratic self‑attention with a linear‑complexity dual‑axis encoding architecture. It combines an adaptive‑fusion bidirectional state‑space model with convolutional gated linear attention to achieve permutation‑invariant representation learning in O(N) time. Experiments on 12 real‑world database benchmarks show that FEAT outperforms existing structured data foundation models on zero‑shot tasks and can be up to 50× faster in inference latency.

By Zhenghang Song, Tang Qian, Lu Chen, Yushuai Li, Zhengke Hu, Bingbing Fang, Yumeng Song, Junbo Zhao, Sheng Zhang, Tianyi Li