← Search

Zijie Geng

14 accepted papers

2026

CoCo-MILP: Inter-Variable Contrastive and Intra-Constraint Competitive MILP Solution Prediction

AAAI 2026technical

Mixed-Integer Linear Programming (MILP) is a cornerstone of combinatorial optimization, yet solving large-scale instances remains a significant computational challenge. Recently, Graph Neural Networks (GNNs) have shown promise in accelerating MILP solvers by predicting high-quality solutions. Howev

Cited by 0SourcePDFScholar
2026

Opt-Verifier: Unleashing the Power of LLMs for Optimization Modeling via Dual-Side Verification

ICML 2026poster

Building mathematical optimization models is critical in operations research (OR), while it requires substantial human expertise. Recent advancements have utilized large language models (LLMs) to automate this modeling process. However, existing works often struggle to verify the correctness of the …

Cited by 0SourceScholar
2025

Accurate KV Cache Eviction via Anchor Direction Projection for Efficient LLM Inference

NeurIPS 2025poster

Key-Value (KV) cache eviction---which retains the KV pairs of the most important tokens while discarding less important ones---is a critical technique for optimizing both memory usage and inference latency in large language models (LLMs). However, existing approaches often rely on simple heuristics-…

Cited by 0SourceScholar
2025

Apollo-MILP: An Alternating Prediction-Correction Neural Solving Framework for Mixed-Integer Linear Programming

ICLR 2025poster

Leveraging machine learning (ML) to predict an initial solution for mixed-integer linear programming (MILP) has gained considerable popularity in recent years. These methods predict a solution and fix a subset of variables to reduce the problem dimension. Then, they solve the reduced problem to obta…

Cited by 7SourcePDFScholar
2025

Benchmarking End-To-End Performance of AI-Based Chip Placement Algorithms

NeurIPS 2025poster

Chip placement is a critical step in the Electronic Design Automation (EDA) workflow, which aims to arrange chip modules on the canvas to optimize the performance, power, and area (PPA) metrics of final designs. Recent advances show great potential of AI-based algorithms in chip placement. However,…

Cited by 0SourceScholar
2025

LaMPlace: Learning to Optimize Cross-Stage Metrics in Macro Placement

ICLR 2025oral

Machine learning techniques have shown great potential in enhancing macro placement, a critical stage in modern chip design. However, existing methods primarily focus on *online* optimization of *intermediate surrogate metrics* that are available at the current placement stage, rather than directly…

Cited by 2SourcePDFScholar
2025

RoME: Domain-Robust Mixture-of-Experts for MILP Solution Prediction across Domains

NeurIPS 2025poster

Mixed-Integer Linear Programming (MILP) is a fundamental and powerful framework for modeling complex optimization problems across diverse domains. Recently, learning-based methods have shown great promise in accelerating MILP solvers by predicting high-quality solutions. However, most existing appro…

Cited by 0SourceScholar
2024

Accelerating Data Generation for Neural Operators via Krylov Subspace Recycling

ICLR 2024spotlight

Learning neural operators for solving partial differential equations (PDEs) has attracted great attention due to its high inference efficiency. However, training such operators requires generating a substantial amount of labeled data, i.e., PDE problems together with their solutions. The data genera…

2024

MILP-StuDio: MILP Instance Generation via Block Structure Decomposition

NeurIPS 2024poster

Mixed-integer linear programming (MILP) is one of the most popular mathematical formulations with numerous applications. In practice, improving the performance of MILP solvers often requires a large amount of high-quality data, which can be challenging to collect. Researchers thus turn to generation…

Cited by 11SourcePDFScholar
2024

Neural Krylov Iteration for Accelerating Linear System Solving

NeurIPS 2024spotlight

Solving large-scale sparse linear systems is essential in fields like mathematics, science, and engineering. Traditional numerical solvers, mainly based on the Krylov subspace iteration algorithm, suffer from the low-efficiency problem, which primarily arises from the less-than-ideal iteration. To t…

Cited by 3SourcePDFScholar
2024

Reinforcement Learning within Tree Search for Fast Macro Placement

ICML 2024poster

Macro placement is a crucial step in modern chip design, and reinforcement learning (RL) has recently emerged as a promising technique for improving the placement quality. However, existing RL-based techniques are hindered by their low sample efficiency, requiring numerous online rollouts or substan…

Cited by 17SourcePDFScholar
2023

A Deep Instance Generative Framework for MILP Solvers Under Limited Data Availability

NeurIPS 2023spotlight

In the past few years, there has been an explosive surge in the use of machine learning (ML) techniques to address combinatorial optimization (CO) problems, especially mixed-integer linear programs (MILPs). Despite the achievements, the limited availability of real-world instances often leads to sub…

2023

De Novo Molecular Generation via Connection-aware Motif Mining

ICLR 2023poster

De novo molecular generation is an essential task for science discovery. Recently, fragment-based deep generative models have attracted much research attention due to their flexibility in generating novel molecules based on existing molecule fragments. However, the motif vocabulary, i.e., the collec…