136 research outputs found
Phase Transitions in Semidefinite Relaxations
Statistical inference problems arising within signal processing, data mining,
and machine learning naturally give rise to hard combinatorial optimization
problems. These problems become intractable when the dimensionality of the data
is large, as is often the case for modern datasets. A popular idea is to
construct convex relaxations of these combinatorial problems, which can be
solved efficiently for large scale datasets.
Semidefinite programming (SDP) relaxations are among the most powerful
methods in this family, and are surprisingly well-suited for a broad range of
problems where data take the form of matrices or graphs. It has been observed
several times that, when the `statistical noise' is small enough, SDP
relaxations correctly detect the underlying combinatorial structures.
In this paper we develop asymptotic predictions for several `detection
thresholds,' as well as for the estimation error above these thresholds. We
study some classical SDP relaxations for statistical problems motivated by
graph synchronization and community detection in networks. We map these
optimization problems to statistical mechanics models with vector spins, and
use non-rigorous techniques from statistical mechanics to characterize the
corresponding phase transitions. Our results clarify the effectiveness of SDP
relaxations in solving high-dimensional statistical problems.Comment: 71 pages, 24 pdf figure
Learning with Semi-Definite Programming: new statistical bounds based on fixed point analysis and excess risk curvature
Many statistical learning problems have recently been shown to be amenable to
Semi-Definite Programming (SDP), with community detection and clustering in
Gaussian mixture models as the most striking instances [javanmard et al.,
2016]. Given the growing range of applications of SDP-based techniques to
machine learning problems, and the rapid progress in the design of efficient
algorithms for solving SDPs, an intriguing question is to understand how the
recent advances from empirical process theory can be put to work in order to
provide a precise statistical analysis of SDP estimators.
In the present paper, we borrow cutting edge techniques and concepts from the
learning theory literature, such as fixed point equations and excess risk
curvature arguments, which yield general estimation and prediction results for
a wide class of SDP estimators. From this perspective, we revisit some
classical results in community detection from [gu\'edon et al.,2016] and [chen
et al., 2016], and we obtain statistical guarantees for SDP estimators used in
signed clustering, group synchronization and MAXCUT
Multiple Partitioning of Multiplex Signed Networks: Application to European Parliament Votes
For more than a decade, graphs have been used to model the voting behavior
taking place in parliaments. However, the methods described in the literature
suffer from several limitations. The two main ones are that 1) they rely on
some temporal integration of the raw data, which causes some information loss,
and/or 2) they identify groups of antagonistic voters, but not the context
associated to their occurrence. In this article, we propose a novel method
taking advantage of multiplex signed graphs to solve both these issues. It
consists in first partitioning separately each layer, before grouping these
partitions by similarity. We show the interest of our approach by applying it
to a European Parliament dataset.Comment: Social Networks, 2020, 60, 83 - 10
An MBO scheme for clustering and semi-supervised clustering of signed networks
We introduce a principled method for the signed clustering problem, where the goal is to partition a weighted undirected graph whose edge weights take both positive and negative values, such that edges within the same cluster are mostly positive, while edges spanning across clusters are
mostly negative. Our method relies on a graph-based diffuse interface model formulation utilizing the Ginzburg–Landau functional, based on an adaptation of the classic numerical Merriman–Bence–Osher (MBO) scheme for minimizing such graph-based functionals. The proposed objective function aims to minimize the total weight of inter-cluster positively-weighted edges, while maximizing the total weight of the inter-cluster negatively-weighted edges. Our method scales to large sparse networks, and can be easily adjusted to incorporate labelled data information, as is often the case in the context of semisupervised learning. We tested our method on a number of both synthetic stochastic block models and real-world data sets (including financial correlation matrices), and obtained promising results that compare favourably against a number of state-of-the-art approaches from the recent literature
A Unified Approach to Synchronization Problems over Subgroups of the Orthogonal Group
Given a group , the problem of synchronization over the group
is a constrained estimation problem where a collection of group
elements are estimated based on noisy
observations of pairwise ratios for an incomplete set of
index pairs . This problem has gained much attention recently and finds
lots of applications due to its appearance in a wide range of scientific and
engineering areas. In this paper, we consider the class of synchronization
problems over a closed subgroup of the orthogonal group, which covers many
instances of group synchronization problems that arise in practice. Our
contributions are threefold. First, we propose a unified approach to solve this
class of group synchronization problems, which consists of a suitable
initialization and an iterative refinement procedure via the generalized power
method. Second, we derive a master theorem on the performance guarantee of the
proposed approach. Under certain conditions on the subgroup, the measurement
model, the noise model and the initialization, the estimation error of the
iterates of our approach decreases geometrically. As our third contribution, we
study concrete examples of the subgroup (including the orthogonal group, the
special orthogonal group, the permutation group and the cyclic group), the
measurement model, the noise model and the initialization. The validity of the
related conditions in the master theorem are proved for these specific
examples. Numerical experiments are also presented. Experiment results show
that our approach outperforms existing approaches in terms of computational
speed, scalability and estimation error
- …