Search arXiv⌕ Search

arXiv subjects

Wei Wu

Publications and source records attributed to Wei Wu.

At least 523 records · Page 29Linked to original sources
arXiv2018

Prolonged mixed phase induced by high pressure in MnRuP

Hexagonally structured MnRuP was studied under high pressure up to 35 GPa from 5 to 300 K using synchrotron X-ray diffraction. We observed that a partial phase transition from hexagonal to orthorhombic symmetry started at 11 GPa. The new and denser orthorhombic phase coexisted with its parent phase for an unusually long pressure range, ΔP ~ 50 GPa. We attribute this structural transformation to a magnetic origin, where a decisive criterion for the boundary of the mixed phase lays in the different distances between the Mn-Mn atoms. In addition, our theoretical study shows that the orthorhombic phase of MnRuP remains steady even at very high pressures up to ~ 250 GPa, when it should transform to a new tetragonal phase.

cond-mat.mtrl-sci↗
arXiv2018

SGM: Sequence Generation Model for Multi-label Classification

Multi-label classification is an important yet challenging task in natural language processing. It is more complex than single-label classification in that the labels tend to be correlated. Existing methods tend to ignore the correlations between labels. Besides, different parts of the text can contribute differently for predicting different labels, which is not considered by existing models. In this paper, we propose to view the multi-label classification task as a sequence generation problem, and apply a sequence generation model with a novel decoder structure to solve it. Extensive experimental results show that our proposed methods outperform previous work by a substantial margin. Further analysis of experimental results demonstrates that the proposed methods not only capture the correlations between labels, but also select the most informative words automatically when predicting different labels.

cs.CL↗
arXiv2018

Practical Block-wise Neural Network Architecture Generation

Convolutional neural networks have gained a remarkable success in computer vision. However, most usable network architectures are hand-crafted and usually require expertise and elaborate design. In this paper, we provide a block-wise network generation pipeline called BlockQNN which automatically builds high-performance networks using the Q-Learning paradigm with epsilon-greedy exploration strategy. The optimal network block is constructed by the learning agent which is trained sequentially to choose component layers. We stack the block to construct the whole auto-generated network. To accelerate the generation process, we also propose a distributed asynchronous framework and an early stop strategy. The block-wise generation brings unique advantages: (1) it performs competitive results in comparison to the hand-crafted state-of-the-art networks on image classification, additionally, the best network generated by BlockQNN achieves 3.54% top-1 error rate on CIFAR-10 which beats all existing auto-generate networks. (2) in the meanwhile, it offers tremendous reduction of the search space in designing networks which only spends 3 days with 32 GPUs, and (3) moreover, it has strong generalizability that the network built on CIFAR also performs well on a larger-scale ImageNet dataset.

cs.CV↗
arXiv2018

Learning Matching Models with Weak Supervision for Response Selection in Retrieval-based Chatbots

We propose a method that can leverage unlabeled data to learn a matching model for response selection in retrieval-based chatbots. The method employs a sequence-to-sequence architecture (Seq2Seq) model as a weak annotator to judge the matching degree of unlabeled pairs, and then performs learning with both the weak signals and the unlabeled data. Experimental results on two public data sets indicate that matching models get significant improvements when they are learned with the proposed method.

cs.CL↗
arXiv2018

Reply to "Comment on 'Modified quantum-speed-limit bounds for open quantum dynamics in quantum channels'"

The authors of the comment[Phys. Rev. A 97, 046101 (2018)] raise that the inconsistency in calculating some common quantum-speed-limit (QSL) bounds, which is presented in our paper [Phys. Rev. A 95, 052118 (2017)], does not exist in their paper [Phys. Rev. A 94, 052125 (2016)]. Therefore they insist that their criticism to some QSL bounds is still valid. We demonstrate all the QSL bounds mentioned in the comment are similar in essence. We also show the inconsistency which is presented in their original paper can not be used to support their criticism. Furthermore, we exhibit although the inconsistency presented in our paper is not a same one to which is presented by the authors of the comment, it exists and be unavoidable in their example. Accordingly, we believe the result in our paper is usable in numerical calculations.

quant-ph↗
arXiv2018

Wave-Field Shaping in Cavities by Tunable Metasurfaces

Cavities, because they trap waves for long times due to their reflecting walls, are used in a vast number of scientific domains. Indeed, in these closed media and due to interferences, the free space continuum of solutions becomes a discrete set of stationary eigenmodes. These enhanced stationary fields are commonly used in fundamental physics to increase wave-matter interactions. The eigenmodes and associated eigenfrequencies of a cavity are imposed by its geometrical properties through the boundary conditions. In this paper, we show that one can control the wave fields created by point sources inside cavities by tailoring only the boundaries of the cavities. This is achieved through the use of a tunable reflecting metasurface, which is part of the frontiers of the cavity, and can switch its boundary conditions from Dirichlet to Neumann. Based on the use of arrays of subwavelength resonators, a mathematical modeling of the physical mechanism underlying the concept of tunable metasurfaces is provided.

math.AP↗
arXiv2018

Topological order in the pseudogap metal

We compute the electronic Green's function of the topologically ordered Higgs phase of a SU(2) gauge theory of fluctuating antiferromagnetism on the square lattice. The results are compared with cluster extensions of dynamical mean field theory, and quantum Monte Carlo calculations, on the pseudogap phase of the strongly interacting hole-doped Hubbard model. Good agreement is found in the momentum, frequency, hopping, and doping dependencies of the spectral function and electronic self-energy. We show that lines of (approximate) zeros of the zero-frequency electronic Green's function are signs of the underlying topological order of the gauge theory, and describe how these lines of zeros appear in our theory of the Hubbard model. We also derive a modified, non-perturbative version of the Luttinger theorem that holds in the Higgs phase.

cond-mat.str-el↗
arXiv2018

Pseudogap and Fermi surface topology in the two-dimensional Hubbard model

One of the distinctive features of hole-doped cuprate superconductors is the onset of a `pseudogap' below a temperature $T^*$. Recent experiments suggest that there may be a connection between the existence of the pseudogap and the topology of the Fermi surface. Here, we address this issue by studying the two-dimensional Hubbard model with two distinct numerical methods. We find that the pseudogap only exists when the Fermi surface is hole-like and that, for a broad range of parameters, its opening is concomitant with a Fermi surface topology change from electron- to hole-like. We identify a common link between these observations: the pole-like feature of the electronic self-energy associated with the formation of the pseudogap is found to also control the degree of particle-hole asymmetry, and hence the Fermi surface topology transition. We interpret our results in the framework of an SU(2) gauge theory of fluctuating antiferromagnetism. We show that a mean-field treatment of this theory in a metallic state with U(1) topological order provides an explanation of this pole-like feature, and a good description of our numerical results. We discuss the relevance of our results to experiments on cuprates.

cond-mat.str-el↗
arXiv2018

IcoRating: A Deep-Learning System for Scam ICO Identification

Cryptocurrencies (or digital tokens, digital currencies, e.g., BTC, ETH, XRP, NEO) have been rapidly gaining ground in use, value, and understanding among the public, bringing astonishing profits to investors. Unlike other money and banking systems, most digital tokens do not require central authorities. Being decentralized poses significant challenges for credit rating. Most ICOs are currently not subject to government regulations, which makes a reliable credit rating system for ICO projects necessary and urgent. In this paper, we introduce IcoRating, the first learning--based cryptocurrency rating system. We exploit natural-language processing techniques to analyze various aspects of 2,251 digital currencies to date, such as white paper content, founding teams, Github repositories, websites, etc. Supervised learning models are used to correlate the life span and the price change of cryptocurrencies with these features. For the best setting, the proposed system is able to identify scam ICO projects with 0.83 precision. We hope this work will help investors identify scam ICOs and attract more efforts in automatically evaluating and analyzing ICO projects.

cs.CL↗
arXiv2018

End-to-end Flow Correlation Tracking with Spatial-temporal Attention

Discriminative correlation filters (DCF) with deep convolutional features have achieved favorable performance in recent tracking benchmarks. However, most of existing DCF trackers only consider appearance features of current frame, and hardly benefit from motion and inter-frame information. The lack of temporal information degrades the tracking performance during challenges such as partial occlusion and deformation. In this work, we focus on making use of the rich flow information in consecutive frames to improve the feature representation and the tracking accuracy. Firstly, individual components, including optical flow estimation, feature extraction, aggregation and correlation filter tracking are formulated as special layers in network. To the best of our knowledge, this is the first work to jointly train flow and tracking task in a deep learning framework. Then the historical feature maps at predefined intervals are warped and aggregated with current ones by the guiding of flow. For adaptive aggregation, we propose a novel spatial-temporal attention mechanism. Extensive experiments are performed on four challenging tracking datasets: OTB2013, OTB2015, VOT2015 and VOT2016, and the proposed method achieves superior results on these benchmarks.

cs.CV↗
arXiv2018

Thermodynamics analysis on BaF2 intermediate phase in solution-derived YBCO superconducting film deposition

In the YBa2Cu3O7-δ (YBCO) high temperature superconducting thin film fabrication via the chemical solution deposition method, BaF2 is an important intermediate phase during heat treatment. In this paper, BaF2 thermodynamics stability was analyzed through calculating the standard Gibbs free energy change (ΔGT) of the reactions related to other intermediate phases within the temperature range of 700-1000 K. Two thermodynamics methods, the Gibbs free energy function method and standard formation molar Gibbs free energy method, were utilized to obtain the ΔGT values. The formation priority of BaF2 relative to other intermediate phases were verified at higher temperatures, while the possibility of BaCO3 formation was found at 700 K.

cond-mat.supr-con↗
arXiv2018

Orthogonality-Promoting Distance Metric Learning: Convex Relaxation and Theoretical Analysis

Distance metric learning (DML), which learns a distance metric from labeled "similar" and "dissimilar" data pairs, is widely utilized. Recently, several works investigate orthogonality-promoting regularization (OPR), which encourages the projection vectors in DML to be close to being orthogonal, to achieve three effects: (1) high balancedness -- achieving comparable performance on both frequent and infrequent classes; (2) high compactness -- using a small number of projection vectors to achieve a "good" metric; (3) good generalizability -- alleviating overfitting to training data. While showing promising results, these approaches suffer three problems. First, they involve solving non-convex optimization problems where achieving the global optimal is NP-hard. Second, it lacks a theoretical understanding why OPR can lead to balancedness. Third, the current generalization error analysis of OPR is not directly on the regularizer. In this paper, we address these three issues by (1) seeking convex relaxations of the original nonconvex problems so that the global optimal is guaranteed to be achievable; (2) providing a formal analysis on OPR's capability of promoting balancedness; (3) providing a theoretical analysis that directly reveals the relationship between OPR and generalization performance. Experiments on various datasets demonstrate that our convex methods are more effective in promoting balancedness, compactness, and generalization, and are computationally more efficient, compared with the nonconvex methods.

cs.LG↗
arXiv2018

Achieving Direct Electrochemical Oxidation of Carbon below 600oC through a Novel Direct Carbon Fuel Cell

Direct carbon fuel cells (DCFCs) are highly efficient power generators fueled by abundant and cheap solid carbons. However, the limited formation of triple phase boundaries (TPBs) within fuel electrodes inhibits their performance even at high temperatures due to the limitation of mass transfer. It also results in low direct-utilization of the fuel. To address the challenges of low carbon oxidation activity and low carbon utilization simultaneously, a highly efficient, 3-D solid-state architected anode has been developed to enhance the performance of DCFCs below 600C. The cells with the 3-D textile anode, Gd:CeO2-Li/Na2CO3 composite electrolyte, and Sm0.5Sr0.5CoO3 (SSC) cathode have demonstrated excellent performance with maximum power densities of 143, 196, and 325 mW cm-2 at 500, 550, and 600C, respectively. At 500C, the cells could be operated steadily with a rated power density of ~0.13 W cm-2 at a constant current density of 0.15 A cm-2 with a carbon utilization over 86%. The significant improvement of the cell performance at such temperatures attributes to the high synergistic conduction of the composite electrolyte and the superior 3-D anode structure which offers more paths for carbon catalytic oxidation. Our results indicate the feasibility of direct electrochemical oxidation of solid carbon at 500-600C with a high carbon utilization, representing a promising strategy to develop 3-D architected electrodes for fuel cells and other electrochemical devices.

physics.app-ph↗
arXiv2018

Determinant Monte Carlo algorithms for dynamical quantities in fermionic systems

We introduce and compare three different Monte Carlo determinantal algorithms that allow one to compute dynamical quantities, such as the self-energy, of fermionic systems in their thermodynamic limit. We show that the most efficient approach expresses the sum of a factorial number of one-particle-irreducible diagrams as a recursive sum of determinants with exponential complexity. By comparing results for the two-dimensional Hubbard model with those obtained from state-of-the-art diagrammatic Monte Carlo, we show that we can reach higher perturbation orders and greater accuracy for the same computational effort.

cond-mat.str-el↗
arXiv2018

A Modified Sigma-Pi-Sigma Neural Network with Adaptive Choice of Multinomials

Sigma-Pi-Sigma neural networks (SPSNNs) as a kind of high-order neural networks can provide more powerful mapping capability than the traditional feedforward neural networks (Sigma-Sigma neural networks). In the existing literature, in order to reduce the number of the Pi nodes in the Pi layer, a special multinomial P_s is used in SPSNNs. Each monomial in P_s is linear with respect to each particular variable sigma_i when the other variables are taken as constants. Therefore, the monomials like sigma_i^n or sigma_i^n sigma_j with n>1 are not included. This choice may be somehow intuitive, but is not necessarily the best. We propose in this paper a modified Sigma-Pi-Sigma neural network (MSPSNN) with an adaptive approach to find a better multinomial for a given problem. To elaborate, we start from a complete multinomial with a given order. Then we employ a regularization technique in the learning process for the given problem to reduce the number of monomials used in the multinomial, and end up with a new SPSNN involving the same number of monomials (= the number of nodes in the Pi-layer) as in P_s. Numerical experiments on some benchmark problems show that our MSPSNN behaves better than the traditional SPSNN with P_s.

cs.LG↗
arXiv2018

Extreme Learning Machine with Local Connections

This paper is concerned with the sparsification of the input-hidden weights of ELM (Extreme Learning Machine). For ordinary feedforward neural networks, the sparsification is usually done by introducing certain regularization technique into the learning process of the network. But this strategy can not be applied for ELM, since the input-hidden weights of ELM are supposed to be randomly chosen rather than to be learned. To this end, we propose a modified ELM, called ELM-LC (ELM with local connections), which is designed for the sparsification of the input-hidden weights as follows: The hidden nodes and the input nodes are divided respectively into several corresponding groups, and an input node group is fully connected with its corresponding hidden node group, but is not connected with any other hidden node group. As in the usual ELM, the hidden-input weights are randomly given, and the hidden-output weights are obtained through a least square learning. In the numerical simulations on some benchmark problems, the new ELM-CL behaves better than the traditional ELM.

cs.LG↗
arXiv2018

Binary output layer of feedforward neural networks for solving multi-class classification problems

Considered in this short note is the design of output layer nodes of feedforward neural networks for solving multi-class classification problems with r (bigger than or equal to 3) classes of samples. The common and conventional setting of output layer, called "one-to-one approach" in this paper, is as follows: The output layer contains r output nodes corresponding to the r classes. And for an input sample of the i-th class, the ideal output is 1 for the i-th output node, and 0 for all the other output nodes. We propose in this paper a new "binary approach": Suppose r is (2^(q minus 1), 2^q] with q bigger than or equal to 2, then we let the output layer contain q output nodes, and let the ideal outputs for the r classes be designed in a binary manner. Numerical experiments carried out in this paper show that our binary approach does equally good job as, but uses less output nodes than, the traditional one-to-one approach.

cs.LG↗