跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+479新增论文
+361其中 AI 相关
+64已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-16 01:34 · 全站最近入库:2026-11-16 21:56各信源进度 →

统计口径与数据新鲜度

统计 2026-11-16 02:24 — 2026-11-17 02:24(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-16 01:34最近发现新增版本:2026-11-16 21:56库内论文最新更新时间:2026-11-14 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

23,827 已收录论文19,941 AI 相关6,922 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 3 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
版本更新 · v2arXiv:2602.10811

EST: Towards Efficient Scaling Laws in Click-Through Rate Prediction via Unified Modeling

Mingyang Liu, Yong Bai, Zhangming Chan, Sishuo Chen, Xiang-Rong Sheng, Han Zhu, Jian Xu, Xinyang Chen

原文摘要

Efficiently scaling industrial Click-Through Rate (CTR) prediction has recently attracted significant research attention. Existing approaches typically employ early aggregation of user behaviors to maintain efficiency. However, such non-unified or partially unified modeling creates an information bottleneck by discarding fine-grained, token-level signals essential for unlocking scaling gains. In this work, we revisit the fundamental distinctions between CTR prediction and Large Language Models (LLMs), identifying two critical properties: the asymmetry in information density between behavioral and non-behavioral features, and the modality-specific priors of content-rich signals. Accordingly, we propose the Efficiently Scalable Transformer (EST), which achieves fully unified modeling by processing all raw inputs in a single sequence without lossy aggregation. EST integrates two modules: Lightweight Cross-Attention (LCA), which prunes redundant self-interactions to focus on high-impact cross-feature dependencies, and Content Sparse Attention (CSA), which utilizes content similarity to dynamically select high-signal behaviors. Extensive experiments show that EST exhibits a stable and efficient power-law scaling relationship, enabling predictable performance gains with model scale. Deployed on Taobao's display advertising platform, EST significantly outperforms production baselines, delivering a 3.27\% RPM (Revenue Per Mile) increase and a 1.22\% CTR lift, establishing a practical pathway for scalable industrial CTR prediction models.

cs.IR

版本更新 · v3arXiv:2606.26578

EvoOptiGraph: Weakness-Driven Coevolution via Graph-Based Structural Generation for Optimization Modeling

Qingcan Kang, Mingyang Liu, Xiaojin Fu, Shixiong Kai, Tao Zhong, Mingxuan Yuan

原文摘要

Automating optimization modeling from natural language with large language models (LLMs) faces two key challenges. First, training corpora lack structural diversity. Second, data generation pipelines remain static and decoupled from model learning. To address these challenges, we propose EvoOptiGraph, a novel framework where data and model co-evolve, driven by model weaknesses. EvoOptiGraph represents each mixed-integer linear program (MILP) as an attributed bipartite graph and applies validity-preserving evolutionary operators to generate structurally diverse instances. The evolved graphs are converted into solver code and natural language via deterministic compilation and verified back-translation. Training proceeds in two stages: supervised fine-tuning (SFT) on an initial dataset, followed by reinforcement learning with verifiable rewards (RLVR), where graph-derived weakness signals guide the generation of new instances targeting the model's failures. This forms a closed loop that continuously updates the training distribution. Empirical results on six public datasets show that EvoOptiGraph significantly outperforms larger generalist models, agentic methods, and specialized baselines in accuracy, executability, and generalization. These results demonstrate that targeted data-model coevolution is an effective strategy for improving LLMs on optimization modeling tasks.

cs.AI

版本更新 · v2arXiv:2606.23120

Does Source-Free Time-Series Adaptation Really Require Updating the Encoder?

Shichang Meng, Linquan Wu, Xuan Ai, Yi Wu, Mingyang Liu, Linqi Song

原文摘要

Source-free domain adaptation (SFDA) adapts a pretrained model to an unlabeled target domain without accessing source data, enabling the reuse of time-series predictors across sensing systems. Existing methods commonly update the encoder using unlabeled target objectives. Yet changes in users, equipment, and operating conditions also alter the spectral characteristics of input signals, raising a fundamental question: does adaptation require changing the encoder, or can we instead adapt the signal it receives? We propose Source Free Frequency-Prototype Alignment (SF-FPA), which learns a spectral input transformation while freezing the source encoder and classifier parameters. First, a frequency adaptation layer applies amplitude and phase corrections to target signals. Separate branches adjust spectral magnitudes and phase relationships, with circular phase encoding avoiding discontinuities at the angular boundary. Second, confidence-filtered prototype alignment guides target representations toward source class prototypes. Combined with information maximization, this objective propagates gradients through the source predictor to learn spectral corrections that support class discrimination. Extensive experiments on three real-world time series benchmarks demonstrate state-of-the-art average Macro-F1 performance. Component ablations and controlled comparisons with encoder adaptation and a parameter-matched time-domain adapter further support spectral input adaptation as an effective approach to reusing source-trained predictors. The implementation is available at https://github.com/ShichangMeng/SF_FPA.

cs.LG