Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
Last revision Both sides next revision
data_augmentation [2018/02/03 11:12]
admin
data_augmentation [2018/06/04 17:10]
admin
Line 120: Line 120:
  
 https://​arxiv.org/​pdf/​1802.00050.pdf Recursive Feature Generation for Knowledge-based Learning https://​arxiv.org/​pdf/​1802.00050.pdf Recursive Feature Generation for Knowledge-based Learning
 +
 +The algorithm works by generating complex features induced using the available
 +knowledge base. It does so through the extraction of recursive learning problems based on existing
 +features and the knowledge base, that are then given as input to induction algorithms. The output of
 +this process is a collection of classifiers that are then turned into features for the original induction
 +problem.
 +
 +https://​arxiv.org/​abs/​1805.06962 Counterexample-Guided Data Augmentation
 +
 +Counterexamples are misclassified examples that have important properties for retraining and improving the model. Key components of our framework include a counterexample generator, which produces data items that are misclassified by the model and error tables, a novel data structure that stores information pertaining to misclassifications. Error tables can be used to explain the model'​s vulnerabilities and are used to efficiently generate counterexamples for augmentation. We show the efficacy of the proposed framework by comparing it to classical augmentation techniques on a case study of object detection in autonomous driving based on deep neural networks. https://​github.com/​dreossi/​analyzeNN
 +
 +https://​arxiv.org/​abs/​1805.12018 Generalizing to Unseen Domains via Adversarial Data Augmentation
 +
 +Only using training data from the source domain, we propose an iterative procedure that augments the dataset with examples from a fictitious target domain that is "​hard"​ under the current model. We show that our iterative scheme is an adaptive data augmentation method where we append adversarial examples at each iteration.