OpenRaiser/Intern-Atlas huggingface dataset:
Data-driven fracture mechanics
Venue: arXiv cs.CE 2020
Year: 2020

We present a new data-driven paradigm for variational brittle fracture mechanics. The fracture-related material modeling assumptions are removed and the governing equations stemming from variational principles are combined with a set of discrete data points, leading to a model-free data-driven method of solution. The solution at a given load step is identified as the point within the data set that best satisfies either the Kuhn-Tucker conditions stemming from the variational fracture problem or global minimization of a suitable energy functional, leading to data-driven counterparts of both the local and the global minimization approaches of variational fracture mechanics. Both formulations are tested on different test configurations with and without noise and for Griffith and R-curve type fracture behavior.
Two-Buyer Sequential Multiunit Auctions with No Overbidding
Venue: arXiv cs.GT 2020
Year: 2020

We study equilibria in two-buyer sequential second-price (or first-price) auctions for identical goods. Buyers have weakly decreasing incremental values, and we make a behavioural no-overbidding assumption: the buyers do not bid above their incremental values. Structurally, we show equilibria are intrinsically linked to a greedy bidding strategy. We then prove three results. First, any equilibrium consists of three phases: a competitive phase, a competition reduction phase and a monopsony phase. In particular, there is a time after which one buyer exhibits monopsonistic behaviours. Second, the declining price anomaly holds: prices weakly decrease over time at any equilibrium in the no-overbidding game, a fact previously known for equilibria with overbidding. Third, the price of anarchy of the sequential auction is exactly $1 - 1/e$.
Inject Machine Learning into Significance Test for Misspecified Linear Models
Venue: arXiv cs.LG 2020
Year: 2020

Due to its strong interpretability, linear regression is widely used in social science, from which significance test provides the significance level of models or coefficients in the traditional statistical inference. However, linear regression methods rely on the linear assumptions of the ground truth function, which do not necessarily hold in practice. As a result, even for simple non-linear cases, linear regression may fail to report the correct significance level. In this paper, we present a simple and effective assumption-free method for linear approximation in both linear and non-linear scenarios. First, we apply a machine learning method to fit the ground truth function on the training set and calculate its linear approximation. Afterward, we get the estimator by adding adjustments based on the validation set. We prove the concentration inequalities and asymptotic properties of our estimator, which leads to the corresponding significance test. Experimental results show that our estimator significantly outperforms linear regression for non-linear ground truth functions, indicating that our estimator might be a better tool for the significance test.
Towards a Trust Aware Network Slice based End to End Services for Virtualised Infrastructures
Venue: arXiv cs.CR 2020
Year: 2020

Future communication networks such as 5G are expected to support end-to-end delivery of services for several vertical markets with diverging requirements. Network slicing is a key construct that is used to provide end to end logical virtual networks running on a common virtualised infrastructure, which are mutually isolated. Having different network slices operating over the same 5G infrastructure creates several challenges in security and trust. This paper addresses the fundamental issue of trust of a network slice. It presents a trust model and property-based trust attestation mechanisms which can be used to evaluate the trust of the virtual network functions that compose the network slice. The proposed model helps to determine the trust of the virtual network functions as well as the properties that should be satisfied by the virtual platforms (both at boot and run time) on which these network functions are deployed for them to be trusted. We present a logic-based language that defines simple rules for the specification of properties and the conditions under which these properties are evaluated to be satisfied for trusted virtualised platforms. The proposed trust model and mechanisms enable the service providers to determine the trustworthiness of the network services as well as the users to develop trustworthy applications. .
Parallel ensemble methods for causal direction inference
Venue: arXiv cs.LG 2020
Year: 2020

Inferring the causal direction between two variables from their observation data is one of the most fundamental and challenging topics in data science. A causal direction inference algorithm maps the observation data into a binary value which represents either x causes y or y causes x. The nature of these algorithms makes the results unstable with the change of data points. Therefore the accuracy of the causal direction inference can be improved significantly by using parallel ensemble frameworks. In this paper, new causal direction inference algorithms based on several ways of parallel ensemble are proposed. Theoretical analyses on accuracy rates are given. Experiments are done on both of the artificial data sets and the real world data sets. The accuracy performances of the methods and their computational efficiencies in parallel computing environment are demonstrated.
Aspect-based Sentiment Analysis of Scientific Reviews
Venue: arXiv cs.CL 2020
Year: 2020

Scientific papers are complex and understanding the usefulness of these papers requires prior knowledge. Peer reviews are comments on a paper provided by designated experts on that field and hold a substantial amount of information, not only for the editors and chairs to make the final decision, but also to judge the potential impact of the paper. In this paper, we propose to use aspect-based sentiment analysis of scientific reviews to be able to extract useful information, which correlates well with the accept/reject decision. While working on a dataset of close to 8k reviews from ICLR, one of the top conferences in the field of machine learning, we use an active learning framework to build a training dataset for aspect prediction, which is further used to obtain the aspects and sentiments for the entire dataset. We show that the distribution of aspect-based sentiments obtained from a review is significantly different for accepted and rejected papers. We use the aspect sentiments from these reviews to make an intriguing observation, certain aspects present in a paper and discussed in the review strongly determine the final recommendation. As a second objective, we quantify the extent of disagreement among the reviewers refereeing a paper. We also investigate the extent of disagreement between the reviewers and the chair and find that the inter-reviewer disagreement may have a link to the disagreement with the chair. One of the most interesting observations from this study is that reviews, where the reviewer score and the aspect sentiments extracted from the review text written by the reviewer are consistent, are also more likely to be concurrent with the chair's decision.
Path Towards Multilevel Evolution of Robots
Venue: arXiv cs.RO 2020
Year: 2020

Multi-level evolution is a bottom-up robotic design paradigm which decomposes the design problem into layered sub-tasks that involve concurrent search for appropriate materials, component geometry and overall morphology. Each of the three layers operate with the goal of building a library of diverse candidate solutions which will be used either as building blocks for the layer above or provided to the decision maker for final use. In this paper we provide a theoretical discussion on the concepts and technologies that could potentially be used as building blocks for this framework.
Daydream: Accurately Estimating the Efficacy of Optimizations for DNN Training
Venue: arXiv cs.DC 2020
Year: 2020

Modern deep neural network (DNN) training jobs use complex and heterogeneous software/hardware stacks. The efficacy of software-level optimizations can vary significantly when used in different deployment configurations. It is onerous and error-prone for ML practitioners and system developers to implement each optimization separately, and determine which ones will improve performance in their own configurations. Unfortunately, existing profiling tools do not aim to answer predictive questions such as "How will optimization X affect the performance of my model?". We address this critical limitation, and proposes a new profiling tool, Daydream, to help programmers efficiently explore the efficacy of DNN optimizations. Daydream models DNN execution with a fine-grained dependency graph based on low-level traces collected by CUPTI, and predicts runtime by simulating execution based on the dependency graph. Daydream maps the low-level traces using DNN domain-specific knowledge, and introduces a set of graph-transformation primitives that can easily model a wide variety of optimizations. We show that Daydream is able to model most mainstream DNN optimization techniques, and accurately predict the efficacy of optimizations that will result in significant performance improvements.
Statistical relationships between corresponding authorship, international co-authorship and citation impact of national research systems
Venue: arXiv cs.DL 2020
Year: 2020

This paper presents a statistical analysis of the relationship between three science indicators applied in earlier bibliometric studies, namely research leadership based on corresponding authorship, international collaboration using international co-authorship data, and field-normalized citation impact. Indicators at the level of countries are extracted from the SIR database created by SCImago Research Group from publication records indexed for Elsevier's Scopus. The relationship between authorship and citation-based indicators is found to be complex, as it reflects a country's phase of scientific development and the coverage policy of the database. Moreover, one should distinguish a genuine leadership effect from a purely statistical effect due to fractional counting. Further analyses at the level of institutions and qualitative validation studies are recommended.
Reconfigurable Intelligent Surfaces: Three Myths and Two Critical Questions
Venue: arXiv cs.IT 2020
Year: 2020

The search for physical-layer technologies that can play a key role in beyond-5G systems has started. One option is reconfigurable intelligent surfaces (RIS), which can collect wireless signals from a transmitter and passively beamform them towards the receiver. The technology has exciting prospects and is quickly gaining traction in the communication community, but in the current hype we have witnessed how several myths and overstatements are spreading in the literature. In this article, we take a neutral look at the RIS technology. We first review the fundamentals and then explain specific features that can be easily misinterpreted. In particular, we debunk three myths: 1) Current network technology can only control the transmitter and receiver, not the environment in between; 2) A better asymptotic array gain is achieved than with conventional beamforming; 3) The pathloss is the same as with anomalous mirrors. To inspire further research, we conclude by identifying two critical questions that must be answered for RIS to become a successful technology: 1) What is a convincing use case for RIS?; 2) How can we estimate channels and control an RIS in real time?
Optimal Sensor Placement in Power Grids: Power Domination, Set Covering, and the Neighborhoods of Zero Forcing Forts
Venue: arXiv cs.DS 2020
Year: 2020

To monitor electrical activity throughout the power grid and mitigate outages, sensors known as phasor measurement units can installed. Due to implementation costs, it is desirable to minimize the number of sensors deployed while ensuring that the grid can be effectively monitored. This optimization problem motivates the graph theoretic power dominating set problem. In this paper, we propose a novel integer program for identifying minimum power dominating sets by formulating a set cover problem. This problem's constraints correspond to neighborhoods of zero forcing forts; we study their structural properties and show they can be separated, allowing the proposed model to be solved via row generation. The proposed and existing methods are compared in several computational experiments in which the proposed method consistently exhibits an order of magnitude improvement in runtime performance.
Wasserstein Distance guided Adversarial Imitation Learning with Reward Shape Exploration
Venue: arXiv cs.LG 2020
Year: 2020

The generative adversarial imitation learning (GAIL) has provided an adversarial learning framework for imitating expert policy from demonstrations in high-dimensional continuous tasks. However, almost all GAIL and its extensions only design a kind of reward function of logarithmic form in the adversarial training strategy with the Jensen-Shannon (JS) divergence for all complex environments. The fixed logarithmic type of reward function may be difficult to solve all complex tasks, and the vanishing gradients problem caused by the JS divergence will harm the adversarial learning process. In this paper, we propose a new algorithm named Wasserstein Distance guided Adversarial Imitation Learning (WDAIL) for promoting the performance of imitation learning (IL). There are three improvements in our method: (a) introducing the Wasserstein distance to obtain more appropriate measure in the adversarial training process, (b) using proximal policy optimization (PPO) in the reinforcement learning stage which is much simpler to implement and makes the algorithm more efficient, and (c) exploring different reward function shapes to suit different tasks for improving the performance. The experiment results show that the learning procedure remains remarkably stable, and achieves significant performance in the complex continuous control tasks of MuJoCo.
Equivariant Maps for Hierarchical Structures
Venue: arXiv cs.LG 2020
Year: 2020

While using invariant and equivariant maps, it is possible to apply deep learning to a range of primitive data structures, a formalism for dealing with hierarchy is lacking. This is a significant issue because many practical structures are hierarchies of simple building blocks; some examples include sequences of sets, graphs of graphs, or multiresolution images. Observing that the symmetry of a hierarchical structure is the "wreath product" of symmetries of the building blocks, we express the equivariant map for the hierarchy using an intuitive combination of the equivariant linear layers of the building blocks. More generally, we show that any equivariant map for the hierarchy has this form. To demonstrate the effectiveness of this approach to model design, we consider its application in the semantic segmentation of point-cloud data. By voxelizing the point cloud, we impose a hierarchy of translation and permutation symmetries on the data and report state-of-the-art on Semantic3D, S3DIS, and vKITTI, that include some of the largest real-world point-cloud benchmarks.
Hierarchical Class-Based Curriculum Loss
Venue: arXiv cs.LG 2020
Year: 2020

Classification algorithms in machine learning often assume a flat label space. However, most real world data have dependencies between the labels, which can often be captured by using a hierarchy. Utilizing this relation can help develop a model capable of satisfying the dependencies and improving model accuracy and interpretability. Further, as different levels in the hierarchy correspond to different granularities, penalizing each label equally can be detrimental to model learning. In this paper, we propose a loss function, hierarchical curriculum loss, with two properties: (i) satisfy hierarchical constraints present in the label space, and (ii) provide non-uniform weights to labels based on their levels in the hierarchy, learned implicitly by the training paradigm. We theoretically show that the proposed loss function is a tighter bound of 0-1 loss compared to any other loss satisfying the hierarchical constraints. We test our loss function on real world image data sets, and show that it significantly substantially outperforms multiple baselines.
Generating Artificial Outliers in the Absence of Genuine Ones -- a Survey
Venue: arXiv cs.LG 2020
Year: 2020

By definition, outliers are rarely observed in reality, making them difficult to detect or analyse. Artificial outliers approximate such genuine outliers and can, for instance, help with the detection of genuine outliers or with benchmarking outlier-detection algorithms. The literature features different approaches to generate artificial outliers. However, systematic comparison of these approaches remains absent. This surveys and compares these approaches. We start by clarifying the terminology in the field, which varies from publication to publication, and we propose a general problem formulation. Our description of the connection of generating outliers to other research fields like experimental design or generative models frames the field of artificial outliers. Along with offering a concise description, we group the approaches by their general concepts and how they make use of genuine instances. An extensive experimental study reveals the differences between the generation approaches when ultimately being used for outlier detection. This survey shows that the existing approaches already cover a wide range of concepts underlying the generation, but also that the field still has potential for further development. Our experimental study does confirm the expectation that the quality of the generation approaches varies widely, for example, in terms of the data set they are used on. Ultimately, to guide the choice of the generation approach in a specific context, we propose an appropriate general-decision process. In summary, this survey comprises, describes, and connects all relevant work regarding the generation of artificial outliers and may serve as a basis to guide further research in the field.
Leadership emergence in walking groups
Venue: arXiv cs.MA 2020
Year: 2020

Understanding the mechanisms underlying the emergence of leadership in multi-agent systems is still under investigation in many areas of research where group coordination is involved. While leadership has been mostly investigated in the case of animal groups, only a few works address the problem of leadership emergence in human ensembles, e.g. pedestrian walking, group dance. In this paper we study the emergence of leadership in the specific scenario of a small walking group. Our aim is to unveil the main mechanisms emerging in a human group when leader or follower roles are not designated a priori. Two groups of participants were asked to walk together and turn or change speed at self-selected times. Data were analysed using time-dependent cross correlation to infer leader-follower interactions between each pair of group members. The results indicate that leadership emergence is due both to contextual factors, such as an individual's position in the group, and to personal factors, such as an individual's characteristic locomotor behaviour. Our approach can easily be extended to larger groups and other scenarios such as team sports and emergency evacuations.
Unsupervised Abnormality Detection Using Heterogeneous Autonomous Systems
Venue: arXiv cs.CV 2020
Year: 2020

Anomaly detection (AD) in a surveillance scenario is an emerging and challenging field of research. For autonomous vehicles like drones or cars, it is immensely important to distinguish between normal and abnormal states in real-time. Additionally, we also need to detect any device malfunction. But the nature and degree of abnormality may vary depending upon the actual environment and adversary. As a result, it is impractical to model all cases a-priori and use supervised methods to classify. Also, an autonomous vehicle provides various data types like images and other analog or digital sensor data, all of which can be useful in anomaly detection if leveraged fruitfully. To that effect, in this paper, a heterogeneous system is proposed which estimates the degree of abnormality of an unmanned surveillance drone, analyzing real-time image and IMU (Inertial Measurement Unit) sensor data in an unsupervised manner. Here, we have demonstrated a Convolutional Neural Network (CNN) architecture, named AngleNet to estimate the angle between a normal image and another image under consideration, which provides us with a measure of anomaly of the device. Moreover, the IMU data are used in autoencoder to predict abnormality. Finally, the results from these two algorithms are ensembled to estimate the final degree of abnormality. The proposed method performs satisfactorily on the IEEE SP Cup-2020 dataset with an accuracy of 97.3%. Additionally, we have also tested this approach on an in-house dataset to validate its robustness.
Distributed Approximation on Power Graphs
Venue: arXiv cs.DS 2020
Year: 2020

We investigate graph problems in the following setting: we are given a graph $G$ and we are required to solve a problem on $G^2$. While we focus mostly on exploring this theme in the distributed CONGEST model, we show new results and surprising connections to the centralized model of computation. In the CONGEST model, it is natural to expect that problems on $G^2$ would be quite difficult to solve efficiently on $G$, due to congestion. However, we show that the picture is both more complicated and more interesting. Specifically, we encounter two phenomena acting in opposing directions: (i) slowdown due to congestion and (ii) speedup due to structural properties of $G^2$. We demonstrate these two phenomena via two fundamental graph problems, namely, Minimum Vertex Cover (MVC) and Minimum Dominating Set (MDS). Among our many contributions, the highlights are the following. - In the CONGEST model, we show an $O(n/ε)$-round $(1+ε)$-approximation algorithm for MVC on $G^2$, while no $o(n^2)$-round algorithm is known for any better-than-2 approximation for MVC on $G$. - We show a centralized polynomial time $5/3$-approximation algorithm for MVC on $G^2$, whereas a better-than-2 approximation is UGC-hard for $G$. - In contrast, for MDS, in the CONGEST model, we show an $\tildeΩ(n^2)$ lower bound for a constant approximation factor for MDS on $G^2$, whereas an $Ω(n^2)$ lower bound for MDS on $G$ is known only for exact computation. In addition to these highlighted results, we prove a number of other results in the distributed CONGEST model including an $\tildeΩ(n^2)$ lower bound for computing an exact solution to MVC on $G^2$, a conditional hardness result for obtaining a $(1+ε)$-approximation to MVC on $G^2$, and an $O(\log Δ)$-approximation to the MDS problem on $G^2$ in $\mbox{poly}\log n$ rounds.