Cong Han Lim

Orcid: 0000-0002-2033-4927

According to our database1, Cong Han Lim authored at least 10 papers between 2014 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Parallelizing Subgradient Methods for the Lagrangian Dual in Stochastic Mixed-Integer Programming.
INFORMS J. Optim., January, 2021

2020
Hierarchical Verification for Adversarial Robustness.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
A Distributed Quasi-Newton Algorithm for Primal and Dual Regularized Empirical Risk Minimization.
CoRR, 2019

2018
Valid inequalities for separable concave constraints with indicator variables.
Math. Program., 2018

An Efficient Pruning Algorithm for Robust Isotonic Regression.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

A Distributed Quasi-Newton Algorithm for Empirical Risk Minimization with Nonsmooth Regularization.
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

2017
k-Support and Ordered Weighted Sparsity for Overlapping Groups: Hardness and Algorithms.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

2016
A Box-Constrained Approach for Hard Permutation Problems.
Proceedings of the 33nd International Conference on Machine Learning, 2016

Efficient Bregman Projections onto the Permutahedron and Related Polytopes.
Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

2014
Beyond the Birkhoff Polytope: Convex Relaxations for Vector Permutation Problems.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014


  Loading...