2 papers
cs.LG2025
Tighter Truncated Rectangular Prism Approximation for RNN Robustness Verification
Xingqi Lin, Liangyu Chen, Min Wu +2
Robustness verification is a promising technique for rigorously proving Recurrent Neural Networks (RNNs) robustly. A key challenge is to over-approximate the nonlinear activation f…
math.OC2024
Learning to Select Cutting Planes in Mixed Integer Linear Programming Solving
Xuefeng Zhang, Liangyu Chen, Zhengfeng Yang +1
Cutting planes (cuts) are crucial for solving Mixed Integer Linear Programming (MILP) problems. Advanced MILP solvers typically rely on manually designed heuristic algorithms for c…