OpenRaiser/Intern-Atlas huggingface dataset:
Experimental Demonstration of High-Performance Physical Reservoir Computing with Nonlinear Interfered Spin Wave Multi-Detection
Venue: arXiv cs.ET 2022
Year: 2022

Physical reservoir computing, which is a promising method for the implementation of highly efficient artificial intelligence devices, requires a physical system with nonlinearity, fading memory, and the ability to map in high dimensions. Although it is expected that spin wave interference can perform as highly efficient reservoir computing in some micromagnetic simulations, there has been no experimental verification to date. Herein, we demonstrate reservoir computing that utilizes multidetected nonlinear spin wave interference in an yttrium iron garnet single crystal. The subject computing system achieved excellent performance when used for hand-written digit recognition, second-order nonlinear dynamical tasks, and nonlinear autoregressive moving average (NARMA). It is of particular note that normalized mean square errors (NMSEs) for NARMA2 and second-order nonlinear dynamical tasks were 1.81x10-2 and 8.37x10-5, respectively, which are the lowest figures for any experimental physical reservoir so far reported. Said high performance was achieved with higher nonlinearity and the large memory capacity of interfered spin wave multi-detection.
CoQAR: Question Rewriting on CoQA
Venue: arXiv cs.CL 2022
Year: 2022

Questions asked by humans during a conversation often contain contextual dependencies, i.e., explicit or implicit references to previous dialogue turns. These dependencies take the form of coreferences (e.g., via pronoun use) or ellipses, and can make the understanding difficult for automated systems. One way to facilitate the understanding and subsequent treatments of a question is to rewrite it into an out-of-context form, i.e., a form that can be understood without the conversational context. We propose CoQAR, a corpus containing $4.5$K conversations from the Conversational Question-Answering dataset CoQA, for a total of $53$K follow-up question-answer pairs. Each original question was manually annotated with at least 2 at most 3 out-of-context rewritings. CoQAR can be used in the supervised learning of three tasks: question paraphrasing, question rewriting and conversational question answering. In order to assess the quality of CoQAR's rewritings, we conduct several experiments consisting in training and evaluating models for these three tasks. Our results support the idea that question rewriting can be used as a preprocessing step for question answering models, thereby increasing their performances.
Multimodal Feature Extraction for Memes Sentiment Classification
Venue: arXiv cs.AI 2022
Year: 2022

In this study, we propose feature extraction for multimodal meme classification using Deep Learning approaches. A meme is usually a photo or video with text shared by the young generation on social media platforms that expresses a culturally relevant idea. Since they are an efficient way to express emotions and feelings, a good classifier that can classify the sentiment behind the meme is important. To make the learning process more efficient, reduce the likelihood of overfitting, and improve the generalizability of the model, one needs a good approach for joint feature extraction from all modalities. In this work, we proposed to use different multimodal neural network approaches for multimodal feature extraction and use the extracted features to train a classifier to identify the sentiment in a meme.
Distilling Ensemble of Explanations for Weakly-Supervised Pre-Training of Image Segmentation Models
Venue: arXiv cs.CV 2022
Year: 2022

While fine-tuning pre-trained networks has become a popular way to train image segmentation models, such backbone networks for image segmentation are frequently pre-trained using image classification source datasets, e.g., ImageNet. Though image classification datasets could provide the backbone networks with rich visual features and discriminative ability, they are incapable of fully pre-training the target model (i.e., backbone+segmentation modules) in an end-to-end manner. The segmentation modules are left to random initialization in the fine-tuning process due to the lack of segmentation labels in classification datasets. In our work, we propose a method that leverages Pseudo Semantic Segmentation Labels (PSSL), to enable the end-to-end pre-training for image segmentation models based on classification datasets. PSSL was inspired by the observation that the explanation results of classification models, obtained through explanation algorithms such as CAM, SmoothGrad and LIME, would be close to the pixel clusters of visual objects. Specifically, PSSL is obtained for each image by interpreting the classification results and aggregating an ensemble of explanations queried from multiple classifiers to lower the bias caused by single models. With PSSL for every image of ImageNet, the proposed method leverages a weighted segmentation learning procedure to pre-train the segmentation network en masse. Experiment results show that, with ImageNet accompanied by PSSL as the source dataset, the proposed end-to-end pre-training strategy successfully boosts the performance of various segmentation models, i.e., PSPNet-ResNet50, DeepLabV3-ResNet50, and OCRNet-HRNetW18, on a number of segmentation tasks, such as CamVid, VOC-A, VOC-C, ADE20K, and CityScapes, with significant improvements. The source code is availabel at https://github.com/PaddlePaddle/PaddleSeg.
Authentication Devices in Fog-Mobile Edge Computing Environments Through a Wireless Grid Resource Sharing Protocol
Venue: arXiv cs.CR 2022
Year: 2022

The rapid growth of the Internet of Things (IoT), cloud computing, Fog computing, mobile edge computing and wireless grids has resulted in the widespread deployment of relatively immature technology. These technologies, which will primarily use 5G wireless communication networks, are becoming popular because they can be deployed quickly with little infrastructure and lends themselves to environments utilizing numerous internet connected devices (ICD). Because of the threat of exploitation, these networks have to be protected by a robust security architecture due to these technologies being plagued with security problems. The authentication of smart ICDs to IoT networks is a critical mechanism for achieving security on these new information system platforms. This article identifies an authentication process required for these ICDs, which will need to prove their identity to authenticate to an IoT fog-mobile edge computing (FMEC) cloud network through a wireless grid authentication process. The purpose of this article is to hypothesize a generic authentication methodology for these FMEC clouds uses in an IoT architecture. The proposed methodology, called wg-IoT, must include the integration of Fog computing, wireless grids and mobile edge computing clouds to create this new IoT architecture. An authentication process developed from the resource sharing protocol (RSP) from a wireless grid is first developed and proposed for the authentication of ICDs. The wireless grid core components must be embedded in IoT devices or sensors depending on their capability to handle five primary functions: management of identification [ID] and presence, permissions management, data transferability, application-programming interface [API] and security.
Evolution of Popularity Bias: Empirical Study and Debiasing
Venue: arXiv cs.IR 2022
Year: 2022

Popularity bias is a long-standing challenge in recommender systems. Such a bias exerts detrimental impact on both users and item providers, and many efforts have been dedicated to studying and solving such a bias. However, most existing works situate this problem in a static setting, where the bias is analyzed only for a single round of recommendation with logged data. These works fail to take account of the dynamic nature of real-world recommendation process, leaving several important research questions unanswered: how does the popularity bias evolve in a dynamic scenario? what are the impacts of unique factors in a dynamic recommendation process on the bias? and how to debias in this long-term dynamic process? In this work, we aim to tackle these research gaps. Concretely, we conduct an empirical study by simulation experiments to analyze popularity bias in the dynamic scenario and propose a dynamic debiasing strategy and a novel False Positive Correction method utilizing false positive signals to debias, which show effective performance in extensive experiments.
Diagnosing and Remedying Shot Sensitivity with Cosine Few-Shot Learners
Venue: arXiv cs.CV 2022
Year: 2022

Few-shot recognition involves training an image classifier to distinguish novel concepts at test time using few examples (shot). Existing approaches generally assume that the shot number at test time is known in advance. This is not realistic, and the performance of a popular and foundational method has been shown to suffer when train and test shots do not match. We conduct a systematic empirical study of this phenomenon. In line with prior work, we find that shot sensitivity is broadly present across metric-based few-shot learners, but in contrast to prior work, larger neural architectures provide a degree of built-in robustness to varying test shot. More importantly, a simple, previously known but greatly overlooked class of approaches based on cosine distance consistently and greatly improves robustness to shot variation, by removing sensitivity to sample noise. We derive cosine alternatives to popular and recent few-shot classifiers, broadening their applicability to realistic settings. These cosine models consistently improve shot-robustness, outperform prior shot-robust state of the art, and provide competitive accuracy on a range of benchmarks and architectures, including notable gains in the very-low-shot regime.
Minimum $2$-edge strongly biconnected spanning directed subgraph problem
Venue: arXiv cs.DS 2022
Year: 2022

Wu and Grumbach introduced the concept of strongly biconnected directed graphs. A directed graph $G=(V,E)$ is called strongly biconnected if the directed graph $G$ is strongly connected and the underlying undirected graph of $G$ is biconnected. A strongly biconnected directed graph $G=(V,E)$ is said to be $2$- edge strongly biconnected if it has at least three vertices and the directed subgraph $(V,E\setminus\left\lbrace e\right\rbrace )$ is strongly biconnected for all $e \in E$. Let $G=(V,E)$ be a $2$-edge-strongly biconnected directed graph. In this paper we study the problem of computing a minimum size subset $H \subseteq E$ such that the directed subgraph $(V,H)$ is $2$- edge strongly biconnected.
Scoped Capabilities for Polymorphic Effects
Venue: arXiv cs.PL 2022
Year: 2022

Type systems usually characterize the shape of values but not their free variables. However, many desirable safety properties could be guaranteed if one knew the free variables captured by values. We describe CCsubBox, a calculus where such captured variables are succinctly represented in types, and show it can be used to safely implement effects and effect polymorphism via scoped capabilities. We discuss how the decision to track captured variables guides key aspects of the calculus, and show that CCsubBox admits simple and intuitive types for common data structures and their typical usage patterns. We demonstrate how these ideas can be used to guide the implementation of capture checking in a practical programming language.
Investigating the Effects of Mood & Usage Behaviour on Notification Response Time
Venue: arXiv cs.HC 2022
Year: 2022

Notifications are one of the most prevailing mechanisms on smartphones and personal computers to convey timely and important information. Despite these benefits, smartphone notifications demand individuals' attention and can cause stress and frustration when delivered at inopportune timings. This paper investigates the effect of individuals' smartphone usage behavior and mood on notification response time. We conduct an in-the-wild study with more than 18 participants for five weeks. Extensive experiment results show that the proposed regression model is able to accurately predict the response time of smartphone notifications using current user's mood and physiological signals. We explored the effect of different features for each participant to choose the most important user-oriented features in order to to achieve a meaningful and personalised notification response prediction. On average, our regression model achieved over all participants an MAE of 0.7764 ms and RMSE of 1.0527 ms. We also investigate how physiological signals (collected from E4 wristbands) are used as an indicator for mood and discuss the individual differences in application usage and categories of smartphone applications on the response time of notifications. Our research sheds light on the future intelligent notification management system.
Red PANDA: Disambiguating Anomaly Detection by Removing Nuisance Factors
Venue: arXiv cs.CV 2022
Year: 2022

Anomaly detection methods strive to discover patterns that differ from the norm in a semantic way. This goal is ambiguous as a data point differing from the norm by an attribute e.g., age, race or gender, may be considered anomalous by some operators while others may consider this attribute irrelevant. Breaking from previous research, we present a new anomaly detection method that allows operators to exclude an attribute from being considered as relevant for anomaly detection. Our approach then learns representations which do not contain information over the nuisance attributes. Anomaly scoring is performed using a density-based approach. Importantly, our approach does not require specifying the attributes that are relevant for detecting anomalies, which is typically impossible in anomaly detection, but only attributes to ignore. An empirical investigation is presented verifying the effectiveness of our approach.
Training Transformers Together
Venue: arXiv cs.LG 2022
Year: 2022

The infrastructure necessary for training state-of-the-art models is becoming overly expensive, which makes training such models affordable only to large corporations and institutions. Recent work proposes several methods for training such models collaboratively, i.e., by pooling together hardware from many independent parties and training a shared model over the Internet. In this demonstration, we collaboratively trained a text-to-image transformer similar to OpenAI DALL-E. We invited the viewers to join the ongoing training run, showing them instructions on how to contribute using the available hardware. We explained how to address the engineering challenges associated with such a training run (slow communication, limited memory, uneven performance between devices, and security concerns) and discussed how the viewers can set up collaborative training runs themselves. Finally, we show that the resulting model generates images of reasonable quality on a number of prompts.
Aerobatic Trajectory Generation for a VTOL Fixed-Wing Aircraft Using Differential Flatness
Venue: arXiv cs.RO 2022
Year: 2022

This paper proposes a novel algorithm for aerobatic trajectory generation for a vertical take-off and landing (VTOL) tailsitter flying wing aircraft. The algorithm differs from existing approaches for fixed-wing trajectory generation, as it considers a realistic six-degree-of-freedom (6DOF) flight dynamics model, including aerodynamics equations. Using a global dynamics model enables the generation of aerobatics trajectories that exploit the entire flight envelope, enabling agile maneuvering through the stall regime, sideways uncoordinated flight, inverted flight etc. The method uses the differential flatness property of the global tailsitter flying wing dynamics, which is derived in this work. By performing snap minimization in the differentially flat output space, a computationally efficient algorithm, suitable for online motion planning, is obtained. The algorithm is demonstrated in extensive flight experiments encompassing six aerobatics maneuvers, a time-optimal drone racing trajectory, and an airshow-like aerobatic sequence for three tailsitter aircraft.
Highlight Specular Reflection Separation based on Tensor Low-rank and Sparse Decomposition Using Polarimetric Cues
Venue: arXiv cs.CV 2022
Year: 2022

This paper is concerned with specular reflection removal based on tensor low-rank decomposition framework with the help of polarization information. Our method is motivated by the observation that the specular highlight of an image is sparsely distributed while the remaining diffuse reflection can be well approximated by a linear combination of several distinct colors using a low-rank and sparse decomposition framework. Unlike current solutions, our tensor low-rank decomposition keeps the spatial structure of specular and diffuse information which enables us to recover the diffuse image under strong specular reflection or in saturated regions. We further define and impose a new polarization regularization term as constraint on color channels. This regularization boosts the performance of the method to recover an accurate diffuse image by handling the color distortion, a common problem of chromaticity-based methods, especially in case of strong specular reflection. Through comprehensive experiments on both synthetic and real polarization images, we demonstrate that our method is able to significantly improve the accuracy of highlight specular removal, and outperform the competitive methods to recover the diffuse image, especially in regions of strong specular reflection or in saturated areas.
An Analysis of Uplink Success Probability in Multi-Cell Lora Networks Under Different Channel Models
Venue: arXiv cs.IT 2022
Year: 2022

The development of the low power wide area network (LPWAN) for the internet of things (IoTs) is expected to grow widely, allowing remote monitoring of smart devices from a distance of up to several kilometers. This paper studies the performance and success probability of multi-cell LoRa networks. Using tools of stochastic geometry, the paper analyzes the important metric namely success probability in both Rayleigh and Rician channel models. The obtained analysis helps investigate and evaluate other quality criteria in the multi-cell LoRa network such as throughput, SNR and SIR requirements. Moreover, we provide numerical simulation results to corroborate the theoretical analysis and to verify how our analysis can characterize the given reliability target.
An Embedding-Dynamic Approach to Self-supervised Learning
Venue: arXiv cs.CV 2022
Year: 2022

A number of recent self-supervised learning methods have shown impressive performance on image classification and other tasks. A somewhat bewildering variety of techniques have been used, not always with a clear understanding of the reasons for their benefits, especially when used in combination. Here we treat the embeddings of images as point particles and consider model optimization as a dynamic process on this system of particles. Our dynamic model combines an attractive force for similar images, a locally dispersive force to avoid local collapse, and a global dispersive force to achieve a globally-homogeneous distribution of particles. The dynamic perspective highlights the advantage of using a delayed-parameter image embedding (a la BYOL) together with multiple views of the same image. It also uses a purely-dynamic local dispersive force (Brownian motion) that shows improved performance over other methods and does not require knowledge of other particle coordinates. The method is called MSBReg which stands for (i) a Multiview centroid loss, which applies an attractive force to pull different image view embeddings toward their centroid, (ii) a Singular value loss, which pushes the particle system toward spatially homogeneous density, (iii) a Brownian diffusive loss. We evaluate downstream classification performance of MSBReg on ImageNet as well as transfer learning tasks including fine-grained classification, multi-class object classification, object detection, and instance segmentation. In addition, we also show that applying our regularization term to other methods further improves their performance and stabilize the training by preventing a mode collapse.
Efficiency of non-truthful auctions under auto-bidding
Venue: arXiv cs.GT 2022
Year: 2022

Auto-bidding is now widely adopted as an interface between advertisers and internet advertising as it allows advertisers to specify high-level goals, such as maximizing value subject to a value-per-spend constraint. Prior research has mostly focused on auctions which are truthful (such as SPA) since uniform bidding is optimal in such auctions, which makes it manageable to reason about equilibria. A tantalizing question is whether one can obtain more efficient outcomes by leaving the realm of truthful auctions. This is the first paper to study non-truthful auctions in the prior-free auto-bidding setting. Our first result is that non-truthfulness provides no benefit when one considers deterministic auctions. Any deterministic mechanism has a price of anarchy (PoA) of at least $2$, even for $2$ bidders; this matches what can be achieved by deterministic truthful mechanisms. In particular, we prove that the first price auction has PoA of exactly $2$. For our second result, we construct a randomized non-truthful auction that achieves a PoA of $1.8$ for $2$ bidders. This is the best-known PoA for this problem. The previously best-known PoA for this problem was $1.9$ and was achieved with a truthful mechanism. Moreover, we demonstrate the benefit of non-truthfulness in this setting by showing that the truthful version of this randomized auction also has a PoA of $1.9$. Finally, we show that no auction (even randomized, non-truthful) can improve upon a PoA bound of $2$ as the number of advertisers grow to infinity.
Efficient Game-Theoretic Planning with Prediction Heuristic for Socially-Compliant Autonomous Driving
Venue: arXiv cs.RO 2022
Year: 2022

Planning under social interactions with other agents is an essential problem for autonomous driving. As the actions of the autonomous vehicle in the interactions affect and are also affected by other agents, autonomous vehicles need to efficiently infer the reaction of the other agents. Most existing approaches formulate the problem as a generalized Nash equilibrium problem solved by optimization-based methods. However, they demand too much computational resource and easily fall into the local minimum due to the non-convexity. Monte Carlo Tree Search (MCTS) successfully tackles such issues in game-theoretic problems. However, as the interaction game tree grows exponentially, the general MCTS still requires a huge amount of iterations to reach the optima. In this paper, we introduce an efficient game-theoretic trajectory planning algorithm based on general MCTS by incorporating a prediction algorithm as a heuristic. On top of it, a social-compliant reward and a Bayesian inference algorithm are designed to generate diverse driving behaviors and identify the other driver's driving preference. Results demonstrate the effectiveness of the proposed framework with datasets containing naturalistic driving behavior in highly interactive scenarios.