Cong Han Lim

Publication Activity (10 Years)

Years Active: 2014-2021
Publications (10 Years): 12

Top Topics

Integer Program

Pruning Algorithm

Empirical Risk Minimization

Convex Relaxation

Top Venues

Publications

Cong Han Lim, Jeffrey T. Linderoth, James R. Luedtke, Stephen J. Wright
Parallelizing Subgradient Methods for the Lagrangian Dual in Stochastic Mixed-Integer Programming. INFORMS J. Optim. 3 (1) (2021)
Cong Han Lim, Raquel Urtasun, Ersin Yumer
Hierarchical Verification for Adversarial Robustness. ICML (2020)
Cong Han Lim, Raquel Urtasun, Ersin Yumer
Hierarchical Verification for Adversarial Robustness. CoRR (2020)
Ching-pei Lee, Cong Han Lim, Stephen J. Wright
A Distributed Quasi-Newton Algorithm for Primal and Dual Regularized Empirical Risk Minimization. CoRR (2019)
Cong Han Lim
An Efficient Pruning Algorithm for Robust Isotonic Regression. NeurIPS (2018)
Ching-pei Lee, Cong Han Lim, Stephen J. Wright
A Distributed Quasi-Newton Algorithm for Empirical Risk Minimization with Nonsmooth Regularization. CoRR (2018)
Ching-pei Lee, Cong Han Lim, Stephen J. Wright
A Distributed Quasi-Newton Algorithm for Empirical Risk Minimization with Nonsmooth Regularization. KDD (2018)
Cong Han Lim, Jeff T. Linderoth, James R. Luedtke
Valid inequalities for separable concave constraints with indicator variables. Math. Program. 172 (1-2) (2018)
Cong Han Lim, Stephen J. Wright
k-Support and Ordered Weighted Sparsity for Overlapping Groups: Hardness and Algorithms. NIPS (2017)
Cong Han Lim, Jeff T. Linderoth, James R. Luedtke
Valid Inequalities for Separable Concave Constraints with Indicator Variables. IPCO (2016)
Cong Han Lim, Stephen J. Wright
Efficient Bregman Projections onto the Permutahedron and Related Polytopes. AISTATS (2016)
Cong Han Lim, Steve Wright
A Box-Constrained Approach for Hard Permutation Problems. ICML (2016)
Cong Han Lim, Stephen J. Wright
Beyond the Birkhoff Polytope: Convex Relaxations for Vector Permutation Problems. NIPS (2014)