Ke Tang
4 papers in the PaperMetrix corpus
Papers by this author
-
Approximation Guarantees of Stochastic Greedy Algorithms for Subset Selection
2018
Subset selection is a fundamental problem in many areas, which aims to select the best subset of size at most $k$ from a universe. Greedy algorithms are widely used for subset selection, and have shown …
-
Parallel Exploration via Negatively Correlated Search
2019 · arXiv (Cornell University)
Effective exploration is a key to successful search. The recently proposed Negatively Correlated Search (NCS) tries to achieve this by parallel exploration, where a set of search processes are driven to be negatively correlated so …
-
Defending Adversarial Examples by Negative Correlation Ensemble
2022 · arXiv (Cornell University)
The security issues in DNNs, such as adversarial examples, have attracted much attention. Adversarial examples refer to the examples which are capable to induce the DNNs return completely predictions by introducing carefully designed perturbations. Obviously, …
-
Learn to optimize—a brief overview
2024 · National Science Review
ABSTRACT Most optimization problems of practical significance are typically solved by highly configurable parameterized algorithms. To achieve the best performance on a problem instance, a trial-and-error configuration process is required, which is very costly and …