A Deep-Learning Method for the Prediction of Socio-Economic Indicators from Street-View Imagery Using a Case Study from Brazil
- Award ID(s):
- 1929464
- PAR ID:
- 10336987
- Date Published:
- Journal Name:
- Data Science Journal
- Volume:
- 21
- ISSN:
- 1683-1470
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
null (Ed.)Abstract This paper is a write-up of the ideas that were presented, developed and discussed at the third International Workshop on QCD Challenges from pp to A–A, which took place in August 2019 in Lund, Sweden (Workshop link: https://indico.lucas.lu.se/event/1214/ ). The goal of the workshop was to focus on some of the open questions in the field and try to come up with concrete suggestions for how to make progress on both the experimental and theoretical sides. The paper gives a brief introduction to each topic and then summarizes the primary results.more » « less
-
null (Ed.)We ask whether the knowledge of a single eigenstate of a local Hamiltonian is sufficient to uniquely determine the Hamiltonian. We present evidence that the answer is ``yes" for generic local Hamiltonians, given either the ground state or an excited eigenstate. In fact, knowing only the two-point equal-time correlation functions of local observables with respect to the eigenstate should generically be sufficient to exactly recover the Hamiltonian for finite-size systems, with numerical algorithms that run in a time that is polynomial in the system size. We also investigate the large-system limit, the sensitivity of the reconstruction to error, and the case when correlation functions are only known for observables on a fixed sub-region. Numerical demonstrations support the results for finite one-dimensional spin chains (though caution must be taken when extrapolating to infinite-size systems in higher dimensions). For the purpose of our analysis, we define the `` k -correlation spectrum" of a state, which reveals properties of local correlations in the state and may be of independent interest.more » « less
-
Holmsen, Kynčl and Valculescu recently conjectured that if a finite set $$X$$ with $$\ell n$$ points in $$\mathbb{R}^{d}$$ that is colored by $$m$$ different colors can be partitioned into $$n$$ subsets of $$\ell$$ points each, such that each subset contains points of at least $$d$$ different colors, then there exists such a partition of $$X$$ with the additional property that the convex hulls of the $$n$$ subsets are pairwise disjoint. We prove a continuous analogue of this conjecture, generalized so that each subset contains points of at least $$c$$ different colors, where we also allow $$c$$ to be greater than $$d$$ . Furthermore, we give lower bounds on the fraction of the points each of the subsets contains from $$c$$ different colors. For example, when $$n\geqslant 2$$ , $$d\geqslant 2$$ , $$c\geqslant d$$ with $$m\geqslant n(c-d)+d$$ are integers, and $$\unicode[STIX]{x1D707}_{1},\ldots ,\unicode[STIX]{x1D707}_{m}$$ are $$m$$ positive finite absolutely continuous measures on $$\mathbb{R}^{d}$$ , we prove that there exists a partition of $$\mathbb{R}^{d}$$ into $$n$$ convex pieces which equiparts the measures $$\unicode[STIX]{x1D707}_{1},\ldots ,\unicode[STIX]{x1D707}_{d-1}$$ , and in addition every piece of the partition has positive measure with respect to at least $$c$$ of the measures $$\unicode[STIX]{x1D707}_{1},\ldots ,\unicode[STIX]{x1D707}_{m}$$ .more » « less
An official website of the United States government

