nils-herrmann/clean_scirepeval huggingface dataset:
Can redshift errors bias measurements of the Hubble Constant?

Redshifts have been so easy to measure for so long that we tend to neglect the fact that they too have uncertainties and are susceptible to systematic error. As we strive to measure cosmological parameters to better than 1 per cent it is worth reviewing the accuracy of our redshift measurements. Surprisingly small systematic redshift errors, as low as 10−4, can have a significant impact on the cosmological parameters we infer, such as H0. Here, we investigate an extensive (but not exhaustive) list of ways in which redshift estimation can go systematically astray. We review common theoretical errors, such as adding redshifts instead of multiplying by (1 + z); using v = cz; and using only cosmological redshift in the estimates of luminosity and angular diameter distances. We consider potential observational errors, such as rest wavelength precision, air to vacuum conversion, and spectrograph wavelength calibration. Finally, we explore physical effects, such as peculiar velocity corrections, galaxy internal velocities, gravitational redshifts, and overcorrecting within a bulk flow. We conclude that it would be quite easy for small systematic redshift errors to have infiltrated our data and be impacting our cosmological results. While it is unlikely that these errors are large enough to resolve the current H0 tension, it remains possible, and redshift accuracy may become a limiting factor in near future experiments. With the enormous efforts going into calibrating the vertical axis of our plots (standard candles, rulers, clocks, and sirens) we argue that it is now worth paying a little more attention to the horizontal axis (redshifts).
GROWTH on S190425z: Searching Thousands of Square Degrees to Identify an Optical or Infrared Counterpart to a Binary Neutron Star Merger with the Zwicky Transient Facility and Palomar Gattini-IR

The third observing run by LVC has brought the discovery of many compact binary coalescences. Following the detection of the first binary neutron star merger in this run (LIGO/Virgo S190425z), we performed a dedicated follow-up campaign with the Zwicky Transient Facility (ZTF) and Palomar Gattini-IR telescopes. The initial skymap of this single-detector gravitational wave (GW) trigger spanned most of the sky observable from Palomar Observatory. Covering 8000 deg2 of the initial skymap over the next two nights, corresponding to 46% integrated probability, ZTF system achieved a depth of ≈21 mAB in g- and r-bands. Palomar Gattini-IR covered 2200 square degrees in J-band to a depth of 15.5 mag, including 32% integrated probability based on the initial skymap. The revised skymap issued the following day reduced these numbers to 21% for the ZTF and 19% for Palomar Gattini-IR. We narrowed 338,646 ZTF transient “alerts” over the first two nights of observations to 15 candidate counterparts. Two candidates, ZTF19aarykkb and ZTF19aarzaod, were particularly compelling given that their location, distance, and age were consistent with the GW event, and their early optical light curves were photometrically consistent with that of kilonovae. These two candidates were spectroscopically classified as young core-collapse supernovae. The remaining candidates were ruled out as supernovae. Palomar Gattini-IR did not identify any viable candidates with multiple detections only after merger time. We demonstrate that even with single-detector GW events localized to thousands of square degrees, systematic kilonova discovery is feasible.
Mapping road safety features from streetview imagery: A deep learning approach

Each year, around 6 million car accidents occur in the U.S. on average. Road safety features (e.g., concrete barriers, metal crash barriers, rumble strips) play an important role in preventing or mitigating vehicle crashes. Accurate maps of road safety features is an important component of safety management systems for federal or state transportation agencies, helping traffic engineers identify locations to invest on safety infrastructure. In current practice, mapping road safety features is largely done manually (e.g., observations on the road or visual interpretation of streetview imagery), which is both expensive and time consuming. In this paper, we propose a deep learning approach to automatically map road safety features from streetview imagery. Unlike existing Convolutional Neural Networks (CNNs) that classify each image individually, we propose to further add Recurrent Neural Network (Long Short Term Memory) to capture geographic context of images (spatial autocorrelation effect along linear road network paths). Evaluations on real world streetview imagery show that our proposed model outperforms several baseline methods.
CerebroVis: Designing an Abstract yet Spatially Contextualized Cerebral Artery Network Visualization

Blood circulation in the human brain is supplied through a network of cerebral arteries. If a clinician suspects a patient has a stroke or other cerebrovascular condition, they order imaging tests. Neuroradiologists visually search the resulting scans for abnormalities. Their visual search tasks correspond to the abstract network analysis tasks of browsing and path following. To assist neuroradiologists in identifying cerebral artery abnormalities, we designed CerebroVis, a novel abstract—yet spatially contextualized—cerebral artery network visualization. In this design study, we contribute a novel framing and definition of the cerebral artery system in terms of network theory and characterize neuroradiologist domain goals as abstract visualization and network analysis tasks. Through an iterative, user-centered design process we developed an abstract network layout technique which incorporates cerebral artery spatial context. The abstract visualization enables increased domain task performance over 3D geometry representations, while including spatial context helps preserve the user's mental map of the underlying geometry. We provide open source implementations of our network layout technique and prototype cerebral artery visualization tool. We demonstrate the robustness of our technique by successfully laying out 61 open source brain scans. We evaluate the effectiveness of our layout through a mixed methods study with three neuroradiologists. In a formative controlled experiment our study participants used CerebroVis and a conventional 3D visualization to examine real cerebral artery imaging data to identify a simulated intracranial artery stenosis. Participants were more accurate at identifying stenoses using CerebroVis (absolute risk difference 13%). A free copy of this paper, the evaluation stimuli and data, and source code are available at osf.io/e5sxt.
CUNI Systems for the Unsupervised News Translation Task in WMT 2019

In this paper we describe the CUNI translation system used for the unsupervised news shared task of the ACL 2019 Fourth Conference on Machine Translation (WMT19). We follow the strategy of Artetxe ae at. (2018b), creating a seed phrase-based system where the phrase table is initialized from cross-lingual embedding mappings trained on monolingual data, followed by a neural machine translation system trained on synthetic parallel data. The synthetic corpus was produced from a monolingual corpus by a tuned PBMT model refined through iterative back-translation. We further focus on the handling of named entities, i.e. the part of vocabulary where the cross-lingual embedding mapping suffers most. Our system reaches a BLEU score of 15.3 on the German-Czech WMT19 shared task.
Reinforced Dynamic Reasoning for Conversational Question Generation

This paper investigates a new task named Conversational Question Generation (CQG) which is to generate a question based on a passage and a conversation history (i.e., previous turns of question-answer pairs). CQG is a crucial task for developing intelligent agents that can drive question-answering style conversations or test user understanding of a given passage. Towards that end, we propose a new approach named Reinforced Dynamic Reasoning network, which is based on the general encoder-decoder framework but incorporates a reasoning procedure in a dynamic manner to better understand what has been asked and what to ask next about the passage into the general encoder-decoder framework. To encourage producing meaningful questions, we leverage a popular question answering (QA) model to provide feedback and fine-tune the question generator using a reinforcement learning mechanism. Empirical results on the recently released CoQA dataset demonstrate the effectiveness of our method in comparison with various baselines and model variants. Moreover, to show the applicability of our method, we also apply it to create multi-turn question-answering conversations for passages in SQuAD.
One-to-X Analogical Reasoning on Word Embeddings: a Case for Diachronic Armed Conflict Prediction from News Texts

We extend the well-known word analogy task to a one-to-X formulation, including one-to-none cases, when no correct answer exists. The task is cast as a relation discovery problem and applied to historical armed conflicts datasets, attempting to predict new relations of type ‘location:armed-group’ based on data about past events. As the source of semantic information, we use diachronic word embedding models trained on English news texts. A simple technique to improve diachronic performance in such task is demonstrated, using a threshold based on a function of cosine distance to decrease the number of false positives; this approach is shown to be beneficial on two different corpora. Finally, we publish a ready-to-use test set for one-to-X analogy evaluation on historical armed conflicts data.
Let's Make It Personal, A Challenge in Personalizing Medical Inter-Human Communication

Current AI approaches have frequently been used to help personalize many aspects of medical experiences and tailor them to a specific individuals' needs. However, while such systems consider medically-relevant information, they ignore socially-relevant information about how this diagnosis should be communicated and discussed with the patient. The lack of this capability may lead to mis-communication, resulting in serious implications, such as patients opting out of the best treatment. Consider a case in which the same treatment is proposed to two different individuals. The manner in which this treatment is mediated to each should be different, depending on the individual patient's history, knowledge, and mental state. While it is clear that this communication should be conveyed via a human medical expert and not a software-based system, humans are not always capable of considering all of the relevant aspects and traversing all available information. We pose the challenge of creating Intelligent Agents (IAs) to assist medical service providers (MSPs) and consumers in establishing a more personalized human-to-human dialogue. Personalizing conversations will enable patients and MSPs to reach a solution that is best for their particular situation, such that a relation of trust can be built and commitment to the outcome of the interaction is assured. We propose a four-part conceptual framework for personalized social interactions, expand on which techniques are available within current AI research and discuss what has yet to be achieved.
Control of nonlinear, complex and black-boxed greenhouse system with reinforcement learning

Modern control theories such as systems engineering approaches try to solve nonlinear system problems by revelation of causal relationship or co-relationship among the components; most of those approaches focus on control of sophisticatedly modeled white-boxed systems. We suggest an application of actor-critic reinforcement learning approach to control a nonlinear, complex and black-boxed system. We demonstrated this approach on artificial green-house environment simulator all of whose control inputs have several side effects so human cannot figure out how to control this system easily. Our approach succeeded to maintain the circumstance at least 20 times longer than PID and Deep Q Learning.
Feasible bases for a polytope related to the Hamilton cycle problem

We study a certain polytope depending on a graph G and a parameter β ∈ (0,1) that arises from embedding the Hamiltonian cycle problem in a discounted Markov decision process. Literature suggests a conjecture a lower bound on the proportion of feasible bases corresponding to Hamiltonian cycles in the set of all feasible bases. We make progress toward a proof of the conjecture by proving results about the structure of feasible bases. In particular, we prove three main results: (1) the set of feasible bases is independent of the parameter β when the parameter is close to one, (2) the polytope can be interpreted as a generalized network flow polytope, and (3) we deduce a combinatorial interpretation of the feasible bases. We also provide a full characterization for a special class of feasible bases, and we apply this to provide some computational support for the conjecture.
Model-Free Unsupervised Learning for Optimization Problems with Constraints

Wireless systems are becoming more and more complicated. As a consequence, the expressions of objective function or constraints of many optimization problems are hard or even impossible to derive. In this paper, we propose a model-free framework to learn the mapping from environment parameters to the solutions of generic constrained optimization problems without the labels generated by numerically finding the optimal solution. We use neural networks respectively for parameterizing the policy to be optimized, the Lagrange multiplier function associated with instantaneous constraint, and approximating the unavailable objective function or constraints. We provide learning algorithms to train all the neural networks simultaneously. We reveal the connections of the proposed framework with reinforcement learning, which is a widely recognized tool for model-free problems. Numerical and simulation results demonstrate the efficiency of model-free learning by taking a well-known power control problem as an example.
Classical and Quantum Algorithms for Tensor Principal Component Analysis

We present classical and quantum algorithms based on spectral methods for a problem in tensor principal component analysis. The quantum algorithm achieves a quartic speedup while using exponentially smaller space than the fastest classical spectral algorithm, and a super-polynomial speedup over classical algorithms that use only polynomial space. The classical algorithms that we present are related to, but slightly different from those presented recently in Ref. . In particular, we have an improved threshold for recovery and the algorithms we present work for both even and odd order tensors. These results suggest that large-scale inference problems are a promising future application for quantum computers.
Deep Learning For Face Recognition: A Critical Analysis

Face recognition is a rapidly developing and widely applied aspect of biometric technologies. Its applications are broad, ranging from law enforcement to consumer applications, and industry efficiency and monitoring solutions. The recent advent of affordable, powerful GPUs and the creation of huge face databases has drawn research focus primarily on the development of increasingly deep neural networks designed for all aspects of face recognition tasks, ranging from detection and preprocessing to feature representation and classification in verification and identification solutions. However, despite these improvements, real-time, accurate face recognition is still a challenge, primarily due to the high computational cost associated with the use of Deep Convolutions Neural Networks (DCNN), and the need to balance accuracy requirements with time and resource constraints. Other significant issues affecting face recognition relate to occlusion, illumination and pose invariance, which causes a notable decline in accuracy in both traditional handcrafted solutions and deep neural networks. This survey will provide a critical analysis and comparison of modern state of the art methodologies, their benefits, and their limitations. It provides a comprehensive coverage of both deep and shallow solutions, as they stand today, and highlight areas requiring future development and improvement. This review is aimed at facilitating research into novel approaches, and further development of current methodologies by scientists and engineers, whilst imparting an informative and analytical perspective on currently available solutions to end users in industry, government and consumer contexts.
Temporal Attentive Alignment for Large-Scale Video Domain Adaptation

Although various image-based domain adaptation (DA) techniques have been proposed in recent years, domain shift in videos is still not well-explored. Most previous works only evaluate performance on small-scale datasets which are saturated. Therefore, we first propose two large-scale video DA datasets with much larger domain discrepancy: UCF-HMDB_full and Kinetics-Gameplay. Second, we investigate different DA integration methods for videos, and show that simultaneously aligning and learning temporal dynamics achieves effective alignment even without sophisticated DA methods. Finally, we propose Temporal Attentive Adversarial Adaptation Network (TA3N), which explicitly attends to the temporal dynamics using domain discrepancy for more effective domain alignment, achieving state-of-the-art performance on four video DA datasets (e.g. 7.9% accuracy gain over “Source only” from 73.9% to 81.8% on “HMDB --> UCF”, and 10.3% gain on “Kinetics --> Gameplay”). The code and data are released at http://github.com/cmhungsteve/TA3N.
Not All Adversarial Examples Require a Complex Defense: Identifying Over-optimized Adversarial Examples with IQR-based Logit Thresholding

Detecting adversarial examples currently stands as one of the biggest challenges in the field of deep learning. Adversarial attacks, which produce adversarial examples, increase the prediction likelihood of a target class for a particular data point. During this process, the adversarial example can be further optimized, even when it has already been wrongly classified with 100% confidence, thus making the adversarial example even more difficult to detect. For this kind of adversarial examples, which we refer to as over-optimized adversarial examples, we discovered that the logits of the model provide solid clues on whether the data point at hand is adversarial or genuine. In this context, we first discuss the masking effect of the softmax function for the prediction made and explain why the logits of the model are more useful in detecting over-optimized adversarial examples. To identify this type of adversarial examples in practice, we propose a non-parametric and computationally efficient method which relies on interquartile range, with this method becoming more effective as the image resolution increases. We support our observations throughout the paper with detailed experiments for different datasets (MNIST, CIFAR-10, and ImageNet) and several architectures.
Finding Moments in Video Collections Using Natural Language

We introduce the task of retrieving relevant video moments from a large corpus of untrimmed, unsegmented videos given a natural language query. Our task poses unique challenges as a system must efficiently identify both the relevant videos and localize the relevant moments in the videos. To address these challenges, we propose SpatioTemporal Alignment with Language (STAL), a model that represents a video moment as a set of regions within a series of short video clips and aligns a natural language query to the moment’s regions. Our alignment cost compares variable-length language and video features using symmetric squared Chamfer distance, which allows for efficient indexing and retrieval of the video moments. Moreover, aligning language features to regions within a video moment allows for finer alignment compared to methods that extract only an aggregate feature from the entire video moment. We evaluate our approach on two recently proposed datasets for temporal localization of moments in video with natural language (DiDeMo Hendricks et al. (2017) and Charades-STA Gao et al. (2017)) extended to our video corpus moment retrieval setting. We show that our STAL re-ranking model outperforms the recently proposed Moment Context Network Hendricks et al. (2017) on all criteria across all datasets on our proposed task, obtaining relative gains of 37%-118% for average recall and up to 30% for median rank. Moreover, our approach achieves more than 130× faster retrieval and 8× smaller index size with a 1M video corpus in an approximate setting.
PointHop: An Explainable Machine Learning Method for Point Cloud Classification

An explainable machine learning method for point cloud classification, called the PointHop method, is proposed in this work. The PointHop method consists of two stages: 1) local-to-global attribute building through iterative one-hop information exchange and 2) classification and ensembles. In the attribute building stage, we address the problem of unordered point cloud data using a space partitioning procedure and developing a robust descriptor that characterizes the relationship between a point and its one-hop neighbor in a PointHop unit. When we put multiple PointHop units in cascade, the attributes of a point will grow by taking its relationship with one-hop neighbor points into account iteratively. Furthermore, to control the rapid dimension growth of the attribute vector associated with a point, we use the Saab transform to reduce the attribute dimension in each PointHop unit. In the classification and ensemble stage, we feed the feature vector obtained from multiple PointHop units to a classifier. We explore ensemble methods to improve the classification performance furthermore. It is shown by experimental results that the PointHop method offers classification performance that is comparable with state-of-the-art methods while demanding much lower training complexity.
Search for Light Dark Matter Interactions Enhanced by the Migdal Effect or Bremsstrahlung in XENON1T.

Direct dark matter detection experiments based on a liquid xenon target are leading the search for dark matter particles with masses above ∼5  GeV/c^{2}, but have limited sensitivity to lighter masses because of the small momentum transfer in dark matter-nucleus elastic scattering. However, there is an irreducible contribution from inelastic processes accompanying the elastic scattering, which leads to the excitation and ionization of the recoiling atom (the Migdal effect) or the emission of a bremsstrahlung photon. In this Letter, we report on a probe of low-mass dark matter with masses down to about 85  MeV/c^{2} by looking for electronic recoils induced by the Migdal effect and bremsstrahlung using data from the XENON1T experiment. Besides the approach of detecting both scintillation and ionization signals, we exploit an approach that uses ionization signals only, which allows for a lower detection threshold. This analysis significantly enhances the sensitivity of XENON1T to light dark matter previously beyond its reach.