179 citations · 474 across the 16 of their papers we have counts for
22 papers · 1 filter
LambdaBeam: Neural Program Search with Higher-Order Functions and Lambdas
Kensen Shi, Hanjun Dai, Wen-Ding Li +2
Search is an important technique in program synthesis that allows for adaptive strategies such as focusing on particular search directions based on execution results. Several prior…
Let the Flows Tell: Solving Graph Combinatorial Optimization Problems with GFlowNets
Dinghuai Zhang, Hanjun Dai, Esmeralda S. Whitammer +3
Combinatorial optimization (CO) problems are often NP-hard and thus out of reach for exact algorithms, making them a tempting domain to apply machine learning methods. The highly s…
Gradient-Free Structured Pruning with Unlabeled Data
Azade Nova, Hanjun Dai, Dale Schuurmans
Large Language Models (LLMs) have achieved great success in solving difficult tasks across many domains, but such success comes with a high computation cost, and inference latency.…
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…