Search Results for author: Uri Patish

Found 2 papers, 0 papers with code

The Cakewalk Method

no code implementations ICLR 2019 Uri Patish, Shimon Ullman

Notably, we show in this benchmark that fixing the distribution of the surrogate is key to consistently recovering locally optimal solutions, and that our surrogate objective leads to an algorithm that outperforms other methods we have tested in a number of measures.

Combinatorial Optimization

Cakewalk Sampling

no code implementations25 Feb 2018 Uri Patish, Shimon Ullman

We study the task of finding good local optima in combinatorial optimization problems.

Clustering Combinatorial Optimization +1

Cannot find the paper you are looking for? You can Submit a new open access paper.