低秩图ons估计:理论及其在图ons游戏中的应用
Low-Rank Graphon Estimation: Theory and Applications to Graphon Games
AI总结:
本文研究了从采样网络数据中估计未知稀疏图ons的低秩方法,通过奇异值阈值和块平均阈值构造低秩近似,并在随机块模型、Hölder和解析图ons中推导非渐近界,展示了低秩对计算的益处。
摘要:
我们研究了在操作范数损失下从采样网络数据中估计未知稀疏图ons的低秩估计,受图ons游戏中的目标干预启发。从观测到的邻接矩阵出发,我们通过奇异值阈值构造低秩近似,并对光滑图ons,通过块平均后阈值化。我们为随机块模型、Hölder和解析图ons获得了操作范数误差和结果估计量秩的非渐近界,并通过最小大下界证明这些速率对这些类别的结果是本质尖锐的。我们的分析强调,低秩在这里主要对计算有价值:虽然它不改善最小大操作范数速率,但能产生具有显著更小秩的操作范数准确近似。然后我们将这些估计器应用于线性二次图ons游戏,并推导非渐近稳定性界,表明使用估计图ons所造成的福利损失受操作范数扰动控制。这为通过估计图ons计算的目标干预提供了近最优保证,同时带来显著的计算节省。对于零基线异质性和在谱间隙条件下,我们还建立了干预遗憾的匹配下界。数值实验展示了统计准确性、保留秩和运行时间之间的权衡。
英文摘要:
We study low-rank estimation of an unknown sparse graphon from sampled network data under operator-norm loss, motivated by targeted interventions in graphon games. Starting from the observed adjacency matrix, we construct low-rank surrogates by singular value thresholding and, for smooth graphons, by block averaging followed by thresholding. We obtain non-asymptotic bounds on both the operator-norm error and the rank of the resulting estimator for stochastic block model, Hölder, and analytic graphons, and we complement these results with minimax lower bounds showing that the rates are essentially sharp for these classes. Our analysis highlights that low rank is valuable here primarily for computation: while it does not improve the minimax operator-norm rate, it yields operator-norm accurate surrogates with substantially smaller rank. We then apply these estimators to linear-quadratic graphon games and derive non-asymptotic stability bounds showing that the welfare loss incurred by using an estimated graphon is controlled by the operator-norm perturbation. This yields near-optimal guarantees for targeted interventions computed from the estimated graphon, together with substantial computational savings. For zero baseline heterogeneity and under a spectral-gap condition, we also establish matching lower bounds for intervention regret. Numerical experiments illustrate the trade-off between statistical accuracy, retained rank, and runtime.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。