相关论文: Note on sampling without replacing from a finite c…

We study the problem of recovering an unknown compactly-supported multivariate function from samples of its Fourier transform that are acquired nonuniformly, i.e. not necessarily on a uniform Cartesian grid. Reconstruction problems of this…

The authors and Fischer recently proved that any hereditary property of two-dimensional matrices (where the row and column order is not ignored) over a finite alphabet is testable with a constant number of queries, by establishing the…

Can the behavior of a random matrix be improved by modifying a small fraction of its entries? Consider a random matrix $A$ with i.i.d. entries. We show that the operator norm of $A$ can be reduced to the optimal order $O(\sqrt{n})$ by…

Suppose $F$ is an infinite field and let $f \in F\{X_1, \dots,X_m\}$ be a noncommutative polynomial. Partially answering a query of Makar-Limanov, we show that there are numbers $d$ and $m'$ such that, if $F$ is closed under taking $d$th…

This article offers a comprehensive treatment of polynomial functional regression, culminating in the establishment of a novel finite sample bound. This bound encompasses various aspects, including general smoothness conditions, capacity…

We consider unconstrained multi-criteria optimization problems with finite sum objective functions. The proposed algorithm belongs to a non-monotone trust region framework where additional sampling approach is used to govern the sample size…

We consider the related tasks of matrix completion and matrix approximation from missing data and propose adaptive sampling procedures for both problems. We show that adaptive sampling allows one to eliminate standard incoherence…

We study the solvability of boundary-value problems for differential-operator equations of the second order in L p (0, 1; X), with 1 < p < +$\infty$, X being a UMD complex Banach space. The originality of this work lies in the fact that we…

We prove explicit, i.e., non-asymptotic, error bounds for Markov Chain Monte Carlo methods, such as the Metropolis algorithm. The problem is to compute the expectation (or integral) of f with respect to a measure which can be given by a…

In recent years, structured matrix recovery problems have gained considerable attention for its real world applications, such as recommender systems and computer vision. Much of the existing work has focused on matrices with low-rank…

We consider the problem of exact recovery of any $m\times n$ matrix of rank $\varrho$ from a small number of observed entries via the standard nuclear norm minimization framework. Such low-rank matrices have degrees of freedom $(m+n)\varrho…

In this paper, we present a problem involving fully nonlinear elliptic operators with Hamiltonian, which can present a singularity or degenerate as the gradient approaches the origin. The model studied here, allows the appearance of plateau…

The ultimate limits of quantum state discrimination are often thought to be captured by asymptotic bounds that restrict the achievable error probabilities, notably the quantum Chernoff and Hoeffding bounds. Here we study hypothesis testing…

In this paper we study the matrix completion problem: Suppose $X \in {\mathbb R}^{n_r \times n_c}$ is unknown except for a known upper bound $r$ on its rank. By measuring a small number $m \ll n_r n_c$ of elements of $X$, is it possible to…

We present randomized algorithms for estimating the trace and deter- minant of Hermitian positive semi-definite matrices. The algorithms are based on subspace iteration, and access the matrix only through matrix vector products. We analyse…

Matrix completion is a classical problem in data science wherein one attempts to reconstruct a low-rank matrix while only observing some subset of the entries. Previous authors have phrased this problem as a nuclear norm minimization…

In many contexts one encounters Hermitian operators $M$ on a Hilbert space whose dimension is so large that it is impossible to write down all matrix entries in an orthonormal basis. How does one determine whether such $M$ is positive…

We consider the problem of completing a matrix with categorical-valued entries from partial observations. This is achieved by extending the formulation and theory of one-bit matrix completion. We recover a low-rank matrix $X$ by maximizing…

We consider inverse problems consisting of the reconstruction of an unknown signal $f$ from noisy measurements $y=Ff+\text{noise}$, where $Ff$ is a function on a Riemannian manifold without boundary $\mathcal M$. We consider the case when…

We show that the Skolem Problem is decidable in finitely generated commutative rings of positive characteristic. More precisely, we show that there exists an algorithm which, given a finite presentation of a (unitary) commutative ring…