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 for matching bipartite and unipartite graphs without collapsing.
PAC learning simplified as bipartite matching.
Neural execution solves complex graph problems like bipartite matching.
New algorithm uses imperfect advice to improve online bipartite matching performance.
Community detection or clustering is a fundamental task in the analysis of network data. Many real networks have a bipartite structure which makes community detection challenging. In this paper, we consider a model which allows for matched communities in the bipartite setting, in addition to node covariates with inform…
The bipartite record linkage task consists of merging two disparate datafiles containing information on two overlapping sets of entities. This is non-trivial in the absence of unique identifiers and it is important for a wide variety of applications given that it needs to be solved whenever we have to combine informati…
We give an algorithmic computation for the height of Kauffman's clock lattice obtained from a knot diagram with two adjacent regions starred and without crossing information specified. We show that this lattice is more familiarly the graph of perfect matchings of a bipartite graph obtained from the knot diagram by over…
In this work an iterative algorithm based on unsupervised learning is presented, specifically on a Restricted Boltzmann Machine (RBM) to solve a perfect matching problem on a bipartite weighted graph. Iteratively is calculated the weights and the bias parameters that maximize the energy funct…
A new measure -variance captures local distributional shape.
A biclustering algorithm finds dense disjoint subgraphs in weighted bipartite graphs.
This paper presents an algorithm to construct a weighted adjacency matrix of a plane bipartite graph obtained from a pretzel knot diagram. The determinant of this matrix after evaluation is shown to be the Jones polynomial of the pretzel knot by way of perfect matchings (or dimers) of this graph. The weights are Tutte'…
Recent years have witnessed a widespread increase of interest in network representation learning (NRL). By far most research efforts have focused on NRL for homogeneous networks like social networks where vertices are of the same type, or heterogeneous networks like knowledge graphs where vertices (and/or edges) are of…
We give a solution to a part of Problem 1.60 in Kirby's list of open problems in topology thus answering in the positive the 1987 conjecture by J.Przytycki concerning the existence of knots without matched diagrams.
New tests detect communities in dense bipartite graphs with high accuracy.
This paper explores combinatorial optimization for problems of max-weight graph matching on multi-partite graphs, which arise in integrating multiple data sources. Entity resolution-the data integration problem of performing noisy joins on structured data-typically proceeds by first hashing each record into zero or mor…
In recent work the author investigates perfect matchings of a bipartite graph obtained from a knot diagram and demonstrates that these correspond to discrete Morse functions on a 2-complex for the 2-sphere. This relationship is expounded below for the opposite audience: those who may be unfamiliar with knots.
Generalizes Kauffman's clock theorem to surfaces.
New approach for algorithms that learn predictors to improve performance.
We consider the following multi-component sparse PCA problem: given a set of data points, we seek to extract a small number of sparse components with disjoint supports that jointly capture the maximum possible variance. These components can be computed one by one, repeatedly solving the single-component problem and def…
Optimizes experiment design for causal structure learning in linear models with cycles.
A novel bandit problem with context-dependent rewards and blocking.
We prove the meridional rank conjecture for twisted links and arborescent links associated to bipartite trees with even weights. These links are substantial generalizations of pretzels and two-bridge links, respectively. Lower bounds on meridional rank are obtained via Coxeter quotients of the groups of link complement…
Study explores properties of bipartite knots.
In human perception and cognition, a fundamental operation that brains perform is interpretation: constructing coherent neural states from noisy, incomplete, and intrinsically ambiguous evidence. The problem of interpretation is well matched to an early and often overlooked architecture, the attractor network---a recur…
New method extends knot theory to non-bipartite knots, revealing PDs.
Submodular functions have many applications. Matchings have many applications. The bitext word alignment problem can be modeled as the problem of maximizing a nonnegative, monotone, submodular function constrained to matchings in a complete bipartite graph where each vertex corresponds to a word in the two input senten…
Simplified Khovanov polynomials for bipartite links.
Ricci curvature was proposed by Ollivier in a general framework of metric measure spaces, and it has been studied extensively in the context of graphs in recent years. In this paper we prove upper bounds for Ollivier's Ricci curvature for bipartite graphs and for the graphs with girth at least 5. We also prove a genera…
Bipartite networks are a common type of network data in which there are two types of vertices, and only vertices of different types can be connected. While bipartite networks exhibit community structure like their unipartite counterparts, existing approaches to bipartite community detection have drawbacks, including im…
New link polynomials linked to cluster theory.
New model for detecting communities in weighted bipartite networks.
Paper tackles online allocation problems using adversarial training.
New research finds six bipartite intrinsically knotted graphs with 23 edges.
Active learning methods, like uncertainty sampling, combined with probabilistic prediction techniques have achieved success in various problems like image classification and text classification. For more complex multivariate prediction tasks, the relationships between labels play an important role in designing structur…
Sharp bounds on diameter and eigenvalues for amply regular graphs.
Simplified Khovanov-Rozansky calculus for bipartite knots.
Proves Khovanov homology has no torsion for bipartite circle graphs.
We introduce a novel discriminative latent variable model for bilingual lexicon induction. Our model combines the bipartite matching dictionary prior of Haghighi et al. (2008) with a representation-based approach (Artetxe et al., 2017). To train the model, we derive an efficient Viterbi EM algorithm. We provide empiric…
Improved bipartite link prediction using 2-hop paths.
Optimal Morse matchings reveal essential structures of cell complexes which lead to powerful tools to study discrete geometrical objects, in particular discrete 3-manifolds. However, such matchings are known to be NP-hard to compute on 3-manifolds, through a reduction to the erasability problem. Here, we refine the stu…
New model for detecting communities in weighted bipartite networks.
Bipartite graphs have been used to represent data relationships in many data-mining applications such as in E-commerce recommendation systems. Since learning in graph space is more complicated than in Euclidian space, recent studies have extensively utilized neural nets to effectively and efficiently embed a graph's no…
A new method calculates HOMFLY-PT polynomials for bipartite links.
We define integral odd Khovanov homology of principally unimodular bipartite graph-links.
We present a simple combinatorial model for quasipositive surfaces and positive braids, based on embedded bipartite graphs. As a first application, we extend the well-known duality on standard diagrams of torus links to twisted torus links. We then introduce a combinatorial notion of adjacency for bipartite graph links…
We present evidence in support of a conjecture that a bipartite graph with at least five vertices in each part and |E(G)| \geq 4 |V(G)| - 17 is intrinsically knotted. We prove the conjecture for graphs that have exactly five or exactly six vertices in one part. We also show that there is a constant C_n such that a bipa…
Develops a new variational estimator for node popularity in bipartite networks.
Improved text summarization using belief propagation on weighted bipartite graphs.