3 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.LG2021★ 3 cited
Structure learning in polynomial time: Greedy algorithms, Bregman information, and exponential families
Goutham Rajendran, Bohdan Kivva, Ming Gao +1
Greedy algorithms have long been a workhorse for learning graphical models, and more broadly for learning statistical models with sparse structure. In the context of learning direc…
cs.CL2021★ 2 cited
Meta-Learning Adversarial Domain Adaptation Network for Few-Shot Text Classification
ChengCheng Han, Zeqiu Fan, Dongxiang Zhang +3
Meta-learning has emerged as a trending technique to tackle few-shot text classification and achieved state-of-the-art performance. However, existing solutions heavily rely on the…