arXiv subjects

Bo Chen

Publications and source records attributed to Bo Chen.

At least 379 records · Page 21Linked to original sources

arXiv2020

Mesh Independence of an Accelerated Block Coordinate Descent Method for Sparse Optimal Control Problems

An accelerated block coordinate descent (ABCD) method in Hilbert space is analyzed to solve the sparse optimal control problem via its dual. The finite element approximation of this method is investigated and convergence results are presents. Based on the second order growth condition of the dual objective function, we show that iteration sequence of dual variables has the iteration complexity of $O(1/k)$. Moreover, we also prove iteration complexity for the primal problem. Two types of mesh-independence for ABCD method are proved, which asserts that asymptotically the infinite dimensional ABCD method and finite dimensional discretizations have the same convergence property, and the iterations of ABCD method remain nearly constant as the discretization is refined.

math.OC↗

arXiv2019

A Functional Equation of Tail-balance for Continuous Signals in the Condorcet Jury Theorem

Consider an odd-sized jury, which determines a majority verdict between two equiprobable states of Nature. If each juror independently receives a binary signal identifying the correct state with identical probability $p$, then the probability of a correct verdict tends to one as the jury size tends to infinity (Condorcet, 1785). Recently, the first two authors developed a model where jurors sequentially receive signals from an interval according to a distribution, which depends on the state of Nature and on the juror's "ability", and vote sequentially. This paper shows that to mimic Condorcet's binary signal, such a distribution must satisfy a functional equation related to tail-balance, that is, to the ratio $α(t)$ of the probability that a mean-zero random variable satisfies $X >t$ given that $|X|>t$. In particular, we show that under natural symmetry assumptions the tail-balances $α(t)$ uniquely determine the distribution.

math.PR↗

arXiv2019

SCR-Graph: Spatial-Causal Relationships based Graph Reasoning Network for Human Action Prediction

Technologies to predict human actions are extremely important for applications such as human robot cooperation and autonomous driving. However, a majority of the existing algorithms focus on exploiting visual features of the videos and do not consider the mining of relationships, which include spatial relationships between human and scene elements as well as causal relationships in temporal action sequences. In fact, human beings are good at using spatial and causal relational reasoning mechanism to predict the actions of others. Inspired by this idea, we proposed a Spatial and Causal Relationship based Graph Reasoning Network (SCR-Graph), which can be used to predict human actions by modeling the action-scene relationship, and causal relationship between actions, in spatial and temporal dimensions respectively. Here, in spatial dimension, a hierarchical graph attention module is designed by iteratively aggregating the features of different kinds of scene elements in different level. In temporal dimension, we designed a knowledge graph based causal reasoning module and map the past actions to temporal causal features through Diffusion RNN. Finally, we integrated the causality features into the heterogeneous graph in the form of shadow node, and introduced a self-attention module to determine the time when the knowledge graph information should be activated. Extensive experimental results on the VIRAT datasets demonstrate the favorable performance of the proposed framework.

cs.CV↗

arXiv2019

Searching for MobileNetV3

We present the next generation of MobileNets based on a combination of complementary search techniques as well as a novel architecture design. MobileNetV3 is tuned to mobile phone CPUs through a combination of hardware-aware network architecture search (NAS) complemented by the NetAdapt algorithm and then subsequently improved through novel architecture advances. This paper starts the exploration of how automated search algorithms and network design can work together to harness complementary approaches improving the overall state of the art. Through this process we create two new MobileNet models for release: MobileNetV3-Large and MobileNetV3-Small which are targeted for high and low resource use cases. These models are then adapted and applied to the tasks of object detection and semantic segmentation. For the task of semantic segmentation (or any dense pixel prediction), we propose a new efficient segmentation decoder Lite Reduced Atrous Spatial Pyramid Pooling (LR-ASPP). We achieve new state of the art results for mobile classification, detection and segmentation. MobileNetV3-Large is 3.2\% more accurate on ImageNet classification while reducing latency by 15\% compared to MobileNetV2. MobileNetV3-Small is 4.6\% more accurate while reducing latency by 5\% compared to MobileNetV2. MobileNetV3-Large detection is 25\% faster at roughly the same accuracy as MobileNetV2 on COCO detection. MobileNetV3-Large LR-ASPP is 30\% faster than MobileNetV2 R-ASPP at similar accuracy for Cityscapes segmentation.

cs.CV↗

arXiv2019

Intrinsic magnetic topological insulator phases in the Sb doped MnBi2Te4 bulks and thin flakes

Magnetic topological insulators (MTIs) offer a combination of topologically nontrivial characteristics and magnetic order and show promise in terms of potentially interesting physical phenomena such as the quantum anomalous Hall (QAH) effect and topological axion insulating states. However, the understanding of their properties and potential applications have been limited due to a lack of suitable candidates for MTIs. Here, we grow two-dimensional single crystals of Mn(SbxBi(1-x))2Te4 bulk and exfoliate them into thin flakes in order to search for intrinsic MTIs. We perform angle-resolved photoemission spectroscopy, low-temperature transport measurements, and first-principles calculations to investigate the band structure, transport properties, and magnetism of this family of materials, as well as the evolution of their topological properties. We find that there exists an optimized MTI zone in the Mn(SbxBi(1-x))2Te4 phase diagram, which could possibly host a high-temperature QAH phase, offering a promising avenue for new device applications.

cond-mat.mtrl-sci↗

arXiv2019

Magneto-transport and Shubnikov-de Haas oscillations in the layered ternary telluride Ta3SiTe6 topological semimetal

Topological semimetals characterize a novel class of quantum materials hosting Dirac/Weyl fermions. The important features of topological fermions can be exhibited by quantum oscillations. Here we report the magnetoresistance and Shubnikov-de Haas (SdH) quantum oscillation of longitudinal resistance in the single crystal of topological semimetal Ta3SiTe6 with the magnetic field up to 38 T. Periodic amplitude of the oscillations reveals related information about the Fermi surface. The fast Fourier transformation spectra represent a single oscillatory frequency. The analysis of the oscillations shows the Fermi pocket with a cross-section area of 0.13 angstrom power minus 2. Combining magneto-transport measurements and the first-principles calculation, we find that these oscillations come from the hole pocket. Hall resistivity and the SdH oscillations recommend that Ta3SiTe6 is a hole dominated system.

cond-mat.mes-hall↗

arXiv2019

Causal variance decompositions for institutional comparisons in healthcare

There is increasing interest in comparing institutions delivering healthcare in terms of disease-specific quality indicators (QIs) that capture processes or outcomes showing variations in the care provided. Such comparisons can be framed in terms of causal models, where adjusting for patient case-mix is analogous to controlling for confounding, and exposure is being treated in a given hospital, for instance. Our goal here is to help identifying good QIs rather than comparing hospitals in terms of an already chosen QI, and so we focus on the presence and magnitude of overall variation in care between the hospitals rather than the pairwise differences between any two hospitals. We consider how the observed variation in care received at patient level can be decomposed into that causally explained by the hospital performance adjusting for the case-mix, the case-mix itself, and residual variation. For this purpose, we derive a three-way variance decomposition, with particular attention to its causal interpretation in terms of potential outcome variables. We propose model-based estimators for the decomposition, accommodating different link functions and either fixed or random effect models. We evaluate their performance in a simulation study and demonstrate their use in a real data application.

stat.ME↗

arXiv2019

Satellite Pose Estimation with Deep Landmark Regression and Nonlinear Pose Refinement

We propose an approach to estimate the 6DOF pose of a satellite, relative to a canonical pose, from a single image. Such a problem is crucial in many space proximity operations, such as docking, debris removal, and inter-spacecraft communications. Our approach combines machine learning and geometric optimisation, by predicting the coordinates of a set of landmarks in the input image, associating the landmarks to their corresponding 3D points on an a priori reconstructed 3D model, then solving for the object pose using non-linear optimisation. Our approach is not only novel for this specific pose estimation task, which helps to further open up a relatively new domain for machine learning and computer vision, but it also demonstrates superior accuracy and won the first place in the recent Kelvins Pose Estimation Challenge organised by the European Space Agency (ESA).

cs.CV↗

arXiv2019

Isolated Singularities of Yang-Mills-Higgs fields on surfaces

We study isolated singularities of two dimensional Yang-Mills-Higgs fields defined on a fiber bundle, where the fiber space is a compact Riemannian manifold and the structure group is a compact connected Lie group. In general the singularity can not be removed due to possibly non-vanishing limit holonomy around the singular points. We establish a sharp asymptotic decay estimate of the Yang-Mills-Higgs field near a singular point, where the decay rate is precisely determined by the limit holonomy. Our result can be viewed as a generalization of the classical removable singularity theorem of two dimensional harmonic maps.

math.DG↗

arXiv2019

KCAT: A Knowledge-Constraint Typing Annotation Tool

Fine-grained Entity Typing is a tough task which suffers from noise samples extracted from distant supervision. Thousands of manually annotated samples can achieve greater performance than millions of samples generated by the previous distant supervision method. Whereas, it's hard for human beings to differentiate and memorize thousands of types, thus making large-scale human labeling hardly possible. In this paper, we introduce a Knowledge-Constraint Typing Annotation Tool (KCAT), which is efficient for fine-grained entity typing annotation. KCAT reduces the size of candidate types to an acceptable range for human beings through entity linking and provides a Multi-step Typing scheme to revise the entity linking result. Moreover, KCAT provides an efficient Annotator Client to accelerate the annotation process and a comprehensive Manager Module to analyse crowdsourcing annotations. Experiment shows that KCAT can significantly improve annotation efficiency, the time consumption increases slowly as the size of type set expands.

cs.AI↗

arXiv2019

MnasNet: Platform-Aware Neural Architecture Search for Mobile

Designing convolutional neural networks (CNN) for mobile devices is challenging because mobile models need to be small and fast, yet still accurate. Although significant efforts have been dedicated to design and improve mobile CNNs on all dimensions, it is very difficult to manually balance these trade-offs when there are so many architectural possibilities to consider. In this paper, we propose an automated mobile neural architecture search (MNAS) approach, which explicitly incorporate model latency into the main objective so that the search can identify a model that achieves a good trade-off between accuracy and latency. Unlike previous work, where latency is considered via another, often inaccurate proxy (e.g., FLOPS), our approach directly measures real-world inference latency by executing the model on mobile phones. To further strike the right balance between flexibility and search space size, we propose a novel factorized hierarchical search space that encourages layer diversity throughout the network. Experimental results show that our approach consistently outperforms state-of-the-art mobile CNN models across multiple vision tasks. On the ImageNet classification task, our MnasNet achieves 75.2% top-1 accuracy with 78ms latency on a Pixel phone, which is 1.8x faster than MobileNetV2 [29] with 0.5% higher accuracy and 2.3x faster than NASNet [36] with 1.2% higher accuracy. Our MnasNet also achieves better mAP quality than MobileNets for COCO object detection. Code is at https://github.com/tensorflow/tpu/tree/master/models/official/mnasnet

cs.CV↗

arXiv2019

Capacity Games with Supply Function Competition

This paper studies a setting in which multiple suppliers compete for a buyer's procurement business. The buyer faces uncertain demand and there is a requirement to reserve capacity in advance of knowing the demand. Each supplier has costs that are two dimensional, with some costs incurred before demand is realized in order to reserve capacity and some costs incurred after demand is realized at the time of delivery. A distinctive feature of our model is that the marginal costs may not be constants, and this naturally leads us to a supply function competition framework in which each supplier offers a schedule of prices and quantities. We treat this problem as an example of a general class of capacity games and show that, when the optimal supply chain profit is submodular, in equilibrium the buyer makes a reservation choice that maximizes the overall supply chain profit, each supplier makes a profit equal to their marginal contribution to the supply chain, and the buyer takes the remaining profit. We further prove that this submodularity property holds under two commonly studied settings: (1) there are only two suppliers; and (2) in the case of more than two suppliers, the marginal two-dimension costs of each supplier are non-decreasing and constant, respectively.

cs.GT↗

arXiv2019

Charged Lovelock black holes in the presence of dark fluid with a nonlinear equation of state

We consider a model that charged static spherically-symmetric black hole is surrounded by dark fluid with nonlinear equation of state $p_d=-B/ρ_d$. We find that the energy density of the dark fluid can be characterized by two parameters. The derivation of metric solution, as well as the calculation of black hole thermodynamical quantities as functions of horizon radius, are performed. Specially, in $D$-dimensional Einstein gravity and Gauss-Bonnet gravity cases, we plot the metric functions and corresponding thermodynamical quantities, such as mass, Hawking temperature and heat capacity, by varying the values of spacetime dimensions and dark fluid parameters. The effects of the dark fluid parameters on black hole solutions as well as on thermodynamical stability of black holes are discussed.

gr-qc↗

arXiv2019

Convolutional Poisson Gamma Belief Network

For text analysis, one often resorts to a lossy representation that either completely ignores word order or embeds each word as a low-dimensional dense feature vector. In this paper, we propose convolutional Poisson factor analysis (CPFA) that directly operates on a lossless representation that processes the words in each document as a sequence of high-dimensional one-hot vectors. To boost its performance, we further propose the convolutional Poisson gamma belief network (CPGBN) that couples CPFA with the gamma belief network via a novel probabilistic pooling layer. CPFA forms words into phrases and captures very specific phrase-level topics, and CPGBN further builds a hierarchy of increasingly more general phrase-level topics. For efficient inference, we develop both a Gibbs sampler and a Weibull distribution based convolutional variational auto-encoder. Experimental results demonstrate that CPGBN can extract high-quality text latent representations that capture the word order information, and hence can be leveraged as a building block to enrich a wide variety of existing latent variable models that ignore word order.

stat.ML↗

arXiv2019

Experimental observation of the gate-controlled reversal of the anomalous Hall effect in the intrinsic magnetic topological insulator MnBi2Te4 device

Here we report the reserved anomalous Hall effect (AHE) in the 5-septuple-layer van der Waals device of the intrinsic magnetic topological insulator MnBi2Te4. By employing the top/bottom gate, a negative AHE loop gradually decreases to zero and changes to a reversed sign. The reversed AHE exhibits distinct coercive fields and temperature dependence from the previous AHE. It reaches the maximum inside the gap of the Dirac cone. The newly-seen reversed AHE is attributed to the competition of the intrinsic Berry curvature and the Dirac-gap enhanced extrinsic skew scattering. Its gate-controlled switching contributes a scheme for the topological spin field-effect transistors.

cond-mat.mes-hall↗

arXiv2019

Hardware/Software Co-monitoring

Hardware/Software (HW/SW) interfaces, mostly implemented as devices and device drivers, are pervasive in various computer systems. Nowadays HW/SW interfaces typically undergo intensive testing and validation before release, but they are still unreliable and insecure when deployed together with computer systems to end users. Escaped logic bugs, hardware transient failures, and malicious exploits are prevalent in HW/SW interactions, making the entire system vulnerable and unstable. We present HW/SW co-monitoring, a runtime co-verification approach to detecting failures and malicious exploits in device/driver interactions. Our approach utilizes a formal device model (FDM), a transaction-level model derived from the device specification, to shadow the real device execution. Based on the co-execution of the device and FDM, HW/SW co-monitoring carries out two-tier runtime checking: (1) device checking checks if the device behaviors conform to the FDM behaviors; (2) property checking detects invalid driver commands issued to the device by verifying system properties against driver/device interactions. We have applied HW/SW co-monitoring to five widely-used devices and their Linux drivers, discovering 9 real bugs and vulnerabilities while introducing modest runtime overhead. The results demonstrate the major potential of HW/SW co-monitoring in improving system reliability and security.

cs.SE↗

arXiv2019

Low-Power Computer Vision: Status, Challenges, Opportunities

Computer vision has achieved impressive progress in recent years. Meanwhile, mobile phones have become the primary computing platforms for millions of people. In addition to mobile phones, many autonomous systems rely on visual data for making decisions and some of these systems have limited energy (such as unmanned aerial vehicles also called drones and mobile robots). These systems rely on batteries and energy efficiency is critical. This article serves two main purposes: (1) Examine the state-of-the-art for low-power solutions to detect objects in images. Since 2015, the IEEE Annual International Low-Power Image Recognition Challenge (LPIRC) has been held to identify the most energy-efficient computer vision solutions. This article summarizes 2018 winners' solutions. (2) Suggest directions for research as well as opportunities for low-power computer vision.

cs.CV↗

arXiv2019

Improving Distantly-supervised Entity Typing with Compact Latent Space Clustering

Recently, distant supervision has gained great success on Fine-grained Entity Typing (FET). Despite its efficiency in reducing manual labeling efforts, it also brings the challenge of dealing with false entity type labels, as distant supervision assigns labels in a context agnostic manner. Existing works alleviated this issue with partial-label loss, but usually suffer from confirmation bias, which means the classifier fit a pseudo data distribution given by itself. In this work, we propose to regularize distantly supervised models with Compact Latent Space Clustering (CLSC) to bypass this problem and effectively utilize noisy data yet. Our proposed method first dynamically constructs a similarity graph of different entity mentions; infer the labels of noisy instances via label propagation. Based on the inferred labels, mention embeddings are updated accordingly to encourage entity mentions with close semantics to form a compact cluster in the embedding space,thus leading to better classification performance. Extensive experiments on standard benchmarks show that our CLSC model consistently outperforms state-of-the-art distantly supervised entity typing systems by a significant margin.

cs.CL↗