VC-Dimension Based Generalization Bounds for Relational Learning
원문 초록
In many applications of relational learning, the available data can be seen as a sample from a larger relational structure (e.g. we may be given a small fragment from some social network). In this paper we are particularly concerned with scenarios in which we can assume that (i) the domain elements appearing in the given sample have been uniformly sampled without replacement from the (unknown) full domain and (ii) the sample is complete for these domain elements (i.e. it is the full substructure induced by these elements). Within this setting, we study bounds on the error of sufficient statistics of relational models that are estimated on the available data. As our main result, we prove a bound based on a variant of the Vapnik-Chervonenkis dimension which is suitable for relational data.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Differentially Private Relational Learning with Entity-level Privacy Guarantees
Learning Where to Learn: Training Distribution Selection for Provable OOD Performance
Visual Abstract Thinking Empowers Multimodal Reasoning
Operator Learning for Schrödinger Equation: Unitarity, Error Bounds, and Time Generalization
Bridging Generative and Discriminative Learning: Few-Shot Relation Extraction via Two-Stage Knowledge-Guided Pre-training
Graph Representational Learning: When Does More Expressivity Hurt Generalization?
토론
이 논문과 연결된 포럼 글이 아직 없습니다.