Related papers: Online premeans and their computation complexity
The concepts of mean (i.e., average) and covariance of a random variable are fundamental in statistics, and are used to solve real-world problems such as those that arise in robotics, computer vision, and medical imaging. On matrix Lie…
We study the problem of estimability of means in undirected graphical Gaussian models with symmetry restrictions represented by a colored graph. Following on from previous studies, we partition the variables into sets of vertices whose…
This work presents the first statistical performance guarantees for group-invariant generative models. Many real data, such as images and molecules, are invariant to certain group symmetries, which can be taken advantage of to learn more…
The purpose of this paper is to investigate the local and global comparison of two $n$-variable generalized Bajraktarevi\'c means, i.e., to establish necessary as well as sufficient conditions in terms of the unknown functions…
Assume $G$ is a connected reductive algebraic group defined over $\bar{\mathbb{F}_p}$ such that $p$ is good prime for $G$. Furthermore we assume that $Z(G)$ is connected and $G/Z(G)$ is simple of classical type. Let $F$ be a Frobenius…
We make some sharp estimates to obtain a Schwarz lemma for the \textit{symmetrized polydisc} $\mathbb G_n$, a family of domains naturally associated with the spectral interpolation, defined by \[ \mathbb G_n :=\left\{ \left(\sum_{1\leq…
Suppose $\mathbb{F}$ is a field and let $\mathbf{a} := (a_1, a_2, \dotsc)$ be a sequence of non-zero elements in $\mathbb{F}$. For $\mathbf{a}_n := (a_1, \dotsc, a_n)$, we consider the family $\mathcal{M}_n(\mathbf{a})$ of $n \times n$…
We relate two measures of complexity of regular languages. The first is syntactic complexity, that is, the cardinality of the syntactic semigroup of the language. That semigroup is isomorphic to the semigroup of transformations of states…
Semiring semantics evaluates logical statements by values in some commutative semiring K. Random semiring interpretations, induced by a probability distribution on K, generalise random structures, and we investigate here the question of how…
Two words are $k$-binomially equivalent if each subword of length at most $k$ occurs the same number of times in both words. The $k$-binomial complexity of an infinite word is a counting function that maps $n$ to the number of $k$-binomial…
A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ with finite complement in it. We characterize isomorphisms between these monoids in terms of permutation of coordinates. Considering the equivalence relation that…
We show that the family ${\cal F}_k$ of all meromorphic functions $f$ in a domain $D$ satisfying $$\frac{|f^{(k)}|}{1+|f|}(z)\ge C \qquad \mbox{ for all } z\in D$$ (where $k$ is a natural number and $C>0$) is quasi-normal. The proof relies…
The arithmetic mean plays a central role in science and technology, being directly related to the concepts of statistical expectance and centrality. Yet, it is highly susceptible to the presence of outliers or biased interference in the…
Large language models (LLMs) have achieved impressive success on many benchmarks for mathematical reasoning. However, there is growing concern that some of this performance actually reflects dataset contamination, where data closely…
Recursive permutations whose cycles are the classes of a decidable equivalence relation are studied; the set of these permutations is called $\mathrm{Perm}$, the group of all recursive permutations $\mathcal{G}$. Multiple equivalent…
We propose a new family of fairness definitions for classification problems that combine some of the best properties of both statistical and individual notions of fairness. We posit not only a distribution over individuals, but also a…
For a general family of non-negative functions matching upper and lower bounds are established for their average over the values of any equidistributed sequence.
The change-making problem was recently extended to sets of positive integers not containing the element $1$, and from there to numerical semigroups. A greedy numerical semigroup is defined as a numerical semigroup where the greedy…
Given a reference computer, Kolmogorov complexity is a well defined function on all binary strings. In the standard approach, however, only the asymptotic properties of such functions are considered because they do not depend on the…
Gaussian mixture models (GMM) are the most widely used statistical model for the $k$-means clustering problem and form a popular framework for clustering in machine learning and data analysis. In this paper, we propose a natural semi-random…