A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
New method combines spectral and sparse methods for Gaussian processes.
Regularization of the classical Laplacian matrices was empirically shown to improve spectral clustering in sparse networks. It was observed that small regularizations are preferable, but this point was left as a heuristic argument. In this paper we formally determine a proper regularization which is intimately related …
Spectral clustering with edge counting detects communities in sparse models.
Unified spectral clustering for sparse networks with heterogeneous degrees.
Efficiently scales continuous kernels with sparse Fourier domain learning.
Improved spectral clustering guarantees for dynamic stochastic block models.
Paper proposes a new method for sparse spectral clustering on Stiefel manifold.
The study finds sparse sets that uniquely determine metrics on negatively curved manifolds.
Spectral method detects communities in sparse hypergraphs, achieving detection threshold.
New method for community detection in sparse directed SBMs with exact recovery guarantees.
Sparse spectral decomposition identifies overlapping communities in networks.
A novel nonstationary permanental process relaxes kernel constraints and captures complex data patterns.
New Bethe-Hessian method improves community detection in sparse networks.
A fast spectral algorithm detects community structure in evolving graphs.
Spectral algorithms are classic approaches to clustering and community detection in networks. However, for sparse networks the standard versions of these algorithms are suboptimal, in some cases completely failing to detect communities even when other algorithms such as belief propagation can do so. Here we introduce a…
High-dimensional inference for sparse spectral precision matrices
Unified framework for clustering with sparse convex combinations.
Spectral algorithm recovers community structure in sparse hypergraphs.
Paper connects probability density cuts to graph theory eigenfunctions.
Develops a method to estimate network difference in high-dimensional time series data.
This paper uses the relationship between graph conductance and spectral clustering to study (i) the failures of spectral clustering and (ii) the benefits of regularization. The explanation is simple. Sparse and stochastic graphs create a lot of small trees that are connected to the core of the graph by only one edge. G…
Learning meaningful graphs from data plays important roles in many data mining and machine learning tasks, such as data representation and analysis, dimension reduction, data clustering, and visualization, etc. In this work, for the first time, we present a highly-scalable spectral approach (GRASPEL) for learning large…
New method improves matrix completion accuracy, especially in noisy data.
Network Lasso clusters sparse graph clusters efficiently.
Near-optimal sample complexity for phase retrieval with generative priors.
While the harmonic function solution performs well in many semi-supervised learning (SSL) tasks, it is known to scale poorly with the number of samples. Recent successful and scalable methods, such as the eigenfunction method focus on efficiently approximating the whole spectrum of the graph Laplacian constructed from …
We consider spectral clustering algorithms for community detection under a general bipartite stochastic block model (SBM). A modern spectral clustering algorithm consists of three steps: (1) regularization of an appropriate adjacency or Laplacian matrix (2) a form of spectral truncation and (3) a k-means type algorithm…
Many algorithms have been proposed for fitting network models with communities, but most of them do not scale well to large networks, and often fail on sparse networks. Here we propose a new fast pseudo-likelihood method for fitting the stochastic block model for networks, as well as a variant that allows for an arbitr…
Signal processing is rich in inherently continuous and often nonlinear applications, such as spectral estimation, optical imaging, and super-resolution microscopy, in which sparsity plays a key role in obtaining state-of-the-art results. Coping with the infinite dimensionality and non-convexity of these problems typica…
The paper analyzes sparse PCA for incomplete data and proves support recovery conditions.
New algorithm recovers sparse signals from linearly sparse dictionaries efficiently.
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can be viewed in the context of both feature selection and sparse approximation. We analyze the performance of widely used greedy heuristics, usi…
For random graphs distributed according to stochastic blockmodels, a special case of latent position graphs, adjacency spectral embedding followed by appropriate vertex classification is asymptotically Bayes optimal; but this approach requires knowledge of and critically depends on the model dimension. In this paper, w…
New outlier detection method using graph Laplacian spectrum boosts performance.
Bayesian method uses data spectra to estimate non-sparse high-dimensional models.
Multi-cell cooperative processing with limited backhaul traffic is studied for cellular uplinks. Aiming at reduced backhaul overhead, a sparsity-regularized multi-cell receive-filter design problem is formulated. Both unstructured distributed cooperation as well as clustered cooperation, in which base station groups ar…
Improved spectral method recovers sparse vectors in random subspaces.
New method estimates Nishimori temperature for node classification in weighted graphs.
We consider the decomposition of a data matrix assumed to be a superposition of a low-rank matrix and a component which is sparse in a known dictionary, using a convex demixing method. We consider two sparsity structures for the sparse factor of the dictionary sparse component, namely entry-wise and column-wise sparsit…
We consider the community detection problem in sparse random hypergraphs. Angelini et al. (2015) conjectured the existence of a sharp threshold on model parameters for community detection in sparse hypergraphs generated by a hypergraph stochastic block model. We solve the positive part of the conjecture for the case of…
Regularized spectral methods improve clustering in signed graphs, especially for sparse data.
Spectral methods are popular in detecting global structures in the given data that can be represented as a matrix. However when the data matrix is sparse or noisy, classic spectral methods usually fail to work, due to localization of eigenvectors (or singular vectors) induced by the sparsity or noise. In this work, we …
While much research effort has been dedicated to scaling up sparse Gaussian process (GP) models based on inducing variables for big data, little attention is afforded to the other less explored class of low-rank GP approximations that exploit the sparse spectral representation of a GP kernel. This paper presents such a…
Spectral mixture (SM) kernels comprise a powerful class of generalized kernels for Gaussian processes (GPs) to describe complex patterns. This paper introduces model compression and time- and phase (TP) modulated dependency structures to the original (SM) kernel for improved generalization of GPs. Specifically, by adop…
Spectral clustering is one of the most popular, yet still incompletely understood, methods for community detection on graphs. This article studies spectral clustering based on the Bethe-Hessian matrix for sparse heterogeneous graphs (following the degree-corrected stochastic block model) in a …
Study spectral properties of sparse random graphs to recover latent vectors.
This paper is concerned about sparse, continuous frequency estimation in line spectral estimation, and focused on developing gridless sparse methods which overcome grid mismatches and correspond to limiting scenarios of existing grid-based approaches, e.g., optimization and SPICE, with an infinitely dense grid…
New spectral clustering method handles discrete covariates for better community detection.