13 citations · 24 across the 5 of their papers we have counts for
5 papers
Hierarchical Verification for Adversarial Robustness
Cong Han Lim, Raquel Urtasun, Ersin Yumer
We introduce a new framework for the exact point-wise robustness verification problem that exploits the layer-wise geometric structure of deep feed-forward networks with r…
A Distributed Quasi-Newton Algorithm for Primal and Dual Regularized Empirical Risk Minimization
Ching-pei Lee, Cong Han Lim, Stephen J. Wright
We propose a communication- and computation-efficient distributed optimization algorithm using second-order information for solving empirical risk minimization (ERM) problems with…
A Distributed Quasi-Newton Algorithm for Empirical Risk Minimization with Nonsmooth Regularization
Ching-pei Lee, Cong Han Lim, Stephen J. Wright
We propose a communication- and computation-efficient distributed optimization algorithm using second-order information for solving ERM problems with a nonsmooth regularization ter…
Sorting Network Relaxations for Vector Permutation Problems
Cong Han Lim, Stephen J. Wright
The Birkhoff polytope (the convex hull of the set of permutation matrices) is frequently invoked in formulating relaxations of optimization problems over permutations. The Birkhoff…
Validating Sample Average Approximation Solutions with Negatively Dependent Batches
Jiajie Chen, Cong Han Lim, Peter Z. G. Qian +2
Sample-average approximations (SAA) are a practical means of finding approximate solutions of stochastic programming problems involving an extremely large (or infinite) number of s…