Related papers: Maximum likelihood degree of surjective rational m…
We consider statistical models arising from the common set of solutions to a sparse polynomial system with general coefficients. The maximum likelihood degree counts the number of critical points of the likelihood function restricted to the…
In algebraic statistics, the maximum likelihood degree of a statistical model is the number of complex critical points of its log-likelihood function. A priori knowledge of this number is useful for applying techniques of numerical…
We give an asymptotic formula for the number of $\mathbb{F}_{q}$-rational points over a fixed determinant moduli space of stable vector bundles of rank $r$ and degree $d$ over a smooth, projective curve $X$ of genus $g \geq 2$ defined over…
We compute the degree of Stiefel manifolds, that is, the variety of orthonormal frames in a finite dimensional vector space. Our approach employs techniques from classical algebraic geometry, algebraic combinatorics, and classical invariant…
Determinantal point processes (DPPs) have wide-ranging applications in machine learning, where they are used to enforce the notion of diversity in subset selection problems. Many estimators have been proposed, but surprisingly the basic…
Maximum likelihood estimation (MLE) is a fundamental computational problem in statistics. In this paper, MLE for statistical models with discrete data is studied from an algebraic statistics viewpoint. A reformulation of the MLE problem in…
Let A be a k-vector space of dimension a. A subvector space M of End(A) is said to be of rank r if every non-zero f in M has rank r. The problem considered in this paper is to determine l(r;a) the maximal dimension of a rank r subspace of…
If $R$ is a valuation domain of maximal ideal $P$ with a maximal immediate extension of finite rank it is proven that there exists a finite sequence of prime ideals $P=L_0\supset L_1\supset...\supset L_m\supseteq 0$ such that…
We explore distribution questions for rational maps on the projective line $\mathbb{P}^1$ over $\mathbb{Q}$ within the framework of arithmetic dynamics, drawing analogies to elliptic curves. Specifically, we investigate counting problems…
We introduce the degree and local degree in equivariant motivic homotopy theory for the purpose of studying equivariant enumerative problems over general fields. Given a finite, tame group scheme $G$ over a field $k$ and an equivariant…
We express the maximum likelihood (ML) degrees of a family toric varieties in terms of Mobius invariants of matroids. The family of interest are those parametrized by monomial maps given by Lawrence lifts of totally unimodular matrices with…
Let $f : X \rightarrow Y$ be a separable finite surjective map between irreducible normal projective varieties defined over an algebraically closed field, such that the corresponding homomorphism between \'etale fundamental groups $f_* :…
Let $X$ be a general cubic hypersurface in $\mathbb P^4$. If $x\in X$ is a general point there are exactly six distinct lines in $X$ passing through $x$, that lie on the rank 3 quadric cone with vertex $x$ of lines that have intersection…
Empirical economic research frequently applies maximum likelihood estimation in cases where the likelihood function is analytically intractable. Most of the theoretical literature focuses on maximum simulated likelihood (MSL) estimators,…
In this paper, some particular rational maps P_n ---> P_n+1, called quadratic congruences, are studied. They appear in the theory of exceptional vector bundles on projective spaces.
We study nonparametric maximum likelihood estimation for two classes of multivariate distributions that imply strong forms of positive dependence; namely log-supermodular (MTP$_2$) distributions and log-$L^\#$-concave (LLC) distributions.…
Let F : W --> V be a dominant rational map between quasi-projective varieties of the same dimension. We give two proofs that h_V(F(P)) >> h_W(P) for all points P in a nonempty Zariski open subset of W. For dominant rational maps F : P^n -->…
A popular perspective in Reinforcement learning (RL) casts the problem as probabilistic inference on a graphical model of the Markov decision process (MDP). The core object of study is the probability of each state-action pair being visited…
For a finite dimensional vector space equipped with a $\mathbb C$-algebra structure, one can define rational maps using the algebraic structure. In this paper, we describe the growth of the degree sequences for this type of rational maps.
We consider an expected-value ranking and selection (R&S) problem where all k solutions' simulation outputs depend on a common parameter whose uncertainty can be modeled by a distribution. We define the most probable best (MPB) to be the…