相关论文: Partitions of Equiangular Tight Frames
The macroscopic forcing method (MFM) of Mani and Park and similar methods for obtaining turbulence closure operators, such as the Green's function-based approach of Hamba, recover reduced solution operators from repeated direct numerical…
The cone of positive-semidefinite (PSD) matrices is fundamental in convex optimization, and we extend this notion to tensors, defining PSD tensors, which correspond to separable quantum states. We study the convex optimization problem over…
We consider a broad class of semilinear SPDEs with multiplicative noise driven by a finite-dimensional Wiener process. We show that, provided that an infinite-dimensional analogue of H\"ormander's bracket condition holds, the Malliavin…
The Optimal Morse Matching (OMM) problem asks for a discrete gradient vector field on a simplicial complex that minimizes the number of critical simplices. It is NP-hard and has been studied extensively in heuristic, approximation, and…
Finite-sum optimization has wide applications in machine learning, covering important problems such as support vector machines, regression, etc. In this paper, we initiate the study of solving finite-sum optimization problems by quantum…
Submodular function minimization (SFM) is a fundamental and efficiently solvable problem class in combinatorial optimization with a multitude of applications in various fields. Surprisingly, there is only very little known about constraint…
The problem of recovering the configuration of points from their partial pairwise distances, referred to as the Euclidean Distance Matrix Completion (EDMC) problem, arises in a broad range of applications, including sensor network…
The study of the partition function in M-theory involves the use of index theory on a twelve-dimensional bounding manifold. In eleven dimensions, viewed as a boundary, this is given by secondary index invariants such as the…
Marcus, Spielman, and Srivastava recently solved the Kadison-Singer problem by showing that if u_1, ..., u_m are column vectors in C^d such that \sum u_iu_i^* = I, then a set of indices S \subseteq {1, ..., m} can be chosen so that \sum_{i…
Although many machine learning algorithms involve learning subspaces with particular characteristics, optimizing a parameter matrix that is constrained to represent a subspace can be challenging. One solution is to use Riemannian…
Recently, a family of tractable NMF algorithms have been proposed under the assumption that the data matrix satisfies a separability condition Donoho & Stodden (2003); Arora et al. (2012). Geometrically, this condition reformulates the NMF…
In this study, we introduce a novel family of tensor networks, termed constrained matrix product states (MPS), designed to incorporate exactly arbitrary discrete linear constraints, including inequalities, into sparse block structures.…
Equi-chordal and equi-isoclinic tight fusion frames (ECTFFs and EITFFs) are both types of optimal packings of subspaces in Euclidean spaces. In the special case where these subspaces are one-dimensional, ECTFFs and EITFFs both correspond to…
We consider the matrix completion problem under a form of row/column weighted entrywise sampling, including the case of uniform entrywise sampling as a special case. We analyze the associated random observation operator, and prove that with…
The Schr\"odinger Bridge (SB) problem has become a fundamental tool in computational optimal transport and generative modeling. To address this problem, ideal methods such as Iterative Proportional Fitting and Iterative Markovian Fitting…
Recent results from real algebraic geometry and the theory of polynomial optimization are related in a new framework to the existence question of multivariate tight wavelet frames whose generators have at least one vanishing moment. Namely,…
This note presents a new proof of an important result due to Bourgain and Tzafriri that provides a partial solution to the Kadison--Singer problem. The result shows that every unit-norm matrix whose entries are relatively small in…
In the past few years, the slice-rank lemma of Tao has been applied successfully to many problems in extremal combinatorics. In this paper, first, we define a new notion of triangular tensors which generalizes that of triangular matrices…
This paper presents an efficient approach to image segmentation that approximates the piecewise-smooth (PS) functional in [12] with explicit solutions. By rendering some rational constraints on the initial conditions and the final solutions…
Parametrizing TMD parton densities and fragmentation functions in ways that consistently match their large transverse momentum behavior in standard collinear factorization has remained notoriously difficult. We show how the problem is…