Learning from networked examples

MaRDI QIDQ4645674zbMATH OpenFDO

Authors Yuyi Wang, Zheng-Chu Guo, Jan Ramon

Publication date 10 January 2019

Full work available at URL https://arxiv.org/abs/1405.2600, http://proceedings.mlr.press/v76/wang17a.html

zbMATH Keywords

concentration inequalitygeneralization error boundnetworked examplenon-i.i.d. samplesample error bound

Mathematics Subject Classification ID

Computational learning theory (68Q32) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Learning network structures from contagion
• Learning unknown graphs
• Single network relational transductive learning
• Supervised learning via the “hubNet” procedure
• Distributed networked learning with correlated data

Cited in

(4)

• Hoeffding's inequality for sums of dependent random variables
• Concentration inequality and the weak law of large numbers for the sum of partly negatively dependent -subgaussian random variables
• Probability inequalities for sums of partly acceptable random variables with finite moments
• Bernstein's inequality with a proper cover and upper bound of portfolio VaR and TVaR

This page was built for publication: Learning from networked examples

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645674)