arXiv subjects

Jie Chen

Publications and source records attributed to Jie Chen.

At least 649 records · Page 36Linked to original sources

arXiv2018

Off-center Rattling Triggers High-Temperature Thermal Transport in Thermoelectric lathrates: Non-Perturbative Approach

Lattice thermal conductivities $κ_{\rm L}$ of type-I clathrates encapsulating "off-center" guest atoms behave in a way that is sharply different from those of conventional crystals such as on-center type-I clathrates. The latter decreases with increasing temperature according to 1/$T$ above a few tens\,K. While, $κ_{\rm L}$ of off-center clathrates increase T-linearly above a few tens K. Further increasing temperature above $T\gtrsim$100 K, $κ_{\rm L}$ saturates without exhibiting appreciable T-dependence. In this temperature regime, the standard formulation of $κ_{\rm L}$ based on the perturbation theory is unfeasible. We herein present a theory of $κ_{\rm L}$ based on "non-perturbative" approach by taking into account the interaction between non-vibrational off-center rattling states of guest atoms and cage shells. It is remarkable that our theory shows excellent agreement with observed $κ_{\rm L}(T)$ for off-center clathrates in magnitudes, the cage volume $Ω$-dependence and T-dependence.

cond-mat.mtrl-sci↗

arXiv2018

Distributed Computation of Linear Matrix Equations: An Optimization Perspective

This paper investigates the distributed computation of the well-known linear matrix equation in the form of $AXB = F$, with the matrices A, B, X, and F of appropriate dimensions, over multi-agent networks from an optimization perspective. In this paper, we consider the standard distributed matrix-information structures, where each agent of the considered multi-agent network has access to one of the sub-block matrices of A, B, and F. To be specific, we first propose different decomposition methods to reformulate the matrix equations in standard structures as distributed constrained optimization problems by introducing substitutional variables; we show that the solutions of the reformulated distributed optimization problems are equivalent to least squares solutions to original matrix equations; and we design distributed continuous-time algorithms for the constrained optimization problems, even by using augmented matrices and a derivative feedback technique. Moreover, we prove the exponential convergence of the algorithms to a least squares solution to the matrix equation for any initial condition.

math.OC↗

arXiv2018

Explainable Neural Networks based on Additive Index Models

Machine Learning algorithms are increasingly being used in recent years due to their flexibility in model fitting and increased predictive performance. However, the complexity of the models makes them hard for the data analyst to interpret the results and explain them without additional tools. This has led to much research in developing various approaches to understand the model behavior. In this paper, we present the Explainable Neural Network (xNN), a structured neural network designed especially to learn interpretable features. Unlike fully connected neural networks, the features engineered by the xNN can be extracted from the network in a relatively straightforward manner and the results displayed. With appropriate regularization, the xNN provides a parsimonious explanation of the relationship between the features and the output. We illustrate this interpretable feature--engineering property on simulated examples.

stat.ML↗

arXiv2018

Locally Interpretable Models and Effects based on Supervised Partitioning (LIME-SUP)

Supervised Machine Learning (SML) algorithms such as Gradient Boosting, Random Forest, and Neural Networks have become popular in recent years due to their increased predictive performance over traditional statistical methods. This is especially true with large data sets (millions or more observations and hundreds to thousands of predictors). However, the complexity of the SML models makes them opaque and hard to interpret without additional tools. There has been a lot of interest recently in developing global and local diagnostics for interpreting and explaining SML models. In this paper, we propose locally interpretable models and effects based on supervised partitioning (trees) referred to as LIME-SUP. This is in contrast with the KLIME approach that is based on clustering the predictor space. We describe LIME-SUP based on fitting trees to the fitted response (LIM-SUP-R) as well as the derivatives of the fitted response (LIME-SUP-D). We compare the results with KLIME and describe its advantages using simulation and real data.

stat.ML↗

arXiv2018

Thermal Conductivity of Polymers and Their Nanocomposites

Polymers are usually considered as thermal insulators and their applications are limited by their low thermal conductivity. However, recent studies showed that certain polymers have surprisingly high thermal conductivity, some of which are comparable to that in poor metals or even silicon. In this review, we outline the experimental achievements and theoretical progress of thermal transport in polymers and their nanocomposites. The open questions and challenges of existing theories are discussed. Special attention is given to the mechanism of thermal transport, the enhancement of thermal conductivity in polymer nanocomposites/fibers, and their potential application as thermal interface materials.

cond-mat.mes-hall↗

arXiv2018

Optimal Weight Allocation of Dynamic Distribution Networks and Positive Semi-definiteness of Signed Laplacians

In this paper, we consider the robustness of a basic model of a dynamical distribution network. In the first problem, i.e., optimal weight allocation, we minimize the H-inf- norm of the dynamical distribution network subject to allocation of the weights on the edges. It is shown that this optimization problem can be formulated as a semi-definite program. Next we consider the semi-definiteness of the weighted graph Laplacian matrix with negative weights on the edges. A necessary and sufficient condition, using the effective resistance matrix, is established to guarantee the positive semi-definiteness of the Laplacian matrix. Furthermore, the bounded real lemma is derived for state-space symmetric systems.

math.OC↗

arXiv2018

Robust Video Content Alignment and Compensation for Clear Vision Through the Rain

Outdoor vision-based systems suffer from atmospheric turbulences, and rain is one of the worst factors for vision degradation. Current rain removal methods show limitations either for complex dynamic scenes, or under torrential rain with opaque occlusions. We propose a novel derain framework which applies superpixel (SP) segmentation to decompose the scene into depth consistent units. Alignment of scene contents are done at the SP level, which proves to be robust against rain occlusion interferences and fast camera motion. Two alignment output tensors, i.e., optimal temporal match tensor and sorted spatial-temporal match tensor, provide informative clues for the location of rain streaks and the occluded background contents. Different classical and novel methods such as Robust Principle Component Analysis and Convolutional Neural Networks are applied and compared for their respective advantages in efficiently exploiting the rich spatial-temporal features provided by the two tensors. Extensive evaluations show that advantage of up to 5dB is achieved on the scene restoration PSNR over state-of-the-art methods, and the advantage is especially obvious with highly complex and dynamic scenes. Visual evaluations show that the proposed framework is not only able to suppress heavy and opaque occluding rain streaks, but also large semi-transparent regional fluctuations and distortions.

cs.CV↗

arXiv2018

Room Temperature Continuous-wave Excited Biexciton Emission in CsPbBr3 Nanocrystals

Biexcitons are a manifestation of many-body excitonic interactions crucial for quantum information and quantum computation in the construction of coherent combinations of quantum states. However, due to their small binding energy and low transition efficiency, most biexcitons in conventional semiconductors exist either at cryogenic temperature or under femtosecond pulse laser excitation. Here we demonstrate room temperature, continuous wave driven biexciton states in CsPbBr3 perovskite nanocrystals through coupling with a plasmonic nanogap. The room temperature CsPbBr3 biexciton excitation fluence (~100 mW/cm2) is reduced by ~10^13 times in the Ag nanowire-film nanogaps. The giant enhancement of biexciton emission is driven by coherent biexciton-plasmon Fano interference. These results provide new pathways to develop high efficiency non-blinking single photon sources, entangled light sources and lasers based on biexciton states.

cond-mat.mes-hall↗

arXiv2018

Insight into the origin of Lithium/Nickel ions exchange in layered Li(NixMnyCoz)O2 cathode materials

In layered LiNixMnyCozO2 cathode material for lithium-ion batteries, the spins of transition metal (TM) ions construct a two-dimensional triangular networks, which can be considered as a simple case of geometrical frustration. By performing neutron powder diffraction experiments and magnetization measurements, we find that long-range magnetic order cannot be established in LiNixMnyCozO2 even at low temperature of 3 K. Remarkably, the frustration parameters of these compounds are estimated to be larger than 30, indicating the existence of strongly frustrated magnetic interactions between spins of TM ions. As frustration will inevitably give rise to lattice instability, the formation of Li/Ni exchange in LiNixMnyCozO2 will help to partially relieve the degeneracy of the frustrated magnetic lattice by forming a stable antiferromagnetic state in hexagonal sublattice with nonmagnetic ions located in centers of the hexagons. Moreover, Li/Ni exchange will introduce 180° superexchange interaction, which further relieves the magnetic frustration through bringing in new exchange paths. Thus, the variation of Li/Ni exchange ratio vs. TM mole fraction in LiNixMnyCozO2 with different compositions can be well understood and predicted in terms of magnetic frustration and superexchange interactions. This provides a unique viewpoint to study the Li/Ni ions exchange in layered Li(NixMnyCoz)O2 cathode materials.

cond-mat.mtrl-sci↗

arXiv2018

Adaptive Parameters Adjustment for Group Reweighted Zero-Attracting LMS

Group zero-attracting LMS and its reweighted form have been proposed for addressing system identification problems with structural group sparsity in the parameters to estimate. Both algorithms however suffer from a trade-off between sparsity degree and estimation bias and, in addition, between convergence speed and steady-state performance like most adaptive filtering algorithms. It is therefore necessary to properly set their step size and regularization parameter. Based on a model of their transient behavior, we introduce a variable-parameter variant of both algorithms to address this issue. By minimizing their mean-square deviation at each time instant, we obtain closed-form expressions of the optimal step size and regularization parameter. Simulation results illustrate the effectiveness of the proposed algorithms.

eess.SP↗

arXiv2018

Robust Video Content Alignment and Compensation for Rain Removal in a CNN Framework

Rain removal is important for improving the robustness of outdoor vision based systems. Current rain removal methods show limitations either for complex dynamic scenes shot from fast moving cameras, or under torrential rain fall with opaque occlusions. We propose a novel derain algorithm, which applies superpixel (SP) segmentation to decompose the scene into depth consistent units. Alignment of scene contents are done at the SP level, which proves to be robust towards rain occlusion and fast camera motion. Two alignment output tensors, i.e., optimal temporal match tensor and sorted spatial-temporal match tensor, provide informative clues for rain streak location and occluded background contents to generate an intermediate derain output. These tensors will be subsequently prepared as input features for a convolutional neural network to restore high frequency details to the intermediate output for compensation of mis-alignment blur. Extensive evaluations show that up to 5 dB reconstruction PSNR advantage is achieved over state-of-the-art methods. Visual inspection shows that much cleaner rain removal is achieved especially for highly dynamic scenes with heavy and opaque rainfall from a fast moving camera.

cs.CV↗

arXiv2018

Ultrafast lattice deformations studied by means of time-resolved electron and x-ray diffraction

Ultrafast lattice deformation of tens to hundreds of nanometer thick metallic crystals, after femtosecond laser excitation, was measured directly using 8.04 keV subpicosecond x-ray and 59 keV femtosecond electron pulses. Coherent phonons were generated in both single crystal and polycrystalline films. Lattice compression was observed within the first few picoseconds after laser irradiation in single crystal aluminum, which was attributed to the generation of a blast force and the propagation of elastic waves. The different time scale of lattice heating for tens and hundreds nanometer thick films are clearly distinguished by electron and x-ray pulse diffraction. The electron and lattice heating due to ultrafast deposition of photon energy was numerically simulated using the two-temperature model (TTM) and the results agreed with experimental observations. The ultrafast heating described by TTM was also discussed from an electrical circuit perspective, which may provide new insights on the possible connection between thermal and electrical processes. This study demonstrates that the combination of two complimentary ultrafast time-resolved methods, ultrafast x-ray and electron diffraction will provide a panoramic picture of the transient atomic motions and structure in crystals.

cond-mat.mtrl-sci↗

arXiv2018

Thermal Conductivity of Suspended Few-Layer MoS2

Modifying phonon thermal conductivity in nanomaterials is important not only for fundamental research but also for practical applications. However, the experiments on tailoring the thermal conductivity in nanoscale, especially in two-dimensional materials, are rare due to technical challenges. In this work, we demonstrate in-situ thermal conduction measurement of MoS2 and find that its thermal conductivity can be continuously tuned to a required value from crystalline to amorphous limits. The reduction of thermal conductivity is understood from phonon-defects scatterings that decrease the phonon transmission coefficient. Beyond a threshold, a sharp drop in thermal conductivity is observed, which is believed to be a crystalline-amorphous transition. Our method and results provide guidance for potential applications in thermoelectrics, photoelectronics, and energy harvesting where thermal management is critical with further integration and miniaturization.

cond-mat.mes-hall↗

arXiv2018

Zeroth-Order Online Alternating Direction Method of Multipliers: Convergence Analysis and Applications

In this paper, we design and analyze a new zeroth-order online algorithm, namely, the zeroth-order online alternating direction method of multipliers (ZOO-ADMM), which enjoys dual advantages of being gradient-free operation and employing the ADMM to accommodate complex structured regularizers. Compared to the first-order gradient-based online algorithm, we show that ZOO-ADMM requires $\sqrt{m}$ times more iterations, leading to a convergence rate of $O(\sqrt{m}/\sqrt{T})$, where $m$ is the number of optimization variables, and $T$ is the number of iterations. To accelerate ZOO-ADMM, we propose two minibatch strategies: gradient sample averaging and observation averaging, resulting in an improved convergence rate of $O(\sqrt{1+q^{-1}m}/\sqrt{T})$, where $q$ is the minibatch size. In addition to convergence analysis, we also demonstrate ZOO-ADMM to applications in signal processing, statistics, and machine learning.

stat.ML↗

arXiv2018

A Posteriori Error Estimate for Computing $\mathrm{tr}(f(A))$ by Using the Lanczos Method

An outstanding problem when computing a function of a matrix, $f(A)$, by using a Krylov method is to accurately estimate errors when convergence is slow. Apart from the case of the exponential function which has been extensively studied in the past, there are no well-established solutions to the problem. Often the quantity of interest in applications is not the matrix $f(A)$ itself, but rather, matrix-vector products or bilinear forms. When the computation related to $f(A)$ is a building block of a larger problem (e.g., approximately computing its trace), a consequence of the lack of reliable error estimates is that the accuracy of the computed result is unknown. In this paper, we consider the problem of computing $\mathrm{tr}(f(A))$ for a symmetric positive-definite matrix $A$ by using the Lanczos method and make two contributions: (i) we propose an error estimate for the bilinear form associated with $f(A)$, and (ii) an error estimate for the trace of $f(A)$. We demonstrate the practical usefulness of these estimates for large matrices and in particular, show that the trace error estimate is indicative of the number of accurate digits. As an application, we compute the log-determinant of a covariance matrix in Gaussian process analysis and underline the importance of error tolerance as a stopping criterion, as a means of bounding the number of Lanczos steps to achieve a desired accuracy.

math.NA↗

arXiv2018

Texture Classification in Extreme Scale Variations using GANet

Research in texture recognition often concentrates on recognizing textures with intraclass variations such as illumination, rotation, viewpoint and small scale changes. In contrast, in real-world applications a change in scale can have a dramatic impact on texture appearance, to the point of changing completely from one texture category to another. As a result, texture variations due to changes in scale are amongst the hardest to handle. In this work we conduct the first study of classifying textures with extreme variations in scale. To address this issue, we first propose and then reduce scale proposals on the basis of dominant texture patterns. Motivated by the challenges posed by this problem, we propose a new GANet network where we use a Genetic Algorithm to change the units in the hidden layers during network training, in order to promote the learning of more informative semantic texture patterns. Finally, we adopt a FVCNN (Fisher Vector pooling of a Convolutional Neural Network filter bank) feature encoder for global texture representation. Because extreme scale variations are not necessarily present in most standard texture databases, to support the proposed extreme-scale aspects of texture understanding we are developing a new dataset, the Extreme Scale Variation Textures (ESVaT), to test the performance of our framework. It is demonstrated that the proposed framework significantly outperforms gold-standard texture features by more than 10% on ESVaT. We also test the performance of our proposed approach on the KTHTIPS2b and OS datasets and a further dataset synthetically derived from Forrest, showing superior performance compared to the state of the art.

cs.CV↗

arXiv2018

Unsupervised Anomaly Detection via Variational Auto-Encoder for Seasonal KPIs in Web Applications

To ensure undisrupted business, large Internet companies need to closely monitor various KPIs (e.g., Page Views, number of online users, and number of orders) of its Web applications, to accurately detect anomalies and trigger timely troubleshooting/mitigation. However, anomaly detection for these seasonal KPIs with various patterns and data quality has been a great challenge, especially without labels. In this paper, we proposed Donut, an unsupervised anomaly detection algorithm based on VAE. Thanks to a few of our key techniques, Donut greatly outperforms a state-of-arts supervised ensemble approach and a baseline VAE approach, and its best F-scores range from 0.75 to 0.9 for the studied KPIs from a top global Internet company. We come up with a novel KDE interpretation of reconstruction for Donut, making it the first VAE-based anomaly detection algorithm with solid theoretical explanation.

cs.LG↗

arXiv2018

FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling

The graph convolutional networks (GCN) recently proposed by Kipf and Welling are an effective graph model for semi-supervised learning. This model, however, was originally designed to be learned with the presence of both training and test data. Moreover, the recursive neighborhood expansion across layers poses time and memory challenges for training with large, dense graphs. To relax the requirement of simultaneous availability of test data, we interpret graph convolutions as integral transforms of embedding functions under probability measures. Such an interpretation allows for the use of Monte Carlo approaches to consistently estimate the integrals, which in turn leads to a batched training scheme as we propose in this work---FastGCN. Enhanced with importance sampling, FastGCN not only is efficient for training but also generalizes well for inference. We show a comprehensive set of experiments to demonstrate its effectiveness compared with GCN and related models. In particular, training is orders of magnitude more efficient while predictions remain comparably accurate.

cs.LG↗