1 citations · 1 across the 4 of their papers we have counts for
4 papers
Learning to Solve the Quadratic Assignment Problem with Warm-Started MCMC Finetuning
Yicheng Pan, Ruisong Zhou, Haijun Zou +2
The quadratic assignment problem (QAP) is a fundamental NP-hard task that poses significant challenges for both traditional heuristics and modern learning-based solvers. Existing Q…
LMask: Learn to Solve Constrained Routing Problems with Lazy Masking
Tianyou Li, Haijun Zou, Jiayuan Wu +1
Routing problems are canonical combinatorial optimization tasks with wide-ranging applications in logistics, transportation, and supply chain management. However, solving these pro…
Monte Carlo Policy Gradient Method for Binary Optimization
Cheng Chen, Ruitao Chen, Tianyou Li +2
Binary optimization has a wide range of applications in combinatorial optimization problems such as MaxCut, MIMO detection, and MaxSAT. However, these problems are typically NP-har…
Convergence Analysis of Stochastic Gradient Descent with MCMC Estimators
Tianyou Li, Fan Chen, Huajie Chen +1
Understanding stochastic gradient descent (SGD) and its variants is essential for machine learning. However, most of the preceding analyses are conducted under amenable conditions…