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.
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.