Log In Sign Up

Mismatching as a tool to enhance algorithmic performances of Monte Carlo methods for the planted clique model

by   Maria Chiara Angelini, et al.

Over-parametrization was a crucial ingredient for recent developments in inference and machine-learning fields. However a good theory explaining this success is still lacking. In this paper we study a very simple case of mismatched over-parametrized algorithm applied to one of the most studied inference problem: the planted clique problem. We analyze a Monte Carlo (MC) algorithm in the same class of the famous Jerrum algorithm. We show how this MC algorithm is in general suboptimal for the recovery of the planted clique. We show however how to enhance its performances by adding a (mismatched) parameter: the temperature; we numerically find that this over-parametrized version of the algorithm can reach the supposed algorithmic threshold for the planted clique problem.


page 1

page 2

page 3

page 4


Parallel Tempering for the planted clique problem

The theoretical information threshold for the planted clique problem is ...

Exact recovery of Planted Cliques in Semi-random graphs

In this paper, we study the Planted Clique problem in a semi-random mode...

Dynamic Local Search for the Maximum Clique Problem

In this paper, we introduce DLS-MC, a new stochastic local search algori...

Perfect Reconstruction of Sparse Signals via Greedy Monte-Carlo Search

We propose a Monte-Carlo-based method for reconstructing sparse signals ...

Contrastive Explanations for Large Errors in Retail Forecasting Predictions through Monte Carlo Simulations

At Ahold Delhaize, there is an interest in using more complex machine le...

Deep active inference agents using Monte-Carlo methods

Active inference is a Bayesian framework for understanding biological in...