OpenRaiser/Intern-Atlas huggingface dataset:
Multi Voxel-Point Neurons Convolution (MVPConv) for Fast and Accurate 3D Deep Learning
Venue: arXiv cs.CV 2021
Year: 2021

We present a new convolutional neural network, called Multi Voxel-Point Neurons Convolution (MVPConv), for fast and accurate 3D deep learning. The previous works adopt either individual point-based features or local-neighboring voxel-based features to process 3D model, which limits the performance of models due to the inefficient computation. Moreover, most of the existing 3D deep learning frameworks aim at solving one specific task, and only a few of them can handle a variety of tasks. Integrating both the advantages of the voxel and point-based methods, the proposed MVPConv can effectively increase the neighboring collection between point-based features and also promote the independence among voxel-based features. Simply replacing the corresponding convolution module with MVPConv, we show that MVPConv can fit in different backbones to solve a wide range of 3D tasks. Extensive experiments on benchmark datasets such as ShapeNet Part, S3DIS and KITTI for various tasks show that MVPConv improves the accuracy of the backbone (PointNet) by up to 36%, and achieves higher accuracy than the voxel-based model with up to 34 times speedup. In addition, MVPConv also outperforms the state-of-the-art point-based models with up to 8 times speedup. Notably, our MVPConv achieves better accuracy than the newest point-voxel-based model PVCNN (a model more efficient than PointNet) with lower latency.
Active WeaSuL: Improving Weak Supervision with Active Learning
Venue: arXiv cs.LG 2021
Year: 2021

The availability of labelled data is one of the main limitations in machine learning. We can alleviate this using weak supervision: a framework that uses expert-defined rules $\boldsymbolλ$ to estimate probabilistic labels $p(y|\boldsymbolλ)$ for the entire data set. These rules, however, are dependent on what experts know about the problem, and hence may be inaccurate or may fail to capture important parts of the problem-space. To mitigate this, we propose Active WeaSuL: an approach that incorporates active learning into weak supervision. In Active WeaSuL, experts do not only define rules, but they also iteratively provide the true label for a small set of points where the weak supervision model is most likely to be mistaken, which are then used to better estimate the probabilistic labels. In this way, the weak labels provide a warm start, which active learning then improves upon. We make two contributions: 1) a modification of the weak supervision loss function, such that the expert-labelled data inform and improve the combination of weak labels; and 2) the maxKL divergence sampling strategy, which determines for which data points expert labelling is most beneficial. Our experiments show that when the budget for labelling data is limited (e.g. $\leq 60$ data points), Active WeaSuL outperforms weak supervision, active learning, and competing strategies, with only a handful of labelled data points. This makes Active WeaSuL ideal for situations where obtaining labelled data is difficult.
Multi-Matrix Verifiable Computation
Venue: arXiv cs.CR 2021
Year: 2021

The problem of securely outsourcing computation to cloud servers has attracted a large amount of attention in recent years. The verifiable computation of Gennaro, Gentry, Parno (Crypto'10) allows a client to verify the server's computation of a function with substantially less time than performing the outsourced computation from scratch. In a multi-function model (Parno, Raykova, Vaikuntanathan; TCC'12) of verifiable computation, the process of encoding function and the process of preparing input are decoupled such that any client can freely submit a computation request on its input, without having to generate an encoding of the function in advance. In this paper, we propose a multi-matrix verifiable computation scheme that allows the secure outsourcing of the matrix functions over a finite field. Our scheme is outsourceable. When it is used to outsource $m$ linear functions, the scheme is roughly $m$ times faster and has less communication cost than the previously best known scheme by Fiore and Gennaro (CCS'12), both in the client-side computation and in the server-side computation. We also show the cost saving with detailed implementations.
A numerical exploration of signal detector arrangement in a spin-wave reservoir computing device
Venue: arXiv cs.ET 2021
Year: 2021

This paper studies numerically how the signal detector arrangement influences the performance of reservoir computing using spin waves excited in a ferrimagnetic garnet film. This investigation is essentially important since the input information is not only conveyed but also transformed by the spin waves into high-dimensional information space when the waves propagate in the film in a spatially distributed manner. This spatiotemporal dynamics realizes a rich reservoir-computational functionality. First, we simulate spin waves in a rectangular garnet film with two input electrodes to obtain spatial distributions of the reservoir states in response to input signals, which are represented as spin vectors and used for a machine-learning waveform classification task. The detected reservoir states are combined through readout connection weights to generate a final output. We visualize the spatial distribution of the weights after training to discuss the number and positions of the output electrodes by arranging them at grid points, equiangularly circular points or at random. We evaluate the classification accuracy by changing the number of the output electrodes, and find that a high accuracy ($>$ 90\%) is achieved with only several tens of output electrodes regardless of grid, circular or random arrangement. These results suggest that the spin waves possess sufficiently complex and rich dynamics for this type of tasks. Then we investigate in which area useful information is distributed more by arranging the electrodes locally on the chip. Finally, we show that this device has generalization ability for input wave-signal frequency in a certain frequency range. These results will lead to practical design of spin-wave reservoir devices for low-power intelligent computing in the near future.
Certifying Emergency Landing for Safe Urban UAV
Venue: arXiv cs.RO 2021
Year: 2021

Unmanned Aerial Vehicles (UAVs) have the potential to be used for many applications in urban environments. However, allowing UAVs to fly above densely populated areas raises concerns regarding safety. One of the main safety issues is the possibility for a failure to cause the loss of navigation capabilities, which can result in the UAV falling/landing in hazardous areas such as busy roads, where it can cause fatal accidents. Current standards, such as the SORA published in 2019, do not consider applicable mitigation techniques to handle this kind of hazardous situations. Consequently, certifying UAV urban operations implies to demonstrate very high levels of integrity, which results in prohibitive development costs. To address this issue, this paper explores the concept of Emergency Landing (EL). A safety analysis is conducted on an urban UAV case study, and requirements are proposed to enable the integration of EL as an acceptable mitigation mean in the SORA. Based on these requirements, an EL implementation was developed, together with a runtime monitoring architecture to enhance confidence in the system. Preliminary qualitative results are presented and the monitor seem to be able to detect errors of the EL system effectively.
Revisiting Citizen Science Through the Lens of Hybrid Intelligence
Venue: arXiv cs.HC 2021
Year: 2021

Artificial Intelligence (AI) can augment and sometimes even replace human cognition. Inspired by efforts to value human agency alongside productivity, we discuss the benefits of solving Citizen Science (CS) tasks with Hybrid Intelligence (HI), a synergetic mixture of human and artificial intelligence. Currently there is no clear framework or methodology on how to create such an effective mixture. Due to the unique participant-centered set of values and the abundance of tasks drawing upon both human common sense and complex 21st century skills, we believe that the field of CS offers an invaluable testbed for the development of HI and human-centered AI of the 21st century, while benefiting CS as well. In order to investigate this potential, we first relate CS to adjacent computational disciplines. Then, we demonstrate that CS projects can be grouped according to their potential for HI-enhancement by examining two key dimensions: the level of digitization and the amount of knowledge or experience required for participation. Finally, we propose a framework for types of human-AI interaction in CS based on established criteria of HI. This "HI lens" provides the CS community with an overview of several ways to utilize the combination of AI and human intelligence in their projects. It also allows the AI community to gain ideas on how developing AI in CS projects can further their own field.
Unsupervised data augmentation for object detection
Venue: arXiv cs.CV 2021
Year: 2021

Data augmentation has always been an effective way to overcome overfitting issue when the dataset is small. There are already lots of augmentation operations such as horizontal flip, random crop or even Mixup. However, unlike image classification task, we cannot simply perform these operations for object detection task because of the lack of labeled bounding boxes information for corresponding generated images. To address this challenge, we propose a framework making use of Generative Adversarial Networks(GAN) to perform unsupervised data augmentation. To be specific, based on the recently supreme performance of YOLOv4, we propose a two-step pipeline that enables us to generate an image where the object lies in a certain position. In this way, we can accomplish the goal that generating an image with bounding box label.
CAT: Cross-Attention Transformer for One-Shot Object Detection
Venue: arXiv cs.CV 2021
Year: 2021

Given a query patch from a novel class, one-shot object detection aims to detect all instances of that class in a target image through the semantic similarity comparison. However, due to the extremely limited guidance in the novel class as well as the unseen appearance difference between query and target instances, it is difficult to appropriately exploit their semantic similarity and generalize well. To mitigate this problem, we present a universal Cross-Attention Transformer (CAT) module for accurate and efficient semantic similarity comparison in one-shot object detection. The proposed CAT utilizes transformer mechanism to comprehensively capture bi-directional correspondence between any paired pixels from the query and the target image, which empowers us to sufficiently exploit their semantic characteristics for accurate similarity comparison. In addition, the proposed CAT enables feature dimensionality compression for inference speedup without performance loss. Extensive experiments on COCO, VOC, and FSOD under one-shot settings demonstrate the effectiveness and efficiency of our method, e.g., it surpasses CoAE, a major baseline in this task by 1.0% in AP on COCO and runs nearly 2.5 times faster. Code will be available in the future.
A Path to Smart Radio Environments: An Industrial Viewpoint on Reconfigurable Intelligent Surfaces
Venue: arXiv cs.NI 2021
Year: 2021

With both the standardization and commercialization completed in an unforeseen pace for the 5th generation (5G) wireless network, researchers, engineers and executives from the academia and the industry have turned their sights on candidate technologies to support the next generation wireless networks. Reconfigurable intelligent surfaces (RIS), sometimes referred to as intelligent reflecting surfaces (IRS), have been identified to be potential components of the future wireless networks because they can reconfigure the propagation environment for wireless signals with low-cost passive devices. In doing so, the coverage of a cell can be expected to increase significantly as well as the overall throughput of the network. RIS has not only become an attractive research area but also triggered a couple of projects to develop appropriate solutions to enable the set-up of hardware demonstrations and prototypes. In parallel, technical discussions and activities towards standardization already took off in some regions. Promoting RIS to be integrated into future commercial networks and become a commercial success requires significant standardization work taken place both at regional level standards developing organizations (SDO) and international SDOs such as the 3rd Generation Partnership Project (3GPP). While many research papers study how RIS can be used and optimized, few effort is devoted to analyzing the challenges to commercialize RIS and how RIS can be standardized. This paper intends to shed some light on RIS from an industrial viewpoint and provide a clear roadmap to make RIS industrially feasible.
Interpretable Semantic Photo Geolocation
Venue: arXiv cs.CV 2021
Year: 2021

Planet-scale photo geolocalization is the complex task of estimating the location depicted in an image solely based on its visual content. Due to the success of convolutional neural networks (CNNs), current approaches achieve super-human performance. However, previous work has exclusively focused on optimizing geolocalization accuracy. Due to the black-box property of deep learning systems, their predictions are difficult to validate for humans. State-of-the-art methods treat the task as a classification problem, where the choice of the classes, that is the partitioning of the world map, is crucial for the performance. In this paper, we present two contributions to improve the interpretability of a geolocalization model: (1) We propose a novel semantic partitioning method which intuitively leads to an improved understanding of the predictions, while achieving state-of-the-art results for geolocational accuracy on benchmark test sets; (2) We introduce a metric to assess the importance of semantic visual concepts for a certain prediction to provide additional interpretable information, which allows for a large-scale analysis of already trained models. Source code and dataset are publicly available.
Team MMSE Precoding with Applications to Cell-free Massive MIMO
Venue: arXiv cs.IT 2021
Year: 2021

This article studies a novel distributed precoding design, coined team minimum mean-square error (TMMSE) precoding, which rigorously generalizes classical centralized MMSE precoding to distributed operations based on transmitter-specific channel state information (CSIT). Building on the so-called theory of teams, we derive a set of necessary and sufficient conditions for optimal TMMSE precoding, in the form of an infinite dimensional linear system of equations. These optimality conditions are further specialized to cell-free massive MIMO networks, and explicitly solved for two important examples, i.e., the classical case of local CSIT and the case of unidirectional CSIT sharing along a serial fronthaul. The latter case is relevant, e.g., for the recently proposed radio stripe concept and the related advances on sequential processing exploiting serial connections. In both cases, our optimal design outperforms the heuristic methods that are known from the previous literature. Duality arguments and numerical simulations validate the effectiveness of the proposed team theoretical approach in terms of ergodic achievable rates under a sum-power constraint.
DRAM Failure Prediction in AIOps: Empirical Evaluation, Challenges and Opportunities
Venue: arXiv cs.LG 2021
Year: 2021

DRAM failure prediction is a vital task in AIOps, which is crucial to maintain the reliability and sustainable service of large-scale data centers. However, limited work has been done on DRAM failure prediction mainly due to the lack of public available datasets. This paper presents a comprehensive empirical evaluation of diverse machine learning techniques for DRAM failure prediction using a large-scale multi-source dataset, including more than three millions of records of kernel, address, and mcelog data, provided by Alibaba Cloud through PAKDD 2021 competition. Particularly, we first formulate the problem as a multi-class classification task and exhaustively evaluate seven popular/state-of-the-art classifiers on both the individual and multiple data sources. We then formulate the problem as an unsupervised anomaly detection task and evaluate three state-of-the-art anomaly detectors. Further, based on the empirical results and our experience of attending this competition, we discuss major challenges and present future research opportunities in this task.
Perpetual Voting: The Axiomatic Lens
Venue: arXiv cs.GT 2021
Year: 2021

Perpetual voting was recently introduced as a framework for long-term collective decision making. In this framework, we consider a sequence of subsequent approval-based elections and try to achieve a fair overall outcome. To achieve fairness over time, perpetual voting rules take the history of previous decisions into account and identify voters that were dissatisfied with previous decisions. In this paper, we look at perpetual voting rules from an axiomatic perspective and study two main questions. First, we ask how simple such rules can be while still meeting basic desiderata. For two simple but natural classes, we fully characterize the axiomatic possibilities. Second, we ask how proportionality can be formalized in perpetual voting. We study proportionality on simple profiles that are equivalent to the apportionment setting and show that lower and upper quota axioms can be used to distinguish (and sometimes characterize) perpetual voting rules. Furthermore, we show a surprising connection between a perpetual rule called Perpetual Consensus and Frege's apportionment method.
Tightening the Biological Constraints on Gradient-Based Predictive Coding
Venue: arXiv cs.NE 2021
Year: 2021

Predictive coding (PC) is a general theory of cortical function. The local, gradient-based learning rules found in one kind of PC model have recently been shown to closely approximate backpropagation. This finding suggests that this gradient-based PC model may be useful for understanding how the brain solves the credit assignment problem. The model may also be useful for developing local learning algorithms that are compatible with neuromorphic hardware. In this paper, we modify this PC model so that it better fits biological constraints, including the constraints that neurons can only have positive firing rates and the constraint that synapses only flow in one direction. We also compute the gradient-based weight and activity updates given the modified activity values. We show that, under certain conditions, these modified PC networks perform as well or nearly as well on MNIST data as the unmodified PC model and networks trained with backpropagation.
Differentiable Event Stream Simulator for Non-Rigid 3D Tracking
Venue: arXiv cs.CV 2021
Year: 2021

This paper introduces the first differentiable simulator of event streams, i.e., streams of asynchronous brightness change signals recorded by event cameras. Our differentiable simulator enables non-rigid 3D tracking of deformable objects (such as human hands, isometric surfaces and general watertight meshes) from event streams by leveraging an analysis-by-synthesis principle. So far, event-based tracking and reconstruction of non-rigid objects in 3D, like hands and body, has been either tackled using explicit event trajectories or large-scale datasets. In contrast, our method does not require any such processing or data, and can be readily applied to incoming event streams. We show the effectiveness of our approach for various types of non-rigid objects and compare to existing methods for non-rigid 3D tracking. In our experiments, the proposed energy-based formulations outperform competing RGB-based methods in terms of 3D errors. The source code and the new data are publicly available.
Self-Dimensioning and Planning of Small Cell Capacity in Multitenant 5G Networks
Venue: arXiv cs.NI 2021
Year: 2021

An important concept in the fifth generation of mobile networks is multitenancy, which allows diverse operators sharing the same wireless infrastructure. To support this feature in conjunction with the challenging performance requirements of future networks, more automated and faster planning of the required radio capacity is needed. Likewise, installing small cells is an effective resource to provide greater performance and capacity to both indoor and outdoor places. This paper proposes a new framework for automated cell planning in multitenant small cell networks. In particular, taking advantage of the available network data, a set of detailed planning specifications over time and space domains are generated in order to meet the contracted capacity by each tenant. Then, the network infrastructure and configuration are updated according to an algorithm that considers different actions such as adding/removing channels and adding or relocating small cells. The simulation results show the effectiveness of various methods to derive the planning specifications depending on the correlation between the tenant's and network's traffic demands.
Vessel and Port Efficiency Metrics through Validated AIS data
Venue: arXiv cs.AI 2021
Year: 2021

Automatic Identification System (AIS) data represents a rich source of information about maritime traffic and offers a great potential for data analytics and predictive modeling solutions, which can help optimizing logistic chains and to reduce environmental impacts. In this work, we address the main limitations of the validity of AIS navigational data fields, by proposing a machine learning-based data-driven methodology to detect and (to the possible extent) also correct erroneous data. Additionally, we propose a metric that can be used by vessel operators and ports to express numerically their business and environmental efficiency through time and spatial dimensions, enabled with the obtained validated AIS data. We also demonstrate Port Area Vessel Movements (PARES) tool, which demonstrates the proposed solutions.
Unbiased Deterministic Total Ordering of Parallel Simulations with Simultaneous Events
Venue: arXiv cs.DC 2021
Year: 2021

In the area of discrete event simulation (DES), event simultaneity occurs when any two events are scheduled to happen at the same point in simulated time. Simulation determinism is the expectation that the same semantically configured simulation will be guaranteed to repeatedly reproduce identical results. Since events in DES are the sole mechanism for state change, ensuring consistent real-time event processing order is crucial to maintaining determinism. This is synonymous with finding a consistent total ordering of events. In this work, we extend the concept of virtual time to utilize an arbitrary-length series of tie-breaking values to preserve determinism in parallel, optimistically executed simulations without imposing additional bias influencing the ordering of otherwise incomparable events. Furthermore, by changing the core pseudo-random number generator seed at initialization, different orderings of events incomparable by standard virtual time can be observed, allowing for fair probing of other potential simulation outcomes. We implement and evaluate this extended definition of virtual time in the Rensselaer Optimistic Simulation System (ROSS) with three simulation models and discuss the importance of deterministic event ordering given the existence of event ties.