Cong Han Lim
6 papers · 2014–2020 · 3 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+2 more ↓ Show less ↑
π§ Keyword Pioneer π£ Hot Topic Early Bird π Conference Polyglot (3) π Academic Marathon (6) π Cross-Pollinator (13)
π
Interdisciplinary Bridge
πΊοΈ
Taxonomy Completionist
(12)
Conferences
NIPS (3)
ICML (2)
AISTATS (1)
Top co-authors
Keywords
dynamic programming
(2)
convex optimization
(2)
convex relaxation
(2)
nonconvex optimization
(1)
group sparsity
(1)
formal verification
(1)
isotonic regression
(1)
coordinate descent
(1)
sparse optimization
(1)
overlapping groups
(1)
continuous relaxation
(1)
tree decomposition
(1)
k-support norm
(1)
permutation matrix
(1)
linear program
(1)
quadratic assignment problem
(1)
relu network
(1)
bregman projection
(1)
projection algorithm
(1)
sorting network
(1)
Papers
Hierarchical Verification for Adversarial Robustness
ICML 2020
An Efficient Pruning Algorithm for Robust Isotonic Regression
NIPS 2018
k-Support and Ordered Weighted Sparsity for Overlapping Groups: Hardness and Algorithms
NIPS 2017
Efficient Bregman Projections onto the Permutahedron and Related Polytopes
AISTATS 2016
A Box-Constrained Approach for Hard Permutation Problems
ICML 2016
Beyond the Birkhoff Polytope: Convex Relaxations for Vector Permutation Problems
NIPS 2014