Related papers: Conditioning of partial nonuniform Fourier matrice…

Many problems in data science can be treated as estimating a low-rank matrix from highly incomplete, sometimes even corrupted, observations. One popular approach is to resort to matrix factorization, where the low-rank matrix factors are…

In this paper we present a new bound obtained with the probabilistic method for the solution of the Set Covering problem with unit costs. The bound is valid for problems of fixed dimension, thus extending previous similar asymptotic…

We investigate the problem of recovering a partially observed high-rank matrix whose columns obey a nonlinear structure such as a union of subspaces, an algebraic variety or grouped in clusters. The recovery problem is formulated as the…

We present a quasi-linearly scaling, first order polynomial finite element method for the solution of the magnetostatic open boundary problem by splitting the magnetic scalar potential. The potential is determined by solving a Dirichlet…

Originally developed for imputing missing entries in low rank, or approximately low rank matrices, matrix completion has proven widely effective in many problems where there is no reason to assume low-dimensional linear structure in the…

We analyze and test using Fourier extensions that minimize a Hilbert space norm for the purpose of solving partial differential equations (PDEs) on surfaces. In particular, we prove that the approach is arbitrarily high-order and also show…

Let $\widehat G \subseteq G$ be complex reductive algebraic groups. The branching problem that aims to study $G$-modules as $\widehat G$-modules is encoded by a collection of branching multiplicities parameterised by pairs of dominant…

Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis. We introduce a new class of upper bounds on the log partition…

In recent years, the capacitated center problems have attracted a lot of research interest. Given a set of vertices $V$, we want to find a subset of vertices $S$, called centers, such that the maximum cluster radius is minimized. Moreover,…

For linear recurrence systems, the problem of finding rational solutions is reduced to the problem of computing polynomial solutions by computing a content bound or a denominator bound. There are several bounds in the literature. The…

For polynomial $ P (x,y)$, and any Calder\'{o}n-Zygmund kernel, $K$, the operator below satisfies a $ (1,r)$ sparse bound, for $ 1< r \leq 2$. $$ \sup _{\epsilon >0} \Bigl\lvert \int_{|y| > \epsilon} f (x-y) e ^{2 \pi i P (x,y) } K(y) \; dy…

In this paper, we consider the singularly perturbed fractional Schr\"{o}dinger equation \begin{equation*} \epsilon^{2\alpha}(-\Delta)^\alpha u+V(x)u=f(u),\quad x\in \mathbb{R}^N, \end{equation*} where $\epsilon>0$ is a small parameter,…

This paper considers the optimization problem in the form of $\min_{X \in \mathcal{F}_v} f(x) + \lambda \|X\|_1,$ where $f$ is smooth, $\mathcal{F}_v = \{X \in \mathbb{R}^{n \times q} : X^T X = I_q, v \in \mathrm{span}(X)\}$, and $v$ is a…

We propose a new method based on sparse optimal discriminant clustering (SODC), incorporating a penalty term into the scoring matrix based on convex clustering. With the addition of this penalty term, it is expected to improve the accuracy…

For an oriented surface $S$, the singular set of a fold map $f:S\rightarrow \mathbb{R}^2$ is a collection of smooth curves, also known as fold singularities. We construct a sharp lower bound on the number of self-intersections of such fold…

We provide improved upper and lower bounds for the Min-Sum-Radii (MSR) and Min-Sum-Diameters (MSD) clustering problems with a bounded number of clusters $k$. In particular, we propose an exact MSD algorithm with running-time $n^{O(k)}$. We…

The nonnegative rank of an entrywise nonnegative matrix A of size mxn is the smallest integer r such that A can be written as A=UV where U is mxr and V is rxn and U and V are both nonnegative. The nonnegative rank arises in different areas…

We derive the Euler-Lagrange equations for minimizers of causal variational principles in the non-compact setting with constraints, possibly prescribing symmetries. Considering first variations, we show that the minimizing measure is…

Generalizing earlier work by Ros in ambient dimension three, we prove an affine lower bound for the Morse index of closed minimal hypersurfaces inside a flat torus in terms of their first Betti number (with purely dimensional coefficients).

We consider the problem of learning an unknown $f$ with a sparse Fourier spectrum in the presence of outlier noise. In particular, the algorithm has access to a noisy oracle for (an unknown) $f$ such that (i) the Fourier spectrum of $f$ is…