A woman living in Kenya's Dadaab, which is among the world's largest refugee camps, wanders across the vast, dusty site to a central hut lined with computers. Like many others who have been brutally displaced and then warehoused at the margins of our global system, her days are spent toiling away for a new capitalist vanguard thousands of miles away in Silicon Valley. A day's work might include labelling videos, transcribing audio, or showing algorithms how to identify various photos of cats. Amid a drought of real employment, "clickwork" represents one of few formal options for Dadaab's residents, though the work is volatile, arduous, and, when waged, paid by the piece. Cramped and airless workspaces, festooned with a jumble of cables and loose wires, are the antithesis to the near-celestial campuses where the new masters of the universe reside.

After decades of massive digitisation, an unprecedented amount of historical documents is available in digital format, along with their machine-readable texts. While this represents a major step forward with respect to preservation and accessibility, it also opens up new opportunities in terms of content mining and the next fundamental challenge is to develop appropriate technologies to efficiently search, retrieve and explore information from this 'big data of the past'. Among semantic indexing opportunities, the recognition and classification of named entities are in great demand among humanities scholars. Yet, named entity recognition (NER) systems are heavily challenged with diverse, historical and noisy inputs. In this survey, we present the array of challenges posed by historical documents to NER, inventory existing resources, describe the main approaches deployed so far, and identify key priorities for future developments.

A Qualitative Constraint Network (QCN) is a constraint graph for representing problems under qualitative temporal and spatial relations, among others. More formally, a QCN includes a set of entities, and a list of qualitative constraints defining the possible scenarios between these entities. These latter constraints are expressed as disjunctions of binary relations capturing the (incomplete) knowledge between the involved entities. QCNs are very effective in representing a wide variety of real-world applications, including scheduling and planning, configuration and Geographic Information Systems (GIS). It is however challenging to elicit, from the user, the QCN representing a given problem. To overcome this difficulty in practice, we propose a new algorithm for learning, through membership queries, a QCN from a non expert. In this paper, membership queries are asked in order to elicit temporal or spatial relationships between pairs of temporal or spatial entities. In order to improve the time performance of our learning algorithm in practice, constraint propagation, through transitive closure, as well as ordering heuristics, are enforced. The goal here is to reduce the number of membership queries needed to reach the target QCN. In order to assess the practical effect of constraint propagation and ordering heuristics, we conducted several experiments on randomly generated temporal and spatial constraint network instances. The results of the experiments are very encouraging and promising.

Replanners are efficient methods for solving non-deterministic planning problems. Despite showing good scalability, existing replanners often fail to solve problems involving a large number of misleading plans, i.e., weak plans that do not lead to strong solutions, however, due to their minimal lengths, are likely to be found at every replanning iteration. The poor performance of replanners in such problems is due to their all-outcome determinization. That is, when compiling from non-deterministic to classical, they include all compiled classical operators in a single deterministic domain which leads replanners to continually generate misleading plans. We introduce an offline replanner, called Safe-Planner (SP), that relies on a single-outcome determinization to compile a non-deterministic domain to a set of classical domains, and ordering heuristics for ranking the obtained classical domains. The proposed single-outcome determinization and the heuristics allow for alternating between different classical domains. We show experimentally that this approach can allow SP to avoid generating misleading plans but to generate weak plans that directly lead to strong solutions. The experiments show that SP outperforms state-of-the-art non-deterministic solvers by solving a broader range of problems. We also validate the practical utility of SP in real-world non-deterministic robotic tasks.

In the quantum technologies context, no quantum device can be considered an isolated (ideal) quantum system. For this reason, the acronym Noisy Intermediate-Scale Quantum (NISQ) technology has been recently introduced [1] to identify the class of early devices in which noise in quantum gates dramatically limits the size of circuits and algorithms that can be reliably performed [2, 3]. As early quantum devices become more widespread, a question that naturally arises is to understand, at the experimental level, whether in a generic quantum device the signature left by inner noise processes exhibits universal features or is characteristic of the specific quantum platform. Moreover, one may wonder to determine if such a noise signature has a time-dependent profile or can be effectively considered stable, in the sense of constant over time, while the device is operating. The answers to these questions are expected to be crucial in defining a proper strategy to mitigate the influence of noise and systematic errors [4-8], possibly going beyond standard quantum sensing techniques [9-14] and overcoming current limitations on probes dimension and resolution [9, 10, 15-18].

We cast a suite of information extraction tasks into a text-to-triple translation framework. Instead of solving each task relying on task-specific datasets and models, we formalize the task as a translation between task-specific input text and output triples. By taking the task-specific input, we enable a task-agnostic translation by leveraging the latent knowledge that a pre-trained language model has about the task. We further demonstrate that a simple pre-training task of predicting which relational information corresponds to which input text is an effective way to produce task-specific outputs. This enables the zero-shot transfer of our framework to downstream tasks. We study the zero-shot performance of this framework on open information extraction (OIE2016, NYT, WEB, PENN), relation classification (FewRel and TACRED), and factual probe (Google-RE and T-REx). The model transfers non-trivially to most tasks and is often competitive with a fully supervised method without the need for any task-specific training. For instance, we significantly outperform the F1 score of the supervised open information extraction without needing to use its training set.

Metric Multidimensional scaling (MDS) is a classical method for generating meaningful (non-linear) low-dimensional embeddings of high-dimensional data. MDS has a long history in the statistics, machine learning, and graph drawing communities. In particular, the Kamada-Kawai force-directed graph drawing method is equivalent to MDS and is one of the most popular ways in practice to embed graphs into low dimensions. Despite its ubiquity, our theoretical understanding of MDS remains limited as its objective function is highly non-convex. In this paper, we prove that minimizing the Kamada-Kawai objective is NP-hard and give a provable approximation algorithm for optimizing it, which in particular is a PTAS on low-diameter graphs.

Recent \emph{Weak Supervision (WS)} approaches have had widespread success in easing the bottleneck of labeling training data for machine learning by synthesizing labels from multiple potentially noisy supervision sources. However, proper measurement and analysis of these approaches remain a challenge. First, datasets used in existing works are often private and/or custom, limiting standardization. Second, WS datasets with the same name and base data often vary in terms of the labels and weak supervision sources used, a significant "hidden" source of evaluation variance. Finally, WS studies often diverge in terms of the evaluation protocol and ablations used. To address these problems, we introduce a benchmark platform, \benchmark, for a thorough and standardized evaluation of WS approaches. It consists of 22 varied real-world datasets for classification and sequence tagging; a range of real, synthetic, and procedurally-generated weak supervision sources; and a modular, extensible framework for WS evaluation, including implementations for popular WS methods. We use \benchmark to conduct extensive comparisons over more than 100 method variants to demonstrate its efficacy as a benchmark platform. The code is available at \url{https://github.com/JieyuZ2/wrench}.

THE current pandemic has shown the oil and gas sector how dependable enterprise operations can be upended almost overnight. Work force routines at extraction sites and refineries have been disrupted, causing unplanned outages, as we saw at the Sharara oilfield. With supply chains interrupted, parts manufactured in traditional source markets could not be delivered on time, delaying essential maintenance. Border closures and an unprecedented drop in demand have further constricted already tight economic operations. Not only do these conditions look set to continue over the short term, but other challenges loom over the foreseeable future.

Armed with a newly minted undergraduate degree in geology, Jasper Baur is in the mining business. Not those mines where we extract metals or minerals; the kind that kill and maim thousands of people every year. As a freshman at upstate New York's Binghamton University in 2016, Baur started working with two geophysics professors, Alex Nikulin and Timothy de Smet, to look into employing instrument-equipped drones to speed the slow, hazardous task of finding land mines. Baur stuck with the research all the way through college; now a grad student in volcanology at Columbia University's Lamont-Doherty Earth Observatory, he is still pursuing it. "It seemed like a really relevant and impactful use of science," he said.