跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+1084新增论文
+883其中 AI 相关
+130已有论文修订
+94新增 AI 导读

arXiv 最近完成扫描:2026-11-18 04:28 · 全站最近入库:2026-11-18 19:45各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-18 04:28最近发现新增版本:2026-11-18 19:45库内论文最新更新时间:2026-11-18 08:00

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

26,870 已收录论文22,374 AI 相关8,156 有修订112 HF 社区发现

浏览论文库

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

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-18 04:27(北京时间)
新论文 · v1arXiv:2611.08032

Reproducing Kernel (Quasi-)Banach Spaces with the $\ell^p$ Coefficient Norms

Tianfang Wang, Guohui Song, Haizhang Zhang

原文摘要

This paper advances the theory of reproducing kernel Banach spaces (RKBSs) by investigating the general $\ell^p$ regularization framework, with a particular focus on the non-convex regime $0<p<1$. While our preceding work established the foundation for RKBSs with the $\ell^1$ norm, the pursuit of stronger sparsity---closer to the $\ell^0$ pseudo-norm---naturally motivates this exploration into $\ell^p$ quasi-norms. For $0<p<1$, we construct reproducing kernel quasi-Banach spaces (RKQBSs) with $\ell^p$ quasi-norms and establish existence and sparsity results for interpolation and regularized learning under appropriate assumptions. We characterize the linear and relaxed representer theorems in terms of a generalized Lebesgue constant and derive bounds under kernel decay, sample spacing, and stability assumptions. For $p>1$, we construct RKBSs using a fixed countable dictionary, establish minimizer existence, and identify the optimal relaxed representer factor through an off-sample coefficient operator. These results reveal fundamental differences between the regimes $0<p<1$, $p=1$, and $p>1$. Numerical experiments compare the accuracy and sparsity of solutions for these three cases.

cs.LG

版本更新 · v4arXiv:2507.22524

HGCN(O): A Self-Tuning GCN HyperModel Toolkit for Outcome Prediction in Event-Sequence Data

Fang Wang, Paolo Ceravolo, Ernesto Damiani

原文摘要

Outcome prediction from event sequence data requires effective use of information at two distinct semantic levels: attributes of individual events and attributes of the complete sequence. Although graph models can explicitly represent temporal relations between events, existing approaches commonly rely on predefined representations and manually configured architectures, with limited consideration of how event and sequence information should be incorporated at their corresponding GNN levels or how GNN models should be fitted to different datasets without manual tuning. We propose HGCN(O), an end to end self tuning graph toolkit for hierarchical information representation and automated model configuration. Its core T-GCN architecture processes event information at the node level and sequence information at the graph level, while O-GCN provides a one level reference for early integration of sequence attributes. TP-GCN and TE-GCN extend T-GCN with a pseudo informative duration embedding and a learned activity embedding, respectively. HGCN(O) integrates these architecture specific designs with hypermodel optimization to jointly determine model structure and training configuration. The core T-GCN achieves F1 scores of 1.0000 on two balanced benchmarks and a weighted F1 of 0.8639 on a highly imbalanced dataset, compared with 0.8318 for GAT and 0.8453 for TransformerConv. Prefix and ablation analyses further demonstrate its effectiveness for outcome prediction from incomplete sequences and quantify the contributions of temporal edge weights and graph level sequence attributes.

cs.LG