nils-herrmann/clean_scirepeval huggingface dataset:
Kimera: an Open-Source Library for Real-Time Metric-Semantic Localization and Mapping

We provide an open-source C++ library for real-time metric-semantic visual-inertial Simultaneous Localization And Mapping (SLAM). The library goes beyond existing visual and visual-inertial SLAM libraries (e.g., ORB-SLAM, VINS-Mono, OKVIS, ROVIO) by enabling mesh reconstruction and semantic labeling in 3D. Kimera is designed with modularity in mind and has four key components: a visual-inertial odometry (VIO) module for fast and accurate state estimation, a robust pose graph optimizer for global trajectory estimation, a lightweight 3D mesher module for fast mesh reconstruction, and a dense 3D metric-semantic reconstruction module. The modules can be run in isolation or in combination, hence Kimera can easily fall back to a state-of-the-art VIO or a full SLAM system. Kimera runs in real-time on a CPU and produces a 3D metric-semantic mesh from semantically labeled images, which can be obtained by modern deep learning methods. We hope that the flexibility, computational efficiency, robustness, and accuracy afforded by Kimera will build a solid basis for future metric-semantic SLAM and perception research, and will allow researchers across multiple areas (e.g., VIO, SLAM, 3D reconstruction, segmentation) to benchmark and prototype their own efforts without having to start from scratch.
Hunt for dark subhalos in the galactic stellar field using computer vision

The nature of dark matter remains uncertain despite several decades of dedicated experimental searches. The lack of tangible evidence for its non-gravitational interactions with ordinary matter gives good motivation for exploring new avenues of inferring its properties through purely gravitational probes. In particular, addressing its small-scale distribution could provide valuable new insights into its particle nature, either confirming the predictions of cold dark matter hypothesis or favouring models with suppressed small-scale matter power spectrum. In this work a machine learning technique for constraining the abundance of DM subhalos through the analysis of galactic stellar field is proposed. While the study is the first of its kind and hence applied only to a simplified synthetic datasets, the obtained results show promising potential for addressing the amount of DM substructure present within Milky Way. Using accurate astrometric observations, which became available only recently and are expected to rapidly improve in the near future, there is good hope to reach sensitivity needed for detecting DM subhalos with masses down to $10^7 M_\odot$.
A Riemann-Hilbert approach to the lower tail of the KPZ equation

Fredholm determinants associated to deformations of the Airy kernel are closely connected to the solution to the Kardar-Parisi-Zhang (KPZ) equation with narrow wedge initial data, and they also appear as largest particle distribution in models of positive-temperature free fermions. We show that logarithmic derivatives of the Fredholm determinants can be expressed in terms of a 2x2 Riemann-Hilbert problem, and we use this to derive asymptotics for the Fredholm determinants. As an application of our result, we derive precise lower tail asymptotics for the solution of the KPZ equation with narrow wedge initial data, refining recent results by Corwin and Ghosal.
Fine-Grained Analysis of Propaganda in News Article

Propaganda aims at influencing people’s mindset with the purpose of advancing a specific agenda. Previous work has addressed propaganda detection at document level, typically labelling all articles from a propagandistic news outlet as propaganda. Such noisy gold labels inevitably affect the quality of any learning system trained on them. A further issue with most existing systems is the lack of explainability. To overcome these limitations, we propose a novel task: performing fine-grained analysis of texts by detecting all fragments that contain propaganda techniques as well as their type. In particular, we create a corpus of news articles manually annotated at fragment level with eighteen propaganda techniques and propose a suitable evaluation measure. We further design a novel multi-granularity neural network, and we show that it outperforms several strong BERT-based baselines.
Probabilistic Successor Representations with Kalman Temporal Differences

The effectiveness of Reinforcement Learning (RL) depends on an animal's ability to assign credit for rewards to the appropriate preceding stimuli. One aspect of understanding the neural underpinnings of this process involves understanding what sorts of stimulus representations support generalisation. The Successor Representation (SR), which enforces generalisation over states that predict similar outcomes, has become an increasingly popular model in this space of inquiries. Another dimension of credit assignment involves understanding how animals handle uncertainty about learned associations, using probabilistic methods such as Kalman Temporal Differences (KTD). Combining these approaches, we propose using KTD to estimate a distribution over the SR. KTD-SR captures uncertainty about the estimated SR as well as covariances between different long-term predictions. We show that because of this, KTD-SR exhibits partial transition revaluation as humans do in this experiment without additional replay, unlike the standard TD-SR algorithm. We conclude by discussing future applications of the KTD-SR as a model of the interaction between predictive and probabilistic animal reasoning.
Early Prediction of 30-day ICU Re-admissions Using Natural Language Processing and Machine Learning

ICU readmission is associated with longer hospitalization, mortality and adverse outcomes. An early recognition of ICU re-admission can help prevent patients from worse situation and lower treatment cost. As the abundance of Electronics Health Records (EHR), it is popular to design clinical decision tools with machine learning technique manipulating on healthcare large scale data. We designed data-driven predictive models to estimate the risk of ICU readmission. The discharge summary of each hospital admission was carefully represented by natural language processing techniques. Unified Medical Language System (UMLS) was further used to standardize inconsistency of discharge summaries. 5 machine learning classifiers were adopted to construct predictive models. The best configuration yielded a competitive AUC of 0.748. Our work suggests that natural language processing of discharge summaries is capable to send clinicians warning of unplanned 30-day readmission upon discharge.
Domain Differential Adaptation for Neural Machine Translation

Neural networks are known to be data hungry and domain sensitive, but it is nearly impossible to obtain large quantities of labeled data for every domain we are interested in. This necessitates the use of domain adaptation strategies. One common strategy encourages generalization by aligning the global distribution statistics between source and target domains, but one drawback is that the statistics of different domains or tasks are inherently divergent, and smoothing over these differences can lead to sub-optimal performance. In this paper, we propose the framework of Domain Differential Adaptation (DDA), where instead of smoothing over these differences we embrace them, directly modeling the difference between domains using models in a related task. We then use these learned domain differentials to adapt models for the target task accordingly. Experimental results on domain adaptation for neural machine translation demonstrate the effectiveness of this strategy, achieving consistent improvements over other alternative adaptation strategies in multiple experimental settings.
Why Attention? Analyzing and Remedying BiLSTM Deficiency in Modeling Cross-Context for NER

State-of-the-art approaches of NER have used sequence-labeling BiLSTM as a core module. This paper formally shows the limitation of BiLSTM in modeling cross-context patterns. Two types of simple cross-structures -- self-attention and Cross-BiLSTM -- are shown to effectively remedy the problem. On both OntoNotes 5.0 and WNUT 2017, clear and consistent improvements are achieved over bare-bone models, up to 8.7% on some of the multi-token mentions. In-depth analyses across several aspects of the improvements, especially the identification of multi-token mentions, are further given.
Compositional Generalization for Primitive Substitutions

Compositional generalization is a basic mechanism in human language learning, but current neural networks lack such ability. In this paper, we conduct fundamental research for encoding compositionality in neural networks. Conventional methods use a single representation for the input sentence, making it hard to apply prior knowledge of compositionality. In contrast, our approach leverages such knowledge with two representations, one generating attention maps, and the other mapping attended input words to output symbols. We reduce the entropy in each representation to improve generalization. Our experiments demonstrate significant improvements over the conventional methods in five NLP tasks including instruction learning and machine translation. In the SCAN domain, it boosts accuracies from 14.0% to 98.8% in Jump task, and from 92.0% to 99.7% in TurnLeft task. It also beats human performance on a few-shot learning task. We hope the proposed approach can help ease future research towards human-level compositional language learning.
Checkmate: Breaking the Memory Wall with Optimal Tensor Rematerialization

We formalize the problem of trading-off DNN training time and memory requirements as the tensor rematerialization optimization problem, a generalization of prior checkpointing strategies. We introduce Checkmate, a system that solves for optimal rematerialization schedules in reasonable times (under an hour) using off-the-shelf MILP solvers or near-optimal schedules with an approximation algorithm, then uses these schedules to accelerate millions of training iterations. Our method scales to complex, realistic architectures and is hardware-aware through the use of accelerator-specific, profile-based cost models. In addition to reducing training cost, Checkmate enables real-world networks to be trained with up to 5.1x larger input sizes. Checkmate is an open-source project, available at this https URL.
Push it to the Limit: Discover Edge-Cases in Image Data with Autoencoders

In this paper, we focus on the problem of identifying semantic factors of variation in large image datasets. By training a convolutional Autoencoder on the image data, we create encodings, which describe each datapoint at a higher level of abstraction than pixel-space. We then apply Principal Component Analysis to the encodings to disentangle the factors of variation in the data. Sorting the dataset according to the values of individual principal components, we find that samples at the high and low ends of the distribution often share specific semantic characteristics. We refer to these groups of samples as semantic groups. When applied to real-world data, this method can help discover unwanted edge-cases.
Improving Relation Extraction with Knowledge-attention

While attention mechanisms have been proven to be effective in many NLP tasks, majority of them are data-driven. We propose a novel knowledge-attention encoder which incorporates prior knowledge from external lexical resources into deep neural networks for relation extraction task. Furthermore, we present three effective ways of integrating knowledge-attention with self-attention to maximize the utilization of both knowledge and data. The proposed relation extraction system is end-to-end and fully attention-based. Experiment results show that the proposed knowledge-attention mechanism has complementary strengths with self-attention, and our integrated models outperform existing CNN, RNN, and self-attention based models. State-of-the-art performance is achieved on TACRED, a complex and large-scale relation extraction dataset.
MaskParse@Deskin at SemEval-2019 Task 1: Cross-lingual UCCA Semantic Parsing using Recursive Masked Sequence Tagging

This paper describes our recursive system for SemEval-2019 Task 1: Cross-lingual Semantic Parsing with UCCA. Each recursive step consists of two parts. We first perform semantic parsing using a sequence tagger to estimate the probabilities of the UCCA categories in the sentence. Then, we apply a decoding policy which interprets these probabilities and builds the graph nodes. Parsing is done recursively, we perform a first inference on the sentence to extract the main scenes and links and then we recursively apply our model on the sentence using a masking features that reflects the decisions made in previous steps. Process continues until the terminal nodes are reached. We chose a standard neural tagger and we focus on our recursive parsing strategy and on the cross lingual transfer problem to develop a robust model for the French language, using only few training samples
On Leveraging the Visual Modality for Neural Machine Translation

Leveraging the visual modality effectively for Neural Machine Translation (NMT) remains an open problem in computational linguistics. Recently, Caglayan et al. posit that the observed gains are limited mainly due to the very simple, short, repetitive sentences of the Multi30k dataset (the only multimodal MT dataset available at the time), which renders the source text sufficient for context. In this work, we further investigate this hypothesis on a new large scale multimodal Machine Translation (MMT) dataset, How2, which has 1.57 times longer mean sentence length than Multi30k and no repetition. We propose and evaluate three novel fusion techniques, each of which is designed to ensure the utilization of visual context at different stages of the Sequence-to-Sequence transduction pipeline, even under full linguistic context. However, we still obtain only marginal gains under full linguistic context and posit that visual embeddings extracted from deep vision models (ResNet for Multi30k, ResNext for How2) do not lend themselves to increasing the discriminativeness between the vocabulary elements at token level prediction in NMT. We demonstrate this qualitatively by analyzing attention distribution and quantitatively through Principal Component Analysis, arriving at the conclusion that it is the quality of the visual embeddings rather than the length of sentences, which need to be improved in existing MMT datasets.
Computational approach to dark-field optical diffraction tomography

The measurement of three-dimensional (3D) images and the analysis of subcellular organelles are crucial for the study of the pathophysiology of cells and tissues. Optical diffraction tomography (ODT) facilitates label-free and quantitative imaging of live cells by reconstructing 3D refractive index (RI) distributions. In many cases, however, the contrast in RI distributions is not strong enough to effectively distinguish subcellular organelles in live cells. To realize label-free and quantitative imaging of subcellular organelles in unlabeled live cells with enhanced contrasts, we present a computational approach using ODT. We demonstrate that the contrast of ODT can be enhanced via spatial high-pass filtering in a 3D spatial frequency domain, and that it yields theoretically equivalent results to physical dark-field illumination. Without changing the optical instruments used in ODT, subcellular organelles in live cells are clearly distinguished by applying a simple but effective computational approach that is validated by comparison with 3D epifluorescence images. We expect that the proposed method will satisfy the demand for label-free organelle observations, and will be extended to fully utilize complex information in 3D RI distributions.
The globular cluster population of NGC 1052-DF2: evidence for rotation

Based upon the kinematics of 10 globular clusters, it has recently been claimed that the ultra-diffuse galaxy, NGC 1052-DF2, lacks a significant quantity of dark matter. Dynamical analyses have generally assumed that this galaxy is pressure supported, with the relatively small velocity dispersion of the globular cluster population indicating the deficit of dark matter. However, the presence of a significant rotation of the globular cluster population could substantially modify this conclusion. Here, we present the discovery of such a signature of rotation in the kinematics of NGC 1052-DF2’s globular clusters, with a velocity amplitude of ${\sim}12.44^{+4.40}_{-5.16}$ km s−1, which, through Bayesian model comparison, represents a marginally better fit to the available kinematic data; note that this rotation is distinct from, and approximately perpendicular to, the recently identified rotation of the stellar component of NGC 1052-DF2. Assuming this truly represents an underlying rotation, it is shown that the determined mass depends upon the inclination of the rotational component and, with a moderate inclination, the resultant mass-to-light ratio can exceed M/L ∼ 10.
Language is Power: Representing States Using Natural Language in Reinforcement Learning.

Recent advances in reinforcement learning have shown its potential to tackle complex real-life tasks. However, as the dimensionality of the task increases, reinforcement learning methods tend to struggle. To overcome this, we explore methods for representing the semantic information embedded in the state. While previous methods focused on information in its raw form (e.g., raw visual input), we propose to represent the state using natural language. Language can represent complex scenarios and concepts, making it a favorable candidate for representation. Empirical evidence, within the domain of ViZDoom, suggests that natural language based agents are more robust, converge faster and perform better than vision based agents, showing the benefit of using natural language representations for reinforcement learning.
Discovery of a very young high-mass X-ray binary associated with the supernova remnant MCSNR J0513-6724 in the LMC

We report the discovery of a very young high-mass X-ray binary (HMXB) system associated with the supernova remnant (SNR) MCSNR J0513-6724 in the Large Magellanic Cloud (LMC), using XMM–Newton X-ray observations. The HMXB is located at the geometrical centre of extended soft X-ray emission, which we confirm as an SNR. The HMXB spectrum is consistent with an absorbed power law with spectral index ∼1.6 and a luminosity of 7 × 1033 erg s−1 (0.2–12 keV). Tentative X-ray pulsations are observed with a periodicity of 4.4 s and the OGLE I-band light curve of the optical counterpart from more than 17.5 yr reveals a period of 2.2324 ± 0.0003 d, which we interpret as the orbital period of the binary system. The X-ray spectrum of the SNR is consistent with non-equilibrium shock models as expected for young/less evolved SNRs. From the derived ionization time-scale we estimate the age of the SNR to be <6 kyr. The association of the HMXB with the SNR makes it the youngest HMXB, in the earliest evolutionary stage known to date. An HMXB as young as this can switch on as an accreting pulsar only when the spin period has reached a critical value. Under this assumption, we obtain an upper limit to the magnetic field of <5 × 1011 G. This implies several interesting possibilities including magnetic field burial, possibly by an episode of post-supernova hyper-critical accretion. Since these fields are expected to diffuse out on a time-scale of 103–104 yr, the discovery of a very young HMXB can provide us the unique opportunity to observe the evolution of the observable magnetic field for the first time in X-ray binaries.
ViP: Video Platform for PyTorch

This work presents the Video Platform for PyTorch (ViP), a deep learning-based framework designed to handle and extend to any problem domain based on videos. ViP supports (1) a single unified interface applicable to all video problem domains, (2) quick prototyping of video models, (3) executing large-batch operations with reduced memory consumption, and (4) easy and reproducible experimental setups. ViP's core functionality is built with flexibility and modularity in mind to allow for smooth data flow between different parts of the platform and benchmarking against existing methods. In providing a software platform that supports multiple video-based problem domains, we allow for more cross-pollination of models, ideas and stronger generalization in the video understanding research community.
Farkas layers: don't shift the data, fix the geometry

Successfully training deep neural networks often requires either batch normalization, appropriate weight initialization, both of which come with their own challenges. We propose an alternative, geometrically motivated method for training. Using elementary results from linear programming, we introduce Farkas layers: a method that ensures at least one neuron is active at a given layer. Focusing on residual networks with ReLU activation, we empirically demonstrate a significant improvement in training capacity in the absence of batch normalization or methods of initialization across a broad range of network sizes on benchmark datasets.
DeshadowGAN: A Deep Learning Approach to Remove Shadows from Optical Coherence Tomography Images

To remove blood vessel shadows from optical coherence tomography (OCT) images of the optic nerve head (ONH).  Volume scans consisting of 97 horizontal B-scans were acquired through the center of the ONH using a commercial OCT device for both eyes of 13 subjects. A custom generative adversarial network (named DeshadowGAN) was designed and trained with 2328 B-scans in order to remove blood vessel shadows in unseen B-scans. Image quality was assessed qualitatively (for artifacts) and quantitatively using the intralayer contrast—a measure of shadow visibility ranging from 0 (shadow-free) to 1 (strong shadow). This was computed in the retinal nerve fiber layer (RNFL), the inner plexiform layer (IPL), the photoreceptor (PR) layer, and the retinal pigment epithelium (RPE) layer. The performance of DeshadowGAN was also compared with that of compensation, the standard for shadow removal.  DeshadowGAN decreased the intralayer contrast in all tissue layers. On average, the intralayer contrast decreased by 33.7 ± 6.81%, 28.8 ± 10.4%, 35.9 ± 13.0%, and 43.0 ± 19.5% for the RNFL, IPL, PR layer, and RPE layer, respectively, indicating successful shadow removal across all depths. Output images were also free from artifacts commonly observed with compensation.  DeshadowGAN significantly corrected blood vessel shadows in OCT images of the ONH. Our algorithm may be considered as a preprocessing step to improve the performance of a wide range of algorithms including those currently being used for OCT segmentation, denoising, and classification. Translational Relevance DeshadowGAN could be integrated to existing OCT devices to improve the diagnosis and prognosis of ocular pathologies.
Characterization of the equality of weak efficiency and efficiency on convex free disposal hulls

In solving a multi-objective optimization problem by scalarization techniques, solutions to a scalarized problem are, in general, weakly efficient rather than efficient to the original problem. Thus, it is crucial to understand what problem ensures that all weakly efficient solutions are efficient. In this paper, we give a characterization of the equality of the weakly efficient set and the efficient set, provided that the free disposal hull of the domain is convex. Using this characterization, we see that the set of weakly efficient solutions is equal to the set of efficient solutions (and also the set of strictly efficient solutions) in strongly convex problems. As practical applications, we consider the structure of the set of efficient solutions to a location problem under Mahalanobis distances and a multi-objective reformulation of the elastic net.