On the verification of Embeddings using Hybrid Markov Logic

• URL: http://arxiv.org/abs/2312.08287v1
• Date: Wed, 13 Dec 2023 17:04:09 GMT
• Title: On the verification of Embeddings using Hybrid Markov Logic
• Authors: Anup Shakya, Abisha Thapa Magar, Somdeb Sarkhel and Deepak Venugopal
• Abstract summary: We propose a framework to verify complex properties of a learned representation. We present an approach to learn parameters for the properties within this framework. We illustrate verification in Graph Neural Networks, Deep Knowledge Tracing and Intelligent Tutoring Systems.
• Score: 2.113770213797994
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The standard approach to verify representations learned by Deep Neural Networks is to use them in specific tasks such as classification or regression, and measure their performance based on accuracy in such tasks. However, in many cases, we would want to verify more complex properties of a learned representation. To do this, we propose a framework based on a probabilistic first-order language, namely, Hybrid Markov Logic Networks (HMLNs) where we specify properties over embeddings mixed with symbolic domain knowledge. We present an approach to learn parameters for the properties within this framework. Further, we develop a verification method to test embeddings in this framework by encoding this task as a Mixed Integer Linear Program for which we can leverage existing state-of-the-art solvers. We illustrate verification in Graph Neural Networks, Deep Knowledge Tracing and Intelligent Tutoring Systems to demonstrate the generality of our approach.

Related papers

• Inducing Gaussian Process Networks [80.40892394020797]
  We propose inducing Gaussian process networks (IGN), a simple framework for simultaneously learning the feature space as well as the inducing points. The inducing points, in particular, are learned directly in the feature space, enabling a seamless representation of complex structured domains. We report on experimental results for real-world data sets showing that IGNs provide significant advances over state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-04-21T05:27:09Z)
• Informed Machine Learning for Improved Similarity Assessment in Process-Oriented Case-Based Reasoning [1.370633147306388]
  We investigate the potential of integrating domain knowledge into Graph Neural Networks (GNNs) First, a special data representation and processing method is used that encodes structural knowledge about the semantic annotations of each graph node and edge. Second, the message-passing component of the GNNs is constrained by knowledge on legal node mappings.
  arXiv  Detail & Related papers  (2021-06-30T09:31:58Z)
• How Fine-Tuning Allows for Effective Meta-Learning [50.17896588738377]
  We present a theoretical framework for analyzing representations derived from a MAML-like algorithm. We provide risk bounds on the best predictor found by fine-tuning via gradient descent, demonstrating that the algorithm can provably leverage the shared structure. This separation result underscores the benefit of fine-tuning-based methods, such as MAML, over methods with "frozen representation" objectives in few-shot learning.
  arXiv  Detail & Related papers  (2021-05-05T17:56:00Z)
• Anomaly Detection on Attributed Networks via Contrastive Self-Supervised Learning [50.24174211654775]
  We present a novel contrastive self-supervised learning framework for anomaly detection on attributed networks. Our framework fully exploits the local information from network data by sampling a novel type of contrastive instance pair. A graph neural network-based contrastive learning model is proposed to learn informative embedding from high-dimensional attributes and local structure.
  arXiv  Detail & Related papers  (2021-02-27T03:17:20Z)
• GENNI: Visualising the Geometry of Equivalences for Neural Network Identifiability [14.31120627384789]
  We propose an efficient algorithm to visualise symmetries in neural networks. Our proposed method, GENNI, allows us to efficiently identify parameters that are functionally equivalent and then visualise the subspace of the resulting equivalence class.
  arXiv  Detail & Related papers  (2020-11-14T22:53:13Z)
• Learned Greedy Method (LGM): A Novel Neural Architecture for Sparse Coding and Beyond [24.160276545294288]
  We propose an unfolded version of a greedy pursuit algorithm for the same goal. Key features of our Learned Greedy Method (LGM) are the ability to accommodate a dynamic number of unfolded layers.
  arXiv  Detail & Related papers  (2020-10-14T13:17:02Z)
• Region Comparison Network for Interpretable Few-shot Image Classification [97.97902360117368]
  Few-shot image classification has been proposed to effectively use only a limited number of labeled examples to train models for new classes. We propose a metric learning based method named Region Comparison Network (RCN), which is able to reveal how few-shot learning works. We also present a new way to generalize the interpretability from the level of tasks to categories.
  arXiv  Detail & Related papers  (2020-09-08T07:29:05Z)
• Information Theoretic Meta Learning with Gaussian Processes [74.54485310507336]
  We formulate meta learning using information theoretic concepts; namely, mutual information and the information bottleneck. By making use of variational approximations to the mutual information, we derive a general and tractable framework for meta learning.
  arXiv  Detail & Related papers  (2020-09-07T16:47:30Z)
• Dynamic Feature Integration for Simultaneous Detection of Salient Object, Edge and Skeleton [108.01007935498104]
  In this paper, we solve three low-level pixel-wise vision problems, including salient object segmentation, edge detection, and skeleton extraction. We first show some similarities shared by these tasks and then demonstrate how they can be leveraged for developing a unified framework.
  arXiv  Detail & Related papers  (2020-04-18T11:10:11Z)
• A Generalizable Knowledge Framework for Semantic Indoor Mapping Based on Markov Logic Networks and Data Driven MCMC [2.4214518935746185]
  We propose a generalizable knowledge framework for data abstraction. Based on these abstract terms, intelligent autonomous systems should be able to make inference according to specific knowledge base. We show in detail how to adapt this framework to a certain task, in particular, semantic robot mapping.
  arXiv  Detail & Related papers  (2020-02-19T19:30:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.