nils-herrmann/clean_scirepeval huggingface dataset:
GlossBERT: BERT for Word Sense Disambiguation with Gloss Knowledge

Word Sense Disambiguation (WSD) aims to find the exact sense of an ambiguous word in a particular context. Traditional supervised methods rarely take into consideration the lexical resources like WordNet, which are widely utilized in knowledge-based methods. Recent studies have shown the effectiveness of incorporating gloss (sense definition) into neural networks for WSD. However, compared with traditional word expert supervised methods, they have not achieved much improvement. In this paper, we focus on how to better leverage gloss knowledge in a supervised neural WSD system. We construct context-gloss pairs and propose three BERT based models for WSD. We fine-tune the pre-trained BERT model and achieve new state-of-the-art results on WSD task.
n-MeRCI: A new Metric to Evaluate the Correlation Between Predictive Uncertainty and True Error

As deep learning applications are becoming more and more pervasive in robotics, the question of evaluating the reliability of inferences becomes a central question in the robotics community. This domain, known as predictive uncertainty, has come under the scrutiny of research groups developing Bayesian approaches adapted to deep learning such as Monte Carlo Dropout. Unfortunately, for the time being, the real goal of predictive uncertainty has been swept under the rug. Indeed, these approaches are solely evaluated in terms of raw performance of the network prediction, while the quality of their estimated uncertainty is not assessed. Evaluating such uncertainty prediction quality is especially important in robotics, as actions shall depend on the confidence in perceived information. In this context, the main contribution of this article is to propose a novel metric that is adapted to the evaluation of relative uncertainty assessment and directly applicable to regression with deep neural networks. To experimentally validate this metric, we evaluate it on a toy dataset and then apply it to the task of monocular depth estimation.
A Neural Virtual Anchor Synthesizer Based on Seq2Seq and GAN Models

This paper presents a novel framework to generate realistic face video of an anchor, who is reading certain news. This task is also known as Virtual Anchor. Given some paragraphs of words, we first utilize a pretrained Word2Vec model to embed each word into a vector; then we utilize a Seq2Seq-based model to translate these word embeddings into action units and head poses of the target anchor; these action units and head poses will be concatenated with facial landmarks as well as the former n synthesized frames, and the concatenation serves as input of a Pix2PixHD-based model to synthesize realistic facial images for the virtual anchor. The experimental results demonstrate our framework is feasible for the synthesis of virtual anchor.
Unsupervised Hierarchical Grouping of Knowledge Graph Entities

Knowledge graphs have attracted lots of attention in academic and industrial environments. Despite their usefulness, popular knowledge graphs suffer from incompleteness of information, especially in their type assertions. This has encouraged research in the automatic discovery of entity types. In this context, multiple works were developed to utilize logical inference on ontologies and statistical machine learning methods to learn type assertion in knowledge graphs. However, these approaches suffer from limited performance on noisy data, limited scalability and the dependence on labeled training samples. In this work, we propose a new unsupervised approach that learns to categorize entities into a hierarchy of named groups. We show that our approach is able to effectively learn entity groups using a scalable procedure in noisy and sparse datasets. We experiment our approach on a set of popular knowledge graph benchmarking datasets, and we publish a collection of the outcome group hierarchies.
Most words are geometrically almost uniform

If w is a word in d>1 letters and G is a finite group, evaluation of w on a uniformly randomly chosen d-tuple in G gives a random variable with values in G, which may or may not be uniform. It is known that if G ranges over finite simple groups of given root system and characteristic, a positive proportion of words w give a distribution which approaches uniformity in the limit as |G| goes to infinity. In this paper, we show that the proportion is in fact 1.
Investigation of wind pressures on tall building under interference effects using machine learning techniques

Interference effects of tall buildings have attracted numerous studies due to the boom of clusters of tall buildings in megacities. To fully understand the interference effects of buildings, it often requires a substantial amount of wind tunnel tests. Limited wind tunnel tests that only cover part of interference scenarios are unable to fully reveal the interference effects. This study used machine learning techniques to resolve the conflicting requirement between limited wind tunnel tests that produce unreliable results and a completed investigation of the interference effects that is costly and time-consuming. Four machine learning models including decision tree, random forest, XGBoost, generative adversarial networks (GANs), were trained based on 30% of a dataset to predict both mean and fluctuating pressure coefficients on the principal building. The GANs model exhibited the best performance in predicting these pressure coefficients. A number of GANs models were then trained based on different portions of the dataset ranging from 10% to 90%. It was found that the GANs model based on 30% of the dataset is capable of predicting both mean and fluctuating pressure coefficients under unseen interference conditions accurately. By using this GANs model, 70% of the wind tunnel test cases can be saved, largely alleviating the cost of this kind of wind tunnel testing study.
Pattern localization to a domain edge.

The formation of protein patterns inside cells is generically described by reaction-diffusion models. The study of such systems goes back to Turing, who showed how patterns can emerge from a homogenous steady state when two reactive components have different diffusivities (e.g., membrane-bound and cytosolic states). However, in nature, systems typically develop in a heterogeneous environment, where upstream protein patterns affect the formation of protein patterns downstream. Examples for this are the polarization of Cdc42 adjacent to the previous bud site in budding yeast and the formation of an actin-recruiter ring that forms around a PIP3 domain in macropinocytosis. This suggests that previously established protein patterns can serve as a template for downstream proteins and that these downstream proteins can "sense" the edge of the template. A mechanism for how this edge sensing may work remains elusive. Here we demonstrate and analyze a generic and robust edge-sensing mechanism, based on a two-component mass-conserving reaction-diffusion (McRD) model. Our analysis is rooted in a recently developed theoretical framework for McRD systems, termed local equilibria theory. We extend this framework to capture the spatially heterogeneous reaction kinetics due to the template. This enables us to graphically construct the stationary patterns in the phase space of the reaction kinetics. Furthermore, we show that the protein template can trigger a regional mass-redistribution instability near the template edge, leading to the accumulation of protein mass, which eventually results in a stationary peak at the template edge. We show that simple geometric criteria on the reactive nullcline's shape predict when this edge-sensing mechanism is operational. Thus, our results provide guidance for future studies of biological systems and for the design of synthetic pattern forming systems.
Evaluating Alignment Approaches in Superimposed Time-Series and Temporal Event-Sequence Visualizations

Composite temporal event sequence visualizations have included sentinel event alignment techniques to cope with data volume and variety. Prior work has demonstrated the utility of using single-event alignment for understanding the precursor, co-occurring, and aftereffect events surrounding a sentinel event. However, the usefulness of single-event alignment has not been sufficiently evaluated in composite visualizations. Furthermore, recently proposed dual-event alignment techniques have not been empirically evaluated. In this work, we designed tasks around temporal event sequence and timing analysis and conducted a controlled experiment on Amazon Mechanical Turk to examine four sentinel event alignment approaches: no sentinel event alignment (NoAlign), single-event alignment (SingleAlign), dual-event alignment with left justification (DualLeft), and dual-event alignment with stretch justification (DualStretch). Differences between approaches were most pronounced with more rows of data. For understanding intermediate events between two sentinel events, dual-event alignment was the clear winner for correctness—71% vs. 18% for NoAlign and SingleAlign. For understanding the duration between two sentinel events, NoAlign was the clear winner: correctness—88% vs. 36% for DualStretch— completion time—55 seconds vs. 101 seconds for DualLeft—and error—1.5% vs. 8.4% for DualStretch. For understanding precursor and aftereffect events, there was no significant difference among approaches. A free copy of this paper, the evaluation stimuli and data, and source code are available at osf.io/78fs5
Consistent Scale Normalization for Object Recognition

Scale variation remains a challenge problem for object detection. Common paradigms usually adopt multi-scale training & testing (image pyramid) or FPN (feature pyramid network) to process objects in wide scale range. However, multi-scale methods aggravate more variation of scale that even deep convolution neural networks with FPN cannot handle well. In this work, we propose an innovative paradigm called Consistent Scale Normalization (CSN) to resolve above problem. CSN compresses the scale space of objects into a consistent range (CSN range), in both training and testing phase. This reassures problem of scale variation fundamentally, and reduces the difficulty for network learning. Experiments show that CSN surpasses multi-scale counterpart significantly for object detection, instance segmentation and multi-task human pose estimation, on several architectures. On COCO test-dev, our single model based on CSN achieves 46.5 mAP with a ResNet-101 backbone, which is among the state-of-the-art (SOTA) candidates for object detection.
A Novel method for IDC Prediction in Breast Cancer Histopathology images using Deep Residual Neural Networks

Invasive ductal carcinoma (IDC), which is also sometimes known as the infiltrating ductal carcinoma, is the most regular form of breast cancer. It accounts to about 80% of all breast cancers. According to American Cancer Society , more than 180, 000 women in the United States are diagnosed with invasive breast cancer each year. The survival rate associated with this form of cancer is about 77% to 93% depending on the stage at which they are being diagnosed. The invasiveness and the frequency of the occurrence of these disease makes it one of the difficult cancers to be diagnosed. Our proposed methodology involves diagnosing the invasive ductal carcinoma with a deep residual convolution network to classify the IDC affected histopathological images from the normal images. The dataset for the purpose used is a benchmark dataset known as the Breast Histopathology Images . The microscopic RGB images are converted into a seven channel image matrix, which are then fed to the network. The proposed model produces a 99.29% accurate approach towards prediction of IDC in the histopathology images with an AUROC score of 0.9996. Classification ability of the model is tested using standard performance metrics. The following methodology has been described in the next sections. Index Terms–Residual learning, CIELAB color space, Grad-CAM, Contrast adaptive histogram equalization (CLAHE), Gaussian filtering
Hierarchical Bayesian Personalized Recommendation: A Case Study and Beyond

Items in modern recommender systems are often organized in hierarchical structures. These hierarchical structures and the data within them provide valuable information for building personalized recommendation systems. In this paper, we propose a general hierarchical Bayesian learning framework, i.e., \emph{HBayes}, to learn both the structures and associated latent factors. Furthermore, we develop a variational inference algorithm that is able to learn model parameters with fast empirical convergence rate. The proposed HBayes is evaluated on two real-world datasets from different domains. The results demonstrate the benefits of our approach on item recommendation tasks, and show that it can outperform the state-of-the-art models in terms of precision, recall, and normalized discounted cumulative gain. To encourage the reproducible results, we make our code public on a git repo: \url{this https URL}.
Stochastic differential theory of cricket.

A new formalism for analyzing the progression of cricket game using Stochastic differential equation (SDE) is introduced. This theory enables a quantitative way of representing every team using three key variables which have physical meaning associated with them. This is in contrast with the traditional system of rating/ranking teams based on combination of different statical cumulants. Further more, using this formalism, a new method to calculate the winning probability as a progression of number of balls is given.
PAC-Bayes with Backprop

We explore the family of methods "PAC-Bayes with Backprop" (PBB) to train probabilistic neural networks by minimizing PAC-Bayes bounds. We present two training objectives, one derived from a previously known PAC-Bayes bound, and a second one derived from a novel PAC-Bayes bound. Both training objectives are evaluated on MNIST and on various UCI data sets. Our experiments show two striking observations: we obtain competitive test set error estimates (~1.4% on MNIST) and at the same time we compute non-vacuous bounds with much tighter values (~2.3% on MNIST) than previous results. These observations suggest that neural nets trained by PBB may lead to self-bounding learning, where the available data can be used to simultaneously learn a predictor and certify its risk, with no need to follow a data-splitting protocol.
Social media usage reveals how regions recover after natural disaster

The challenge of nowcasting and forecasting the effect of natural disasters (e.g. earthquakes, floods, hurricanes) on assets, people and society is of primary importance for assessing the ability of such systems to recover from extreme events. Traditional disaster recovery estimates, such as surveys and interviews, are usually costly, time consuming and do not scale. Here we present a methodology to indirectly estimate the post-emergency recovery status ('downtime') of small businesses in urban areas looking at their online posting activity on social media. Analysing the time series of posts before and after an event, we quantify the downtime of small businesses for three natural disasters occurred in Nepal, Puerto Rico and Mexico. A convenient and reliable method for nowcasting the post-emergency recovery status of economic activities could help local governments and decision makers to better target their interventions and distribute the available resources more effectively.
Sampling protein-ligand binding pathways to recover crystallographic binding poses using interactive molecular dynamics in virtual reality

Using molecular dynamics (MD) to simulate drug binding & unbinding is a challenge. Because it requires sampling rugged energy landscapes that separate bound and unbound states, it has a high cost and consumes significant computational resources. Here, we describe the use of interactive molecular dynamics in virtual reality (iMD-VR) as a low-cost strategy for generating reversible protein-ligand binding and unbinding pathways. We outline an experimental protocol which enables expert iMD-VR users to generate reversible pathways for guiding ligands into and out of the binding pockets of trypsin, neuraminidase, and HIV-1 protease, and recreate their respective crystallographic protein-ligand binding poses within 5 - 10 minutes. Detailed test carried out to evaluate the use of iMD-VR by novices showed that (following a brief training phase) they were similarly able to generate unbinding and rebinding pathways which recovered binding poses on similar timescales as the experts. These results indicate that iMD-VR affords sufficient control for users to generate reversible binding pathways that recover crystallographic poses, offering a new approach for simulating drug docking and generating binding hypothesis.
Deep Contextualized Word Embeddings in Transition-Based and Graph-Based Dependency Parsing - A Tale of Two Parsers Revisited

Transition-based and graph-based dependency parsers have previously been shown to have complementary strengths and weaknesses: transition-based parsers exploit rich structural features but suffer from error propagation, while graph-based parsers benefit from global optimization but have restricted feature scope. In this paper, we show that, even though some details of the picture have changed after the switch to neural networks and continuous representations, the basic trade-off between rich features and global optimization remains essentially the same. Moreover, we show that deep contextualized word embeddings, which allow parsers to pack information about global sentence structure into local feature representations, benefit transition-based parsers more than graph-based parsers, making the two approaches virtually equivalent in terms of both accuracy and error profile. We argue that the reason is that these representations help prevent search errors and thereby allow transition-based parsers to better exploit their inherent strength of making accurate local decisions. We support this explanation by an error analysis of parsing experiments on 13 languages.
Triple-Poles Complementary Split Ring Resonator for Sensing Diabetics Glucose Levels at cm-Band

Microwave sensors are very promising for sensing the blood glucose levels non-invasively for their non-ionizing nature, miniaturized sizing, and low health risks for diabetics. All these features offer the possibility for realizing a portable non-invasive glucose sensor for monitoring glucose levels in real time. In this article, we propose a triple poles complementary split ring resonator (CSRR) produced on a FR4 substrate in microstrip technology in the cm-wave band (1-6 GHz). The proposed bio-sensor can detect the small variations in the dielectric properties (relative permittivity and dielectric losses) of glucose in the blood mimicking aqueous solutions due their intense interaction with the electromagnetic field at harmonic resonances. The resonator exhibits higher sensitivity performance at the different resonances compared to the single and double-poles counterparts as demonstrated by simulations in a 3D full-wave EM solver.
TabNet: Attentive Interpretable Tabular Learning

We propose a novel high-performance and interpretable canonical deep tabular data learning architecture, TabNet. TabNet uses sequential attention to choose which features to reason from at each decision step, enabling interpretability and more efficient learning as the learning capacity is used for the most salient features. We demonstrate that TabNet outperforms other neural network and decision tree variants on a wide range of non-performance-saturated tabular datasets and yields interpretable feature attributions plus insights into the global model behavior. Finally, for the first time to our knowledge, we demonstrate self-supervised learning for tabular data, significantly improving performance with unsupervised representation learning when unlabeled data is abundant.
Playing magic tricks to deep neural networks untangles human deception

Magic is the art of producing in the spectator an illusion of impossibility. Although the scientific study of magic is in its infancy, the advent of recent tracking algorithms based on deep learning allow now to quantify the skills of the magician in naturalistic conditions at unprecedented resolution and robustness. In this study, we deconstructed stage magic into purely motor maneuvers and trained an artificial neural network (DeepLabCut) to follow coins as a professional magician made them appear and disappear in a series of tricks. Rather than using AI as a mere tracking tool, we conceived it as an "artificial spectator". When the coins were not visible, the algorithm was trained to infer their location as a human spectator would (i.e. in the left fist). This created situations where the human was fooled while AI (as seen by a human) was not, and vice versa. Magic from the perspective of the machine reveals our own cognitive biases.
Evaluating Contextualized Embeddings on 54 Languages in POS Tagging, Lemmatization and Dependency Parsing

We present an extensive evaluation of three recently proposed methods for contextualized embeddings on 89 corpora in 54 languages of the Universal Dependencies 2.3 in three tasks: POS tagging, lemmatization, and dependency parsing. Employing the BERT, Flair and ELMo as pretrained embedding inputs in a strong baseline of UDPipe 2.0, one of the best-performing systems of the CoNLL 2018 Shared Task and an overall winner of the EPE 2018, we present a one-to-one comparison of the three contextualized word embedding methods, as well as a comparison with word2vec-like pretrained embeddings and with end-to-end character-level word embeddings. We report state-of-the-art results in all three tasks as compared to results on UD 2.2 in the CoNLL 2018 Shared Task.
How the geometry of cities explains urban scaling laws and determines their exponents.

Urban scaling laws relate socio-economic, behavioral, and physical variables to the population size of cities and allow for a new paradigm of city planning, and an understanding of urban resilience and economies. Independently of culture and climate, almost all cities exhibit two fundamental scaling exponents, one sub-linear and one super-linear that are related. Here we show that based on fundamental fractal geometric relations of cities we derive both exponents and their relation. Sub-linear scaling arises as the ratio of the fractal dimensions of the road network and the distribution of the population in 3D. Super-linear scaling emerges from human interactions that are constrained by the city geometry. We demonstrate the validity of the framework with data on 4750 European cities. We make several testable predictions, including the relation of average height of cities with population size, and that at a critical population size, growth changes from horizontal densification to three-dimensional growth.