OpenRaiser/Intern-Atlas huggingface dataset:
Three prophylactic interventions to counter fake news on social media
Venue: arXiv cs.HC 2021
Year: 2021

Fake news on Social Media undermines democratic institutions and processes. Especially since 2016, researchers from many disciplines have focussed on ways to address the phenomenon. Much of the research focus to date has been on identification and understanding the nature of the phenomenon in and between social networks and of a rather reactive nature. We propose interventions that focus on individual user empowerment, and social media structural change that is prophylactic (pre exposure), rather than therapeutic (post exposure) with the goal of reducing the population exposed to fake news. We investigate interventions that result in greater user elaboration (cognitive effort) before exposure to fake news. We propose three interventions i) psychological inoculation, ii) fostering digital and media literacy and iii) imposition of user transaction costs. Each intervention promises to illicit greater cognitive effort in message evaluation and reduce the likelihood of creating, sharing, liking and consuming 'fake news'.
Moving Object Segmentation in 3D LiDAR Data: A Learning-based Approach Exploiting Sequential Data
Venue: arXiv cs.RO 2021
Year: 2021

The ability to detect and segment moving objects in a scene is essential for building consistent maps, making future state predictions, avoiding collisions, and planning. In this paper, we address the problem of moving object segmentation from 3D LiDAR scans. We propose a novel approach that pushes the current state of the art in LiDAR-only moving object segmentation forward to provide relevant information for autonomous robots and other vehicles. Instead of segmenting the point cloud semantically, i.e., predicting the semantic classes such as vehicles, pedestrians, roads, etc., our approach accurately segments the scene into moving and static objects, i.e., also distinguishing between moving cars vs. parked cars. Our proposed approach exploits sequential range images from a rotating 3D LiDAR sensor as an intermediate representation combined with a convolutional neural network and runs faster than the frame rate of the sensor. We compare our approach to several other state-of-the-art methods showing superior segmentation quality in urban environments. Additionally, we created a new benchmark for LiDAR-based moving object segmentation based on SemanticKITTI. We published it to allow other researchers to compare their approaches transparently and we furthermore published our code.
Prototype Guided Federated Learning of Visual Feature Representations
Venue: arXiv cs.LG 2021
Year: 2021

Federated Learning (FL) is a framework which enables distributed model training using a large corpus of decentralized training data. Existing methods aggregate models disregarding their internal representations, which are crucial for training models in vision tasks. System and statistical heterogeneity (e.g., highly imbalanced and non-i.i.d. data) further harm model training. To this end, we introduce a method, called FedProto, which computes client deviations using margins of prototypical representations learned on distributed data, and applies them to drive federated optimization via an attention mechanism. In addition, we propose three methods to analyse statistical properties of feature representations learned in FL, in order to elucidate the relationship between accuracy, margins and feature discrepancy of FL models. In experimental analyses, FedProto demonstrates state-of-the-art accuracy and convergence rate across image classification and semantic segmentation benchmarks by enabling maximum margin training of FL models. Moreover, FedProto reduces uncertainty of predictions of FL models compared to the baseline. To our knowledge, this is the first work evaluating FL models in dense prediction tasks, such as semantic segmentation.
Obstructing Classification via Projection
Venue: arXiv cs.CG 2021
Year: 2021

Machine learning and data mining techniques are effective tools to classify large amounts of data. But they tend to preserve any inherent bias in the data, for example, with regards to gender or race. Removing such bias from data or the learned representations is quite challenging. In this paper we study a geometric problem which models a possible approach for bias removal. Our input is a set of points P in Euclidean space R^d and each point is labeled with k binary-valued properties. A priori we assume that it is "easy" to classify the data according to each property. Our goal is to obstruct the classification according to one property by a suitable projection to a lower-dimensional Euclidean space R^m (m < d), while classification according to all other properties remains easy. What it means for classification to be easy depends on the classification model used. We first consider classification by linear separability as employed by support vector machines. We use Kirchberger's Theorem to show that, under certain conditions, a simple projection to R^(d-1) suffices to eliminate the linear separability of one of the properties whilst maintaining the linear separability of the other properties. We also study the problem of maximizing the linear "inseparability" of the chosen property. Second, we consider more complex forms of separability and prove a connection between the number of projections required to obstruct classification and the Helly-type properties of such separabilities.
Private Hierarchical Clustering in Federated Networks
Venue: arXiv cs.CR 2021
Year: 2021

Analyzing structural properties of social networks, such as identifying their clusters or finding their most central nodes, has many applications. However, these applications are not supported by federated social networks that allow users to store their social links locally on their end devices. In the federated regime, users want access to personalized services while also keeping their social links private. In this paper, we take a step towards enabling analytics on federated networks with differential privacy guarantees about protecting the user links or contacts in the network. Specifically, we present the first work to compute hierarchical cluster trees using local differential privacy. Our algorithms for computing them are novel and come with theoretical bounds on the quality of the trees learned. The private hierarchical cluster trees enable a service provider to query the community structure around a user at various granularities without the users having to share their raw contacts with the provider. We demonstrate the utility of such queries by redesigning the state-of-the-art social recommendation algorithms for the federated setup. Our recommendation algorithms significantly outperform the baselines which do not use social contacts and are on par with the non-private algorithms that use contacts.
Light-weight Document Image Cleanup using Perceptual Loss
Venue: arXiv cs.CV 2021
Year: 2021

Smartphones have enabled effortless capturing and sharing of documents in digital form. The documents, however, often undergo various types of degradation due to aging, stains, or shortcoming of capturing environment such as shadow, non-uniform lighting, etc., which reduces the comprehensibility of the document images. In this work, we consider the problem of document image cleanup on embedded applications such as smartphone apps, which usually have memory, energy, and latency limitations due to the device and/or for best human user experience. We propose a light-weight encoder decoder based convolutional neural network architecture for removing the noisy elements from document images. To compensate for generalization performance with a low network capacity, we incorporate the perceptual loss for knowledge transfer from pre-trained deep CNN network in our loss function. In terms of the number of parameters and product-sum operations, our models are 65-1030 and 3-27 times, respectively, smaller than existing state-of-the-art document enhancement models. Overall, the proposed models offer a favorable resource versus accuracy trade-off and we empirically illustrate the efficacy of our approach on several real-world benchmark datasets.
Unsupervised Learning of Adaptive Codebooks for Deep Feedback Encoding in FDD Systems
Venue: arXiv cs.IT 2021
Year: 2021

In this work, we propose a joint adaptive codebook construction and feedback generation scheme in frequency division duplex (FDD) systems. Both unsupervised and supervised deep learning techniques are used for this purpose. Based on a recently discovered equivalence of uplink (UL) and downlink (DL) channel state information (CSI) in terms of neural network learning, the codebook and associated deep encoder for feedback signaling is based on UL data only. Subsequently, the feedback encoder can be offloaded to the mobile terminals (MTs) to generate channel feedback there as efficiently as possible, without any training effort at the terminals or corresponding transfer of training and codebook data. Numerical simulations demonstrate the promising performance of the proposed method.
High-Performance FPGA-based Accelerator for Bayesian Neural Networks
Venue: arXiv cs.AR 2021
Year: 2021

Neural networks (NNs) have demonstrated their potential in a wide range of applications such as image recognition, decision making or recommendation systems. However, standard NNs are unable to capture their model uncertainty which is crucial for many safety-critical applications including healthcare and autonomous vehicles. In comparison, Bayesian neural networks (BNNs) are able to express uncertainty in their prediction via a mathematical grounding. Nevertheless, BNNs have not been as widely used in industrial practice, mainly because of their expensive computational cost and limited hardware performance. This work proposes a novel FPGA-based hardware architecture to accelerate BNNs inferred through Monte Carlo Dropout. Compared with other state-of-the-art BNN accelerators, the proposed accelerator can achieve up to 4 times higher energy efficiency and 9 times better compute efficiency. Considering partial Bayesian inference, an automatic framework is proposed, which explores the trade-off between hardware and algorithmic performance. Extensive experiments are conducted to demonstrate that our proposed framework can effectively find the optimal points in the design space.
Image to Image Translation : Generating maps from satellite images
Venue: arXiv cs.LG 2021
Year: 2021

Generation of maps from satellite images is conventionally done by a range of tools. Maps became an important part of life whose conversion from satellite images may be a bit expensive but Generative models can pander to this challenge. These models aims at finding the patterns between the input and output image. Image to image translation is employed to convert satellite image to corresponding map. Different techniques for image to image translations like Generative adversarial network, Conditional adversarial networks and Co-Variational Auto encoders are used to generate the corresponding human-readable maps for that region, which takes a satellite image at a given zoom level as its input. We are training our model on Conditional Generative Adversarial Network which comprises of Generator model which which generates fake images while the discriminator tries to classify the image as real or fake and both these models are trained synchronously in adversarial manner where both try to fool each other and result in enhancing model performance.
A Deep Learning Scheme for Efficient Multimedia IoT Data Compression
Venue: arXiv cs.MM 2021
Year: 2021

Given the voluminous nature of the multimedia sensed data, the Multimedia Internet of Things (MIoT) devices and networks will present several limitations in terms of power and communication overhead. One traditional solution to cope with the large-size data challenge is to use lossy compression. However, current lossy compression schemes require low compression rate to guarantee acceptable perceived image quality, which results in a low reduction of the communicated data size and consequently a low reduction in the energy and bandwidth consumption. Thus, an efficient compression solution is required for striking a good balance between data size (and consequently communication overhead) and visual degradation. In this paper, a Deep-Learning (DL) super-resolution model is applied to recuperate high quality images (at the application server side) given as input degraded images with a high compression ratio (at the sender side). The experimental analysis shows the effectiveness of the proposed solution in enhancing the visual quality of the compressed and down-scaled images. Consequently, the proposed solution reduces the overall communication overhead and power consumption of limited MIoT devices.
Learning Pareto-Frontier Resource Management Policies for Heterogeneous SoCs: An Information-Theoretic Approach
Venue: arXiv cs.AR 2021
Year: 2021

Mobile system-on-chips (SoCs) are growing in their complexity and heterogeneity (e.g., Arm's Big-Little architecture) to meet the needs of emerging applications, including games and artificial intelligence. This makes it very challenging to optimally manage the resources (e.g., controlling the number and frequency of different types of cores) at runtime to meet the desired trade-offs among multiple objectives such as performance and energy. This paper proposes a novel information-theoretic framework referred to as PaRMIS to create Pareto-optimal resource management policies for given target applications and design objectives. PaRMIS specifies parametric policies to manage resources and learns statistical models from candidate policy evaluation data in the form of target design objective values. The key idea is to select a candidate policy for evaluation in each iteration guided by statistical models that maximize the information gain about the true Pareto front. Experiments on a commercial heterogeneous SoC show that PaRMIS achieves better Pareto fronts and is easily usable to optimize complex objectives (e.g., performance per Watt) when compared to prior methods.
Pink for Princesses, Blue for Superheroes: The Need to Examine Gender Stereotypes in Kid's Products in Search and Recommendations
Venue: arXiv cs.IR 2021
Year: 2021

In this position paper, we argue for the need to investigate if and how gender stereotypes manifest in search and recommender systems.As a starting point, we particularly focus on how these systems may propagate and reinforce gender stereotypes through their results in learning environments, a context where teachers and children in their formative stage regularly interact with these systems. We provide motivating examples supporting our concerns and outline an agenda to support future research addressing the phenomena.
Quadrature Photonic Spatial Ising Machine
Venue: arXiv cs.ET 2021
Year: 2021

The mining in physics and biology for accelerating the hardcore algorithm to solve non-deterministic polynomial (NP) hard problems has inspired a great amount of special-purpose ma-chine models. Ising machine has become an efficient solver for various combinatorial optimizationproblems. As a computing accelerator, large-scale photonic spatial Ising machine have great advan-tages and potentials due to excellent scalability and compact system. However, current fundamentallimitation of photonic spatial Ising machine is the configuration flexibility of problem implementationin the accelerator model. Arbitrary spin interactions is highly desired for solving various NP hardproblems. Moreover, the absence of external magnetic field in the proposed photonic Ising machinewill further narrow the freedom to map the optimization applications. In this paper, we propose anovel quadrature photonic spatial Ising machine to break through the limitation of photonic Isingaccelerator by synchronous phase manipulation in two and three sections. Max-cut problem solutionwith graph order of 100 and density from 0.5 to 1 is experimentally demonstrated after almost 100iterations. We derive and verify using simulation the solution for Max-cut problem with more than1600 nodes and the system tolerance for light misalignment. Moreover, vertex cover problem, modeled as an Ising model with external magnetic field, has been successfully implemented to achievethe optimal solution. Our work suggests flexible problem solution by large-scale photonic spatialIsing machine.
An Algebraic Characterisation of First-Order Logic with Neighbour
Venue: arXiv cs.LO 2021
Year: 2021

We give an algebraic characterisation of first-order logic with the neighbour relation, on finite words. For this, we consider languages of finite words over alphabets with an involution on them. The natural algebras for such languages are involution semigroups. To characterise the logic, we define a special kind of semidirect product of involution semigroups, called the locally hermitian product. The characterisation theorem for FO with neighbour states that a language is definable in the logic if and only if it is recognised by a locally hermitian product of an aperiodic commutative involution semigroup, and a locally trivial involution semigroup. We then define the notion of involution varieties of languages, namely classes of languages closed under Boolean operations, quotients, involution, and inverse images of involutory morphisms. An Eilenberg-type correspondence is established between involution varieties of languages and pseudovarieties of involution semigroups.
Pure Tensor Program Rewriting via Access Patterns (Representation Pearl)
Venue: arXiv cs.PL 2021
Year: 2021

Tensor kernels in machine learning (ML) often correspond to pure mathematical expressions, making term rewriting an attractive strategy for optimization and mapping to specialized hardware accelerators. However, existing ML intermediate representations (IRs) tend to either be \textit{pure but high-level}, making low-level rewrites to hardware targets inexpressible, or \textit{low-level but impure}, hampering the use of term rewriting altogether. This paper introduces Glenside, a pure IR whose core abstraction -- the \textit{access pattern} -- enables low-level, layout-aware, hardware-centric program rewrites. We demonstrate how term rewriting in Glenside can be used to map program fragments to hardware accelerator invocations and automatically discover classic data layout transformations like \texttt{im2col}. Glenside establishes a new foundation for exploring further term rewriting techniques in optimizing low-level tensor programs.
Using Machine Learning Techniques to Identify Key Risk Factors for Diabetes and Undiagnosed Diabetes
Venue: arXiv cs.LG 2021
Year: 2021

This paper reviews a wide selection of machine learning models built to predict both the presence of diabetes and the presence of undiagnosed diabetes using eight years of National Health and Nutrition Examination Survey (NHANES) data. Models are tuned and compared via their Brier Scores. The most relevant variables of the best performing models are then compared. A Support Vector Machine with a linear kernel performed best for predicting diabetes, returning a Brier score of 0.0654 and an AUROC of 0.9235 on the test set. An elastic net regression performed best for predicting undiagnosed diabetes with a Brier score of 0.0294 and an AUROC of 0.9439 on the test set. Similar features appear prominently in the models for both sets of models. Blood osmolality, family history, the prevalance of various compounds, and hypertension are key indicators for all diabetes risk. For undiagnosed diabetes in particular, there are ethnicity or genetic components which arise as strong correlates as well.
iTelos -- Purpose Driven Knowledge Graph Generation
Venue: arXiv cs.DB 2021
Year: 2021

When building a new application we are more and more confronted with the need of reusing and integrating pre-existing knowledge, e.g., ontologies, schemas, data of any kind, from multiple sources. Nevertheless, it is a fact that this prior knowledge is virtually impossible to reuse as-is. This difficulty is the cause of high costs, with the further drawback that the resulting application will again be hardly reusable. It is a negative loop which consistently reinforces itself. iTelos is a general purpose methodology aiming at minimizing as much as possible the effects of this loop. iTelos is based on the intuition that the data level and the schema level of an application should be developed independently, thus allowing for maximum flexibility in the reuse of the prior knowledge, but under the overall guidance of the needs to be satisfied, formalized as competence queries. This intuition is implemented by codifying all the requirements, including those concerning reuse, as part of an a-priori defined purpose, which is then used to drive a middle-out development process where the application schema and data are continuously aligned.
A Review of Autonomous Road Vehicle Integrated Approaches to an Emergency Obstacle Avoidance Maneuver
Venue: arXiv cs.RO 2021
Year: 2021

As passenger vehicle technologies have advanced, so have their capabilities to avoid obstacles, especially with developments in tires, suspensions, steering, as well as safety technologies like ABS, ESC, and more recently, ADAS systems. However, environments around passenger vehicles have also become more complex, and dangerous. There have previously been studies that outline driver tendencies and performance capabilities when attempting to avoid obstacles while driving passenger vehicles. Now that autonomous vehicles are being developed with obstacle avoidance capabilities, it is important to target performance that meets or exceeds that of human drivers. This manuscript highlights systems that are crucial for an emergency obstacle avoidance maneuver (EOAM) and identifies the state-of-the-art for each of the related systems, while considering the nuances of traveling at highway speeds. Some of the primary EOAM-related systems/areas that are discussed in this review are: general path planning methods, system hierarchies, decision-making, trajectory generation, and trajectory-tracking control methods. After concluding remarks, suggestions for future work which could lead to an ideal EOAM development, are discussed.