How did Donald Trump Surprisingly Win the 2016 United States Presidential Election? an Information-Theoretic Perspective (Clean Sensing for Big Data Analytics:Optimal Strategie

12/31/2018
by   Weiyu Xu, et al.
0

Donald Trump was lagging behind in nearly all opinion polls leading up to the 2016 US presidential election, but he surprisingly won the election. This raises the following important questions: 1) why most opinion polls were not accurate in 2016? and 2) how to improve the accuracies of opinion polls? In this paper, we study the inaccuracies of opinion polls in the 2016 election through the lens of information theory. We first propose a general framework of parameter estimation, called clean sensing (polling), which performs optimal parameter estimation with sensing cost constraints, from heterogeneous and potentially distorted data sources. We then cast the opinion polling as a problem of parameter estimation from potentially distorted heterogeneous data sources, and derive the optimal polling strategy using heterogenous and possibly distorted data under cost constraints. Our results show that a larger number of data samples do not necessarily lead to better polling accuracy, which give a possible explanation of the inaccuracies of opinion polls in 2016. The optimal sensing strategy should instead optimally allocate sensing resources over heterogenous data sources according to several factors including data quality, and, moreover, for a particular data source, it should strike an optimal balance between the quality of data samples, and the quantity of data samples. As a byproduct of this research, in a general setting, we derive a group of new lower bounds on the mean-squared errors of general unbiased and biased parameter estimators. These new lower bounds can be tighter than the classical Cramér-Rao bound (CRB) and Chapman-Robbins bound. Our derivations are via studying the Lagrange dual problems of certain convex programs. The classical Cramér-Rao bound and Chapman-Robbins bound follow naturally from our results for special cases of these convex programs.

READ FULL TEXT
research
04/17/2023

Barankin-Type Bound for Constrained Parameter Estimation

In constrained parameter estimation, the classical constrained Cramer-Ra...
research
02/05/2022

Lower-bounds on the Bayesian Risk in Estimation Procedures via f-Divergences

We consider the problem of parameter estimation in a Bayesian setting an...
research
02/07/2018

New Cramer-Rao-Type Bound for Constrained Parameter Estimation

Non-Bayesian parameter estimation under parametric constraints is encoun...
research
01/05/2023

Optimal lower bounds for Quantum Learning via Information Theory

Although a concept class may be learnt more efficiently using quantum sa...
research
01/05/2022

Limits on Parameter Estimation of Quantum Channels

The aim of this thesis is to develop a theoretical framework to study pa...
research
07/22/2021

Bandit Quickest Changepoint Detection

Detecting abrupt changes in temporal behavior patterns is of interest in...
research
07/12/2023

On Collaboration in Distributed Parameter Estimation with Resource Constraints

We study sensor/agent data collection and collaboration policies for par...

Please sign up or login with your details

Forgot password? Click here to reset