相关论文: Measure Recognition Problem
The paper investigates possible generalisations of Maharam's theorem to a classification of Boolean algebras that support a finitely additive measure. We prove that Boolean algebras that support a finitely additive non-atomic uniformly…
We investigate reflection-type problems on the class SPM, of Boolean algebras carrying strictly positive finitely additive measures. We show, in particular, that in the constructible universe there is a Boolean algebra $\mathfrak A$ which…
A Boolean algebra $\A$ equipped with a (finitely-additive) positive probability measure $m$ can be turned into a metric space $(\A , d_{m})$, where $d_{m}(a,b)= m ((a\wedge\neg b)\vee(\neg a\wedge b))$, for any $a,b\in A$, sometimes…
Multiple orthogonal polynomials are a generalization of orthogonal polynomials in which the orthogonality is distributed among a number of orthogonality weights. They appear in random matrix theory in the form of special determinantal point…
Estimating a constrained relation is a fundamental problem in machine learning. Special cases are classification (the problem of estimating a map from a set of to-be-classified elements to a set of labels), clustering (the problem of…
We address the problem of merging graph and feature-space information while learning a metric from structured data. Existing algorithms tackle the problem in an asymmetric way, by either extracting vectorized summaries of the graph…
In this article, we conduct a detailed study of \emph{finitely additive measures} (fams) in the context of Boolean algebras, focusing on three specific topics: freeness and approximation, existence and extension criteria, and integration…
The field of numerical algebraic geometry consists of algorithms for numerically solving systems of polynomial equations. When the system is exact, such as having rational coefficients, the solution set is well-defined. However, for a…
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking predicates (SBPs) is a well-known, often effective, technique…
We generalize the concept of mutually unbiased bases (MUB) to measurements which are not necessarily described by rank one projectors. As such, these measurements can be a useful tool to study the long standing problem of the existence of…
Machine Learning is a diverse field applied across various domains such as computer science, social sciences, medicine, chemistry, and finance. This diversity results in varied evaluation approaches, making it difficult to compare models…
Mixture proportion estimation (MPE) is the problem of estimating the weight of a component distribution in a mixture, given samples from the mixture and component. This problem constitutes a key part in many "weakly supervised learning"…
Let $M(\alpha)$ denote the Mahler measure of the algebraic number $\alpha$. In a recent paper, Dubickas and Smyth constructed a metric version of the Mahler measure on the multiplicative group of algebraic numbers. Later, Fili and the…
Arithmetic combinatorics is often concerned with the problem of bounding the behaviour of arbitrary finite sets in a group or ring with respect to arithmetic operations such as addition or multiplication. Similarly, combinatorial geometry…
We introduce Strong Measuring, a maximal strengthening of J. T. Moore's Measuring principle, which asserts that every collection of fewer than continuum many closed bounded subsets of $\omega_1$ is measured by some club subset of…
Multi-label classification (MLC) is a supervised learning problem in which, contrary to standard multiclass classification, an instance can be associated with several class labels simultaneously. In this chapter, we advocate a rule-based…
A distinctive problem of harmonic analysis on $\R$ with respect to a Borel probability measure $\mu$ is identifying all $t\in\R$ such that both \[\left\{e^{-2\pi i\lambda x}: \lambda\in\Lambda\right\}\quad\text{and}\quad \left\{e^{-2\pi…
Given a set of dissimilarity measurements amongst data points, determining what metric representation is most "consistent" with the input measurements or the metric that best captures the relevant geometric features of the data is a key…
This paper studies semiparametric identification of substitution and complementarity patterns between two goods using a panel multinomial choice model with bundles. The model allows the two goods to be either substitutes or complements and…
Maximum diversity problems arise in many practical settings from facility location to social networks, and constitute an important class of NP-hard problems in combinatorial optimization. There has been a growing interest in these problems…