162 citations · 313 across the 21 of their papers we have counts for
26 papers
Arbitrarily Large Labelled Random Satisfiability Formulas for Machine Learning Training
Dimitris Achlioptas, Amrit Daswaney, Periklis A. Papakonstantinou
Applying deep learning to solve real-life instances of hard combinatorial problems has tremendous potential. Research in this direction has focused on the Boolean satisfiability (S…
The Lovász Local Lemma is Not About Probability
Dimitris Achlioptas, Kostas Zampetakis
Given a collection of independent events each of which has strictly positive probability, the probability that all of them occur is also strictly positive. The Lovász local lemma (…
On the 2-colorability of random hypergraphs
Dimitris Achlioptas, Cristopher Moore
A 2-coloring of a hypergraph is a mapping from its vertices to a set of two colors such that no edge is monochromatic. Let be a random -uniform hypergraph on vert…
The random 2-SAT partition function
Dimitris Achlioptas, Amin Coja-Oghlan, Max Hahn-Klimroth +4
We show that throughout the satisfiable phase the normalised number of satisfying assignments of a random -SAT formula converges in probability to an expression predicted by the…
Bad Global Minima Exist and SGD Can Reach Them
Shengchao Liu, Dimitris Papailiopoulos, Dimitris Achlioptas
Several works have aimed to explain why overparameterized neural networks generalize well when trained by Stochastic Gradient Descent (SGD). The consensus explanation that has emer…
A Local Lemma for Focused Stochastic Algorithms
Dimitris Achlioptas, Fotis Iliopoulos, Vladimir Kolmogorov
We develop a framework for the rigorous analysis of focused stochastic local search algorithms. These are algorithms that search a state space by repeatedly selecting some constrai…