Theoretical and computational guarantees of mean field variational inference for community detection (Q2215750): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: PRMLT / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1710.11268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed membership stochastic blockmodels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonparametric view of network models and Newman–Girvan and other modularities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of moments and degree distributions for network models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5483032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/jmlr.2003.3.4-5.993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency of maximum-likelihood and variational estimators in the stochastic block model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Error Rates of SDP for Block Models: Beyond Grothendieck’s Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achieving Optimal Misclassification Proportion in Stochastic Block Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling-Based Approaches to Calculating Marginal Densities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community detection in sparse networks via Grothendieck's inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to variational methods for graphical models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency of spectral clustering in stochastic block models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Belief propagation, robust reconstruction and optimal recovery of block models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral clustering and the high-dimensional stochastic blockmodel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphical Models, Exponential Families, and Variational Inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence properties of a general algorithm for calculating variational Bayesian estimates for a normal mixture model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frequentist Consistency of Variational Bayes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Variational Bayes Estimation and Variational Information Criteria for Linear Regression Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax rates of community detection in stochastic block models / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3087561124 / rank
 
Normal rank

Latest revision as of 09:27, 30 July 2024

scientific article
Language Label Description Also known as
English
Theoretical and computational guarantees of mean field variational inference for community detection
scientific article

    Statements

    Theoretical and computational guarantees of mean field variational inference for community detection (English)
    0 references
    0 references
    0 references
    14 December 2020
    0 references
    The authors study the mean field method for community detection under the stochastic block model. They consider the statistical and computational guarantees of the iterative variational inference algorithm for community detection. The primary goal of community detection problem is to recover the community membership in a network. Denote the underlying ground truth by \(Z^*\). For a network of $n$ nodes and $k$ communities, \(Z^*\) is an \(n\times k\) matrix with each row a standard Euclidean basis in \(\mathbb R^k\). They propose an iterative algorithm called batch coordinate ascent variational inference (BCAVI), a slight modification of CAVI with batch updates, to make parallel and distributed computing possible. Let \(\pi^{(s)}\) denote the output of the $s$-th iteration, a \(\{\pi_i ^{(s)} \}_{i=1}^n\) is equal to 1, which is interpreted as an approximate posterior probability of assigning the corresponding node of each row into \(k\) communities. An informal statement of the main result: Let \(\pi^{(s)}\) be the estimation of community membership from the iterative algorithm BCAVI after \(s\) iterations. Under weak regularity condition, for some \(c_n = o_n(1)\), with high probability, we have for all $s\geq 0$, \[ l(\pi^{(s+1)},Z^*)\leq\text{ minimax rate }+ c_n l (\pi^{(s)}, Z^*) .\tag{1} \] The main contribution of this paper is equation (1).
    0 references
    mean field
    0 references
    variational inference
    0 references
    Bayesian
    0 references
    community detection
    0 references
    stochastic block model
    0 references
    0 references
    0 references
    0 references

    Identifiers