arXiv research

Paper recovers lattice signal partitions efficiently.

We propose and analyze a generic method for community recovery in stochastic block models and degree corrected block models. This approach can exactly recover the hidden communities with high probability when the expected node degrees are of order $\log n$ or higher. Starting from a roughly correct community partition …

Study exact partition recovery with same-cluster oracle, bounded error.

Two new methods improve block-sparse signal recovery from noisy data.

The binary symmetric stochastic block model deals with a random graph of $n$ vertices partitioned into two equal-sized clusters, such that each pair of vertices is connected independently with probability $p$ within clusters and $q$ across clusters. In the asymptotic regime of $p=a \log n/n$ and $q=b \log n/n$ for fixe…

ALMA improves clustering of multilayer networks.

SDP approach recovers communities in multilayer hypergraphs from aggregated similarity matrices.

A new method avoids partition function computation for Gibbs density estimation.

In this paper we make two novel contributions to hierarchical clustering. First, we introduce an anomalous pattern initialisation method for hierarchical clustering algorithms, called A-Ward, capable of substantially reducing the time they take to converge. This method generates an initial partition with a sufficiently…

We discuss a variant of `blind' community detection, in which we aim to partition an unobserved network from the observation of a (dynamical) graph signal defined on the network. We consider a scenario where our observed graph signals are obtained by filtering white noise input, and the underlying network is different …

We consider the problem of identifying underlying community-like structures in graphs. Towards this end we study the Stochastic Block Model (SBM) on $k$-clusters: a random model on $n=km$ vertices, partitioned in $k$ equal sized clusters, with edges sampled independently across clusters with probability $q$ and within …

We consider the exact recovery problem in the hypergraph stochastic block model (HSBM) with $k$ blocks of equal size. More precisely, we consider a random $d$-uniform hypergraph $H$ with $n$ vertices partitioned into $k$ clusters of size $s = n / k$. Hyperedges $e$ are added independently with probability $p$ if $e$ is…

Develops a new method to recover large latent tree models efficiently.

Paper finds exact recovery threshold in general hypergraph model.

This paper sets thresholds for recovering vertex correspondences in partially correlated graphs.

Algorithm clusters items by sequentially selecting features, minimizing observations.

Efficient algorithm for robust recovery in stochastic block models.

Paper proposes efficient methods for clustering and signal recovery in high-dimensional data with block structures.

Bottom-up algorithms outperform top-down in hierarchical community detection at intermediate levels.

Paper tackles community recovery in binary symmetric SBM graphs.

Geometric framework links clustering accuracy to structural recovery.

Develops methods to learn centre groupings from summary statistics in multi-centre studies.

A new algorithm reduces CI tests for causal graph recovery.

We consider a blind identification problem in which we aim to recover a statistical model of a network without knowledge of the network's edges, but based solely on nodal observations of a certain process. More concretely, we focus on observations that consist of single snapshots taken from multiple trajectories of a d…

There is a recent surge of interest in identifying the sharp recovery thresholds for cluster recovery under the stochastic block model. In this paper, we address the more refined question of how many vertices that will be misclassified on average. We consider the binary form of the stochastic block model, where $n$ ver…

Spectral algorithm recovers community structure in sparse hypergraphs.

Exact cluster recovery with same-cluster queries for arbitrary ellipsoidal clusters.

We consider two closely related problems: planted clustering and submatrix localization. The planted clustering problem assumes that a random graph is generated based on some underlying clusters of the nodes; the task is to recover these clusters given the graph. The submatrix localization problem concerns locating hid…

We study a semidefinite programming (SDP) relaxation of the maximum likelihood estimation for exactly recovering a hidden community of cardinality $K$ from an $n \times n$ symmetric data matrix $A$, where for distinct indices $i,j$, $A_{ij} \sim P$ if $i, j$ are both in the community and $A_{ij} \sim Q$ otherwise, for …

Graph clustering involves the task of dividing nodes into clusters, so that the edge density is higher within clusters as opposed to across clusters. A natural, classic and popular statistical setting for evaluating solutions to this problem is the stochastic block model, also referred to as the planted partition model…

In correlation clustering, we are given $n$ objects together with a binary similarity score between each pair of them. The goal is to partition the objects into clusters so to minimise the disagreements with the scores. In this work we investigate correlation clustering as an active learning problem: each similarity sc…

Paper tackles clustering with ordinal comparisons, achieving near-optimal results.

We derive an arbitrage free relationship between recovery swap rates, digital default swap spreads and conventional CDS spreads, and argue that the fair forward recovery rate used in recovery swaps must contain a convexity premium over the expected recovery value.

The paper improves clustering algorithms for noisy data samples.

The study limits how many parts regular simplicial partitions can overlap.

OTSS learns personalized decision weights from logged decisions and outputs.

Method uses Seq2Seq learning to automatically generate recovery commands for ICT systems.

Hypergraph partitioning lies at the heart of a number of problems in machine learning and network sciences. Many algorithms for hypergraph partitioning have been proposed that extend standard approaches for graph partitioning to the case of hypergraphs. However, theoretical aspects of such methods have seldom received …

This paper reviews normalization techniques for DNNs.

A new model explains U- and Swoosh-shaped stock price recovery during the COVID-19.

This paper improves support recovery in universal one-bit compressed sensing.

This work provides a guaranteed tensor recovery method by combining low-rankness and smoothness priors.

We discuss a general notion of "sparsity structure" and associated recoveries of a sparse signal from its linear image of reduced dimension possibly corrupted with noise. Our approach allows for unified treatment of (a) the "usual sparsity" and "usual $\ell_1$ recovery," (b) block-sparsity with possibly overlapping blo…

We consider the problem of signal recovery on graphs as graphs model data with complex structure as signals on a graph. Graph signal recovery implies recovery of one or multiple smooth graph signals from noisy, corrupted, or incomplete measurements. We propose a graph signal model and formulate signal recovery as a cor…

IRKSN algorithm achieves sparse recovery with wider applicability conditions.

In this paper, we propose a family of graph partition similarity measures that take the topology of the graph into account. These graph-aware measures are alternatives to using set partition similarity measures that are not specifically designed for graph partitions. The two types of measures, graph-aware and set parti…

The study examines the balancedness of random partition models and finds the rich-get-richer characteristic is a result of model assumptions.

The paper develops mixed-integer formulations for neural networks using partitioning.