{'fraction_non_alphanumeric': 0.012084592145015106, 'fraction_numerical': 0.0, 'mean_word_length': 5.696969696969697, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Conic Programming Approach to Generalized Tchebycheff Inequalities

Consider the problem of finding optimal bounds on the expected value of piecewise polynomials over all measures with a given set of moments. This is a special class ofgeneralized Tchebycheff inequalities in probability theory. We study this problem within the framework of conic programming. Relying on a general approximation scheme for conic programming, we show that these bounds can be numerically computed or approximated via semidefinite programming. We also describe some applications of this class of generalized Tchebycheff inequalities in probability, finance, and inventory theory.