7 citations · 19 across the 16 of their papers we have counts for
4 papers · 1 filter
Generating Linear programming Instances with Controllable Rank and Condition Number
Anqi Li, Congying Han, Tiande Guo
Instances generation is crucial for linear programming algorithms, which is necessary either to find the optimal pivot rules by training learning method or to evaluate and verify c…
Masked Reconstruction Contrastive Learning with Information Bottleneck Principle
Ziwen Liu, Bonan Li, Congying Han +2
Contrastive learning (CL) has shown great power in self-supervised learning due to its ability to capture insight correlations among large-scale data. Current CL models are biased…
On the optimal pivot path of simplex method for linear programming based on reinforcement learning
Anqi Li, Tiande Guo, Congying Han +2
Based on the existing pivot rules, the simplex method for linear programming is not polynomial in the worst case. Therefore the optimal pivot of the simplex method is crucial. This…
DropKey
Bonan Li, Yinhan Hu, Xuecheng Nie +4
In this paper, we focus on analyzing and improving the dropout technique for self-attention layers of Vision Transformer, which is important while surprisingly ignored by prior wor…