Related papers: Matrix weights, singular integrals, Jones factoriz…
Matrix factorization is a widely used approach for top-N recommendation and collaborative filtering. When implemented on implicit feedback data (such as clicks), a common heuristic is to upweight the observed interactions. This strategy has…
This is a sequel to [SIGMA 9 (2013), 007, 23 pages, arXiv:1210.1177], in which there is a construction of a $2\times2$ positive-definite matrix function $K (x)$ on $\mathbb{R}^{2}$. The entries of $K(x)$ are expressed in terms of…
Fully bracketed implication terms on $n$ variables are evaluated in G\"odel $m$-valued logic on a finite chain, and we enumerate truth-table rows by output value across all Catalan bracketings. Using the Catalan decomposition, we derive a…
We study concentration inequalities for structured weighted sums of random data, including (i) tensor inner products and (ii) sequential matrix sums. We are interested in tail bounds and concentration inequalities for those structured…
We introduce matrix-valued weight functions of arbitrary size, which are analogues of the weight function for the Gegenbauer or ultraspherical polynomials for the parameter $\nu>0$. The LDU-decomposition of the weight is explicitly given in…
We propose a new fast method to match factorization theorems applicable in different kinematical regions, such as the transverse-momentum-dependent and the collinear factorization theorems in Quantum Chromodynamics. At variance with…
This paper extends the results from arXiv:1702.04569 about sharp $A_2$-$A_\infty$ estimates with matrix weights to the non-homogeneous situation.
Identifying the number of factors in a high-dimensional factor model has attracted much attention in recent years and a general solution to the problem is still lacking. A promising ratio estimator based on the singular values of the lagged…
A classical argument was introduced by Khintchine in 1926 in order to exhibit the existence of totally irrational singular linear forms in two variables. This argument was subsequently revisited and extended by many authors. For instance,…
For a rational matrix function $\Phi$ with poles outside the unit circle, we estimate the degree of the unique superoptimal approximation $\A\Phi$ by matrix functions analytic in the unit disk. We obtain sharp estimates in the case of…
The proposed article aims at offering a comprehensive tutorial for the computational aspects of structured matrix and tensor factorization. Unlike existing tutorials that mainly focus on {\it algorithmic procedures} for a small set of…
We develop new solvability methods for divergence form second order, real and complex, elliptic systems above Lipschitz graphs, with $L_2$ boundary data. The coefficients $A$ may depend on all variables, but are assumed to be close to…
Using determinant representations for partition functions of the corresponding square ice models and the method proposed recently by one of the authors, we investigate refined enumerations of vertically symmetric alternating-sign matrices,…
Let d1 and d2 be discriminants of distinct quadratic imaginary orders O_d1 and O_d2 and let J(d1,d2) denote the product of differences of CM j-invariants with discriminants d1 and d2. In 1985, Gross and Zagier gave an elegant formula for…
An assignment problem is the optimization problem of finding, in an m by n matrix of nonnegative real numbers, k entries, no two in the same row or column, such that their sum is minimal. Such an optimization problem is called a random…
The aim of this paper is to implement some new techniques, based on conjugate duality in convex optimization, for proving the existence of global error bounds for convex inequality systems. We deal first of all with systems described via…
Fontaine-Mazur Conjecture is one of the core statements in modern arithmetic geometry. Several formulations were given since its original statement in 1993, and various angles have been adopted by numerous authors to try to tackle it.…
Renormalization-group methods in soft-collinear effective theory are used to perform the resummation of large perturbative logarithms for deep-inelastic scattering in the threshold region x->1. The factorization theorem for the structure…
We consider feasibility and constrained optimization problems defined over smooth and/or strongly convex sets. These notions mirror their popular function counterparts but are much less explored in the first-order optimization literature.…
We prove matching direct and inverse theorems for uniform polynomial approximation with $A^*$ weights (a subclass of doubling weights suitable for approximation in the $L_\infty$ norm) having finitely many zeros and not too "rapidly…