相关论文: Simple Constructive Weak Factorization

Motivated by an application in computational biology, we consider low-rank matrix factorization with $\{0,1\}$-constraints on one of the factors and optionally convex constraints on the second one. In addition to the non-convexity shared…

In this paper, we study superficial elements of an ideal with respect to a module from a geometrical point of view, using blowing-ups. The notion of weak transform is particularly relevant to this study. We use this viewpoint to get a…

We prove vanishing of the higher direct images of the structure (and the canonical) sheaf for a proper birational morphism with source a smooth variety and target the quotient of a smooth variety by a finite group of order prime to the…

We show that the classifying category C(T) of a dependent type theory T with axioms for identity types admits a non-trivial weak factorisation system. We provide an explicit characterisation of the elements of both the left class and the…

Mott noted a one-to-one correspondence between saturated multiplicatively closed subsets of a domain D and directed convex subgroups of the group of divisibility D. With this, we construct a functor between inclusions into saturated…

Tensor factorizations are computationally hard problems, and in particular, are often significantly harder than their matrix counterparts. In case of Boolean tensor factorizations -- where the input tensor and all the factors are required…

Existing nonnegative matrix factorization methods focus on learning global structure of the data to construct basis and coefficient matrices, which ignores the local structure that commonly exists among data. In this paper, we propose a new…

This paper provides a theoretical explanation on the clustering aspect of nonnegative matrix factorization (NMF). We prove that even without imposing orthogonality nor sparsity constraint on the basis and/or coefficient matrix, NMF still…

We obtain a factorization of the characteristic function of a contractive two-step iterated lifting in terms of the characteristic functions of constituent liftings of the iterated lifting and the Julia-Halmos matrix. We also give an…

We study categories of matrix factorizations. These categories are defined for any regular function on a suitable regular scheme. Our paper has two parts. In the first part we develop the foundations; for example we discuss derived direct…

We give a construction that identifies the collection of pure processes (i.e. those which are deterministic, or without randomness) within a theory containing both pure and mixed processes. Working in the framework of symmetric monoidal…

Matrix factorization methods are important tools in data mining and analysis. They can be used for many tasks, ranging from dimensionality reduction to visualization. In this paper we concentrate on the use of matrix factorizations for…

We present fully polynomial approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials. We transform these problems into partition functions of abstract combinatorial structures…

We study minimization of a structured objective function, being the sum of a smooth function and a composition of a weakly convex function with a linear operator. Applications include image reconstruction problems with regularizers that…

Let F:X->B be a morphism of varieties in characteristic zero. The problem of semistable reduction of F was stated as a problem in the combinatorics of polyhedral complexes by Abramovich and Karu (alg-geom/9707012). In this paper we solve…

The paper discusses the construction of high dimensional spatial discretizations for arbitrary multivariate trigonometric polynomials, where the frequency support of the trigonometric polynomial is known. We suggest a construction based on…

We introduce the $D$-decomposition, a non-orthogonal matrix factorization of the form $A \approx P D Q$, where $P \in \mathbb{R}^{n \times k}$, $D \in \mathbb{R}^{k \times k}$, and $Q \in \mathbb{R}^{k \times n}$. The decomposition is…

Many applications in scientific computing and data science require the computation of a rank-revealing factorization of a large matrix. In many of these instances the classical algorithms for computing the singular value decomposition are…

Low-rank matrix factorization (MF) is an important technique in data science. The key idea of MF is that there exists latent structures in the data, by uncovering which we could obtain a compressed representation of the data. By factorizing…

We define the wonderful compactification of an arrangement of subvarieties. Given a complex nonsingular algebraic variety $Y$ and certain collection $\mathcal{G}$ of subvarieties of $Y$, the wonderful compactification $Y_\mathcal{G}$ can be…