跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+1112新增论文
+875其中 AI 相关
+133已有论文修订
+97新增 AI 导读

arXiv 最近完成扫描:2026-11-20 06:44 · 全站最近入库:2026-11-19 19:09各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-20 06:44最近发现新增版本:2026-11-19 19:09库内论文最新更新时间:2026-11-19 02:59

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

27,982 已收录论文23,249 AI 相关8,559 有修订112 HF 社区发现

浏览论文库

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

找到 7 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-20 06:42(北京时间)
新论文 · v1arXiv:2611.23936

PGU-Decoder: Prior-Guided Unified Decoding for Industrial Road-Network Map Updating

Yuguang Ning, Bingbing Kang, Nan Zhao, Zhixuan Li, Ze Zhao, Dongdong Liu, Wenjian Zhu, Zekai Liu 等 9 位作者

原文摘要

Timely road-network map updates are essential to navigation and autonomous driving. Three key tasks are intra-intersection road network generation, merging/diverging detection, and drivable-area detection, covering topology, geometry, and attributes, respectively. Separate pipelines duplicate rule maintenance, quality assurance, and manual verification, increasing operational costs. We propose PGU-Decoder, a production-grade unified decoding framework for semantic prediction across these tasks. A Prior Query Module (PQM) constructs point-level prior queries from sampled locations on road-network geometries. Fixed reference points preserve positional priors throughout decoding, allowing the model to focus on surrounding context. Point-level representations are aggregated into instance-level representations, and a Relational Graph Attention Network (RGAT) captures inter-instance dependencies. Task-specific heads then generate predictions. We validate PGU-Decoder in large-scale automated road-network map updating across more than 360 cities in China, where it consistently outperforms seven baselines. Following deployment at AutoNavi Map, it achieves quality scores above 98% on all three tasks, reduces manual verification costs by 95%, and increases update frequency from weekly to hourly. These results demonstrate a practical and cost-effective industrial solution for road-network map updating.

cs.LG

版本更新 · v3arXiv:2606.06145

Sliding-Window Quotas in Apache Hadoop YARN: Exact Admission and Flexible Placement

Ruize Zhao

原文摘要

A reservation in Apache Hadoop YARN can pass a quota of 600 MiB-hours even when a 24-hour window contains 720 MiB-hours of usage. YARN subtracts sampled prefixes to estimate the window total. This can also reject requests that fit, and adding demand can introduce a sample that reverses a rejection. We bound the peak error in both directions and implement an exact check that visits rate changes at either edge of the window. When the two policies see the same history in replays from two public job traces, they disagree on up to $13.3\%$ of requests. Among requests both policies admit, the 95th-percentile latency of inserting a reservation into the plan is $39$--$47\%$ of the sampled baseline. A separate linear scan finds all feasible integer starts for a single constant-demand stage. In a ResourceManager test, the default agent rejects a flexible request. The ResourceManager accepts the stage when submitted at a start found by the scan. In one replay, committing such retries reduces total admissions.

cs.DS

新论文 · v1arXiv:2611.08541

ELPAC: Endpoint-Anchored Latent Progression with Stage-Varying Multimodal Coordination

Shengxian Ding, Yifei Zhang, Xinyuan Tian, Yuanshuang Guo, Yize Zhao

原文摘要

Aging cohorts increasingly combine imaging, plasma, and cognitive measurements, but most subjects provide only a partially observed cross-sectional snapshot, leaving latent stage, progression subtype, and stage-varying multimodal coordination to be inferred jointly. Existing methods estimate the cohort-level aging process, model covariance under observed covariates, or fuse modalities for prediction. However, they rarely target the joint problem of endpoint-anchored staging and progression-resolved residual coordination across modalities, even though subject staging, subtype assignment, and multimodal interplay are mutually dependent. We introduce ELPAC, a Bayesian framework with two interlocking constructions. The first integrates subtype trajectories backward from clinically reliable endpoint groups along biologically structured velocity components encoding modality-specific monotone direction and optional sequential ordering priors. The second factorizes residual multimodal variation around the inferred stage axis into sparse coordination axes whose loadings and activations expose which multimodal patterns are operative in each subtype and when they emerge, with stage-resolved variation supplying the auxiliary structure for conditional identifiability. We use a scalable amortized variational inference scheme that enables joint posterior inference at cohort scale with single-pass deployment on new subjects. On synthetic data and a harmonized ADNI+NACC/SCAN Alzheimer's cohort, ELPAC demonstrates accurate latent-structure recovery, well-calibrated prediction intervals, and biologically interpretable multimodal coordination programs that differ by subtype.

stat.ML · cs.LG · stat.ME

新论文 · v1arXiv:2611.04747

TAPES: Task-Aligned Joint Predictive Pretraining for Transaction Event Sequences

Ruobing Zuo, Weiyu Han, Huilin He, Haoyu Jiang, Ze Zhao, Jie Sheng, Xiao Tan, Shuai Chen 等 9 位作者

原文摘要

Transaction event sequences support diverse prediction tasks in online commerce and digital financial services. The same transaction records can yield prediction targets with different semantics, including values, changes, and relations to past events. These targets impose different constraints on history representations, but their predictability alone does not establish the downstream utility of a target set. Moreover, target-wise prediction losses do not explicitly model conditional co-occurrence among targets. To address these challenges, we propose TAPES, a task-aligned joint predictive pretraining framework for transaction sequences. TAPES constructs a finite collection of candidate target sets from admissible field-operator combinations. It selects a target set according to the downstream utility of representations learned through short joint pretraining trials under matched budgets. It then reinitializes the encoder and pretrains it on the selected targets through a joint likelihood parameterized by a shared discrete latent variable, before downstream supervised adaptation. Experiments in a real-world transaction-risk setting and on multiple public financial benchmarks spanning diverse downstream tasks demonstrate that TAPES outperforms representative baselines. Ablation studies further validate the contributions of predictive target selection and joint modeling.

cs.LG · cs.AI

版本更新 · v2arXiv:2611.01796

Exact Tie-Breaking and Tight Degree Bounds for Minimum-Degree Greedy on Interval Graphs

Ruize Zhao

原文摘要

We study tie-breaking in the minimum-degree greedy algorithm (MDG) for maximum independent set on interval graphs. Given an interval representation of an $n$-vertex graph, we compute the largest and smallest output sizes and construct executions attaining them in $O(n^3)$ time and $O(n^2)$ space. For maximum degree at most four, favorable tie-breaking gives a tight guarantee of $3/4$. For every maximum-degree bound of at least five, the guarantee drops to $2/3$. Both bounds are tight even on connected unit interval graphs whose output size is independent of tie-breaking. Together with the known optimality of favorable tie-breaking for maximum degree at most three, these results give a complete classification by degree bound.

cs.DS

新论文 · v1arXiv:2611.02640

InterFuse: Interaction-Guided Adaptive Fusion of Heterogeneous Models for Payment Risk Ranking

Haoyu Jiang, Weiyu Han, Ze Zhao, Jie Sheng, Ruobing Zuo, Xiao Tan, Shuai Chen, Tianyi Zhang

原文摘要

Payment platforms use view-specific models trained on transaction attributes, behavioral histories, and relational structures to rank transactions under limited review budgets. However, existing fusion methods often focus on prediction scores or interactions among model representations, with less attention to how these interactions should guide aggregation using each model's original prediction and input coverage. To address this limitation, we propose InterFuse, a fusion framework that uses a shared fusion state from cross-model interaction to guide transaction-adaptive aggregation. InterFuse encodes each model's representation, prediction score, and input coverage as a model-specific token, using learned states for unavailable outputs. Availability-aware attention updates these tokens and produces a shared fusion state. This state then guides aggregation over available models using their updated representations, original predictions, and input coverage. We evaluate InterFuse on an industrial payment replay and three public financial benchmarks using the same upstream models across fusion methods. InterFuse achieves the highest top-ranked recall and AUC on all four datasets, improving Recall@1% by 1.11-8.09 percentage points over the strongest baselines. Ablations show the benefits of cross-model interaction and adaptive aggregation, while industrial analyses find larger interaction gains when model predictions disagree. Additional analyses examine robustness to missing outputs and the trade-off between ranking gains and fusion latency.

cs.AI

版本更新 · v2arXiv:2610.37365

TRIDENT-Seq: Profile-Matched Prefix-Future Contrast for Label-Efficient Payment Risk Modeling

Weiyu Han, Haoyu Jiang, Jie Sheng, Ruobing Zuo, Huilin He, Ze Zhao, Xiao Tan, Nairong Zhang 等 10 位作者

原文摘要

Ant International accumulates large volumes of transaction history across users and payment businesses. Confirmed fraud and chargeback outcomes, by contrast, are scarce, delayed, and specific to each business. A single encoder pretrained on unlabeled histories could serve all businesses, but only if pretraining captures the behavior that separates risk. Coarse activity differences can make contrastive pretraining on transaction logs too easy: transaction volume, amount, and timing can distinguish a history's continuation from arbitrary candidates without modeling how payment resources are used. We present TRIDENT-Seq, a transaction foundation model trained with Prefix-Future Contrast (PFC). PFC matches each prefix to a summary of its subsequent behavior among candidates with similar activity profiles; activity prediction and dispersion regularization act on the encoder output. Across three production payment businesses, the pretrained encoder improves average precision (AP) and recall at a 0.5% intervention budget over architecture-matched scratch training in all six business-budget settings. With a fixed validation set, it exceeds full-label scratch training in mean AP and recall using 10% of the training labels on Wallet and 25% on Shopping and SME. Pretraining only on another business's histories still helps. Replacing profile-matched candidates with random ones cuts recall from 24.62% to 5.64%. In Ant International's deployment evaluation, recorded amount-based chargeback and overall loss rates are 37.7% and 37.9% lower than those of the previous XGBoost-based system under the same intervention budget.

cs.LG