nils-herrmann/clean_scirepeval huggingface dataset:
Decomposed Attention: Self-Attention with Linear Complexities

Recent works have been applying self-attention to various fields in computer vision and natural language processing. However, the memory and computational demands of existing self-attention operations grow quadratically with the spatiotemporal size of the input. This prohibits the application of self-attention on large inputs, e.g., long sequences, high-definition images, or large videos. To remedy this drawback, this paper proposes a novel decomposed attention (DA) module with substantially less memory and computational consumption. The resource-efficiency allows more widespread and flexible application. Empirical evaluations on object recognition demonstrated the effectiveness of these advantages. DA-augmented models achieved stateof-the-art performance for object recognition on MS-COCO 2017 and significant improvement for image classification on ImageNet. Further, the resource-efficiency of DA democratizes self-attention to fields where the prohibitively high costs have been preventing its application. The state-ofthe-art result for stereo depth estimation on the Scene Flow dataset exemplified this.
Epidemic spreading with awareness and different timescales in multiplex networks

One of the major issues in theoretical modeling of epidemic spreading is the development of methods to control the transmission of an infectious agent. Human behavior plays a fundamental role in the spreading dynamics and can be used to stop a disease from spreading or to reduce its burden, as individuals aware of the presence of a disease can take measures to reduce their exposure to contagion. In this paper, we propose a mathematical model for the spread of diseases with awareness in complex networks. Unlike previous models, the information is propagated following a generalized Maki-Thompson rumor model. Flexibility on the timescale between information and disease spreading is also included. We verify that the velocity characterizing the diffusion of information awareness greatly influences the disease prevalence. We also show that a reduction in the fraction of unaware individuals does not always imply a decrease of the prevalence, as the relative timescale between disease and awareness spreading plays a crucial role in the systems' dynamics. This result is shown to be independent of the network topology. We finally calculate the epidemic threshold of our model, and show that it does not depend on the relative timescale. Our results provide a new view on how information influence disease spreading and can be used for the development of more efficient methods for disease control.
Improving Semantic Segmentation via Video Propagation and Label Relaxation

Semantic segmentation requires large amounts of pixel-wise annotations to learn accurate models. In this paper, we present a video prediction-based methodology to scale up training sets by synthesizing new training samples in order to improve the accuracy of semantic segmentation networks. We exploit video prediction models' ability to predict future frames in order to also predict future labels. A joint propagation strategy is also proposed to alleviate mis-alignments in synthesized samples. We demonstrate that training segmentation models on datasets augmented by the synthesized samples leads to significant improvements in accuracy. Furthermore, we introduce a novel boundary label relaxation technique that makes training robust to annotation noise and propagation artifacts along object boundaries. Our proposed methods achieve state-of-the-art mIoUs of 83.5% on Cityscapes and 82.9% on CamVid. Our single model, without model ensembles, achieves 72.8% mIoU on the KITTI semantic segmentation test set, which surpasses the winning entry of the ROB challenge 2018.
Deep Bayesian Uncertainty Estimation for Adaptation and Self-Annotation of Food Packaging Images

Food packaging labels provide important information for public health, such as allergens and useby dates. Off-the-shelf Optical Character Verification (OCV) systems are good solutions for automating food label quality assessments, but are known to under perform on complex data. This paper proposes a Deep Learning based system that can identify inadequate images for OCV, due to their poor label quality, by employing state-of-the-art Convolutional Neural Network (CNN) architectures, and practical Bayesian inference techniques for automatic self-annotation. We propose a practical domain adaptation procedure based on k -means clustering of CNN latent variables, followed by a k -Nearest Neighbour classification for handling high label variability between different dataset distributions. Moreover, Supervised Learning has proven useful in such systems but manual annotation of large amounts of data is usually required. This is practically intractable in most real world problems due to time/labour constraints. In an attempt to address this issue, we introduce a self-annotating prediction model based on Self-Training of a Bayesian CNN, that leverages modern variational inference methods of deep models. In this context, we propose a new inverse uncertainty weighting technique that encourages the SelfFabio De Sousa Ribeiro, Francesco Calivá, Georgios Leontidis, and Stefanos Kollias MLearn Group School of Computer Science University of Lincoln E-mail: {fdesousaribeiro, fcaliva, gleontidis, skollias}@lincoln.ac.uk Mark Swainson, Kjartan Gudmundsson National Centre for Food Manufacturing Holbeach Technology Park E-mail: {mswainson, kgudmundsson}@lincoln.ac.uk Training model to learn from more informative data over time, potentially preventing it from becoming lazy by only selecting easy examples to learn from. An experimental study is presented illustrating the superior performance of the proposed approach over standard Self-Training, and highlighting the importance of predictive uncertainty estimates in safety-critical domains.
PointCloud Saliency Maps

3D point-cloud recognition with PointNet and its variants has received remarkable progress. A missing ingredient, however, is the ability to automatically evaluate point-wise importance w.r.t.\! classification performance, which is usually reflected by a saliency map. A saliency map is an important tool as it allows one to perform further processes on point-cloud data. In this paper, we propose a novel way of characterizing critical points and segments to build point-cloud saliency maps. Our method assigns each point a score reflecting its contribution to the model-recognition loss. The saliency map explicitly explains which points are the key for model recognition. Furthermore, aggregations of highly-scored points indicate important segments/subsets in a point-cloud. Our motivation for constructing a saliency map is by point dropping, which is a non-differentiable operator. To overcome this issue, we approximate point-dropping with a differentiable procedure of shifting points towards the cloud centroid. Consequently, each saliency score can be efficiently measured by the corresponding gradient of the loss w.r.t the point under the spherical coordinates. Extensive evaluations on several state-of-the-art point-cloud recognition models, including PointNet, PointNet++ and DGCNN, demonstrate the veracity and generality of our proposed saliency map. Code for experiments is released on \url{https://github.com/tianzheng4/PointCloud-Saliency-Maps}
Deep Learning for Classical Japanese Literature

Much of machine learning research focuses on producing models which perform well on benchmark tasks, in turn improving our understanding of the challenges associated with those tasks. From the perspective of ML researchers, the content of the task itself is largely irrelevant, and thus there have increasingly been calls for benchmark tasks to more heavily focus on problems which are of social or cultural relevance. In this work, we introduce Kuzushiji-MNIST, a dataset which focuses on Kuzushiji (cursive Japanese), as well as two larger, more challenging datasets, Kuzushiji-49 and Kuzushiji-Kanji. Through these datasets, we wish to engage the machine learning community into the world of classical Japanese literature. Dataset available at this https URL
Decompose to manipulate: Manipulable Object Synthesis in 3D Medical Images with Structured Image Decomposition

The performance of medical image analysis systems is constrained by the quantity of high-quality image annotations. Such systems require data to be annotated by experts with years of training, especially when diagnostic decisions are involved. Such datasets are thus hard to scale up. In this context, it is hard for supervised learning systems to generalize to the cases that are rare in the training set but would be present in real-world clinical practices. We believe that the synthetic image samples generated by a system trained on the real data can be useful for improving the supervised learning tasks in the medical image analysis applications. Allowing the image synthesis to be manipulable could help synthetic images provide complementary information to the training data rather than simply duplicating the real-data manifold. In this paper, we propose a framework for synthesizing 3D objects, such as pulmonary nodules, in 3D medical images with manipulable properties. The manipulation is enabled by decomposing of the object of interests into its segmentation mask and a 1D vector containing the residual information. The synthetic object is refined and blended into the image context with two adversarial discriminators. We evaluate the proposed framework on lung nodules in 3D chest CT images and show that the proposed framework could generate realistic nodules with manipulable shapes, textures and locations, etc. By sampling from both the synthetic nodules and the real nodules from 2800 3D CT volumes during the classifier training, we show the synthetic patches could improve the overall nodule detection performance by average 8.44% competition performance metric (CPM) score.
Continual Learning Augmented Investment Decisions

Investment decisions can benefit from incorporating an accumulated knowledge of the past to drive future decision making. We introduce Continual Learning Augmentation (CLA) which is based on an explicit memory structure and a feed forward neural network (FFNN) base model and used to drive long term financial investment decisions. We demonstrate that our approach improves accuracy in investment decision making while memory is addressed in an explainable way. Our approach introduces novel remember cues, consisting of empirically learned change points in the absolute error series of the FFNN. Memory recall is also novel, with contextual similarity assessed over time by sampling distances using dynamic time warping (DTW). We demonstrate the benefits of our approach by using it in an expected return forecasting task to drive investment decisions. In an investment simulation in a broad international equity universe between 2003-2017, our approach significantly outperforms FFNN base models. We also illustrate how CLA's memory addressing works in practice, using a worked example to demonstrate the explainability of our approach.
On the Connection between Planets, Dark Matter and Cancer: Comment on “Planetary Dependence of Melanoma”

In a recent paper, Zioutas and Valachovic (2018) claim that dark matter is responsible for a significant fraction of the melanoma skin cancer. This conclusion is drawn from their observation of a significant correlation between skin melanoma incidence in the US and the inner planets positions (especially those of Mercury and Earth). Here, I present a number of objections to their interpretation. Some (but not all) of the counterarguments are based on the analysis of a larger dataset from the same source, considering more cancer types and separating by patient attributes, such as race. One of the counterarguments is that if the melanoma fluctuations with periods similar to planetary orbits were produced by dark matter density enhancements on Earth, then we would have to conclude that the black population is somehow immune to dark matter, a conclusion that seems incompatible with the current Weakly-Interacting Massive Particles (WIMP) paradigm. Interestingly, some periodicities are present in the data, including the ones reported by Zioutas and Valachovic, but I argue that they must have a societal rather than astronomical origin.
Finite-Sample Analyses for Fully Decentralized Multi-Agent Reinforcement Learning

Despite the increasing interest in multi-agent reinforcement learning (MARL) in the community, understanding its theoretical foundation has long been recognized as a challenging problem. In this work, we make an attempt towards addressing this problem, by providing finite-sample analyses for fully decentralized MARL. Specifically, we consider two fully decentralized MARL settings, where teams of agents are connected by time-varying communication networks, and either collaborate or compete in a zero-sum game, without the absence of any central controller. These settings cover many conventional MARL settings in the literature. For both settings, we develop batch MARL algorithms that can be implemented in a fully decentralized fashion, and quantify the finite-sample errors of the estimated action-value functions. Our error analyses characterize how the function class, the number of samples within each iteration, and the number of iterations determine the statistical accuracy of the proposed algorithms. Our results, compared to the finite-sample bounds for single-agent RL, identify the involvement of additional error terms caused by decentralized computation, which is inherent in our decentralized MARL setting. To our knowledge, our work appears to be the first finite-sample analyses for MARL, which sheds light on understanding both the sample and computational efficiency of MARL algorithms.
Deep ChArUco: Dark ChArUco Marker Pose Estimation

ChArUco boards are used for camera calibration, monocular pose estimation, and pose verification in both robotics and augmented reality. Such fiducials are detectable via traditional computer vision methods (as found in OpenCV) in well-lit environments, but classical methods fail when the lighting is poor or when the image undergoes extreme motion blur. We present Deep ChArUco, a real-time pose estimation system which combines two custom deep networks, ChArUcoNet and RefineNet, with the Perspective-n-Point (PnP) algorithm to estimate the marker's 6DoF pose. ChArUcoNet is a two-headed marker-specific convolutional neural network (CNN) which jointly outputs ID-specific classifiers and 2D point locations. The 2D point locations are further refined into subpixel coordinates using RefineNet. Our networks are trained using a combination of auto-labeled videos of the target marker, synthetic subpixel corner data, and extreme data augmentation. We evaluate Deep ChArUco in challenging low-light, high-motion, high-blur scenarios and demonstrate that our approach is superior to a traditional OpenCV-based method for ChArUco marker detection and pose estimation.
Quasinormal modes of a black hole with quadrupole moment

We analytically determine the quasinormal mode (QNM) frequencies of a black hole with quadrupole moment in the eikonal limit using the light-ring method. The generalized black holes that are discussed in this work possess arbitrary quadrupole and higher mass moments in addition to mass and angular momentum. Static collapsed configurations with mass and quadrupole moment are treated in detail and the QNM frequencies associated with two such configurations are evaluated to linear order in the quadrupole moment. Furthermore, we touch upon the treatment of rotating systems. In particular, the generalized black hole that we consider for our extensive QNM calculations is a completely collapsed configuration whose exterior gravitational field can be described by the Hartle-Thorne spacetime [ (1968)]. This collapsed system as well as its QNMs is characterized by mass $M$, quadrupole moment $Q$ and angular momentum $J$, where the latter two parameters are treated to first and second orders of approximation, respectively. When the quadrupole moment is set equal to the relativistic quadrupole moment of the corresponding Kerr black hole, $J^2/(Mc^2)$, the Hartle-Thorne QNMs reduce to those of the Kerr black hole to second order in angular momentum $J$. Using ringdown frequencies, one cannot observationally distinguish a generalized Hartle-Thorne black hole with arbitrary quadrupole moment from a Kerr black hole provided the dimensionless parameter given by $|QMc^2-J^2|c^2/(G^2M^4)$ is sufficiently small compared to unity.
FBNet: Hardware-Aware Efficient ConvNet Design via Differentiable Neural Architecture Search

Designing accurate and efficient ConvNets for mobile devices is challenging because the design space is combinatorially large. Due to this, previous neural architecture search (NAS) methods are computationally expensive. ConvNet architecture optimality depends on factors such as input resolution and target devices. However, existing approaches are too resource demanding for case-by-case redesigns. Also, previous work focuses primarily on reducing FLOPs, but FLOP count does not always reflect actual latency. To address these, we propose a differentiable neural architecture search (DNAS) framework that uses gradient-based methods to optimize ConvNet architectures, avoiding enumerating and training individual architectures separately as in previous methods. FBNets (Facebook-Berkeley-Nets), a family of models discovered by DNAS surpass state-of-the-art models both designed manually and generated automatically. FBNet-B achieves 74.1% top-1 accuracy on ImageNet with 295M FLOPs and 23.1 ms latency on a Samsung S8 phone, 2.4x smaller and 1.5x faster than MobileNetV2-1.3 with similar accuracy. Despite higher accuracy and lower latency than MnasNet, we estimate FBNet-B's search cost is 420x smaller than MnasNet's, at only 216 GPU-hours. Searched for different resolutions and channel sizes, FBNets achieve 1.5% to 6.4% higher accuracy than MobileNetV2. The smallest FBNet achieves 50.2% accuracy and 2.9 ms latency (345 frames per second) on a Samsung S8. Over a Samsung-optimized FBNet, the iPhone-X-optimized model achieves a 1.4x speedup on an iPhone X. FBNet models are open-sourced at https://github. com/facebookresearch/mobile-vision.
A Structured Model for Action Detection

A dominant paradigm for learning-based approaches in computer vision is training generic models, such as ResNet for image recognition, or I3D for video understanding, on large datasets and allowing them to discover the optimal representation for the problem at hand. While this is an obviously attractive approach, it is not applicable in all scenarios. We claim that action detection is one such challenging problem - the models that need to be trained are large, and labeled data is expensive to obtain. To address this limitation, we propose to incorporate domain knowledge into the structure of the model, simplifying optimization. In particular, we augment a standard I3D network with a tracking module to aggregate long-term motion patterns, and use a graph convolutional network to reason about interactions between actors and objects. Evaluated on the challenging AVA dataset, the proposed approach improves over the I3D baseline by 5.5% mAP and over the state-of-the-art by 4.8% mAP.
A Dynamic Niche Model for the Emergence and Evolution of Mutualistic Network Structures

Mutualistic interactions are vital constituents of ecological and socio-economic systems. Empirical studies have found that the patterns of reciprocal relations among the participants often shows the salient features of being simultaneously nested and modular. Whether and how these two structural properties of mutualistic networks can emerge out of a common mechanism however remains unclear. We propose a unified dynamic model based on the adaptation of niche relations that gives rise to both structural features. We apply Hutchinson's concept of niche interaction to networked cooperative species. Their niche relation evolves under the assumption of fitness maximization. Modularity and nestedness emerge concurrently through the accumulated local advantages in the structural and demographic distribution. A rich ensemble of key dynamical behaviors are unveiled in the dynamical framework. We demonstrate that mutualism can exhibit either a stabilizing or destabilizing effect on the evolved network, which undergoes a drastic transition with the overall competition level. Most strikingly, the adaptive network may exhibit a profound nature of history-dependency in response to environmental changes, allowing it to be found in alternative stable structures. The adaptive nature of niche interactions, as captured in our framework, can underlie a broad class of ecological relations and also socio-economic networks that engage in bipartite cooperation.
SDNet: Contextualized Attention-based Deep Network for Conversational Question Answering

Conversational question answering (CQA) is a novel QA task that requires understanding of dialogue context. Different from traditional single-turn machine reading comprehension (MRC) tasks, CQA includes passage comprehension, coreference resolution, and contextual understanding. In this paper, we propose an innovated contextualized attention-based deep neural network, SDNet, to fuse context into traditional MRC models. Our model leverages both inter-attention and self-attention to comprehend conversation context and extract relevant information from passage. Furthermore, we demonstrated a novel method to integrate the latest BERT contextual model. Empirical results show the effectiveness of our model, which sets the new state of the art result in CoQA leaderboard, outperforming the previous best model by 1.6% F1. Our ensemble model further improves the result by 2.7% F1.
Massive poles in Lee-Wick quantum field theory

Most discussions of propagators in Lee-Wick theories focus on the presence of two massive complex conjugate poles in the propagator. We show that there is in fact only one pole near the physical region, or in another representation three pole-like structures with compensating extra poles. The latter modified Lehmann representation is useful caculationally and conceptually only if one includes the resonance structure in the spectral integral.
Serverless Computing: One Step Forward, Two Steps Back

Serverless computing offers the potential to program the cloud in an autoscaling, pay-as-you go manner. In this paper we address critical gaps in first-generation serverless computing, which place its autoscaling potential at odds with dominant trends in modern computing: notably data-centric and distributed computing, but also open source and custom hardware. Put together, these gaps make current serverless offerings a bad fit for cloud innovation and particularly bad for data systems innovation. In addition to pinpointing some of the main shortfalls of current serverless architectures, we raise a set of challenges we believe must be met to unlock the radical potential that the cloud---with its exabytes of storage and millions of cores---should offer to innovative developers.