Using Graphs of Classifiers to Impose Constraints on Semi-supervised Relation Extraction
Code (0)
등록된 구현이 없습니다.
Tasks
RelationRelation ExtractionSimilar Papers 제목 키워드 기반
Using Graphs of Classifiers to Impose Declarative Constraints on Semi-supervised Learning
We propose a general approach to modeling semi-supervised learning (SSL) algorithms. Specifically, we present a declarative language for modeling both traditional supervised classification tasks and many SSL heuristics, …
Bayesian OptimizationClassificationGeneral ClassificationRelation+3WCP: Worst-Case Perturbations for Semi-Supervised Deep Learning
In this paper, we present a novel regularization mechanism for training deep networks by minimizing the Worse-Case Perturbation (WCP). It is based on the idea that a robust model is least likely to be affected by smal…
Deep LearningEfficiently Deciding Algebraic Equivalence of Bow-Free Acyclic Path Diagrams
For causal discovery in the presence of latent confounders, constraints beyond conditional independences exist that can enable causal discovery algorithms to distinguish more pairs of graphs. Such constraints are not wel…
Causal DiscoveryReject Illegal Inputs: Scaling Generative Classifiers with Supervised Deep Infomax
Deep Infomax~(DIM) is an unsupervised representation learning framework by maximizing the mutual information between the inputs and the outputs of an encoder, while probabilistic constraints are imposed on the outputs. I…
Representation LearningMako: Semi-supervised continual learning with minimal labeled data via data programming
Lifelong machine learning (LML) is a well-known paradigm mimicking the human learning process by utilizing experiences from previous tasks. Nevertheless, an issue that has been rarely addressed is the lack of labels at t…
Continual Learningimage-classificationImage Classification