3 citations · 5 across the 10 of their papers we have counts for
3 papers · 1 filter
Task Affinity with Maximum Bipartite Matching in Few-Shot Learning
Cat P. Le, Juncheng Dong, Mohammadreza Soltani +1
We propose an asymmetric affinity score for representing the complexity of utilizing the knowledge of one task for learning another one. Our method is based on the maximum bipartit…
Fisher Task Distance and Its Application in Neural Architecture Search
Cat P. Le, Mohammadreza Soltani, Juncheng Dong +1
We formulate an asymmetric (or non-commutative) distance between tasks based on Fisher Information Matrices, called Fisher task distance. This distance represents the complexity of…
Improved Automated Machine Learning from Transfer Learning
Cat P. Le, Mohammadreza Soltani, Robert Ravier +1
In this paper, we propose a neural architecture search framework based on a similarity measure between some baseline tasks and a target task. We first define the notion of the task…