activity
20192022
most citedRetro*: Learning Retrosynthetic Planning with Neural Guided A* Search

42 citations · 63 across the 6 of their papers we have counts for

collaborators
Showing cs.LGShow all

7 papers · 1 filter

cs.LG2022

Learning Temporal Rules from Noisy Timeseries Data

Karan Samel, Zelin Zhao, Binghong Chen +4

Events across a timeline are a common data representation, seen in different temporal modalities. Individual atomic events can occur in a certain temporal ordering to compose highe…

cs.LG2021★ 15 cited

ProTo: Program-Guided Transformer for Program-Guided Tasks

Zelin Zhao, Karan Samel, Binghong Chen +1

Programs, consisting of semantic and structural information, play an important role in the communication between humans and agents. Towards learning general program executors to un…

cs.LG2021

Graph Contrastive Pre-training for Effective Theorem Reasoning

Zhaoyu Li, Binghong Chen, Xujie Si

Interactive theorem proving is a challenging and tedious process, which requires non-trivial expertise and detailed low-level instructions (or tactics) from human experts. Tactic p…

cs.LG2021★ 4 cited

How to Design Sample and Computationally Efficient VQA Models

Karan Samel, Zelin Zhao, Binghong Chen +3

In multi-modal reasoning tasks, such as visual question answering (VQA), there have been many modeling and training paradigms tested. Previous models propose different methods for…

cs.LG2020★ 42 cited

Retro*: Learning Retrosynthetic Planning with Neural Guided A* Search

Binghong Chen, Chengtao Li, Hanjun Dai +1

Retrosynthetic planning is a critical task in organic chemistry which identifies a series of reactions that can lead to the synthesis of a target product. The vast number of possib…

cs.LG2019

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 …