paper-with-me

홈 › Papers

Unweighted Stochastic Local Search can be Effective for Random CSP Benchmarks

2014-11-27 · Christopher D. Rosin

We present ULSA, a novel stochastic local search algorithm for random binary constraint satisfaction problems (CSP). ULSA is many times faster than the prior state of the art on a widely-studied suite of random CSP benchmarks. Unlike the best previous methods for these benchmarks, ULSA is a simple unweighted method that does not require dynamic adaptation of weights or penalties. ULSA obtains new record best solutions satisfying 99 of 100 variables in the challenging frb100-40 benchmark instance.

📄 PDF Abstract BibTeX arXiv:1411.7480

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

From random walks to distances on unweighted graphs

2015-11-02 · NeurIPS 2015 12 · Tatsunori B. Hashimoto, Yi Sun, Tommi S. Jaakkola

Large unweighted directed graphs are commonly used to capture relations between entities. A fundamental problem in the analysis of such networks is to properly define the similarity or dissimilarity between any two verti…

Clustering

Volume Doubling Condition and a Local Poincaré Inequality on Unweighted Random Geometric Graphs

2019-07-06 · Franziska Göbel, Gilles Blanchard

The aim of this paper is to establish two fundamental measure-metric properties of particular random geometric graphs. We consider $\varepsilon$-neighborhood graphs whose vertices are drawn independently and identically …

Local optimisation of Nyström samples through stochastic gradient descent

2022-03-24 · Matthew Hutchings, Bertrand Gauthier

We study a relaxed version of the column-sampling problem for the Nystr\"om approximation of kernel matrices, where approximations are defined from multisets of landmark points in the ambient space; such multisets are re…

Density estimation from unweighted k-nearest neighbor graphs: a roadmap

2013-12-01 · NeurIPS 2013 12 · Ulrike Von Luxburg, Morteza Alamgir

Consider an unweighted k-nearest neighbor graph on n points that have been sampled i.i.d. from some unknown density p on R^d. We prove how one can estimate the density p just from the unweighted adjacency matrix of the…

Density Estimation

NLocalSAT: Boosting Local Search with Solution Prediction

2020-01-26 · Wenjie Zhang, Zeyu Sun, Qihao Zhu, Ge Li 외

The Boolean satisfiability problem (SAT) is a famous NP-complete problem in computer science. An effective way for solving a satisfiable SAT problem is the stochastic local search (SLS). However, in this method, the init…

Prediction