相关论文: Mixture decompositions of exponential families usi…

Given two positive integers $M$ and $k$, let $\B_k$ be the set of bases $q>1$ such that there exists a real number $x$ having exactly $k$ different $q$-expansions over the alphabet $\{0,1,\cdots,M\}$. In this paper we investigate the…

In this paper, we describe the properties of the $i$-components of Hamming codes. We suggest constructions of the admissible families of components of Hamming codes. It is shown that every $q$-ary code of length $m$ and minimum distance 5…

A numerical monoid is an additive submonoid of the non-negative integers. Given a numerical monoid $S$, consider the family of "shifted" monoids $M_n$ obtained by adding $n$ to each generator of $S$. In this paper, we examine minimal…

Given a subset $\mathcal{S}\subseteq \mathbb{F}_q[x]$ and fixed integers $n,m\in \mathbb{N}$, we study the distribution of the smallest denominator $Q\in \mathcal{S}$ for which there exists $\mathbf{P}\in \mathbb{F}_q[x]^m$ such that…

Recent work has shown that finite mixture models with $m$ components are identifiable, while making no assumptions on the mixture components, so long as one has access to groups of samples of size $2m-1$ which are known to come from the…

Problems of probabilistic inference and decision making under uncertainty commonly involve continuous random variables. Often these are discretized to a few points, to simplify assessments and computations. An alternative approximation is…

Given two discrete random variables $X$ and $Y,$ with probability distributions ${\bf p}=(p_1, \ldots , p_n)$ and ${\bf q}=(q_1, \ldots , q_m)$, respectively, denote by ${\cal C}({\bf p}, {\bf q})$ the set of all couplings of ${\bf p}$ and…

Mini-batch algorithms have become increasingly popular due to the requirement for solving optimization problems, based on large-scale data sets. Using an existing online expectation-{}-maximization (EM) algorithm framework, we demonstrate…

Let $S(n)$ denote the least primary factor in the primary decomposition of the multiplicative group $M_n = (\Bbb Z/n\Bbb Z)^\times$. We give an asymptotic formula, with order of magnitude $x/(\log x)^{1/2}$, for the counting function of…

This paper deals with the estimation of the modes of an univariate mixture when the number of components is known and when the component density are well separated. We propose an algorithm based on the minimization of the "kp" criterion we…

We study an analogue of a classical arithmetic problem over the ring of polynomials. We prove that $m = 5$ is the minimal number such that the sums of any two distinct polynomials in a set of $m$ polynomials over $\F_2[x]$ cannot all be of…

Recently, G.~Yanev obtained a characterization of the exponential family of distributions in terms of a functional equation for certain mixture densities. The purpose of this note is twofold: we extend Yanev's theorem by relaxing a…

We consider the problem of solving mixed random linear equations with $k$ components. This is the noiseless setting of mixed linear regression. The goal is to estimate multiple linear models from mixed samples in the case where the labels…

Exponential families are the workhorses of parametric modelling theory. One reason for their popularity is their associated inference theory, which is very clean, both from a theoretical and a computational point of view. One way in which…

A combinatorial rectangle may be viewed as a matrix whose entries are all +-1. The discrepancy of an m by n matrix is the maximum among the absolute values of its m row sums and n column sums. In this paper, we investigate combinatorial…

A family $\mathcal F$ has covering number $\tau$ if the size of the smallest set intersecting all sets from $\mathcal F$ is equal to $\tau$. Let $M(n,k,\tau)$ stand for the size of the largest intersecting family $\mathcal F$ of $k$-element…

The extremal problems regarding the maximum possible size of intersecting families of various combinatorial objects have been extensively studied. In this paper, we investigate supersaturation extensions, which in this context ask for the…

Let $G$ be a finite abelian group, and let $m>0$ with $\exp(G)\mid m$. Let $s_{m}(G)$ be the generalized Erd\H{o}s-Ginzburg-Ziv invariant which denotes the smallest positive integer $d$ such that any sequence of elements in $G$ of length…

Let $G$ be a finite group. A family $\mathcal{M}$ of maximal subgroups of $G$ is called `irredundant' if its intersection is not equal to the intersection of any proper subfamily. $\mathcal{M}$ is called `maximal irredundant' if…

We prove that under some regularity and strong identifiability conditions, around a mixing distribution with $m_0$ components, the optimal local minimax rate of estimation of a mixture with $m$ components is $n^{-1/(4(m-m_0) + 2)}$. This…