Related papers: Maximal Ordinal Two-Factorizations
Factor graph, as a bipartite graphical model, offers a structured representation by revealing local connections among graph nodes. This study explores the utilization of factor graphs in modeling the autonomous racecar planning problem,…
We generalize the classical nuts and bolts problem to a setting where the input is a collection of $n$ nuts and $m$ bolts, and there is no promise of any matching pairs. It is not allowed to compare a nut directly with a nut or a bolt…
We propose a framework for optimal $t$-matchings excluding the prescribed $t$-factors in bipartite graphs. The proposed framework is a generalization of the nonbipartite matching problem and includes several problems, such as the…
We start from two closure operators defined on the elements of a special kind of partially ordered sets, called causal nets. Causal nets are used to model histories of concurrent processes, recording occurrences of local states and of…
Boolean matrix factorization is a natural and a popular technique for summarizing binary matrices. In this paper, we study a problem of Boolean matrix factorization where we additionally require that the factor matrices have consecutive…
Ordinal data analysis is an interesting direction in machine learning. It mainly deals with data for which only the relationships `$<$', `$=$', `$>$' between pairs of points are known. We do an attempt of formalizing structures behind…
We propose a combined model, which integrates the latent factor model and the logistic regression model, for the citation network. It is noticed that neither a latent factor model nor a logistic regression model alone is sufficient to…
We compute the most general embedding space two-point function in arbitrary Lorentz representations in the context of the recently introduced formalism in arXiv:1905.00036 and arXiv:1905.00434. This work provides a first explicit…
We propose a multivariate probability distribution that models a linear correlation between binary and continuous variables. The proposed distribution is a natural extension of the previously developed multivariate binary distribution. As…
We take an order-theoretic approach to circuit (string diagram) syntax, treating a circuit as a partial order with additional input-output structure. We define morphisms between circuits and prove a factorisation theorem showing that these…
Recently, convex formulations of low-rank matrix factorization problems have received considerable attention in machine learning. However, such formulations often require solving for a matrix of the size of the data matrix, making it…
In this paper we give an ordinal analysis of the theory of second order arithmetic. We do this by working with proof trees -- that is, "deductions" which may not be well-founded. Working in a suitable theory, we are able to represent…
Bipartite Correlation clustering is the problem of generating a set of disjoint bi-cliques on a set of nodes while minimizing the symmetric difference to a bipartite input graph. The number or size of the output clusters is not constrained…
We develop new approximation algorithms for classical graph and set problems in the RAM model under space constraints. As one of our main results, we devise an algorithm for d-Hitting Set that runs in time n^{O(d^2 + d/\epsilon})}, uses…
We introduce a new approach to an enumerative problem closely linked with the geometry of branched coverings; that is, we study the number of ways a permutation can be decomposed into a product of a given number of 2-cycles, 3-cycles, etc.…
We develop $D$-optimal designs for linear main effects models on a subset of the $2^K$ full factorial design region, when the number of factors set to the higher level is bounded. It turns out that in the case of narrow margins only those…
In this paper, we give the following result: If $D$ is a digraph of order $n$, and if $d_{D}^{+}(u) + d_{D}^{-}(v) \ge n$ for every two distinct vertices $u$ and $v$ with $(u, v) \notin A(D)$, then $D$ has a directed $2$-factor with exactly…
This paper studies optimal estimation of large-dimensional nonlinear factor models. The key challenge is that the observed variables are possibly nonlinear functions of some latent variables where the functional forms are left unspecified.…
After a brief introduction to the problem of subtraction of infrared divergences for high-order collider observables, we present a preliminary study of strongly-ordered soft and collinear multiple radiation from the point of view of…
In 2002, in a seminal article, Christoph Bandt and Bernd Pompe proposed a new methodology for the analysis of complex time series, now known as Ordinal Analysis. The ordinal methodology is based on the computation of symbols (known as…