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

page 1

page 2

page 3

page 4

research
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...
research
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...
research
05/16/2021

The maximum likelihood degree of sparse polynomial systems

We consider statistical models arising from the common set of solutions ...
research
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...
research
04/06/2020

The Bethe and Sinkhorn Permanents of Low Rank Matrices and Implications for Profile Maximum Likelihood

In this paper we consider the problem of computing the likelihood of the...
research
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...
research
08/28/2020

Hierarchical Marketing Mix Models with Sign Constraints

Marketing mix models (MMMs) are statistical models for measuring the eff...

Please sign up or login with your details

Forgot password? Click here to reset