Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: How did Donald Trump Surprisingly Win the 2016 United States
  Presidential Election? an Information-Theoretic Perspective (Clean Sensing
  for Big Data Analytics:Optimal Strategies,Estimation Error Bounds Tighter
  than the Cram\'{e}r-Rao Bound)   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\'{e}r-Rao bound (CRB) and Chapman-Robbins bound. Our derivations are via
studying the Lagrange dual problems of certain convex programs. The classical
Cram\'{e}r-Rao bound and Chapman-Robbins bound follow naturally from our
results for special cases of these convex programs.

32
The categories of this paper are: atom-ph
21
The categories of this paper are: adap-org
29
The categories of this paper are: funct-an
15
The categories of this paper are: nucl-ex
20
The categories of this paper are: acc-phys
22
The categories of this paper are: chao-dyn
4
The categories of this paper are: cond-mat
12
The categories of this paper are: nucl-th
24
The categories of this paper are: dg-ga
33
The categories of this paper are: plasm-ph
28
The categories of this paper are: alg-geom
8
The categories of this paper are: hep-ex
14
The categories of this paper are: math-ph
34
The categories of this paper are: chem-ph
6
The categories of this paper are: astro-ph
31
The categories of this paper are: ao-sci