Community detection and stochastic block models: recent developments
E Abbe - Journal of Machine Learning Research, 2018 - jmlr.org
The stochastic block model (SBM) is a random graph model with planted clusters. It is widely
employed as a canonical model to study clustering and community detection, and provides …
employed as a canonical model to study clustering and community detection, and provides …
Critical phenomena in complex networks
The combination of the compactness of networks, featuring small diameters, and their
complex architectures results in a variety of critical effects dramatically different from those in …
complex architectures results in a variety of critical effects dramatically different from those in …
Community detection in general stochastic block models: Fundamental limits and efficient algorithms for recovery
E Abbe, C Sandon - 2015 IEEE 56th Annual Symposium on …, 2015 - ieeexplore.ieee.org
New phase transition phenomena have recently been discovered for the stochastic block
model, for the special case of two non-overlapping symmetric communities. This gives raise …
model, for the special case of two non-overlapping symmetric communities. This gives raise …
[HTML][HTML] Warm-starting quantum optimization
There is an increasing interest in quantum algorithms for problems of integer programming
and combinatorial optimization. Classical solvers for such problems employ relaxations …
and combinatorial optimization. Classical solvers for such problems employ relaxations …
Computational complexity and human decision-making
P Bossaerts, C Murawski - Trends in cognitive sciences, 2017 - cell.com
The rationality principle postulates that decision-makers always choose the best action
available to them. It underlies most modern theories of decision-making. The principle does …
available to them. It underlies most modern theories of decision-making. The principle does …
Cross-disciplinary perspectives on meta-learning for algorithm selection
KA Smith-Miles - ACM Computing Surveys (CSUR), 2009 - dl.acm.org
The algorithm selection problem [Rice 1976] seeks to answer the question: Which algorithm
is likely to perform best for my problem? Recognizing the problem as a learning task in the …
is likely to perform best for my problem? Recognizing the problem as a learning task in the …
[图书][B] Handbook of knowledge representation
Handbook of Knowledge Representation describes the essential foundations of Knowledge
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …
Improved evolutionary optimization from genetically adaptive multimethod search
JA Vrugt, BA Robinson - Proceedings of the National …, 2007 - National Acad Sciences
In the last few decades, evolutionary algorithms have emerged as a revolutionary approach
for solving search and optimization problems involving multiple conflicting objectives …
for solving search and optimization problems involving multiple conflicting objectives …
Gibbs states and the set of solutions of random constraint satisfaction problems
F Krzakała, A Montanari… - Proceedings of the …, 2007 - National Acad Sciences
An instance of a random constraint satisfaction problem defines a random subset 𝒮 (the set
of solutions) of a large product space XN (the set of assignments). We consider two …
of solutions) of a large product space XN (the set of assignments). We consider two …
Reed-Muller codes achieve capacity on erasure channels
We introduce a new approach to proving that a sequence of deterministic linear codes
achieves capacity on an erasure channel under maximum a posteriori decoding. Rather …
achieves capacity on an erasure channel under maximum a posteriori decoding. Rather …