Related papers: On the local uniformization problem
We study Abhyankar valuations of excellent equicharacteristic local domains with an algebraically closed residue field. For zero dimensional valuations we prove that whenever the ring is complete and the semigroup of values taken by the…
We consider the problem of learning low-rank tensors from partial observations with structural constraints, and propose a novel factorization of such tensors, which leads to a simpler optimization problem. The resulting problem is an…
The instability of embedding spaces across model retraining cycles presents significant challenges to downstream applications using user or item embeddings derived from recommendation systems as input features. This paper introduces a novel…
Stone locales together with continuous maps form a coreflective subcategory of spectral locales and perfect maps. A proof in the internal language of an elementary topos was previously given by the second-named author. This proof can be…
Online learning to rank is a core problem in machine learning. In Lattimore et al. (2018), a novel online learning algorithm was proposed based on topological sorting. In the paper they provided a set of self-normalized inequalities (a) in…
We show that, for a fixed order $\gamma\geq 1$, each local minimizer of a rather general nonsmooth optimization problem in Euclidean spaces is either M-stationary in the classical sense (corresponding to stationarity of order $1$),…
The task of reconstructing a matrix given a sample of observedentries is known as the matrix completion problem. It arises ina wide range of problems, including recommender systems, collaborativefiltering, dimensionality reduction, image…
This paper studies three natural pre-orders of increasing generality on the set of all completely non-unitary partial isometries with equal defect indices. We show that the problem of determining when one partial isometry is less than…
We study different types of localisations of a commutative noetherian ring. More precisely, we provide criteria to decide: (a) if a given flat ring epimorphism is a universal localisation in the sense of Cohn and Schofield; and (b) when…
We study the optimization version of the set partition problem (where the difference between the partition sums are minimized), which has numerous applications in decision theory literature. While the set partitioning problem is NP-hard and…
In this paper, we focus on computing local minimizers of a multivariate polynomial optimization problem under certain genericity conditions. By using a technique in computer algebra and the second-order optimality condition, we provide a…
Robust principal component analysis is an important representative method in data analysis. It is usually viewed as an optimization problem involving the rank and $\ell_0$-norm of matrices. In this paper, we study the rank and $\ell_0$…
Matrix rank minimizing subject to affine constraints arises in many application areas, ranging from signal processing to machine learning. Nuclear norm is a convex relaxation for this problem which can recover the rank exactly under some…
We study Morita equivalence and Morita duality for rings with local units. We extend the Auslander's results on the theory of Morita equivalence and the Azumaya-Morita duality theorem to rings with local units. As a consequence, we give a…
We discuss the locality problem in relativistic and nonrelativistic quantum theory. We show that there exists a formulation of quantum theory that, on one hand, preserves the mathematical apparatus of the standard quantum mechanics and, on…
This paper studies a stylized, yet natural, learning-to-rank problem and points out the critical incorrectness of a widely used nearest neighbor algorithm. We consider a model with $n$ agents (users) $\{x_i\}_{i \in [n]}$ and $m$…
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system…
Block full rank pencils introduced in [Dopico et al., Local linearizations of rational matrices with application to rational approximations of nonlinear eigenvalue problems, Linear Algebra Appl., 2020] allow us to obtain local information…
Alternating minimization heuristics seek to solve a (difficult) global optimization task through iteratively solving a sequence of (much easier) local optimization tasks on different parts (or blocks) of the input parameters. While popular…
In this paper, we deal with uniform spaces whose diagonal uniformity admits a basis consisting of equivalence relations. Such non-Archimedean uniform spaces are particularly interesting for applications in commutative ring theory, because…