Knowledge-Based Distant Regularization in Learning Probabilistic Models
원문 초록
Exploiting the appropriate inductive bias based on the knowledge of data is essential for achieving good performance in statistical machine learning. In practice, however, the domain knowledge of interest often provides information on the relationship of data attributes only distantly, which hinders direct utilization of such domain knowledge in popular regularization methods. In this paper, we propose the knowledge-based distant regularization framework, in which we utilize the distant information encoded in a knowledge graph for regularization of probabilistic model estimation. In particular, we propose to impose prior distributions on model parameters specified by knowledge graph embeddings. As an instance of the proposed framework, we present the factor analysis model with the knowledge-based distant regularization. We show the results of preliminary experiments on the improvement of the generalization capability of such model.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Learning Robust Stereo Matching in the Wild with Selective Mixture-of-Experts
AGTCNet: A Graph-Temporal Approach for Principled Motor Imagery EEG Classification
Segment This Thing: Foveated Tokenization for Efficient Point-Prompted Segmentation
Parameter-free approximate equivariance for tasks with finite group symmetry
Positional Encoding meets Persistent Homology on Graphs
Information Locality as an Inductive Bias for Neural Language Models
토론
이 논문과 연결된 포럼 글이 아직 없습니다.