64 research outputs found
Weakly supervised learning via statistical sufficiency
The Thesis introduces a novel algorithmic framework for
weakly supervised learn- ing, namely, for any any problem in
between supervised and unsupervised learning, from the labels
standpoint. Weak supervision is the reality in many applications
of machine learning where training is performed with partially
missing, aggregated- level and/or noisy labels. The approach is
grounded on the concept of statistical suf- ficiency and its
transposition to loss functions. Our solution is problem-agnostic
yet constructive as it boils down to a simple two-steps
procedure. First, estimate a suffi- cient statistic for the
labels from weak supervision. Second, plug the estimate into a
(newly defined) linear-odd loss function and learn the model by
any gradient-based solver, with a simple adaptation. We apply the
same approach to several challeng- ing learning problems: (i)
learning from label proportions, (ii) learning with noisy labels
for both linear classifiers and deep neural networks, and (iii)
learning from feature-wise distributed datasets where the entity
matching function is unknown
Strong coupling between excitons in organic semiconductors and Bloch Surface Waves
We report on the strong coupling between the Bloch surface wave supported by
an inorganic multilayer structure and -aggregate excitons in an organic
semiconductor. The dispersion curves of the resulting polariton modes are
investigated by means of angle-resolved attenuated total reflection as well as
photoluminescence experiments. The measured Rabi splitting is 290 meV. These
results are in good agreement with those obtained from our theoretical model
Assessing candidate preference through web browsing history
Predicting election outcomes is of considerable interest to candidates, political scientists, and the public at large. We propose the use of Web browsing history as a new indicator of candidate preference among the electorate, one that has potential to overcome a number of the drawbacks of election polls. However, there are a number of challenges that must be overcome to effectively use Web browsing for assessing candidate preference—including the lack of suitable ground truth data and the heterogeneity of user populations in time and space. We address these challenges, and show that the resulting methods can shed considerable light on the dynamics of voters’ candidate preferences in ways that are difficult to achieve using polls.Accepted manuscrip
- …