arXiv subjects

Bo Han

Publications and source records attributed to Bo Han.

At least 379 records · Page 21Linked to original sources

arXiv2019

Scaling-up atomically thin coplanar semiconductor-metal circuitry via phase engineered chemical assembly

Two-dimensional (2D) layered semiconductors, with their ultimate atomic thickness, have shown promise to scale down transistors for modern integrated circuitry. However, the electrical contacts that connect these materials with external bulky metals are usually unsatisfactory, which limits the transistor performance. Recently, contacting 2D semiconductors using coplanar 2D conductors has shown promise in reducing the problematic high resistance contacts. However, many of these methods are not ideal for scaled production. Here, we report on the large-scale, spatially controlled chemical assembly of the integrated 2H-MoTe2 field-effect transistors (FETs) with coplanar metallic 1T' MoTe2 contacts via phase engineered approaches. We demonstrate that the heterophase FETs exhibit ohmic contact behavior with low contact resistance, resulting from the coplanar seamless contact between 2H and 1T' MoTe2 confirmed by transmission electron microscopy characterizations. The average mobility of the heterophase FETs was measured to be as high as 23 cm2 V-1 s-1 (comparable with those of exfoliated single crystals), due to the large 2H MoTe2 single-crystalline domain (486μm). By developing a patterned growth method, we realize the 1T' MoTe2 gated heterophase FET array whose components of channel, gate, and contacts are all 2D materials. Finally, we transfer the heterophase device array onto a flexible substrate and demonstrate the near-infrared photoresponse with high photoresponsivity (~1.02 A/W). Our study provides a basis for the large-scale application of phase-engineered coplanar MoTe2 semiconductors-meter structure in advanced electronics and optoelectronics.

cond-mat.mtrl-sci↗

arXiv2019

Revisiting Sample Selection Approach to Positive-Unlabeled Learning: Turning Unlabeled Data into Positive rather than Negative

In the early history of positive-unlabeled (PU) learning, the sample selection approach, which heuristically selects negative (N) data from U data, was explored extensively. However, this approach was later dominated by the importance reweighting approach, which carefully treats all U data as N data. May there be a new sample selection method that can outperform the latest importance reweighting method in the deep learning age? This paper is devoted to answering this question affirmatively---we propose to label large-loss U data as P, based on the memorization properties of deep networks. Since P data selected in such a way are biased, we develop a novel learning objective that can handle such biased P data properly. Experiments confirm the superiority of the proposed method.

cs.LG↗

arXiv2019

FasTer: Fast Tensor Completion with Nonconvex Regularization

Low-rank tensor completion problem aims to recover a tensor from limited observations, which has many real-world applications. Due to the easy optimization, the convex overlapping nuclear norm has been popularly used for tensor completion. However, it over-penalizes top singular values and lead to biased estimations. In this paper, we propose to use the nonconvex regularizer, which can less penalize large singular values, instead of the convex one for tensor completion. However, as the new regularizer is nonconvex and overlapped with each other, existing algorithms are either too slow or suffer from the huge memory cost. To address these issues, we develop an efficient and scalable algorithm, which is based on the proximal average (PA) algorithm, for real-world problems. Compared with the direct usage of PA algorithm, the proposed algorithm runs orders faster and needs orders less space. We further speed up the proposed algorithm with the acceleration technique, and show the convergence to critical points is still guaranteed. Experimental comparisons of the proposed approach are made with various other tensor completion approaches. Empirical results show that the proposed algorithm is very fast and can produce much better recovery performance.

cs.LG↗

arXiv2019

Generalized Wen-Zee Terms

Motivated by symmetry-protected topological phases (SPTs) with both spatial symmetry (e.g., lattice rotation) and internal symmetry (e.g., spin rotation), we propose a class of exotic topological terms, which generalize the well-known Wen-Zee topological terms of quantum Hall systems [X.-G. Wen and A. Zee, Phys. Rev. Lett. 69, 953 (1992)]. These generalized Wen-Zee terms are expressed as wedge product of spin connection and usual gauge fields (1-form or higher) in various dimensions. In order to probe SPT orders, we externally insert "symmetry twists" like domain walls of discrete internal symmetry and disclinations that are geometric defects with nontrivial Riemann curvature. Then, generalized Wen-Zee terms simply tells us how SPTs respond to those symmetry twists. Classifying these exotic topological terms thus leads to a complete classification and characterization of SPTs within the present framework. We also propose SPT low-energy field theories, from which generalized Wen-Zee terms are deduced as topological response actions. Following the Abstract of Wen-Zee paper, our work enriches alternative possibilities of condensed-matter realization of unification of electromagnetism and "gravity".

cond-mat.str-el↗

arXiv2018

DATELINE: Deep Plackett-Luce Model with Uncertainty Measurements

The aggregation of k-ary preferences is a historical and important problem, since it has many real-world applications, such as peer grading, presidential elections and restaurant ranking. Meanwhile, variants of Plackett-Luce model has been applied to aggregate k-ary preferences. However, there are two urgent issues still existing in the current variants. First, most of them ignore feature information. Namely, they consider k-ary preferences instead of instance-dependent k-ary preferences. Second, these variants barely consider the uncertainty in k-ary preferences provided by agnostic crowds. In this paper, we propose Deep plAckeTt-luce modEL wIth uNcertainty mEasurements (DATELINE), which can address both issues simultaneously. To address the first issue, we employ deep neural networks mapping each instance into its ranking score in Plackett-Luce model. Then, we present a weighted Plackett-Luce model to solve the second issue, where the weight is a dynamic uncertainty vector measuring the worker quality. More importantly, we provide theoretical guarantees for DATELINE to justify its robustness.

cs.LG↗

arXiv2018

Masking: A New Perspective of Noisy Supervision

It is important to learn various types of classifiers given training data with noisy labels. Noisy labels, in the most popular noise model hitherto, are corrupted from ground-truth labels by an unknown noise transition matrix. Thus, by estimating this matrix, classifiers can escape from overfitting those noisy labels. However, such estimation is practically difficult, due to either the indirect nature of two-step approaches, or not big enough data to afford end-to-end approaches. In this paper, we propose a human-assisted approach called Masking that conveys human cognition of invalid class transitions and naturally speculates the structure of the noise transition matrix. To this end, we derive a structure-aware probabilistic model incorporating a structure prior, and solve the challenges from structure extraction and structure alignment. Thanks to Masking, we only estimate unmasked noise transition probabilities and the burden of estimation is tremendously reduced. We conduct extensive experiments on CIFAR-10 and CIFAR-100 with three noise structures as well as the industrial-level Clothing1M with agnostic noise structure, and the results show that Masking can improve the robustness of classifiers significantly.

cs.LG↗

arXiv2018

Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labels

Deep learning with noisy labels is practically challenging, as the capacity of deep models is so high that they can totally memorize these noisy labels sooner or later during training. Nonetheless, recent studies on the memorization effects of deep neural networks show that they would first memorize training data of clean labels and then those of noisy labels. Therefore in this paper, we propose a new deep learning paradigm called Co-teaching for combating with noisy labels. Namely, we train two deep neural networks simultaneously, and let them teach each other given every mini-batch: firstly, each network feeds forward all data and selects some data of possibly clean labels; secondly, two networks communicate with each other what data in this mini-batch should be used for training; finally, each network back propagates the data selected by its peer network and updates itself. Empirical results on noisy versions of MNIST, CIFAR-10 and CIFAR-100 demonstrate that Co-teaching is much superior to the state-of-the-art methods in the robustness of trained deep models.

cs.LG↗

arXiv2018

Privacy-preserving Stochastic Gradual Learning

It is challenging for stochastic optimizations to handle large-scale sensitive data safely. Recently, Duchi et al. proposed private sampling strategy to solve privacy leakage in stochastic optimizations. However, this strategy leads to robustness degeneration, since this strategy is equal to the noise injection on each gradient, which adversely affects updates of the primal variable. To address this challenge, we introduce a robust stochastic optimization under the framework of local privacy, which is called Privacy-pREserving StochasTIc Gradual lEarning (PRESTIGE). PRESTIGE bridges private updates of the primal variable (by private sampling) with the gradual curriculum learning (CL). Specifically, the noise injection leads to the issue of label noise, but the robust learning process of CL can combat with label noise. Thus, PRESTIGE yields "private but robust" updates of the primal variable on the private curriculum, namely an reordered label sequence provided by CL. In theory, we reveal the convergence rate and maximum complexity of PRESTIGE. Empirical results on six datasets show that, PRESTIGE achieves a good tradeoff between privacy preservation and robustness over baselines.

cs.CR↗

arXiv2018

Matrix Co-completion for Multi-label Classification with Missing Features and Labels

We consider a challenging multi-label classification problem where both feature matrix $\X$ and label matrix $\Y$ have missing entries. An existing method concatenated $\X$ and $\Y$ as $[\X; \Y]$ and applied a matrix completion (MC) method to fill the missing entries, under the assumption that $[\X; \Y]$ is of low-rank. However, since entries of $\Y$ take binary values in the multi-label setting, it is unlikely that $\Y$ is of low-rank. Moreover, such assumption implies a linear relationship between $\X$ and $\Y$ which may not hold in practice. In this paper, we consider a latent matrix $\Z$ that produces the probability $σ(Z_{ij})$ of generating label $Y_{ij}$, where $σ(\cdot)$ is nonlinear. Considering label correlation, we assume $[\X; \Z]$ is of low-rank, and propose an MC algorithm based on subgradient descent named co-completion (COCO) motivated by elastic net and one-bit MC. We give a theoretical bound on the recovery effect of COCO and demonstrate its practical usefulness through experiments.

cs.LG↗

arXiv2018

Elastic-net regularization for nonlinear electrical impedance tomography with a splitting approach

Image reconstruction of EIT mathematically is a typical nonlinear and severely ill-posed inverse problem. Appropriate priors or penalties are required to enable the reconstruction. The commonly used L2-norm can enforce the stability to preserve local smoothness, and the current L1-norm can enforce the sparsity to preserve sharp edges. Considering the fact that L2-norm penalty always makes the solution overly smooth and L1-norm penalty always makes the solution too sparse, elastic-net regularization approach with a convex combination term of L1-norm and L2-norm emerges for fully nonlinear EIT inverse problems. Our aim is to combine the strength of both terms: sparsity in the transform domain and smoothness in the physical domain, in an attempt to improve the reconstruction resolution and robustness to noise. Nonlinearity and non-smoothness of the generated composite minimization problem make it challenging to find an efficient numerical solution. Then we develop one simple and fast numerical optimization scheme based on the split Bregman technique for the joint penalties regularization. The method is validated using simulated data for some typical conductivity distributions. Results indicate that the proposed inversion model with an appropriate parameter choice achieves an efficient regularization solution and enhances the quality of the reconstructed image.

math.NA↗

arXiv2018

Millionaire: A Hint-guided Approach for Crowdsourcing

Modern machine learning is migrating to the era of complex models, which requires a plethora of well-annotated data. While crowdsourcing is a promising tool to achieve this goal, existing crowdsourcing approaches barely acquire a sufficient amount of high-quality labels. In this paper, motivated by the "Guess-with-Hints" answer strategy from the Millionaire game show, we introduce the hint-guided approach into crowdsourcing to deal with this challenge. Our approach encourages workers to get help from hints when they are unsure of questions. Specifically, we propose a hybrid-stage setting, consisting of the main stage and the hint stage. When workers face any uncertain question on the main stage, they are allowed to enter the hint stage and look up hints before making any answer. A unique payment mechanism that meets two important design principles for crowdsourcing is developed. Besides, the proposed mechanism further encourages high-quality workers less using hints, which helps identify and assigns larger possible payment to them. Experiments are performed on Amazon Mechanical Turk, which show that our approach ensures a sufficient number of high-quality labels with low expenditure and detects high-quality workers.

cs.HC↗

arXiv2018

An iteration regularizaion method with general convex penalty for nonlinear inverse problems in Banach spaces

In this paper, we discuss the construction, analysis and implementation of a novel iterative regularization scheme with general convex penalty term for nonlinear inverse problems in Banach spaces based on the homotopy perturbation technique, in an attempt to detect the special features of the sought solutions such as sparsity or piecewise constant. By using tools from convex analysis in Banach spaces, we provide a detailed convergence and stability results for the presented algorithm. Numerical simulations for one-dimensional and two-dimensional parameter identification problems are performed to validate that our approach is competitive in terms of reducing the overall computational time in comparison with the existing Landweber iteration with general convex penalty.

math.NA↗

arXiv2017

Boundary conformal field theory and symmetry protected topological phases in $2+1$ dimensions

We propose a diagnostic tool for detecting non-trivial symmetry protected topological (SPT) phases protected by a symmetry group $G$ in 2+1 dimensions. Our method is based on directly studying the 1+1-dimensional anomalous edge conformal field theory (CFT) of SPT phases. We claim that if the CFT is the edge theory of an SPT phase, then there must be an obstruction to cutting it open. This obstruction manifests in the in-existence of boundary states that preserves both the conformal symmetry and the global symmetry $G$. We discuss the relation between edgeability, the ability to find a consistent boundary state, and gappability, the ability to gap out a CFT, in the presence of $G$. We study several cases including time-reversal symmetric topological insulators, $\mathbb{Z}_N$ symmetric bosonic SPTs, and $\mathbb{Z}_2 \times \mathbb{Z}_2$ symmetric topological superconductors.

cond-mat.str-el↗

arXiv2017

Interface Contributions to Topological Entanglement in Abelian Chern-Simons Theory

We study the entanglement entropy between (possibly distinct) topological phases across an interface using an Abelian Chern-Simons description with topological boundary conditions (TBCs) at the interface. From a microscopic point of view, these TBCs correspond to turning on particular gapping interactions between the edge modes across the interface. However, in studying entanglement in the continuum Chern-Simons description, we must confront the problem of non-factorization of the Hilbert space, which is a standard property of gauge theories. We carefully define the entanglement entropy by using an extended Hilbert space construction directly in the continuum theory. We show how a given TBC isolates a corresponding gauge invariant state in the extended Hilbert space, and hence compute the resulting entanglement entropy. We find that the sub-leading correction to the area law remains universal, but depends on the choice of topological boundary conditions. This agrees with the microscopic calculation of \cite{Cano:2014pya}. Additionally, we provide a replica path integral calculation for the entropy. In the case when the topological phases across the interface are taken to be identical, our construction gives a novel explanation of the equivalence between the left-right entanglement of (1+1)d Ishibashi states and the spatial entanglement of (2+1)d topological phases.

cond-mat.str-el↗

arXiv2017

Post-edit Analysis of Collective Biography Generation

Text generation is increasingly common but often requires manual post-editing where high precision is critical to end users. However, manual editing is expensive so we want to ensure this effort is focused on high-value tasks. And we want to maintain stylistic consistency, a particular challenge in crowd settings. We present a case study, analysing human post-editing in the context of a template-based biography generation system. An edit flow visualisation combined with manual characterisation of edits helps identify and prioritise work for improving end-to-end efficiency and accuracy.

cs.CL↗

arXiv2016

:telephone::person::sailboat::whale::okhand:; or "Call me Ishmael" - How do you translate emoji?

We report on an exploratory analysis of Emoji Dick, a project that leverages crowdsourcing to translate Melville's Moby Dick into emoji. This distinctive use of emoji removes textual context, and leads to a varying translation quality. In this paper, we use statistical word alignment and part-of-speech tagging to explore how people use emoji. Despite these simple methods, we observed differences in token and part-of-speech distributions. Experiments also suggest that semantics are preserved in the translation, and repetition is more common in emoji.

cs.CL↗

arXiv2016

LeaveNow: A Social Network-based Smart Evacuation System for Disaster Management

The importance of timely response to natural disasters and evacuating affected people to safe areas is paramount to save lives. Emergency services are often handicapped by the amount of rescue resources at their disposal. We present a system that leverages the power of a social network forming new connections among people based on \textit{real-time location} and expands the rescue resources pool by adding private sector cars. We also introduce a car-sharing algorithm to identify safe routes in an emergency with the aim of minimizing evacuation time, maximizing pick-up of people without cars, and avoiding traffic congestion.

cs.SI↗

arXiv2016

Astronomical Data Fusion Tool Based on PostgreSQL

With the application of advanced astronomical technologies, equipments and methods all over the world, astronomy covers from radio, infrared, visible light, ultraviolet, X-ray and gamma ray band, and enters into the era of full wavelength astronomy. How to effectively integrate data from different ground- and space-based observation equipments, different observers, different bands, different observation time, requires the data fusion technology. In this paper we introduce the cross-match tool that is developed by the Python language and based on the PostgreSQL database and uses Q3C as the core index, facilitating the cross-match work of massive astronomical data. It provides four different cross-match functions, namely: I) cross-match of custom error range; II) cross-match of catalog error; III) cross-match based on the elliptic error range; IV) cross-match of the nearest algorithm. The cross-match result set provides good foundation for subsequent data mining and statistics based on multiwavelength data. The most advantage of this tool is a user-oriented tool applied locally by users. By means of this tool, users may easily create their own databases, manage their own data and cross-match databases according to their requirements. In addition, this tool is also able to transfer data from one database into another database. More importantly, the tool is easy to get started and used by astronomers without writing any code.

astro-ph.IM↗