179 citations · 471 across the 15 of their papers we have counts for
23 papers
Optimal Scaling for Locally Balanced Proposals in Discrete Spaces
Haoran Sun, Hanjun Dai, Dale Schuurmans
Optimal scaling has been well studied for Metropolis-Hastings (M-H) algorithms in continuous spaces, but a similar understanding has been lacking in discrete spaces. Recently, a fa…
SMORE: Knowledge Graph Completion and Multi-hop Reasoning in Massive Knowledge Graphs
Hongyu Ren, Hanjun Dai, Bo Dai +4
Knowledge graphs (KGs) capture knowledge in the form of head--relation--tail triples and are a crucial component in many AI systems. There are two important reasoning tasks on KGs:…
Combiner: Full Attention Transformer with Sparse Computation Cost
Hongyu Ren, Hanjun Dai, Zihang Dai +4
Transformers provide a class of expressive architectures that are extremely effective for sequence modeling. However, the key limitation of transformers is their quadratic memory a…
SpreadsheetCoder: Formula Prediction from Semi-structured Context
Xinyun Chen, Petros Maniatis, Rishabh Singh +4
Spreadsheet formula prediction has been an important program synthesis problem with many real-world applications. Previous works typically utilize input-output examples as the spec…
Learning Discrete Energy-based Models via Auxiliary-variable Local Exploration
Hanjun Dai, Rishabh Singh, Bo Dai +2
Discrete structures play an important role in applications like program language modeling and software engineering. Current approaches to predicting complex structures typically co…
Polymers for Extreme Conditions Designed Using Syntax-Directed Variational Autoencoders
Rohit Batra, Hanjun Dai, Tran Doan Huan +5
The design/discovery of new materials is highly non-trivial owing to the near-infinite possibilities of material candidates, and multiple required property/performance objectives.…