Constrained Polynomial Likelihood

10/30/2019
by   Paul Schneider, et al.
0

Starting from a distribution z, we develop a non-negative polynomial minimum-norm likelihood ratio ξ such that dp=ξ dz satisfies a certain type of shape restrictions. The coefficients of the polynomial are the unique solution of a mixed conic semi-definite program. The approach is widely applicable. For example, it can be used to incorporate expert opinion into a model, or as an objective function in machine learning algorithms.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

04/09/2018

Definite Sums as Solutions of Linear Recurrences With Polynomial Coefficients

We present an algorithm which, given a linear recurrence operator L with...
05/31/2022

A Coxeter type classification of Dynkin type 𝔸_n non-negative posets

We continue the Coxeter spectral analysis of finite connected posets I t...
05/16/2021

The maximum likelihood degree of sparse polynomial systems

We consider statistical models arising from the common set of solutions ...
02/05/2019

Minimum description length as an objective function for non-negative matrix factorization

Non-negative matrix factorization (NMF) is a dimensionality reduction te...
07/25/2021

Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients

Assessing non-negativity of multivariate polynomials over the reals, thr...
06/14/2021

Global Controllability for Quasilinear Non-negative Definite System of ODEs and SDEs

We consider exact and averaged control problem for a system of quasi-lin...
05/10/2022

Exploring Viable Algorithmic Options for Learning from Demonstration (LfD): A Parameterized Complexity Approach

The key to reconciling the polynomial-time intractability of many machin...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.