arXiv subjects

Jie Chen

Publications and source records attributed to Jie Chen.

At least 595 records · Page 33Linked to original sources

arXiv2020

A generalized decay law for particle- and wave-like thermal phonons

Our direct atomic simulations reveal that a thermally activated phonon mode involves a large population of elastic wavepackets. These excitations are characterized by a wide distribution of lifetimes and coherence times expressing particle- and wave-like natures. In agreement with direct simulations, our theoretical derivation yields a generalized law for the decay of the phonon number taking into account coherent effects. Before the conventional exponential decay due to phonon-phonon scattering, this law introduces a delay proportional to the square of the coherence time. This additional regime leads to a moderate increase in relaxation times and thermal conductivity. This work opens new horizons in the understanding of the origin and the treatment of thermal phonons.

cond-mat.mes-hall↗

arXiv2020

Scaling features in the spreading of COVID-19

Since the outbreak of COVID-19, many data analyses have been done. Some of them are based on the classical epidemiological approach that assumes an exponential growth, but a few studies report that a power-law scaling may provide a better fit to the currently available data. Hereby, we examine the data in China (01/20/2020--02/24/2020), and indeed find that the growth closely follows a power-law kinetics over a significantly wide time period. The exponents are $2.48(20)$, $2.21(6)$ and $4.26(12)$ for the number of confirmed infections, deaths and cured cases, respectively, indicating an underlying small-world network structure in the pandemic. While no obvious deviations from the power-law growth can be seen yet for the number of deaths and cured cases, negative deviations have clearly appeared in the number of infections, particularly that for the region outside Hubei. This suggests the beginning of the slowing-down of the virus spreading due to the huge containment effort. Meanwhile, we find that despite the dramatic difference in magnitudes, the growth kinetics of the infection number exhibits much similarity for Hubei province and the region outside Hubei. On this basis, in log-log plot, we rescale the infection number for the region outside Hubei such that it overlaps as much as possible with the total infection number in China, from which an approximate extrapolation yields the maximum of the pandemic around March 3, 2020, with the number of infections about $83,000$. Further, by analyzing the kinetics of the mortality in log-log scale, we obtains a rough estimate that near March 3, the death rate of COVID-19 would be about $4.7\%\thicksim 5.0\%$ for Hubei province and $0.7\%\thicksim1.0\%$ for the region outside Hubei. We emphasize that our predictions may be quantitatively unreliable, since the data analysis is purely empirical and various assumptions are used.

physics.soc-ph↗

arXiv2020

Study of polycrystalline bulk Sr$_3$OsO$_6$ double-perovskite insulator: comparison with 1000 K ferromagnetic epitaxial films

Polycrystalline Sr$_3$OsO$_6$, which is an ordered double-perovskite insulator, is synthesized via solid-state reaction under high-temperature and high-pressure conditions of 1200 $^\circ$C and 6 GPa. The synthesis enables us to conduct a comparative study of the bulk form of Sr$_3$OsO$_6$ toward revealing the driving mechanism of 1000 K ferromagnetism, which has recently been discovered for epitaxially grown Sr$_3$OsO$_6$ films. Unlike the film, the bulk is dominated by antiferromagnetism rather than ferromagnetism. Therefore, robust ferromagnetic order appears only when Sr$_3$OsO$_6$ is under the influence of interfaces. A specific heat capacity of 39.6(9) 10$^{-3}$ J mol$^{-1}$ K$^{-2}$ is found at low temperatures ($<$17 K). This value is remarkably high, suggesting the presence of possible fermionic-like excitations at the magnetic ground state. Although the bulk and film forms of Sr$_3$OsO$_6$ share the same lattice basis and electrically insulating state, the magnetism is entirely different between them.

cond-mat.mtrl-sci↗

arXiv2020

Linearly Convergent Algorithm with Variance Reduction for Distributed Stochastic Optimization

This paper considers a distributed stochastic strongly convex optimization, where agents connected over a network aim to cooperatively minimize the average of all agents' local cost functions. Due to the stochasticity of gradient estimation and distributedness of local objective, fast linearly convergent distributed algorithms have not been achieved yet. This work proposes a novel distributed stochastic gradient tracking algorithm with variance reduction, where the local gradients are estimated by an increasing batch-size of sampled gradients. With an undirected connected communication graph and a geometrically increasing batch-size, the iterates are shown to converge in mean to the optimal solution at a geometric rate (achieving linear convergence). The iteration, communication, and oracle complexity for obtaining an $ε$-optimal solution are established as well. Particulary, the communication complexity is $\mathcal{O}(\ln (1/ε))$ while the oracle complexity (number of sampled gradients) is $\mathcal{O}(1/ε^2)$, which is of the same order as that of centralized approaches. Hence, the proposed scheme is communication-efficient without requiring extra sampled gradients. Numerical simulations are given to demonstrate the theoretic results.

math.OC↗

arXiv2020

Affine Combination of Diffusion Strategies over Networks

Diffusion adaptation is a powerful strategy for distributed estimation and learning over networks. Motivated by the concept of combining adaptive filters, this work proposes a combination framework that aggregates the operation of multiple diffusion strategies for enhanced performance. By assigning a combination coefficient to each node, and using an adaptation mechanism to minimize the network error, we obtain a combined diffusion strategy that benefits from the best characteristics of all component strategies simultaneously in terms of excess-mean-square error (EMSE). Analyses of the universality are provided to show the superior performance of affine combination scheme and to characterize its behavior in the mean and mean-square sense. Simulation results are presented to demonstrate the effectiveness of the proposed strategies, as well as the accuracy of theoretical findings.

eess.SP↗

arXiv2020

Convolution Neural Network Architecture Learning for Remote Sensing Scene Classification

Remote sensing image scene classification is a fundamental but challenging task in understanding remote sensing images. Recently, deep learning-based methods, especially convolutional neural network-based (CNN-based) methods have shown enormous potential to understand remote sensing images. CNN-based methods meet with success by utilizing features learned from data rather than features designed manually. The feature-learning procedure of CNN largely depends on the architecture of CNN. However, most of the architectures of CNN used for remote sensing scene classification are still designed by hand which demands a considerable amount of architecture engineering skills and domain knowledge, and it may not play CNN's maximum potential on a special dataset. In this paper, we proposed an automatically architecture learning procedure for remote sensing scene classification. We designed a parameters space in which every set of parameters represents a certain architecture of CNN (i.e., some parameters represent the type of operators used in the architecture such as convolution, pooling, no connection or identity, and the others represent the way how these operators connect). To discover the optimal set of parameters for a given dataset, we introduced a learning strategy which can allow efficient search in the architecture space by means of gradient descent. An architecture generator finally maps the set of parameters into the CNN used in our experiments.

cs.CV↗

arXiv2020

Embedding Compression with Isotropic Iterative Quantization

Continuous representation of words is a standard component in deep learning-based NLP models. However, representing a large vocabulary requires significant memory, which can cause problems, particularly on resource-constrained platforms. Therefore, in this paper we propose an isotropic iterative quantization (IIQ) approach for compressing embedding vectors into binary ones, leveraging the iterative quantization technique well established for image retrieval, while satisfying the desired isotropic property of PMI based models. Experiments with pre-trained embeddings (i.e., GloVe and HDC) demonstrate a more than thirty-fold compression ratio with comparable and sometimes even improved performance over the original real-valued embedding vectors.

cs.CL↗

arXiv2020

Ro-SOS: Metric Expression Network (MEnet) for Robust Salient Object Segmentation

Although deep CNNs have brought significant improvement to image saliency detection, most CNN based models are sensitive to distortion such as compression and noise. In this paper, we propose an end-to-end generic salient object segmentation model called Metric Expression Network (MEnet) to deal with saliency detection with the tolerance of distortion. Within MEnet, a new topological metric space is constructed, whose implicit metric is determined by the deep network. As a result, we manage to group all the pixels in the observed image semantically within this latent space into two regions: a salient region and a non-salient region. With this architecture, all feature extractions are carried out at the pixel level, enabling fine granularity of output boundaries of the salient objects. What's more, we try to give a general analysis for the noise robustness of the network in the sense of Lipschitz and Jacobian literature. Experiments demonstrate that robust salient maps facilitating object segmentation can be generated by the proposed metric. Tests on several public benchmarks show that MEnet has achieved desirable performance. Furthermore, by direct computation and measuring the robustness, the proposed method outperforms previous CNN-based methods on distorted inputs.

cs.CV↗

arXiv2020

Ultralow thermal conductivity from transverse acoustic phonon suppression in distorted crystalline α-MgAgSb

Low thermal conductivity is favorable for preserving the temperature gradient between the two ends of a thermoelectric material in order to ensure continuous electron current generation. In high-performance thermoelectric materials, there are two main low thermal conductivity mechanisms: the phonon anharmonic in PbTe and SnSe and phonon scattering resulting from the dynamic disorder in AgCrSe2 and CuCrSe2, which have been successfully revealed by inelastic neutron scattering. Using neutron scattering and ab initio calculations, we report here a mechanism of static local structure distortion combined with phonon-anharmonic-induced ultralow lattice thermal conductivity in α-MgAgSb. Since the transverse acoustic phonons are almost fully scattered by the compound's intrinsic distorted rocksalt sublattice, the heat is mainly transported by the longitudinal acoustic phonons. The ultralow thermal conductivity in α-MgAgSb is attributed to its atomic dynamics being altered by the structure distortion, which presents a possible microscopic route to enhance the performance of similar thermoelectric materials.

cond-mat.mtrl-sci↗

arXiv2020

Secure State Estimation with Byzantine Sensors: A Probabilistic Approach

This paper studies static state estimation in multi-sensor settings, with a caveat that an unknown subset of the sensors are compromised by an adversary, whose measurements can be manipulated arbitrarily. The attacker is able to compromise $q$ out of $m$ sensors. A new performance metric, which quantifies the asymptotic decay rate for the probability of having an estimation error larger than $δ$, is proposed. We develop an optimal estimator for the new performance metric with a fixed $δ$, which is the Chebyshev center of a union of ellipsoids. We further provide an estimator that is optimal for every $δ$, for the special case where the sensors are homogeneous. Numerical examples are given to elaborate the results.

eess.SY↗

arXiv2020

Cooperative Pursuit with Multi-Pursuer and One Faster Free-moving Evader

This paper addresses a multi-pursuer single-evader pursuit-evasion game where the free-moving evader moves faster than the pursuers. Most of the existing works impose constraints on the faster evader such as limited moving area and moving direction. When the faster evader is allowed to move freely without any constraint, the main issues are how to form an encirclement to trap the evader into the capture domain, how to balance between forming an encirclement and approaching the faster evader, and what conditions make the capture possible. In this paper, a distributed pursuit algorithm is proposed to enable pursuers to form an encirclement and approach the faster evader. An algorithm that balances between forming an encirclement and approaching the faster evader is proposed. Moreover, sufficient capture conditions are derived based on the initial spatial distribution and the speed ratios of the pursuers and the evader. Simulation and experimental results on ground robots validate the effectiveness and practicability of the proposed method.

eess.SY↗

arXiv2020

RSI-CB: A Large Scale Remote Sensing Image Classification Benchmark via Crowdsource Data

In recent years, deep convolutional neural network (DCNN) has seen a breakthrough progress in natural image recognition because of three points: universal approximation ability via DCNN, large-scale database (such as ImageNet), and supercomputing ability powered by GPU. The remote sensing field is still lacking a large-scale benchmark compared to ImageNet and Place2. In this paper, we propose a remote sensing image classification benchmark (RSI-CB) based on massive, scalable, and diverse crowdsource data. Using crowdsource data, such as Open Street Map (OSM) data, ground objects in remote sensing images can be annotated effectively by points of interest, vector data from OSM, or other crowdsource data. The annotated images can be used in remote sensing image classification tasks. Based on this method, we construct a worldwide large-scale benchmark for remote sensing image classification. This benchmark has two sub-datasets with 256 by 256 and 128 by 128 sizes because different DCNNs require different image sizes. The former contains 6 categories with 35 subclasses of more than 24,000 images. The latter contains 6 categories with 45 subclasses of more than 36,000 images. This classification system of ground objects is defined according to the national standard of land-use classification in China and is inspired by the hierarchy mechanism of ImageNet. Finally, we conduct many experiments to compare RSI-CB with the SAT-4, SAT-6, and UC-Merced datasets on handcrafted features, such as scale-invariant feature transform, color histogram, local binary patterns, and GIST, and classical DCNN models, such as AlexNet, VGGNet, GoogLeNet, and ResNet.

cs.CV↗

arXiv2020

Adaptively Aligned Image Captioning via Adaptive Attention Time

Recent neural models for image captioning usually employ an encoder-decoder framework with an attention mechanism. However, the attention mechanism in such a framework aligns one single (attended) image feature vector to one caption word, assuming one-to-one mapping from source image regions and target caption words, which is never possible. In this paper, we propose a novel attention model, namely Adaptive Attention Time (AAT), to align the source and the target adaptively for image captioning. AAT allows the framework to learn how many attention steps to take to output a caption word at each decoding step. With AAT, an image region can be mapped to an arbitrary number of caption words while a caption word can also attend to an arbitrary number of image regions. AAT is deterministic and differentiable, and doesn't introduce any noise to the parameter gradients. In this paper, we empirically show that AAT improves over state-of-the-art methods on the task of image captioning. Code is available at https://github.com/husthuaan/AAT.

cs.CV↗

arXiv2019

Weighted Sum-Rate Maximization for Reconfigurable Intelligent Surface Aided Wireless Networks

Reconfigurable intelligent surfaces (RIS) is a promising solution to build a programmable wireless environment via steering the incident signal in fully customizable ways with reconfigurable passive elements. In this paper, we consider a RIS-aided multiuser multiple-input single-output (MISO) downlink communication system. Our objective is to maximize the weighted sum-rate (WSR) of all users by joint designing the beamforming at the access point (AP) and the phase vector of the RIS elements, while both the perfect channel state information (CSI) setup and the imperfect CSI setup are investigated. For perfect CSI setup, a low-complexity algorithm is proposed to obtain the stationary solution for the joint design problem by utilizing the fractional programming technique. Then, we resort to the stochastic successive convex approximation technique and extend the proposed algorithm to the scenario wherein the CSI is imperfect. The validity of the proposed methods is confirmed by numerical results. In particular, the proposed algorithm performs quite well when the channel uncertainty is smaller than 10%.

eess.SP↗

arXiv2019

Stochastic Gradient Descent with Biased but Consistent Gradient Estimators

Stochastic gradient descent (SGD), which dates back to the 1950s, is one of the most popular and effective approaches for performing stochastic optimization. Research on SGD resurged recently in machine learning for optimizing convex loss functions and training nonconvex deep neural networks. The theory assumes that one can easily compute an unbiased gradient estimator, which is usually the case due to the sample average nature of empirical risk minimization. There exist, however, many scenarios (e.g., graphs) where an unbiased estimator may be as expensive to compute as the full gradient because training examples are interconnected. Recently, Chen et al. (2018) proposed using a consistent gradient estimator as an economic alternative. Encouraged by empirical success, we show, in a general setting, that consistent estimators result in the same convergence behavior as do unbiased ones. Our analysis covers strongly convex, convex, and nonconvex objectives. We verify the results with illustrative experiments on synthetic and real-world data. This work opens several new research directions, including the development of more efficient SGD updates with consistent estimators and the design of efficient training algorithms for large-scale graphs.

cs.LG↗

arXiv2019

A multi-label classification method using a hierarchical and transparent representation for paper-reviewer recommendation

Paper-reviewer recommendation task is of significant academic importance for conference chairs and journal editors. How to effectively and accurately recommend reviewers for the submitted papers is a meaningful and still tough task. In this paper, we propose a Multi-Label Classification method using a hierarchical and transparent Representation named Hiepar-MLC. Further, we propose a simple multi-label-based reviewer assignment MLBRA strategy to select the appropriate reviewers. It is interesting that we also explore the paper-reviewer recommendation in the coarse-grained granularity.

cs.IR↗

arXiv2019

CAG: A Real-time Low-cost Enhanced-robustness High-transferability Content-aware Adversarial Attack Generator

Deep neural networks (DNNs) are vulnerable to adversarial attack despite their tremendous success in many AI fields. Adversarial attack is a method that causes the intended misclassfication by adding imperceptible perturbations to legitimate inputs. Researchers have developed numerous types of adversarial attack methods. However, from the perspective of practical deployment, these methods suffer from several drawbacks such as long attack generating time, high memory cost, insufficient robustness and low transferability. We propose a Content-aware Adversarial Attack Generator (CAG) to achieve real-time, low-cost, enhanced-robustness and high-transferability adversarial attack. First, as a type of generative model-based attack, CAG shows significant speedup (at least 500 times) in generating adversarial examples compared to the state-of-the-art attacks such as PGD and C\&W. CAG only needs a single generative model to perform targeted attack to any targeted class. Because CAG encodes the label information into a trainable embedding layer, it differs from prior generative model-based adversarial attacks that use $n$ different copies of generative models for $n$ different targeted classes. As a result, CAG significantly reduces the required memory cost for generating adversarial examples. CAG can generate adversarial perturbations that focus on the critical areas of input by integrating the class activation maps information in the training process, and hence improve the robustness of CAG attack against the state-of-art adversarial defenses. In addition, CAG exhibits high transferability across different DNN classifier models in black-box attack scenario by introducing random dropout in the process of generating perturbations. Extensive experiments on different datasets and DNN models have verified the real-time, low-cost, enhanced-robustness, and high-transferability benefits of CAG.

cs.CV↗

arXiv2019

Scalable Variational Bayesian Kernel Selection for Sparse Gaussian Process Regression

This paper presents a variational Bayesian kernel selection (VBKS) algorithm for sparse Gaussian process regression (SGPR) models. In contrast to existing GP kernel selection algorithms that aim to select only one kernel with the highest model evidence, our proposed VBKS algorithm considers the kernel as a random variable and learns its belief from data such that the uncertainty of the kernel can be interpreted and exploited to avoid overconfident GP predictions. To achieve this, we represent the probabilistic kernel as an additional variational variable in a variational inference (VI) framework for SGPR models where its posterior belief is learned together with that of the other variational variables (i.e., inducing variables and kernel hyperparameters). In particular, we transform the discrete kernel belief into a continuous parametric distribution via reparameterization in order to apply VI. Though it is computationally challenging to jointly optimize a large number of hyperparameters due to many kernels being evaluated simultaneously by our VBKS algorithm, we show that the variational lower bound of the log-marginal likelihood can be decomposed into an additive form such that each additive term depends only on a disjoint subset of the variational variables and can thus be optimized independently. Stochastic optimization is then used to maximize the variational lower bound by iteratively improving the variational approximation of the exact posterior belief via stochastic gradient ascent, which incurs constant time per iteration and hence scales to big data. We empirically evaluate the performance of our VBKS algorithm on synthetic and massive real-world datasets.

cs.LG↗