Sparse spectral decomposition identifies overlapping communities in networks.
arXiv research
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.
Trend · papers per month
We discuss structured Schatten norms for tensor decomposition that includes two recently proposed norms ("overlapped" and "latent") for convex-optimization-based tensor decomposition, and connect tensor decomposition with wider literature on structured sparsity. Based on the properties of the structured Schatten norms,…
We develop a generalisation of disentanglement in VAEs---decomposition of the latent representation---characterising it as the fulfilment of two factors: a) the latent encodings of the data having an appropriate level of overlap, and b) the aggregate encoding of the data conforming to a desired structure, represented t…
The paper provides concentration inequalities for Markov chain variance estimators.
The paper derives upper bounds on eigenvalues of Laplace-Beltrami operator on hyperbolic surfaces.
Unified theory of ownership concentration, overlap, and dependence.
Unified framework for geometric computation of minimum-area homotopy.
Metric surfaces can be divided into small triangles.
Sparse Singular Value Decomposition (SVD) models have been proposed for biclustering high dimensional gene expression data to identify block patterns with similar expressions. However, these models do not take into account prior group effects upon variable selection. To this end, we first propose group-sparse SVD model…
DAOC provides stable clustering for large networks.
The paper bounds eigenvalues and integrals of eigenfunctions on hyperbolic manifolds.
We investigate intersections of geodesic lines in and in an associated tree T, proving the following result. Let M be a punctured hyperbolic torus and let be a closed geodesic in M. Any edge of any triangle formed by distinct geodesic lines in the preimage of in is shorter then . However, a simil…
Paper identifies sparse structures and communities in heterogeneous graphical models.
We introduce Bayesian Poisson Tucker decomposition (BPTD) for modeling country--country interaction event data. These data consist of interaction events of the form "country took action toward country at time ." BPTD discovers overlapping country--community memberships, including the number of latent com…
Community detection is the task of detecting hidden communities from observed interactions. Guaranteed community detection has so far been mostly limited to models with non-overlapping communities such as the stochastic block model. In this paper, we remove this restriction, and provide guaranteed community detection f…
We empirically analyze the price and liquidity responses to trade signs, traded volumes and signed traded volumes. Utilizing the singular value decomposition, we explore the interconnections of price responses and of liquidity responses across the whole market. The statistical characteristics of their singular vectors …
Core-Halo solves large-scale fixed-point problems by decentralizing updates.
In this paper we study the problem of learning the weights of a deep convolutional neural network. We consider a network where convolutions are carried out over non-overlapping patches with a single kernel in each layer. We develop an algorithm for simultaneously learning all the kernels from the training data. Our app…
We introduce Clique Matrices as an alternative representation of undirected graphs, being a generalisation of the incidence matrix representation. Here we use clique matrices to decompose a graph into a set of possibly overlapping clusters, de ned as well-connected subsets of vertices. The decomposition is based on a s…
The paper explores the tradeoffs between fairness measures in machine learning.
Many signal processing algorithms break the target signal into overlapping segments (also called windows, or patches), process them separately, and then stitch them back into place to produce a unified output. At the overlaps, the final value of those samples that are estimated more than once needs to be decided in som…
Unified framework detects change-points and estimates parameters in nonlinear systems with regime switching.
The study of hierarchy in networks of the human brain has been of significant interest among the researchers as numerous studies have pointed out towards a functional hierarchical organization of the human brain. This paper provides a novel method for the extraction of hierarchical connectivity components in the human …
Mapper-GIN simplifies 3D point cloud classification with lightweight structure.
The paper proves properties of Bergman spaces and Schiffer operators on Riemann surfaces with quasicircles.
FreDN separates trends and periodicities in non-stationary time series forecasts.
Overlapping clustering problem is an important learning issue in which clusters are not mutually exclusive and each object may belongs simultaneously to several clusters. This paper presents a kernel based method that produces overlapping clusters on a high feature space using mercer kernel techniques to improve separa…
Deconfounding scores improve causal effect estimation with weak overlap.
A new method speeds up overlapping group lasso computations.
In medicine, visualizing chromosomes is important for medical diagnostics, drug development, and biomedical research. Unfortunately, chromosomes often overlap and it is necessary to identify and distinguish between the overlapping chromosomes. A segmentation solution that is fast and automated will enable scaling of co…
New method improves CATE estimation in low overlap regions.
Proposes a sensitivity framework to handle limited overlap in causal inference.
Producing overlapping schemes is a major issue in clustering. Recent proposed overlapping methods relies on the search of an optimal covering and are based on different metrics, such as Euclidean distance and I-Divergence, used to measure closeness between observations. In this paper, we propose the use of another meas…
The study simplifies assessing overlap in logistic regression models using empirical likelihood.
Recently, to solve large-scale lasso and group lasso problems, screening rules have been developed, the goal of which is to reduce the problem size by efficiently discarding zero coefficients using simple rules independently of the others. However, screening for overlapping group lasso remains an open challenge because…
Financial Times Series such as stock price and exchange rates are, often, non-linear and non-stationary. Use of decomposition models has been found to improve the accuracy of predictive models. The paper proposes a hybrid approach integrating the advantages of both decomposition model (namely, Maximal Overlap Discrete …
New method detects long-term structures with internal dynamics in time series data.
Community detection is a fundamental problem in network analysis which is made more challenging by overlaps between communities which often occur in practice. Here we propose a general, flexible, and interpretable generative model for overlapping communities, which can be thought of as a generalization of the degree-co…
RISA improves VFL by using imputed samples with low uncertainty.
As research into community finding in social networks progresses, there is a need for algorithms capable of detecting overlapping community structure. Many algorithms have been proposed in recent years that are capable of assigning each node to more than a single community. The performance of these algorithms tends to …
We present a principled approach for detecting overlapping temporal community structure in dynamic networks. Our method is based on the following framework: find the overlapping temporal community structure that maximizes a quality function associated with each snapshot of the network subject to a temporal smoothness c…
New mechanism detects overlap density for weak-to-strong generalization.
We calculate eigenvector overlaps between intersecting time periods of covariance matrices.
Community detection is a task of fundamental importance in social network analysis that can be used in a variety of knowledge-based domains. While there exist many works on community detection based on connectivity structures, they suffer from either considering the overlapping or non-overlapping communities. In this w…
Unified approach for fair classification with overlapping groups.
Overlap-Local-SGD improves distributed SGD by overlapping communication and computation.
The growing use of neuroimaging technologies generates a massive amount of biomedical data that exhibit high dimensionality. Tensor-based analysis of brain imaging data has been proved quite effective in exploiting their multiway nature. The advantages of tensorial methods over matrix-based approaches have also been de…
New LT-O-learners improve HLTE estimation with low overlap.