arXiv subjects

Xiao Huang

Publications and source records attributed to Xiao Huang.

153 records · Page 9Linked to original sources

arXiv2019

A Two-Stage Stochastic Programming Model for Car-Sharing Problem using Kernel Density Estimation

Car-sharing problem is a popular research field in sharing economy. In this paper, we investigate the car-sharing re-balancing problem under uncertain demands. An innovative framework that integrates a non-parametric approach - kernel density estimation (KDE) and a two-stage stochastic programming (SP) model are proposed. Specifically, the probability distributions are derived from New York taxi trip data sets by KDE, which is used as the input uncertain parameters for SP. Additionally, the car-sharing problem is formulated as a two-stage SP model which aims to maximize the overall profit. Meanwhile, a Monte Carlo method called sample average approximation (SAA) and Benders decomposition algorithm is introduced to solve the large-scale optimization model. Finally, the experimental validations show that the proposed framework outperforms the existing works in terms of outcomes.

math.OC↗

arXiv2019

Auto-GNN: Neural Architecture Search of Graph Neural Networks

Graph neural networks (GNN) has been successfully applied to operate on the graph-structured data. Given a specific scenario, rich human expertise and tremendous laborious trials are usually required to identify a suitable GNN architecture. It is because the performance of a GNN architecture is significantly affected by the choice of graph convolution components, such as aggregate function and hidden dimension. Neural architecture search (NAS) has shown its potential in discovering effective deep architectures for learning tasks in image and language modeling. However, existing NAS algorithms cannot be directly applied to the GNN search problem. First, the search space of GNN is different from the ones in existing NAS work. Second, the representation learning capacity of GNN architecture changes obviously with slight architecture modifications. It affects the search efficiency of traditional search methods. Third, widely used techniques in NAS such as parameter sharing might become unstable in GNN. To bridge the gap, we propose the automated graph neural networks (AGNN) framework, which aims to find an optimal GNN architecture within a predefined search space. A reinforcement learning based controller is designed to greedily validate architectures via small steps. AGNN has a novel parameter sharing strategy that enables homogeneous architectures to share parameters, based on a carefully-designed homogeneity definition. Experiments on real-world benchmark datasets demonstrate that the GNN architecture identified by AGNN achieves the best performance, comparing with existing handcrafted models and tradistional search methods.

cs.LG↗

arXiv2019

A Multimodal Vision Sensor for Autonomous Driving

This paper describes a multimodal vision sensor that integrates three types of cameras, including a stereo camera, a polarization camera and a panoramic camera. Each sensor provides a specific dimension of information: the stereo camera measures depth per pixel, the polarization obtains the degree of polarization, and the panoramic camera captures a 360-degree landscape. Data fusion and advanced environment perception could be built upon the combination of sensors. Designed especially for autonomous driving, this vision sensor is shipped with a robust semantic segmentation network. In addition, we demonstrate how cross-modal enhancement could be achieved by registering the color image and the polarization image. An example of water hazard detection is given. To prove the multimodal vision sensor's compatibility with different devices, a brief runtime performance analysis is carried out.

eess.IV↗

arXiv2019

Panoramic Annular Localizer: Tackling the Variation Challenges of Outdoor Localization Using Panoramic Annular Images and Active Deep Descriptors

Visual localization is an attractive problem that estimates the camera localization from database images based on the query image. It is a crucial task for various applications, such as autonomous vehicles, assistive navigation and augmented reality. The challenging issues of the task lie in various appearance variations between query and database images, including illumination variations, dynamic object variations and viewpoint variations. In order to tackle those challenges, Panoramic Annular Localizer into which panoramic annular lens and robust deep image descriptors are incorporated is proposed in this paper. The panoramic annular images captured by the single camera are processed and fed into the NetVLAD network to form the active deep descriptor, and sequential matching is utilized to generate the localization result. The experiments carried on the public datasets and in the field illustrate the validation of the proposed system.

cs.CV↗

arXiv2019

Multi-Label Adversarial Perturbations

Adversarial examples are delicately perturbed inputs, which aim to mislead machine learning models towards incorrect outputs. While most of the existing work focuses on generating adversarial perturbations in multi-class classification problems, many real-world applications fall into the multi-label setting in which one instance could be associated with more than one label. For example, a spammer may generate adversarial spams with malicious advertising while maintaining the other labels such as topic labels unchanged. To analyze the vulnerability and robustness of multi-label learning models, we investigate the generation of multi-label adversarial perturbations. This is a challenging task due to the uncertain number of positive labels associated with one instance, as well as the fact that multiple labels are usually not mutually exclusive with each other. To bridge this gap, in this paper, we propose a general attacking framework targeting on multi-label classification problem and conduct a premier analysis on the perturbations for deep neural networks. Leveraging the ranking relationships among labels, we further design a ranking-based framework to attack multi-label ranking algorithms. We specify the connection between the two proposed frameworks and separately design two specific methods grounded on each of them to generate targeted multi-label perturbations. Experiments on real-world multi-label image classification and ranking problems demonstrate the effectiveness of our proposed frameworks and provide insights of the vulnerability of multi-label deep learning models under diverse targeted attacking strategies. Several interesting findings including an unpolished defensive strategy, which could potentially enhance the interpretability and robustness of multi-label deep learning models, are further presented and discussed at the end.

cs.LG↗

arXiv2018

A General Multi-agent Epistemic Planner Based on Higher-order Belief Change

In recent years, multi-agent epistemic planning has received attention from both dynamic logic and planning communities. Existing implementations of multi-agent epistemic planning are based on compilation into classical planning and suffer from various limitations, such as generating only linear plans, restriction to public actions, and incapability to handle disjunctive beliefs. In this paper, we propose a general representation language for multi-agent epistemic planning where the initial KB and the goal, the preconditions and effects of actions can be arbitrary multi-agent epistemic formulas, and the solution is an action tree branching on sensing results. To support efficient reasoning in the multi-agent KD45 logic, we make use of a normal form called alternating cover disjunctive formulas (ACDFs). We propose basic revision and update algorithms for ACDFs. We also handle static propositional common knowledge, which we call constraints. Based on our reasoning, revision and update algorithms, adapting the PrAO algorithm for contingent planning from the literature, we implemented a multi-agent epistemic planner called MEPK. Our experimental results show the viability of our approach.

cs.AI↗

arXiv2015

Index Coding and Network Coding via Rank Minimization

Index codes reduce the number of bits broadcast by a wireless transmitter to a number of receivers with different demands and with side information. It is known that the problem of finding optimal linear index codes is NP-hard. We investigate the performance of different heuristics based on rank minimization and matrix completion methods, such as alternating projections and alternating minimization, for constructing linear index codes over the reals. As a summary of our results, the alternating projections method gives the best results in terms of minimizing the number of broadcast bits and convergence rate and leads to up to 13% savings in average communication cost compared to graph coloring algorithms studied in the literature. Moreover, we describe how the proposed methods can be used to construct linear network codes for non-multicast networks. Our computer code is available online.

cs.IT↗

arXiv2014

A Universal, Rapid Method for Clean Transfer of Nanostructures onto Various Substrates

Transfer and integration of nanostructures onto target substrates is the prerequisite for their fundamental studies and practical applications. Conventional transfer techniques that involve stamping, lift-off and/or striping suffer from the process-specific drawbacks, such as the requirement for chemical etchant or high-temperature annealing and the introduction of surface discontinuities and/or contaminations that can greatly hinder the properties and functions of the transferred materials. Herein, we report a universal and rapid transfer method implementable at mild conditions. Nanostructures with various dimensionalities (i.e. nanoparticles, nanowires and nanosheets) and surface properties (i.e. hydrophilic and hydrophobic) can be facilely transferred to diverse substrates including hydrophilic, hydrophobic and flexible surfaces with good fidelity. Importantly, our method ensures the rapid and clean transfer of two-dimensional (2D) materials, and allows for the facile fabrication of vertical heterostructures with various compositions used for electronic devices. We believe that our method can facilitate the development of nano-electronics by accelerating the clean transfer and integration of low-dimensional materials into multidimensional structures.

cond-mat.mtrl-sci↗

arXiv2013

Rapid and reliable thickness identification of two-dimensional nanosheets using optical microscopy

The physical and electronic properties of ultrathin two-dimensional (2D) layered nanomaterials are highly related to their thickness. Therefore, the rapid and accurate identification of single- and few- to multi-layer nanosheets is essential to their fundamental study and practical applications. Here, a universal optical method has been developed for simple, rapid and reliable identification of single- to quindecuple-layer (1L-15L) 2D nanosheets, including graphene, MoS2, WSe2 and TaS2, on Si substrates coated with 90 nm or 300 nm SiO2. The optical contrast differences between the substrates and 2D nanosheets with different layer numbers were collected and tabulated, serving as a standard reference, from which the layer number of a given nanosheet can be readily and reliably determined without using complex calculation nor expensive instrument. Our general optical identification method will facilitate the thickness-dependent study of various 2D nanomaterials, and expedite their research toward practical applications.

cond-mat.mtrl-sci↗