Related papers: Online premeans and their computation complexity
We prove asymptotic convergence for a general class of $k$-means algorithms performed over streaming data from a distribution: the centers asymptotically converge to the set of stationary points of the $k$-means cost function. To do so, we…
Metric clustering is fundamental in areas ranging from Combinatorial Optimization and Data Mining, to Machine Learning and Operations Research. However, in a variety of situations we may have additional requirements or knowledge, distinct…
We study families of analytic and meromorphic functions with bounded generalized Schwarzian derivative $S_k(f)$. We show that these families are quasi-normal. Further, we investigate associated families, such as those formed by derivatives…
Quasi-arithmetic means are defined for every continuous, strictly monotone function $f \colon U \rightarrow \mathbb{R}$, ($U$ -- an interval). For an $n$-tuple $a \in U^n$ with corresponding vector of weights $w=(w_1,\dots,w_n)$ ($w_i>0$,…
The computation of the normaliser of a permutation group in the full symmetric group is an important and hard problem in computational group theory. This article reports on an algorithm that builds a descending chain of overgroups to…
This paper explores the use of 2-categorical technology for describing and reasoning about complex quantum procedures. We give syntactic definitions of a family of complementary measurements, and of quantum key distribution, and show that…
The Median of Means (MoM) is a mean estimator that has gained popularity in the context of heavy-tailed data. In this work, we analyze its performance in the task of simultaneously estimating the mean of each function in a class…
Bayesian modeling and analysis of the MEG and EEG modalities provide a flexible framework for introducing prior information complementary to the measured data. This prior information is often qualitative in nature, making the translation of…
Parametric Presburger arithmetic concerns families of sets S_t in Z^d, for t in N, that are defined using addition, inequalities, constants in Z, Boolean operations, multiplication by t, and quantifiers on variables ranging over Z. That is,…
Algorithms for clustering points in metric spaces is a long-studied area of research. Clustering has seen a multitude of work both theoretically, in understanding the approximation guarantees possible for many objective functions such as…
We give two algorithmic procedures to compute the whole set of almost symmetric numerical semigroups with fixed Frobenius number and type, and the whole set of almost symmetric numerical semigroups with fixed Frobenius number. Our…
In this paper we describe the solutions of the functional equation \begin{equation*} F\Big(\frac{x+y}2\Big)+f_1(x)+f_2(y)=G \big(g_1(x)+g_2(y)) \end{equation*} defined on an open subinterval of $ \mathbb{R} $. Improving previous results we…
This paper is a continuation of the paper "Numerical Semigroups: Ap\'ery Sets and Hilbert Series". We consider the general numerical AA-semigroup, i.e., semigroups consisting of all non-negative integer linear combinations of relatively…
In the following article we provide an exposition of exact computational methods to perform parameter inference from partially observed network models. In particular, we consider the duplication attachment (DA) model which has a likelihood…
Algorithmic information theory studies description complexity and randomness and is now a well known field of theoretical computer science and mathematical logic. There are several textbooks and monographs devoted to this theory where one…
Let $S$ and $\Delta$ be numerical semigroups. A numerical semigroup $S$ is an $\mathbf{I}(\Delta)$-{\it semigroup} if $S\backslash \{0\}$ is an ideal of $\Delta$. We will denote by $\mathcal{J}(\Delta)=\{S \mid S \text{ is an…
We study the polynomial approximation of symmetric multivariate functions and of multi-set functions. Specifically, we consider $f(x_1, \dots, x_N)$, where $x_i \in \mathbb{R}^d$, and $f$ is invariant under permutations of its $N$…
We obtain estimates on the number $|\mathcal{A}_{\boldsymbol{\lambda}}|$ of elements on a linear family $\mathcal{A}$ of monic polynomials of $\mathbb{F}_q[T]$ of degree $n$ having factorization pattern…
For a sequence of continuous, monotone functions $f_1,\dots,f_n \colon I \to \mathbb{R}$ ($I$ is an interval) we define the mapping $M \colon I^n \to I^n$ as a Cartesian product of quasi-arithmetic means generated by $f_j$-s. It is known…
Mutual information I in infinite sequences (and in their finite prefixes) is essential in theoretical analysis of many situations. Yet its right definition has been elusive for a long time. I address it by generalizing Kolmogorov Complexity…