42 citations · 96 across the 9 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.LG2019★ 3 cited
GLAD: Learning Sparse Graph Recovery
Harsh Shrivastava, Xinshi Chen, Binghong Chen +4
Recovering sparse conditional independence graphs from data is a fundamental problem in machine learning with wide applications. A popular formulation of the problem is an …
cs.LG2019★ 29 cited
Learning to Plan in High Dimensions via Neural Exploration-Exploitation Trees
Binghong Chen, Bo Dai, Qinjie Lin +3
We propose a meta path planning algorithm named \emph{Neural Exploration-Exploitation Trees~(NEXT)} for learning from prior experience for solving new path planning problems in hig…