OpenRaiser/Intern-Atlas huggingface dataset:
One and Two Bit Message Passing for SC-LDPC Codes with Higher-Order Modulation
Venue: arXiv cs.IT 2019
Year: 2019

Low complexity decoding algorithms are necessary to meet data rate requirements in excess of 1 Tbps. In this paper, we study one and two bit message passing algorithms for belief propagation decoding of low-density parity-check (LDPC) codes and analyze them by density evolution. The variable nodes (VNs) exploit soft information from the channel output. To decrease the data flow, the messages exchanged between check nodes (CNs) and VNs are represented by one or two bits. The newly proposed quaternary message passing (QMP) algorithm is compared asymptotically and in finite length simulations to binary message passing (BMP) and ternary message passing (TMP) for spectrally efficient communication with higher-order modulation and probabilistic amplitude shaping (PAS). To showcase the potential for high throughput forward error correction, spatially coupled LDPC codes and a target spectral efficiency (SE) of 3 bits/QAM symbol are considered. Gains of about 0.7 dB and 0.1 dB are observed compared to BMP and TMP, respectively. The gap to unquantized belief propagation (BP) decoding is reduced to about 0.75 dB. For smaller code rates, the gain of QMP compared to TMP is more pronounced and amounts to 0.24 dB in the considered example.
Provable Approximations for Constrained $\ell_p$ Regression
Venue: arXiv cs.LG 2019
Year: 2019

The $\ell_p$ linear regression problem is to minimize $f(x)=||Ax-b||_p$ over $x\in\mathbb{R}^d$, where $A\in\mathbb{R}^{n\times d}$, $b\in \mathbb{R}^n$, and $p>0$. To avoid overfitting and bound $||x||_2$, the constrained $\ell_p$ regression minimizes $f(x)$ over every unit vector $x\in\mathbb{R}^d$. This makes the problem non-convex even for the simplest case $d=p=2$. Instead, ridge regression is used to minimize the Lagrange form $f(x)+λ||x||_2$ over $x\in\mathbb{R}^d$, which yields a convex problem in the price of calibrating the regularization parameter $λ>0$. We provide the first provable constant factor approximation algorithm that solves the constrained $\ell_p$ regression directly, for every constant $p,d\geq 1$. Using core-sets, its running time is $O(n \log n)$ including extensions for streaming and distributed (big) data. In polynomial time, it can handle outliers, $p\in (0,1)$ and minimize $f(x)$ over every $x$ and permutation of rows in $A$. Experimental results are also provided, including open source and comparison to existing software.
Flash Lightens Gray Pixels
Venue: arXiv cs.CV 2019
Year: 2019

In the real world, a scene is usually cast by multiple illuminants and herein we address the problem of spatial illumination estimation. Our solution is based on detecting gray pixels with the help of flash photography. We show that flash photography significantly improves the performance of gray pixel detection without illuminant prior, training data or calibration of the flash. We also introduce a novel flash photography dataset generated from the MIT intrinsic dataset.
Generative Collaborative Networks for Single Image Super-Resolution
Venue: arXiv cs.CV 2019
Year: 2019

A common issue of deep neural networks-based methods for the problem of Single Image Super-Resolution (SISR), is the recovery of finer texture details when super-resolving at large upscaling factors. This issue is particularly related to the choice of the objective loss function. In particular, recent works proposed the use of a VGG loss which consists in minimizing the error between the generated high resolution images and ground-truth in the feature space of a Convolutional Neural Network (VGG19), pre-trained on the very "large" ImageNet dataset. When considering the problem of super-resolving images with a distribution "far" from the ImageNet images distribution (\textit{e.g.,} satellite images), their proposed \textit{fixed} VGG loss is no longer relevant. In this paper, we present a general framework named \textit{Generative Collaborative Networks} (GCN), where the idea consists in optimizing the \textit{generator} (the mapping of interest) in the feature space of a \textit{features extractor} network. The two networks (generator and extractor) are \textit{collaborative} in the sense that the latter "helps" the former, by constructing discriminative and relevant features (not necessarily \textit{fixed} and possibly learned \textit{mutually} with the generator). We evaluate the GCN framework in the context of SISR, and we show that it results in a method that is adapted to super-resolution domains that are "far" from the ImageNet domain.
Fractional spectral graph wavelets and their applications
Venue: arXiv cs.CV 2019
Year: 2019

One of the key challenges in the area of signal processing on graphs is to design transforms and dictionaries methods to identify and exploit structure in signals on weighted graphs. In this paper, we first generalize graph Fourier transform (GFT) to graph fractional Fourier transform (GFRFT), which is then used to define a novel transform named spectral graph fractional wavelet transform (SGFRWT), which is a generalized and extended version of spectral graph wavelet transform (SGWT). A fast algorithm for SGFRWT is also derived and implemented based on Fourier series approximation. The potential applications of SGFRWT are also presented.
Dispersion of Mobile Robots: The Power of Randomness
Venue: arXiv cs.DC 2019
Year: 2019

We consider cooperation among insects, modeled as cooperation between mobile robots on a graph. Within this setting, we consider the problem of mobile robot dispersion on graphs. The study of mobile robots on a graph is an interesting paradigm with many interesting problems and applications. The problem of dispersion in this context, introduced by Augustine and Moses Jr., asks that $n$ robots, initially placed arbitrarily on an $n$ node graph, work together to quickly reach a configuration with exactly one robot at each node. Previous work on this problem has looked at the trade-off between the time to achieve dispersion and the amount of memory required by each robot. However, the trade-off was analyzed for \textit{deterministic algorithms} and the minimum memory required to achieve dispersion was found to be $Ω(\log n)$ bits at each robot. In this paper, we show that by harnessing the power of \textit{randomness}, one can achieve dispersion with $O(\log Δ)$ bits of memory at each robot, where $Δ$ is the maximum degree of the graph. Furthermore, we show a matching lower bound of $Ω(\log Δ)$ bits for any \textit{randomized algorithm} to solve dispersion. We further extend the problem to a general $k$-dispersion problem where $k> n$ robots need to disperse over $n$ nodes such that at most $\lceil k/n \rceil$ robots are at each node in the final configuration.
On the validation of complex systems operating in open contexts
Venue: arXiv cs.SE 2019
Year: 2019

In the recent years, there has been a rush towards highly autonomous systems operating in public environments, such as automated driving of road vehicles, passenger shuttle systems and mobile robots. These systems, operating in unstructured, public real-world environments (the operational design domain can be characterized as open context) per se bear a serious safety risk. The serious safety risk, the complexity of the necessary technical systems, the openness of the operational design domain and the regulatory situation pose a fundamental challenge to the automotive industry. Many different approaches to the validation of autonomous driving functions have been proposed over the course of the last years. However, although partly announced as the solution to the validation challenge, many of the praised approaches leave open crucial parts. To illustrate the contributions as well as the limitations of the individual approaches and providing strategies for 'viable' validation and approval of such systems, the first part of the paper gives an analysis of the fundamental challenges related to the valid design and operation of complex autonomous systems operating in open contexts. In the second part, we formalize the problem statement and provide algorithms for an iterative development and validation. In the last part we give a high level overview of a practical, holistic development process which we refer to as systematic, system view based approach to validation (in short sys2val) and comment on the contributions from ISO26262 and current state of ISO/PAS 21448 (SOTIF).
Polynomial-time Algorithms for Multiple-arm Identification with Full-bandit Feedback
Venue: arXiv cs.LG 2019
Year: 2019

We study the problem of stochastic combinatorial pure exploration (CPE), where an agent sequentially pulls a set of single arms (a.k.a. a super arm) and tries to find the best super arm. Among a variety of problem settings of the CPE, we focus on the full-bandit setting, where we cannot observe the reward of each single arm, but only the sum of the rewards. Although we can regard the CPE with full-bandit feedback as a special case of pure exploration in linear bandits, an approach based on linear bandits is not computationally feasible since the number of super arms may be exponential. In this paper, we first propose a polynomial-time bandit algorithm for the CPE under general combinatorial constraints and provide an upper bound of the sample complexity. Second, we design an approximation algorithm for the 0-1 quadratic maximization problem, which arises in many bandit algorithms with confidence ellipsoids. Based on our approximation algorithm, we propose novel bandit algorithms for the top-k selection problem, and prove that our algorithms run in polynomial time. Finally, we conduct experiments on synthetic and real-world datasets, and confirm the validity of our theoretical analysis in terms of both the computation time and the sample complexity.
Necessary and Sufficient Conditions for Passivity of Velocity-Sourced Impedance Control of Series Elastic Actuators
Venue: arXiv cs.RO 2019
Year: 2019

Series Elastic Actuation (SEA) has become prevalent in applications involving physical human-robot interaction as it provides considerable advantages over traditional stiff actuators in terms of stability robustness and fidelity of force control. Several impedance control architectures have been proposed for SEA. Among these alternatives, the cascaded controller with an inner-most velocity loop, an intermediate torque loop and an outer-most impedance loop is particularly favoured for its simplicity, robustness, and performance. In this paper, we derive the \emph{necessary and sufficient conditions} to ensure the passivity of this cascade-controller architecture for rendering two most common virtual impedance models. Based on the newly established passivity conditions, we provide non-conservative design guidelines to haptically display a null impedance and a pure spring while ensuring the passivity of interaction. We also demonstrate the importance of including physical damping in the actuator model during derivation of passivity conditions, when integral controllers are utilized. In particular, we show the adversary effect of physical damping on system passivity.
Unifying Ensemble Methods for Q-learning via Social Choice Theory
Venue: arXiv cs.AI 2019
Year: 2019

Ensemble methods have been widely applied in Reinforcement Learning (RL) in order to enhance stability, increase convergence speed, and improve exploration. These methods typically work by employing an aggregation mechanism over actions of different RL algorithms. We show that a variety of these methods can be unified by drawing parallels from committee voting rules in Social Choice Theory. We map the problem of designing an action aggregation mechanism in an ensemble method to a voting problem which, under different voting rules, yield popular ensemble-based RL algorithms like Majority Voting Q-learning or Bootstrapped Q-learning. Our unification framework, in turn, allows us to design new ensemble-RL algorithms with better performance. For instance, we map two diversity-centered committee voting rules, namely Single Non-Transferable Voting Rule and Chamberlin-Courant Rule, into new RL algorithms that demonstrate excellent exploratory behavior in our experiments.
A Replication Study: Machine Learning Models Are Capable of Predicting Sexual Orientation From Facial Images
Venue: arXiv cs.CV 2019
Year: 2019

Recent research used machine learning methods to predict a person's sexual orientation from their photograph (Wang and Kosinski, 2017). To verify this result, two of these models are replicated, one based on a deep neural network (DNN) and one on facial morphology (FM). Using a new dataset of 20,910 photographs from dating websites, the ability to predict sexual orientation is confirmed (DNN accuracy male 68%, female 77%, FM male 62%, female 72%). To investigate whether facial features such as brightness or predominant colours are predictive of sexual orientation, a new model based on highly blurred facial images was created. This model was also able to predict sexual orientation (male 63%, female 72%). The tested models are invariant to intentional changes to a subject's makeup, eyewear, facial hair and head pose (angle that the photograph is taken at). It is shown that the head pose is not correlated with sexual orientation. While demonstrating that dating profile images carry rich information about sexual orientation these results leave open the question of how much is determined by facial morphology and how much by differences in grooming, presentation and lifestyle. The advent of new technology that is able to detect sexual orientation in this way may have serious implications for the privacy and safety of gay men and women.
Phase-field modeling of fracture for quasi-brittle materials
Venue: arXiv cs.CE 2019
Year: 2019

This paper addresses the modeling of fracture in quasi-brittle materials using a phase-field approach to the description of crack topology. Within the computational mechanics community, several studies have treated the issue of modeling fracture using phase fields. Most of these studies have used an approach that implies the lack of a damage threshold. We herein explore an alternative model that includes a damage threshold and study how it compares with the most popular approach. The formulation is systematically explained within a rigorous variational framework. Subsequently, we present the corresponding three-dimensional finite element discretization that leads to a straightforward numerical implementation. Benchmark simulations in two dimensions and three dimensions are then presented. The results show that while an elastic stage and a damage threshold are ensured by the present model, good agreement with the results reported in the literature can be obtained, where such features are generally absent.
Improved algorithms for Correlation Clustering with local objectives
Venue: arXiv cs.DS 2019
Year: 2019

Correlation Clustering is a powerful graph partitioning model that aims to cluster items based on the notion of similarity between items. An instance of the Correlation Clustering problem consists of a graph $G$ (not necessarily complete) whose edges are labeled by a binary classifier as ``similar'' and ``dissimilar''. An objective which has received a lot of attention in literature is that of minimizing the number of disagreements: an edge is in disagreement if it is a ``similar'' edge and is present across clusters or if it is a ``dissimilar'' edge and is present within a cluster. Define the disagreements vector to be an $n$ dimensional vector indexed by the vertices, where the $v$-th index is the number of disagreements at vertex $v$. Recently, Puleo and Milenkovic (ICML '16) initiated the study of the Correlation Clustering framework in which the objectives were more general functions of the disagreements vector. In this paper, we study algorithms for minimizing $\ell_q$ norms $(q \geq 1)$ of the disagreements vector for both arbitrary and complete graphs. We present the first known algorithm for minimizing the $\ell_q$ norm of the disagreements vector on arbitrary graphs and also provide an improved algorithm for minimizing the $\ell_q$ norm $(q \geq 1)$ of the disagreements vector on complete graphs. We also study an alternate cluster-wise local objective introduced by Ahmadi, Khuller and Saha (IPCO '19), which aims to minimize the maximum number of disagreements associated with a cluster. We also present an improved ($2 + \varepsilon$) approximation algorithm for this objective. Finally, we compliment our algorithmic results for minimizing the $\ell_q$ norm of the disagreements vector with some hardness results.
Poster: On the Feasibility of Training Neural Networks with Visibly Watermarked Dataset
Venue: arXiv cs.CR 2019
Year: 2019

As there are increasing needs of sharing data for machine learning, there is growing attention for the owners of the data to claim the ownership. Visible watermarking has been an effective way to claim the ownership of visual data, yet the visibly watermarked images are not regarded as a primary source for learning visual recognition models due to the lost visual information by in the watermark and the possibility of an attack to remove the watermarks. To make the watermarked images better suited for machine learning with less risk of removal, we propose DeepStamp, a watermarking framework that, given a watermarking image and a trained network for image classification, learns to synthesize a watermarked image that are human-perceptible, robust to removals, and able to be used as training images for classification with minimal accuracy loss. To achieve the goal, we employ the generative multi-adversarial network (GMAN). In experiments with CIFAR10, we show that the DeepStamp learn to transform a watermark to be embedded in each image and the watermarked images can be used to train networks.
Cascaded Recurrent Neural Networks for Hyperspectral Image Classification
Venue: arXiv cs.CV 2019
Year: 2019

By considering the spectral signature as a sequence, recurrent neural networks (RNNs) have been successfully used to learn discriminative features from hyperspectral images (HSIs) recently. However, most of these models only input the whole spectral bands into RNNs directly, which may not fully explore the specific properties of HSIs. In this paper, we propose a cascaded RNN model using gated recurrent units (GRUs) to explore the redundant and complementary information of HSIs. It mainly consists of two RNN layers. The first RNN layer is used to eliminate redundant information between adjacent spectral bands, while the second RNN layer aims to learn the complementary information from non-adjacent spectral bands. To improve the discriminative ability of the learned features, we design two strategies for the proposed model. Besides, considering the rich spatial information contained in HSIs, we further extend the proposed model to its spectral-spatial counterpart by incorporating some convolutional layers. To test the effectiveness of our proposed models, we conduct experiments on two widely used HSIs. The experimental results show that our proposed models can achieve better results than the compared models.
Real-time tree search with pessimistic scenarios
Venue: arXiv cs.AI 2019
Year: 2019

Autonomous agents need to make decisions in a sequential manner, under partially observable environment, and in consideration of how other agents behave. In critical situations, such decisions need to be made in real time for example to avoid collisions and recover to safe conditions. We propose a technique of tree search where a deterministic and pessimistic scenario is used after a specified depth. Because there is no branching with the deterministic scenario, the proposed technique allows us to take into account the events that can occur far ahead in the future. The effectiveness of the proposed technique is demonstrated in Pommerman, a multi-agent environment used in a NeurIPS 2018 competition, where the agents that implement the proposed technique have won the first and third places.
Security Function Analysis on Performance of High-Speed Router Networking
Venue: arXiv cs.NI 2019
Year: 2019

A router is a device, in the computer networks, that is used to forward a data packet. Because of its function, the router becomes an important role in measuring the performance of computer networks. It needs to process the incoming data packets with high speed and minimum delay. Therefore, the router must have supported with a good security system as well. The activation of security applications and data encryptions in the router and firewall can consume the resources of CPU from the additional computations and they are able to affect the degradation of its performance. Furthermore, the security mechanisms in the router could bring a possibility of congestion in the networks during the ON/OFF functioning of security so it might influence the performance of the router in forwarding the data packets. A quantitative analysis based on queuing theory may be used to measure and predict as well as improve the performance of the router. In this paper, some scenarios of simulation will be carried out to analyze the effect of security function in the router with high-speed networks. The schemes use generalized exponential (GE-type) distribution to reflect bursty interarrival and service time at a router. The results show that the security function in the router could bring the decreasing of its performance.
Face Recognition Under Varying Blur, Illumination and Expression in an Unconstrained Environment
Venue: arXiv cs.CV 2019
Year: 2019

Face recognition system is one of the esteemed research areas in pattern recognition and computer vision as long as its major challenges. A few challenges in recognizing faces are blur, illumination, and varied expressions. Blur is natural while taking photographs using cameras, mobile phones, etc. Blur can be uniform and non-uniform. Usually non-uniform blur happens in images taken using handheld image devices. Distinguishing or handling a blurred image in a face recognition system is generally tough. Under varying lighting conditions, it is challenging to identify the person correctly. Diversified facial expressions such as happiness, sad, surprise, fear, anger changes or deforms the faces from normal images. Identifying faces with facial expressions is also a challenging task, due to the deformation caused by the facial expressions. To solve these issues, a pre-processing step was carried out after which Blur and Illumination-Robust Face recognition (BIRFR) algorithm was performed. The test image and training images with facial expression are transformed to neutral face using Facial expression removal (FER) peration. Every training image is transformed based on the optimal Transformation Spread Function (TSF), and illumination coefficients. Local Binary Pattern (LBP) features extracted from test image and transformed training image is used for classification.