arXiv subjects

Bo Liu

Publications and source records attributed to Bo Liu.

At least 523 records · Page 29Linked to original sources

arXiv2021

GistNet: a Geometric Structure Transfer Network for Long-Tailed Recognition

The problem of long-tailed recognition, where the number of examples per class is highly unbalanced, is considered. It is hypothesized that the well known tendency of standard classifier training to overfit to popular classes can be exploited for effective transfer learning. Rather than eliminating this overfitting, e.g. by adopting popular class-balanced sampling methods, the learning algorithm should instead leverage this overfitting to transfer geometric information from popular to low-shot classes. A new classifier architecture, GistNet, is proposed to support this goal, using constellations of classifier parameters to encode the class geometry. A new learning algorithm is then proposed for GeometrIc Structure Transfer (GIST), with resort to a combination of loss functions that combine class-balanced and random sampling to guarantee that, while overfitting to the popular classes is restricted to geometric parameters, it is leveraged to transfer class geometry from popular to few-shot classes. This enables better generalization for few-shot classes without the need for the manual specification of class weights, or even the explicit grouping of classes into different types. Experiments on two popular long-tailed recognition datasets show that GistNet outperforms existing solutions to this problem.

cs.CV↗

arXiv2021

Semi-supervised Long-tailed Recognition using Alternate Sampling

Main challenges in long-tailed recognition come from the imbalanced data distribution and sample scarcity in its tail classes. While techniques have been proposed to achieve a more balanced training loss and to improve tail classes data variations with synthesized samples, we resort to leverage readily available unlabeled data to boost recognition accuracy. The idea leads to a new recognition setting, namely semi-supervised long-tailed recognition. We argue this setting better resembles the real-world data collection and annotation process and hence can help close the gap to real-world scenarios. To address the semi-supervised long-tailed recognition problem, we present an alternate sampling framework combining the intuitions from successful methods in these two research areas. The classifier and feature embedding are learned separately and updated iteratively. The class-balanced sampling strategy has been implemented to train the classifier in a way not affected by the pseudo labels' quality on the unlabeled data. A consistency loss has been introduced to limit the impact from unlabeled data while leveraging them to update the feature embedding. We demonstrate significant accuracy improvements over other competitive methods on two datasets.

cs.CV↗

arXiv2021

A toolbox for elementary fermions with a dipolar Fermi gas in a 3D optical lattice

There has been growing interest in investigating properties of elementary particles predicted by the standard model. Examples of such studies include exploring their low-energy analogs in condensed matter system, where they arise as collective states or quasiparticles. Here we show that a toolbox for systematically engineering the emergent elementary fermions, i.e., Dirac, Weyl and Majorana fermions, can be built in a single atomic system composed of a spinless magnetic dipolar Fermi gas in a 3D optical lattice. The designed direction-dependent dipole-dipole interaction leads to both the basic building block, i.e, in-plane p+ip superfluid pairing instability and the manipulating tool, i.e, out-of-plane Peierls instability. It is shown that the Peierls instability provides a natural way of tuning the topological nature of p+ip superfluids and thus transform the fermion's nature between distinct emergent particles. Our scheme should open up a new thrust towards searching for elementary particles through manipulating the topology.

cond-mat.quant-gas↗

arXiv2021

Numerical study of transverse position monitor and compensation for x-ray polarization diagnosis

Diagnosing free electron laser (FEL) polarization is critical for polarization-modulated research such as x-ray free electron laser (XFEL) diffraction imaging and probing material magnetism. In an electron time-of-flight (eTOF)\ polarimeter, the flight time and angular distribution of photoelectrons were designed based on x-ray polarimetry for on-site diagnosis. However, the transverse position of x-ray FEL pulses introduces error into the measured photoelectron angular distribution. This work thus proposes a method to monitor the transverse position using an eTOF polarimeter and explains how to compensate for the error due to transverse position. A comprehensive numerical model is developed to demonstrate the feasibility of the compensation method, and the results reveal that a spatial resolution of 20 $μ$m and a polarity improved by 0.5\% is possible with fully polarized FEL pulses. The impact of FEL\ pulses and a method to calibrate their linearity is also discussed.

physics.ins-det↗

arXiv2021

Some Geometrical and Topological Properties of DNNs' Decision Boundaries

Geometry and topology of decision regions are closely related with classification performance and robustness against adversarial attacks. In this paper, we use differential geometry to theoretically explore the geometrical and topological properties of decision regions produced by deep neural networks (DNNs). The goal is to obtain some geometrical and topological properties of decision boundaries for given DNN models, and provide some principled guidance to design and regularization of DNNs. First, we present the curvatures of decision boundaries in terms of network parameters, and give sufficient conditions on network parameters for producing flat or developable decision boundaries. Based on the Gauss-Bonnet-Chern theorem in differential geometry, we then propose a method to compute the Euler characteristics of compact decision boundaries, and verify it with experiments.

cs.LG↗

arXiv2021

Temperature-sensitive spatial distribution of defects in PdSe2 flakes

Defect engineering plays an important role in tailoring the electronic transport properties of van der Waals materials. However, it is usually achieved through tuning the type and concentration of defects, rather than dynamically reconfiguring their spatial distribution. Here, we report temperature-sensitive spatial redistribution of defects in PdSe2 thin flakes through scanning tunneling microscopy (STM). We observe that the spatial distribution of Se vacancies in PdSe2 flakes exhibits a strong anisotropic characteristic at 80 K, and that this orientation-dependent feature is weakened when temperature is raised. Moreover, we carry out transport measurements on PdSe2 thin flakes and show that the anisotropic features of carrier mobility and phase coherent length are also sensitive to temperature. Combining with theoretical analysis, we conclude that temperature-driven defect spatial redistribution could interpret the temperature-sensitive electrical transport behaviors in PdSe2 thin flakes. Our work highlights that engineering spatial distribution of defects in the van der Waals materials, which has been overlooked before, may open up a new avenue to tailor the physical properties of materials and explore new device functionalities.

cond-mat.mes-hall↗

arXiv2021

SchedGuard: Protecting against Schedule Leaks Using Linux Containers

Real-time systems have recently been shown to be vulnerable to timing inference attacks, mainly due to their predictable behavioral patterns. Existing solutions such as schedule randomization lack the ability to protect against such attacks, often limited by the system's real-time nature. This paper presents SchedGuard: a temporal protection framework for Linux-based hard real-time systems that protects against posterior scheduler side-channel attacks by preventing untrusted tasks from executing during specific time segments. SchedGuard is integrated into the Linux kernel using cgroups, making it amenable to use with container frameworks. We demonstrate the effectiveness of our system using a realistic radio-controlled rover platform and synthetically generated workloads. Not only is SchedGuard able to protect against the attacks mentioned above, but it also ensures that the real-time tasks/containers meet their temporal requirements.

cs.CR↗

arXiv2021

Learning Spatio-Appearance Memory Network for High-Performance Visual Tracking

Existing visual object tracking usually learns a bounding-box based template to match the targets across frames, which cannot accurately learn a pixel-wise representation, thereby being limited in handling severe appearance variations. To address these issues, much effort has been made on segmentation-based tracking, which learns a pixel-wise object-aware template and can achieve higher accuracy than bounding-box template based tracking. However, existing segmentation-based trackers are ineffective in learning the spatio-temporal correspondence across frames due to no use of the rich temporal information. To overcome this issue, this paper presents a novel segmentation-based tracking architecture, which is equipped with a spatio-appearance memory network to learn accurate spatio-temporal correspondence. Among it, an appearance memory network explores spatio-temporal non-local similarity to learn the dense correspondence between the segmentation mask and the current frame. Meanwhile, a spatial memory network is modeled as discriminative correlation filter to learn the mapping between feature map and spatial map. The appearance memory network helps to filter out the noisy samples in the spatial memory network while the latter provides the former with more accurate target geometrical center. This mutual promotion greatly boosts the tracking performance. Without bells and whistles, our simple-yet-effective tracking architecture sets new state-of-the-arts on the VOT2016, VOT2018, VOT2019, GOT-10K, TrackingNet, and VOT2020 benchmarks, respectively. Besides, our tracker outperforms the leading segmentation-based trackers SiamMask and D3S on two video object segmentation benchmarks DAVIS16 and DAVIS17 by a large margin. The source codes can be found at https://github.com/phiphiphi31/DMB.

cs.CV↗

arXiv2021

Free-Running Long-Distance Reference-Frame-Independent Quantum Key Distribution

Rapidly and randomly drifted reference frames will shorten the link distance and decrease the secure key rate of realistic quantum key distribution (QKD) systems. However, an actively or inappropriately implemented calibration scheme will increase complexity of the systems and may open security loopholes. In this article, we present a free-running reference-frame-independent (RFI) QKD scheme, where measurement events are classified into multiple slices with the same misalignment variation of reference frames and each slice performs the post-processing procedure individually. We perform the free-running RFI QKD experiment with a fiber link of 100km and the misalignment of the reference frame between Alice and Bob is varied more than 29 periods in a 50.7-hour experiment test. The average secure key rate is about 734 bps with a total loss of 31.5 dB, which achieves the state-of-art performance of the long-distance RFI QKD implementations. Our free-running RFI scheme can be efficiently adapted into the satellite-to-ground and drone based mobile communication scenarios, as it can be performed with rapidly varying reference frame and a loss more than 40 dB, where no secure key can be obtained by the original RFI scheme.

quant-ph↗

arXiv2021

Agile Robot Navigation through Hallucinated Learning and Sober Deployment

Learning from Hallucination (LfH) is a recent machine learning paradigm for autonomous navigation, which uses training data collected in completely safe environments and adds numerous imaginary obstacles to make the environment densely constrained, to learn navigation planners that produce feasible navigation even in highly constrained (more dangerous) spaces. However, LfH requires hallucinating the robot perception during deployment to match with the hallucinated training data, which creates a need for sometimes-infeasible prior knowledge and tends to generate very conservative planning. In this work, we propose a new LfH paradigm that does not require runtime hallucination -- a feature we call "sober deployment" -- and can therefore adapt to more realistic navigation scenarios. This novel Hallucinated Learning and Sober Deployment (HLSD) paradigm is tested in a benchmark testbed of 300 simulated navigation environments with a wide range of difficulty levels, and in the real-world. In most cases, HLSD outperforms both the original LfH method and a classical navigation planner.

cs.RO↗

arXiv2021

IdentityDP: Differential Private Identification Protection for Face Images

Because of the explosive growth of face photos as well as their widespread dissemination and easy accessibility in social media, the security and privacy of personal identity information becomes an unprecedented challenge. Meanwhile, the convenience brought by advanced identity-agnostic computer vision technologies is attractive. Therefore, it is important to use face images while taking careful consideration in protecting people's identities. Given a face image, face de-identification, also known as face anonymization, refers to generating another image with similar appearance and the same background, while the real identity is hidden. Although extensive efforts have been made, existing face de-identification techniques are either insufficient in photo-reality or incapable of well-balancing privacy and utility. In this paper, we focus on tackling these challenges to improve face de-identification. We propose IdentityDP, a face anonymization framework that combines a data-driven deep neural network with a differential privacy (DP) mechanism. This framework encompasses three stages: facial representations disentanglement, $ε$-IdentityDP perturbation and image reconstruction. Our model can effectively obfuscate the identity-related information of faces, preserve significant visual similarity, and generate high-quality images that can be used for identity-agnostic computer vision tasks, such as detection, tracking, etc. Different from the previous methods, we can adjust the balance of privacy and utility through the privacy budget according to pratical demands and provide a diversity of results without pre-annotations. Extensive experiments demonstrate the effectiveness and generalization ability of our proposed anonymization framework.

cs.CV↗

arXiv2021

Enantio-conversion of chiral mixtures via optical pumping

Enantio-conversion with the help of electromagnetic fields is an essential issue due to the chirality-dependence of many chemical, biological, and pharmaceutical processes. Here, we propose a method for this issue based on a five-level double-$Δ$ model of chiral molecules. By utilizing the breaking of left-right symmetry in the two $Δ$-type sub-structures, we can establish the chiral-state-selective excitation with one chiral ground state being excited to an achiral excited state and the other one being undisturbed. In the meanwhile, the achiral excited state will relax to the two chiral ground states. The two effects simultaneously acting on the chiral mixtures can convert molecules of different chiralities to the ones of the same chirality, i.e., the enantio-conversion via optical pumping. With typical parameters in gas-phase experiments, we numerically show that highly efficient enantio-conversion can be achieved. Our method works in the appearance of decoherences and without the precise control of pulse-durations (pulse-areas) and/or pulse-shapes. These advantages offer it promising features in promoting the future exploring of enantio-conversion.

quant-ph↗

arXiv2021

Spurious Local Minima Are Common for Deep Neural Networks with Piecewise Linear Activations

In this paper, it is shown theoretically that spurious local minima are common for deep fully-connected networks and convolutional neural networks (CNNs) with piecewise linear activation functions and datasets that cannot be fitted by linear models. A motivating example is given to explain the reason for the existence of spurious local minima: each output neuron of deep fully-connected networks and CNNs with piecewise linear activations produces a continuous piecewise linear (CPWL) output, and different pieces of CPWL output can fit disjoint groups of data samples when minimizing the empirical risk. Fitting data samples with different CPWL functions usually results in different levels of empirical risk, leading to prevalence of spurious local minima. This result is proved in general settings with any continuous loss function. The main proof technique is to represent a CPWL function as a maximization over minimization of linear pieces. Deep ReLU networks are then constructed to produce these linear pieces and implement maximization and minimization operations.

cs.LG↗

arXiv2021

SLAKE: A Semantically-Labeled Knowledge-Enhanced Dataset for Medical Visual Question Answering

Medical visual question answering (Med-VQA) has tremendous potential in healthcare. However, the development of this technology is hindered by the lacking of publicly-available and high-quality labeled datasets for training and evaluation. In this paper, we present a large bilingual dataset, SLAKE, with comprehensive semantic labels annotated by experienced physicians and a new structural medical knowledge base for Med-VQA. Besides, SLAKE includes richer modalities and covers more human body parts than the currently available dataset. We show that SLAKE can be used to facilitate the development and evaluation of Med-VQA systems. The dataset can be downloaded from http://www.med-vqa.com/slake.

cs.CV↗

arXiv2021

Self-Amplification of Coherent Energy Modulation in Seeded Free-Electron Lasers

The spectroscopic techniques for time-resolved fine analysis of matter require coherent X-ray radiation with femtosecond duration and high average brightness. Seeded free-electron lasers (FELs), which use the frequency up-conversion of an external seed laser to improve temporal coherence, are ideal for providing fully coherent soft X-ray pulses. However, it is difficult to operate seeded FELs at a high repetition rate due to the limitations of present state-of-the-art laser systems. Here, we report the novel self-modulation method for enhancing laser-induced energy modulation, thereby significantly reducing the requirement of an external laser system. Driven by this scheme, we experimentally realize high harmonic generation in a seeded FEL using an unprecedentedly small energy modulation. An electron beam with a laser-induced energy modulation as small as 1.8 times the slice energy spread is used for lasing at the 7th harmonic of a 266-nm seed laser in a single-stage high-gain harmonic generation (HGHG) setup and the 30th harmonic of the seed laser in a two-stage HGHG setup. The results mark a major step towards a high-repetition-rate, fully coherent X-ray FEL.

physics.acc-ph↗

arXiv2021

A Lifelong Learning Approach to Mobile Robot Navigation

This paper presents a self-improving lifelong learning framework for a mobile robot navigating in different environments. Classical static navigation methods require environment-specific in-situ system adjustment, e.g. from human experts, or may repeat their mistakes regardless of how many times they have navigated in the same environment. Having the potential to improve with experience, learning-based navigation is highly dependent on access to training resources, e.g. sufficient memory and fast computation, and is prone to forgetting previously learned capability, especially when facing different environments. In this work, we propose Lifelong Learning for Navigation (LLfN) which (1) improves a mobile robot's navigation behavior purely based on its own experience, and (2) retains the robot's capability to navigate in previous environments after learning in new ones. LLfN is implemented and tested entirely onboard a physical robot with a limited memory and computation budget.

cs.RO↗

arXiv2021

Toward Agile Maneuvers in Highly Constrained Spaces: Learning from Hallucination

While classical approaches to autonomous robot navigation currently enable operation in certain environments, they break down in tightly constrained spaces, e.g., where the robot needs to engage in agile maneuvers to squeeze between obstacles. Recent machine learning techniques have the potential to address this shortcoming, but existing approaches require vast amounts of navigation experience for training, during which the robot must operate in close proximity to obstacles and risk collision. In this paper, we propose to side-step this requirement by introducing a new machine learning paradigm for autonomous navigation called learning from hallucination (LfH), which can use training data collected in completely safe environments to compute navigation controllers that result in fast, smooth, and safe navigation in highly constrained environments. Our experimental results show that the proposed LfH system outperforms three autonomous navigation baselines on a real robot and generalizes well to unseen environments, including those based on both classical and machine learning techniques.

cs.RO↗

arXiv2021

Heterogeneous Hypergraph Embedding for Graph Classification

Recently, graph neural networks have been widely used for network embedding because of their prominent performance in pairwise relationship learning. In the real world, a more natural and common situation is the coexistence of pairwise relationships and complex non-pairwise relationships, which is, however, rarely studied. In light of this, we propose a graph neural network-based representation learning framework for heterogeneous hypergraphs, an extension of conventional graphs, which can well characterize multiple non-pairwise relations. Our framework first projects the heterogeneous hypergraph into a series of snapshots and then we take the Wavelet basis to perform localized hypergraph convolution. Since the Wavelet basis is usually much sparser than the Fourier basis, we develop an efficient polynomial approximation to the basis to replace the time-consuming Laplacian decomposition. Extensive evaluations have been conducted and the experimental results show the superiority of our method. In addition to the standard tasks of network embedding evaluation such as node classification, we also apply our method to the task of spammers detection and the superior performance of our framework shows that relationships beyond pairwise are also advantageous in the spammer detection.

cs.SI↗