Dual optimal design and the Christoffel-Darboux polynomial

09/08/2020
by   Yohann De Castro, et al.
0

The purpose of this short note is to show that the Christoffel-Darboux polynomial, useful in approximation theory and data science, arises naturally when deriving the dual to the problem of semi-algebraic D-optimal experimental design in statistics. It uses only elementary notions of convex analysis.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

09/18/2020

A note on optimal designs for estimating the slope of a polynomial regression

In this note we consider the optimal design problem for estimating the s...
10/24/2017

Greater data science at baccalaureate institutions

Donoho's JCGS (in press) paper is a spirited call to action for statisti...
04/08/2019

Polynomial Invariant Theory and Shape Enumerator of Self-Dual Codes in the NRT-Metric

In this paper we consider self-dual NRT-codes, that is, self-dual codes ...
09/28/2020

Bezout-like polynomial equations associated with dual univariate interpolating subdivision schemes

The algebraic characterization of dual univariate interpolating subdivis...
11/30/2017

Improved Linear Embeddings via Lagrange Duality

Near isometric orthogonal embeddings to lower dimensions are a fundament...
07/13/2021

Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields

Dual decomposition approaches in nonconvex optimization may suffer from ...
08/30/2016

Lopsided Approximation of Amoebas

The amoeba of a Laurent polynomial is the image of the corresponding hyp...
This week in AI

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