OpenRaiser/Intern-Atlas huggingface dataset:
Fractional Matchings under Preferences: Stability and Optimality
Venue: arXiv cs.GT 2020
Year: 2020

We thoroughly study a generalized version of the classic Stable Marriage and Stable Roommates problems where agents may share partners. We consider two prominent stability concepts: ordinal stability [Aharoni and Fleiner, Journal of Combinatorial Theory, 2003] and cardinal stability [Caragiannis et al., ACM EC 2019] and two optimality criteria: maximizing social welfare (i.e., the overall satisfaction of the agents) and maximizing the number of fully matched agents (i.e., agents whose shares sum up to one). After having observed that ordinal stability always exists and implies cardinal stability, and that the set of ordinally stable matchings in a restricted case admits a lattice structure, we obtain a complete picture regarding the computational complexity of finding an optimal ordinally stable or cardinally stable matching. In the process we answer an open question raised by Caragiannis et al. [AIJ 2020].
Localism as Secrecy: Efficiency-Secrecy Tradeoffs in the Recruitment of ISIS Foreign Fighters
Venue: arXiv cs.SI 2020
Year: 2020

This paper compares networks of foreign fighters who joined the Islamic State of Iraq and Syria (ISIS) from Europe and the Arabian Peninsula in order to test whether there are differences in their recruitment and how those differences affect the nature of the foreign fighter mobilization. It is the first study to compare different networks of foreign fighters that joined the same group in the same conflict at the same period of time. This study finds that foreign fighter recruitment resembles an efficiency-secrecy tradeoff: in places where recruitment needs to be hidden from legal scrutiny, recruitment networks are decentralized; composed of small and more local recruitment cells. These cells can operate more secretly and the group as a whole is more resilient to disruption. In exchange, it is hard for the group to attract large numbers of recruits. Whereas in places where recruitment could occur more freely, recruitment networks are more hierarchical; comprised of a larger number of recruits with more geographically diverse connections. The hierarchical design of their recruitment networks may be easier to disrupt, but it also helps the group efficiently recruit more followers if left undisturbed. This study concludes that the ISIS foreign fighter recruitment process varied significantly. Researchers and policymakers focused on recruitment and radicalization should therefore carefully frame their results or policies based on the different types of recruitment processes and the various social, political, and legal contexts where their work takes place.
Generalized Variational Continual Learning
Venue: arXiv cs.LG 2020
Year: 2020

Continual learning deals with training models on new tasks and datasets in an online fashion. One strand of research has used probabilistic regularization for continual learning, with two of the main approaches in this vein being Online Elastic Weight Consolidation (Online EWC) and Variational Continual Learning (VCL). VCL employs variational inference, which in other settings has been improved empirically by applying likelihood-tempering. We show that applying this modification to VCL recovers Online EWC as a limiting case, allowing for interpolation between the two approaches. We term the general algorithm Generalized VCL (GVCL). In order to mitigate the observed overpruning effect of VI, we take inspiration from a common multi-task architecture, neural networks with task-specific FiLM layers, and find that this addition leads to significant performance gains, specifically for variational methods. In the small-data regime, GVCL strongly outperforms existing baselines. In larger datasets, GVCL with FiLM layers outperforms or is competitive with existing baselines in terms of accuracy, whilst also providing significantly better calibration.
Language Generation via Combinatorial Constraint Satisfaction: A Tree Search Enhanced Monte-Carlo Approach
Venue: arXiv cs.CL 2020
Year: 2020

Generating natural language under complex constraints is a principled formulation towards controllable text generation. We present a framework to allow specification of combinatorial constraints for sentence generation. We propose TSMH, an efficient method to generate high likelihood sentences with respect to a pre-trained language model while satisfying the constraints. Our approach is highly flexible, requires no task-specific training, and leverages efficient constraint satisfaction solving techniques. To better handle the combinatorial constraints, a tree search algorithm is embedded into the proposal process of the Markov chain Monte Carlo (MCMC) to explore candidates that satisfy more constraints. Compared to existing MCMC approaches, our sampling approach has a better mixing performance. Experiments show that TSMH achieves consistent and significant improvement on multiple language generation tasks.
A reinforcement learning control approach for underwater manipulation under position and torque constraints
Venue: arXiv cs.RO 2020
Year: 2020

In marine operations underwater manipulators play a primordial role. However, due to uncertainties in the dynamic model and disturbances caused by the environment, low-level control methods require great capabilities to adapt to change. Furthermore, under position and torque constraints the requirements for the control system are greatly increased. Reinforcement learning is a data driven control technique that can learn complex control policies without the need of a model. The learning capabilities of these type of agents allow for great adaptability to changes in the operative conditions. In this article we present a novel reinforcement learning low-level controller for the position control of an underwater manipulator under torque and position constraints. The reinforcement learning agent is based on an actor-critic architecture using sensor readings as state information. Simulation results using the Reach Alpha 5 underwater manipulator show the advantages of the proposed control strategy.
A Non-linear Function-on-Function Model for Regression with Time Series Data
Venue: arXiv cs.LG 2020
Year: 2020

In the last few decades, building regression models for non-scalar variables, including time series, text, image, and video, has attracted increasing interests of researchers from the data analytic community. In this paper, we focus on a multivariate time series regression problem. Specifically, we aim to learn mathematical mappings from multiple chronologically measured numerical variables within a certain time interval S to multiple numerical variables of interest over time interval T. Prior arts, including the multivariate regression model, the Seq2Seq model, and the functional linear models, suffer from several limitations. The first two types of models can only handle regularly observed time series. Besides, the conventional multivariate regression models tend to be biased and inefficient, as they are incapable of encoding the temporal dependencies among observations from the same time series. The sequential learning models explicitly use the same set of parameters along time, which has negative impacts on accuracy. The function-on-function linear model in functional data analysis (a branch of statistics) is insufficient to capture complex correlations among the considered time series and suffer from underfitting easily. In this paper, we propose a general functional mapping that embraces the function-on-function linear model as a special case. We then propose a non-linear function-on-function model using the fully connected neural network to learn the mapping from data, which addresses the aforementioned concerns in the existing approaches. For the proposed model, we describe in detail the corresponding numerical implementation procedures. The effectiveness of the proposed model is demonstrated through the application to two real-world problems.
Multiple Transmit Power Levels based NOMA for Massive Machine-type Communications
Venue: arXiv cs.IT 2020
Year: 2020

This paper proposes a tractable solution for integrating non-orthogonal multiple access (NOMA) into massive machine-type communications (mMTC) to increase the uplink connectivity. Multiple transmit power levels are provided at the user end to enable open-loop power control, which is absent from the traditional uplink NOMA with the fixed transmit power. The basics of this solution are firstly presented to analytically show the inherent performance gain in terms of the average arrival rate (AAR). Then, a practical framework based on a novel power map is proposed to associate a set of well-designed transmit power levels with each geographical region for handling the no instantaneous channel state information problem. Based on this framework, the semi-grant-free (semi-GF) transmission with two practical protocols is introduced to enhance the connectivity, which has higher AAR than both the conventional grand-based and GF transmissions. When the number of active GF devices in mMTC far exceeds the available resource blocks, the corresponding AAR tends to zero. To solve this problem, user barring techniques are employed into the semi-GF transmission to stable the traffic flow and thus increase the AAR. Lastly, promising research directions are discussed for improving the proposed networks.
Online Domain Adaptation for Continuous Cross-Subject Liver Viability Evaluation Based on Irregular Thermal Data
Venue: arXiv cs.CV 2020
Year: 2020

Accurate evaluation of liver viability during its procurement is a challenging issue and has traditionally been addressed by taking invasive biopsy on liver. Recently, people have started to investigate on the non-invasive evaluation of liver viability during its procurement using the liver surface thermal images. However, existing works include the background noise in the thermal images and do not consider the cross-subject heterogeneity of livers, thus the viability evaluation accuracy can be affected. In this paper, we propose to use the irregular thermal data of the pure liver region, and the cross-subject liver evaluation information (i.e., the available viability label information in cross-subject livers), for the real-time evaluation of a new liver's viability. To achieve this objective, we extract features of irregular thermal data based on tools from graph signal processing (GSP), and propose an online domain adaptation (DA) and classification framework using the GSP features of cross-subject livers. A multiconvex block coordinate descent based algorithm is designed to jointly learn the domain-invariant features during online DA and learn the classifier. Our proposed framework is applied to the liver procurement data, and classifies the liver viability accurately.
Redundancy Resolution and Disturbance Rejection via Torque Optimization in Hybrid Cable-Driven Robots
Venue: arXiv cs.RO 2020
Year: 2020

This paper presents redundancy resolution and disturbance rejection via torque optimization in Hybrid Cable-Driven Robots (HCDRs). To begin with, we initiate a redundant HCDR for nonlinear whole-body system modeling and model reduction. Based on the reduced dynamic model, two new methods are proposed to solve the redundancy resolution problem: joint-space torque optimization for actuated joints (TOAJ) and joint-space torque optimization for actuated and unactuated joints (TOAUJ), and they can be extended to other HCDRs. Compared to the existing approaches, this paper provides the first solution (TOAUJ-based method) for HCDRs that can solve the redundancy resolution problem as well as disturbance rejection. Additionally, this paper develops detailed algorithms targeting TOAJ and TOAUJ implementation. A simple yet effective controller is designed for generated data analysis and validation. Case studies are conducted to evaluate the performance of TOAJ and TOAUJ, and the results suggest the effectiveness of the aforementioned approaches.
Emotional Semantics-Preserved and Feature-Aligned CycleGAN for Visual Emotion Adaptation
Venue: arXiv cs.CV 2020
Year: 2020

Thanks to large-scale labeled training data, deep neural networks (DNNs) have obtained remarkable success in many vision and multimedia tasks. However, because of the presence of domain shift, the learned knowledge of the well-trained DNNs cannot be well generalized to new domains or datasets that have few labels. Unsupervised domain adaptation (UDA) studies the problem of transferring models trained on one labeled source domain to another unlabeled target domain. In this paper, we focus on UDA in visual emotion analysis for both emotion distribution learning and dominant emotion classification. Specifically, we design a novel end-to-end cycle-consistent adversarial model, termed CycleEmotionGAN++. First, we generate an adapted domain to align the source and target domains on the pixel-level by improving CycleGAN with a multi-scale structured cycle-consistency loss. During the image translation, we propose a dynamic emotional semantic consistency loss to preserve the emotion labels of the source images. Second, we train a transferable task classifier on the adapted domain with feature-level alignment between the adapted and target domains. We conduct extensive UDA experiments on the Flickr-LDL & Twitter-LDL datasets for distribution learning and ArtPhoto & FI datasets for emotion classification. The results demonstrate the significant improvements yielded by the proposed CycleEmotionGAN++ as compared to state-of-the-art UDA approaches.
Wasserstein k-means with sparse simplex projection
Venue: arXiv cs.LG 2020
Year: 2020

This paper presents a proposal of a faster Wasserstein $k$-means algorithm for histogram data by reducing Wasserstein distance computations and exploiting sparse simplex projection. We shrink data samples, centroids, and the ground cost matrix, which leads to considerable reduction of the computations used to solve optimal transport problems without loss of clustering quality. Furthermore, we dynamically reduced the computational complexity by removing lower-valued data samples and harnessing sparse simplex projection while keeping the degradation of clustering quality lower. We designate this proposed algorithm as sparse simplex projection based Wasserstein $k$-means, or SSPW $k$-means. Numerical evaluations conducted with comparison to results obtained using Wasserstein $k$-means algorithm demonstrate the effectiveness of the proposed SSPW $k$-means for real-world datasets
Implicit bias of deep linear networks in the large learning rate phase
Venue: arXiv cs.LG 2020
Year: 2020

Most theoretical studies explaining the regularization effect in deep learning have only focused on gradient descent with a sufficient small learning rate or even gradient flow (infinitesimal learning rate). Such researches, however, have neglected a reasonably large learning rate applied in most practical applications. In this work, we characterize the implicit bias effect of deep linear networks for binary classification using the logistic loss in the large learning rate regime, inspired by the seminal work by Lewkowycz et al. [26] in a regression setting with squared loss. They found a learning rate regime with a large stepsize named the catapult phase, where the loss grows at the early stage of training and eventually converges to a minimum that is flatter than those found in the small learning rate regime. We claim that depending on the separation conditions of data, the gradient descent iterates will converge to a flatter minimum in the catapult phase. We rigorously prove this claim under the assumption of degenerate data by overcoming the difficulty of the non-constant Hessian of logistic loss and further characterize the behavior of loss and Hessian for non-separable data. Finally, we demonstrate that flatter minima in the space spanned by non-separable data along with the learning rate in the catapult phase can lead to better generalization empirically.
Learning Certified Control using Contraction Metric
Venue: arXiv cs.RO 2020
Year: 2020

In this paper, we solve the problem of finding a certified control policy that drives a robot from any given initial state and under any bounded disturbance to the desired reference trajectory, with guarantees on the convergence or bounds on the tracking error. Such a controller is crucial in safe motion planning. We leverage the advanced theory in Control Contraction Metric and design a learning framework based on neural networks to co-synthesize the contraction metric and the controller for control-affine systems. We further provide methods to validate the convergence and bounded error guarantees. We demonstrate the performance of our method using a suite of challenging robotic models, including models with learned dynamics as neural networks. We compare our approach with leading methods using sum-of-squares programming, reinforcement learning, and model predictive control. Results show that our methods indeed can handle a broader class of systems with less tracking error and faster execution speed. Code is available at https://github.com/sundw2014/C3M.
Supervised Learning Achieves Human-Level Performance in MOBA Games: A Case Study of Honor of Kings
Venue: arXiv cs.AI 2020
Year: 2020

We present JueWu-SL, the first supervised-learning-based artificial intelligence (AI) program that achieves human-level performance in playing multiplayer online battle arena (MOBA) games. Unlike prior attempts, we integrate the macro-strategy and the micromanagement of MOBA-game-playing into neural networks in a supervised and end-to-end manner. Tested on Honor of Kings, the most popular MOBA at present, our AI performs competitively at the level of High King players in standard 5v5 games.
Unsupervised Domain Adaptation in Semantic Segmentation via Orthogonal and Clustered Embeddings
Venue: arXiv cs.CV 2020
Year: 2020

Deep learning frameworks allowed for a remarkable advancement in semantic segmentation, but the data hungry nature of convolutional networks has rapidly raised the demand for adaptation techniques able to transfer learned knowledge from label-abundant domains to unlabeled ones. In this paper we propose an effective Unsupervised Domain Adaptation (UDA) strategy, based on a feature clustering method that captures the different semantic modes of the feature distribution and groups features of the same class into tight and well-separated clusters. Furthermore, we introduce two novel learning objectives to enhance the discriminative clustering performance: an orthogonality loss forces spaced out individual representations to be orthogonal, while a sparsity loss reduces class-wise the number of active feature channels. The joint effect of these modules is to regularize the structure of the feature space. Extensive evaluations in the synthetic-to-real scenario show that we achieve state-of-the-art performance.
Exploring WorldCat Identities as an altmetric information source: A library catalog analysis experiment in the field of Scientometrics
Venue: arXiv cs.DL 2020
Year: 2020

Assessing the impact of scholarly books is a difficult research evaluation problem. Library Catalog Analysis facilitates the quantitative study, at different levels, of the impact and diffusion of academic books based on data about their availability in libraries. The WorldCat global catalog collates data on library holdings, offering a range of tools including the novel WorldCat Identities. This is based on author profiles and provides indicators relating to the availability of their books in library catalogs. Here, we investigate this new tool to identify its strengths and weaknesses based on a sample of Bibliometrics and Scientometrics authors. We review the problems that this entails and compare Library Catalog Analysis indicators with Google Scholar and Web of Science citations. The results show that WorldCat Identities can be a useful tool for book impact assessment but the value of its data is undermined by the provision of massive collections of ebooks to academic libraries.
Stay Connected, Leave no Trace: Enhancing Security and Privacy in WiFi via Obfuscating Radiometric Fingerprints
Venue: arXiv cs.CR 2020
Year: 2020

The intrinsic hardware imperfection of WiFi chipsets manifests itself in the transmitted signal, leading to a unique radiometric fingerprint. This fingerprint can be used as an additional means of authentication to enhance security. In fact, recent works propose practical fingerprinting solutions that can be readily implemented in commercial-off-the-shelf devices. In this paper, we prove analytically and experimentally that these solutions are highly vulnerable to impersonation attacks. We also demonstrate that such a unique device-based signature can be abused to violate privacy by tracking the user device, and, as of today, users do not have any means to prevent such privacy attacks other than turning off the device. We propose RF-Veil, a radiometric fingerprinting solution that not only is robust against impersonation attacks but also protects user privacy by obfuscating the radiometric fingerprint of the transmitter for non-legitimate receivers. Specifically, we introduce a randomized pattern of phase errors to the transmitted signal such that only the intended receiver can extract the original fingerprint of the transmitter. In a series of experiments and analyses, we expose the vulnerability of adopting naive randomization to statistical attacks and introduce countermeasures. Finally, we show the efficacy of RF-Veil experimentally in protecting user privacy and enhancing security. More importantly, our proposed solution allows communicating with other devices, which do not employ RF-Veil.
Feature Selection based on Principal Component Analysis for Underwater Source Localization by Deep Learning
Venue: arXiv cs.SD 2020
Year: 2020

In this paper, we propose an interpretable feature selection method based on principal component analysis (PCA) and principal component regression (PCR), which can extract important features for underwater source localization by only introducing the source location without other prior information. This feature selection method is combined with a two-step framework for underwater source localization based on the semi-supervised learning scheme. In the framework, the first step utilizes a convolutional autoencoder to extract the latent features from the whole available dataset. The second step performs source localization via an encoder multi-layer perceptron (MLP) trained on a limited labeled portion of the dataset. The proposed approach has been validated on the public dataset SwllEx-96 Event S5. The result shows the framework has appealing accuracy and robustness on the unseen data, especially when the number of data used to train gradually decreases. After feature selection, not only the training stage has a 95\% acceleration but the performance of the framework becomes more robust on the depth and more accurate when the number of labeled data used to train is extremely limited.