Correlation clustering with sherali-adams
V Cohen-Addad, E Lee… - 2022 IEEE 63rd Annual …, 2022 - ieeexplore.ieee.org
Given a complete graph G=(V, E) where each edge is labeled+ or−, the CORRELATION
CLUSTERING problem asks to partition V into clusters to minimize the number of+ edges …
CLUSTERING problem asks to partition V into clusters to minimize the number of+ edges …
Grothendieck's theorem, past and present
G Pisier - Bulletin of the American Mathematical Society, 2012 - ams.org
Probably the most famous of Grothendieck's contributions to Banach space theory is the
result that he himself described as “the fundamental theorem in the metric theory of tensor …
result that he himself described as “the fundamental theorem in the metric theory of tensor …
Semidefinite programs on sparse random graphs and their application to community detection
Denote by A the adjacency matrix of an Erdos-Renyi graph with bounded average degree.
We consider the problem of maximizing< A-EA, X> over the set of positive semidefinite …
We consider the problem of maximizing< A-EA, X> over the set of positive semidefinite …
Parallel correlation clustering on big graphs
Given a similarity graph between items, correlation clustering (CC) groups similar items
together and dissimilar ones apart. One of the most popular CC algorithms is KwikCluster …
together and dissimilar ones apart. One of the most popular CC algorithms is KwikCluster …
On differentially private graph sparsification and applications
In this paper, we study private sparsification of graphs. In particular, we give an algorithm
that given an input graph, returns a sparse graph which approximates the spectrum of the …
that given an input graph, returns a sparse graph which approximates the spectrum of the …
On robustness to adversarial examples and polynomial optimization
We study the design of computationally efficient algorithms with provable guarantees, that
are robust to adversarial (test time) perturbations. While there has been an explosion of …
are robust to adversarial (test time) perturbations. While there has been an explosion of …
Learning-theoretic foundations of algorithm configuration for combinatorial partitioning problems
Max-cut, clustering, and many other partitioning problems that are of significant importance
to machine learning and other scientific fields are NP-hard, a reality that has motivated …
to machine learning and other scientific fields are NP-hard, a reality that has motivated …
Optimizing sparse fermionic hamiltonians
We consider the problem of approximating the ground state energy of a fermionic
Hamiltonian using a Gaussian state. In sharp contrast to the dense case [1, 2], we prove that …
Hamiltonian using a Gaussian state. In sharp contrast to the dense case [1, 2], we prove that …
[PDF][PDF] Grothendieck-type inequalities in combinatorial optimization
S Khot, A Naor - arxiv preprint arxiv:1108.2464, 2011 - arxiv.org
arxiv:1108.2464v1 [cs.DS] 11 Aug 2011 Page 1 GROTHENDIECK-TYPE INEQUALITIES IN
COMBINATORIAL OPTIMIZATION SUBHASH KHOT AND ASSAF NAOR Abstract. We …
COMBINATORIAL OPTIMIZATION SUBHASH KHOT AND ASSAF NAOR Abstract. We …
Differentially private analysis on graph streams
In this paper, we focus on answering queries, in a differentially private manner, on graph
streams. We adopt the sliding window model of privacy, where we wish to perform analysis …
streams. We adopt the sliding window model of privacy, where we wish to perform analysis …