Searcharxiv⌕ Search

arXiv subjects

Wenbin Li

Publications and source records attributed to Wenbin Li.

At least 109 records · Page 6Linked to original sources
arXiv2023

Stability of five-dimensional Myers-Perry black holes under massive scalar perturbation: bound states and quasinormal modes

The stability of five-dimensional singly rotating Myers-Perry Black Holes against massive scalar perturbations is studied. Both the quasibound states and quasinormal modes of the massive scalar field are considered. For the quasibound states, we use an analytical method to discuss the effective potential felt by the scalar field, and found that there is no potential well outside the event horizon. Thus, singly rotating Myers-Perry Black Holes are stable against the perturbation of quasibound states of massive scalar fields. Then, We use continued fraction method based on solving a seven-term recurrence relations to compute the spectra of the quasinormal modes. For different values of the black hole rotation parameter $a$, scalar mass parameter $μ$ and angular quantum numbers, all found quasinormal modes are damped. So singly rotating Myers-Perry Black Holes are also stable against the perturbation of quasinormal modes of massive scalar fields. Besides, when the scalar mass $μ$ becomes relatively large, the long-living quasiresonances are also found as in other rotating black hole models. Our results complement previous arguments on the stability of five-dimensional singly rotating Myers-Perry black holes against massive scalar perturbations.

gr-qc↗
arXiv2023

A Comprehensive Review and a Taxonomy of Edge Machine Learning: Requirements, Paradigms, and Techniques

The union of Edge Computing (EC) and Artificial Intelligence (AI) has brought forward the Edge AI concept to provide intelligent solutions close to the end-user environment, for privacy preservation, low latency to real-time performance, and resource optimization. Machine Learning (ML), as the most advanced branch of AI in the past few years, has shown encouraging results and applications in the edge environment. Nevertheless, edge-powered ML solutions are more complex to realize due to the joint constraints from both edge computing and AI domains, and the corresponding solutions are expected to be efficient and adapted in technologies such as data processing, model compression, distributed inference, and advanced learning paradigms for Edge ML requirements. Despite the fact that a great deal of the attention garnered by Edge ML is gained in both the academic and industrial communities, we noticed the lack of a complete survey on existing Edge ML technologies to provide a common understanding of this concept. To tackle this, this paper aims at providing a comprehensive taxonomy and a systematic review of Edge ML techniques, focusing on the soft computing aspects of existing paradigms and techniques. We start by identifying the Edge ML requirements driven by the joint constraints. We then extensively survey more than twenty paradigms and techniques along with their representative work, covering two main parts: edge inference, and edge learning. In particular, we analyze how each technique fits into Edge ML by meeting a subset of the identified requirements. We also summarize Edge ML frameworks and open issues to shed light on future directions for Edge ML.

cs.LG↗
arXiv2023

Defensive Few-shot Learning

This paper investigates a new challenging problem called defensive few-shot learning in order to learn a robust few-shot model against adversarial attacks. Simply applying the existing adversarial defense methods to few-shot learning cannot effectively solve this problem. This is because the commonly assumed sample-level distribution consistency between the training and test sets can no longer be met in the few-shot setting. To address this situation, we develop a general defensive few-shot learning (DFSL) framework to answer the following two key questions: (1) how to transfer adversarial defense knowledge from one sample distribution to another? (2) how to narrow the distribution gap between clean and adversarial examples under the few-shot setting? To answer the first question, we propose an episode-based adversarial training mechanism by assuming a task-level distribution consistency to better transfer the adversarial defense knowledge. As for the second question, within each few-shot task, we design two kinds of distribution consistency criteria to narrow the distribution gap between clean and adversarial examples from the feature-wise and prediction-wise perspectives, respectively. Extensive experiments demonstrate that the proposed framework can effectively make the existing few-shot models robust against adversarial attacks. Code is available at https://github.com/WenbinLee/DefensiveFSL.git.

cs.CV↗
arXiv2023

A Multilayer Framework for Online Metric Learning

Online metric learning has been widely applied in classification and retrieval. It can automatically learn a suitable metric from data by restricting similar instances to be separated from dissimilar instances with a given margin. However, the existing online metric learning algorithms have limited performance in real-world classifications, especially when data distributions are complex. To this end, this paper proposes a multilayer framework for online metric learning to capture the nonlinear similarities among instances. Different from the traditional online metric learning, which can only learn one metric space, the proposed Multi-Layer Online Metric Learning (MLOML) takes an online metric learning algorithm as a metric layer and learns multiple hierarchical metric spaces, where each metric layer follows a nonlinear layers for the complicated data distribution. Moreover, the forward propagation (FP) strategy and backward propagation (BP) strategy are employed to train the hierarchical metric layers. To build a metric layer of the proposed MLOML, a new Mahalanobis-based Online Metric Learning (MOML) algorithm is presented based on the passive-aggressive strategy and one-pass triplet construction strategy. Furthermore, in a progressively and nonlinearly learning way, MLOML has a stronger learning ability than traditional online metric learning in the case of limited available training data. To make the learning process more explainable and theoretically guaranteed, theoretical analysis is provided. The proposed MLOML enjoys several nice properties, indeed learns a metric progressively, and performs better on the benchmark datasets. Extensive experiments with different settings have been conducted to verify these properties of the proposed MLOML.

cs.CV↗
arXiv2023

Trip-ROMA: Self-Supervised Learning with Triplets and Random Mappings

Contrastive self-supervised learning (SSL) methods, such as MoCo and SimCLR, have achieved great success in unsupervised visual representation learning. They rely on a large number of negative pairs and thus require either large memory banks or large batches. Some recent non-contrastive SSL methods, such as BYOL and SimSiam, attempt to discard negative pairs and have also shown remarkable performance. To avoid collapsed solutions caused by not using negative pairs, these methods require non-trivial asymmetry designs. However, in small data regimes, we can not obtain a sufficient number of negative pairs or effectively avoid the over-fitting problem when negatives are not used at all. To address this situation, we argue that negative pairs are still important but one is generally sufficient for each positive pair. We show that a simple Triplet-based loss (Trip) can achieve surprisingly good performance without requiring large batches or asymmetry designs. Moreover, to alleviate the over-fitting problem in small data regimes and further enhance the effect of Trip, we propose a simple plug-and-play RandOm MApping (ROMA) strategy by randomly mapping samples into other spaces and requiring these randomly projected samples to satisfy the same relationship indicated by the triplets. Integrating the triplet-based loss with random mapping, we obtain the proposed method Trip-ROMA. Extensive experiments, including unsupervised representation learning and unsupervised few-shot learning, have been conducted on ImageNet-1K and seven small datasets. They successfully demonstrate the effectiveness of Trip-ROMA and consistently show that ROMA can further effectively boost other SSL methods. Code is available at https://github.com/WenbinLee/Trip-ROMA.

cs.CV↗
arXiv2023

Polar discontinuities and interfacial electronic properties of Bi$_2$O$_2$Se on SrTiO$_3$

The layered oxychalcogenide semiconductor Bi$_2$O$_2$Se (BOS) hosts a multitude of unusual properties including high electron mobility. Owing to similar crystal symmetry and lattice constants, the perovskite oxide SrTiO$_3$ (STO) has been demonstrated to be an excellent substrate for wafer-scale growth of atomically thin BOS films. However, the structural and electronic properties of the BOS/STO interface remain poorly understood. Here, through first-principles study, we reveal that polar discontinuities and interfacial contact configurations have a strong impact on the electronic properties of ideal BOS/STO interfaces. The lowest-energy [Bi-TiO$_2$] contact type, which features the contact between a Bi$_2$O$_2$ layer of BOS with the TiO$_2$-terminated surface of STO, incurs significant interfacial charge transfer from BOS to STO, producing a BOS/STO-mixed, $n$-type metallic state at the interface. By contrast, the [Se-SrO] contact type, which is the most stable contact configuration between BOS and SrO-terminated STO substrate, has a much smaller interfacial charge transfer from STO to BOS and exhibits $p$-type electronic structure with much weaker interfacial hybridization between BOS and STO. These results indicate that BOS grown on TiO$_2$-terminated STO substrates could be a fruitful system for exploring emergent phenomena at the interface between an oxychalcogenide and an oxide, whereas BOS grown on SrO-terminated substrates may be more advantageous for preserving the excellent intrinsic transport properties of BOS.

cond-mat.mtrl-sci↗
arXiv2023

Unraveling the unusually high electrical conductivity of the delafossite metal PdCoO$_2$

The prototypical delafossite metal PdCoO$_2$ has been the subject of intense interest for hosting exotic transport properties. Using first-principles transport calculations and theoretical modeling, we reveal that the high electrical conductivity of PdCoO$_2$ at room temperature originates from the contributions of both high Fermi velocities, enabled by Pd $4d_{z^2}-5s$ hybridization, and exceptionally weak electron-phonon coupling, which leads to a coupling strength ($λ=0.057$) that is nearly an order of magnitude smaller than those of common metals. The abnormally weak electron-phonon coupling in PdCoO$_2$ results from a low electronic density of states at the Fermi level, as well as the large and strongly facetted Fermi surface with suppressed Umklapp electron-phonon matrix elements. We anticipate that our work will inform the design of unconventional metals with superior transport properties.

cond-mat.mtrl-sci↗
arXiv2023

Where and How: Mitigating Confusion in Neural Radiance Fields from Sparse Inputs

Neural Radiance Fields from Sparse input} (NeRF-S) have shown great potential in synthesizing novel views with a limited number of observed viewpoints. However, due to the inherent limitations of sparse inputs and the gap between non-adjacent views, rendering results often suffer from over-fitting and foggy surfaces, a phenomenon we refer to as "CONFUSION" during volume rendering. In this paper, we analyze the root cause of this confusion and attribute it to two fundamental questions: "WHERE" and "HOW". To this end, we present a novel learning framework, WaH-NeRF, which effectively mitigates confusion by tackling the following challenges: (i)"WHERE" to Sample? in NeRF-S -- we introduce a Deformable Sampling strategy and a Weight-based Mutual Information Loss to address sample-position confusion arising from the limited number of viewpoints; and (ii) "HOW" to Predict? in NeRF-S -- we propose a Semi-Supervised NeRF learning Paradigm based on pose perturbation and a Pixel-Patch Correspondence Loss to alleviate prediction confusion caused by the disparity between training and testing viewpoints. By integrating our proposed modules and loss functions, WaH-NeRF outperforms previous methods under the NeRF-S setting. Code is available https://github.com/bbbbby-99/WaH-NeRF.

cs.CV↗
arXiv2023

Causal Discovery from Temporal Data: An Overview and New Perspectives

Temporal data, representing chronological observations of complex systems, has always been a typical data structure that can be widely generated by many domains, such as industry, medicine and finance. Analyzing this type of data is extremely valuable for various applications. Thus, different temporal data analysis tasks, eg, classification, clustering and prediction, have been proposed in the past decades. Among them, causal discovery, learning the causal relations from temporal data, is considered an interesting yet critical task and has attracted much research attention. Existing causal discovery works can be divided into two highly correlated categories according to whether the temporal data is calibrated, ie, multivariate time series causal discovery, and event sequence causal discovery. However, most previous surveys are only focused on the time series causal discovery and ignore the second category. In this paper, we specify the correlation between the two categories and provide a systematical overview of existing solutions. Furthermore, we provide public datasets, evaluation metrics and new perspectives for temporal data causal discovery.

cs.LG↗
arXiv2023

Autonomous Aerial Delivery Vehicles, a Survey of Techniques on how Aerial Package Delivery is Achieved

Autonomous aerial delivery vehicles have gained significant interest in the last decade. This has been enabled by technological advancements in aerial manipulators and novel grippers with enhanced force to weight ratios. Furthermore, improved control schemes and vehicle dynamics are better able to model the payload and improved perception algorithms to detect key features within the unmanned aerial vehicle's (UAV) environment. In this survey, a systematic review of the technological advancements and open research problems of autonomous aerial delivery vehicles is conducted. First, various types of manipulators and grippers are discussed in detail, along with dynamic modelling and control methods. Then, landing on static and dynamic platforms is discussed. Subsequently, risks such as weather conditions, state estimation and collision avoidance to ensure safe transit is considered. Finally, delivery UAV routing is investigated which categorises the topic into two areas: drone operations and drone-truck collaborative operations.

cs.RO↗
arXiv2023

Opportunistic Air Quality Monitoring and Forecasting with Expandable Graph Neural Networks

Air Quality Monitoring and Forecasting has been a popular research topic in recent years. Recently, data-driven approaches for air quality forecasting have garnered significant attention, owing to the availability of well-established data collection facilities in urban areas. Fixed infrastructures, typically deployed by national institutes or tech giants, often fall short in meeting the requirements of diverse personalized scenarios, e.g., forecasting in areas without any existing infrastructure. Consequently, smaller institutes or companies with limited budgets are compelled to seek tailored solutions by introducing more flexible infrastructures for data collection. In this paper, we propose an expandable graph attention network (EGAT) model, which digests data collected from existing and newly-added infrastructures, with different spatial structures. Additionally, our proposal can be embedded into any air quality forecasting models, to apply to the scenarios with evolving spatial structures. The proposal is validated over real air quality data from PurpleAir.

cs.LG↗
arXiv2023

Efficient Prediction of Peptide Self-assembly through Sequential and Graphical Encoding

In recent years, there has been an explosion of research on the application of deep learning to the prediction of various peptide properties, due to the significant development and market potential of peptides. Molecular dynamics has enabled the efficient collection of large peptide datasets, providing reliable training data for deep learning. However, the lack of systematic analysis of the peptide encoding, which is essential for AI-assisted peptide-related tasks, makes it an urgent problem to be solved for the improvement of prediction accuracy. To address this issue, we first collect a high-quality, colossal simulation dataset of peptide self-assembly containing over 62,000 samples generated by coarse-grained molecular dynamics (CGMD). Then, we systematically investigate the effect of peptide encoding of amino acids into sequences and molecular graphs using state-of-the-art sequential (i.e., RNN, LSTM, and Transformer) and structural deep learning models (i.e., GCN, GAT, and GraphSAGE), on the accuracy of peptide self-assembly prediction, an essential physiochemical process prior to any peptide-related applications. Extensive benchmarking studies have proven Transformer to be the most powerful sequence-encoding-based deep learning model, pushing the limit of peptide self-assembly prediction to decapeptides. In summary, this work provides a comprehensive benchmark analysis of peptide encoding with advanced deep learning models, serving as a guide for a wide range of peptide-related predictions such as isoelectric points, hydration free energy, etc.

q-bio.BM↗
arXiv2023

Quasinormal modes and stability of higher dimensional rotating black holes under massive scalar perturbations

We consider the stability of six-dimensional singly rotating Myers-Perry black holes under massive scalar perturbations. Using Leaver's continued fraction method, we compute the quasinormal modes of the massive scalar fields. All modes found are damped under the quasinormal boundary conditions. It is also found that long-living modes called quasiresonances exist for large scalar masses as in the four-dimensional Kerr black hole case. Our numerical results provide a direct and complement evidence for the stability of six-dimensional MP black holes under massive scalar perturbation.

gr-qc↗
arXiv2023

Modeling Inter-Class and Intra-Class Constraints in Novel Class Discovery

Novel class discovery (NCD) aims at learning a model that transfers the common knowledge from a class-disjoint labelled dataset to another unlabelled dataset and discovers new classes (clusters) within it. Many methods, as well as elaborate training pipelines and appropriate objectives, have been proposed and considerably boosted performance on NCD tasks. Despite all this, we find that the existing methods do not sufficiently take advantage of the essence of the NCD setting. To this end, in this paper, we propose to model both inter-class and intra-class constraints in NCD based on the symmetric Kullback-Leibler divergence (sKLD). Specifically, we propose an inter-class sKLD constraint to effectively exploit the disjoint relationship between labelled and unlabelled classes, enforcing the separability for different classes in the embedding space. In addition, we present an intra-class sKLD constraint to explicitly constrain the intra-relationship between a sample and its augmentations and ensure the stability of the training process at the same time. We conduct extensive experiments on the popular CIFAR10, CIFAR100 and ImageNet benchmarks and successfully demonstrate that our method can establish a new state of the art and can achieve significant performance improvements, e.g., 3.5%/3.7% clustering accuracy improvements on CIFAR100-50 dataset split under the task-aware/-agnostic evaluation protocol, over previous state-of-the-art methods. Code is available at https://github.com/FanZhichen/NCD-IIC.

cs.CV↗
arXiv2023

RotoGBML: Towards Out-of-Distribution Generalization for Gradient-Based Meta-Learning

Gradient-based meta-learning (GBML) algorithms are able to fast adapt to new tasks by transferring the learned meta-knowledge, while assuming that all tasks come from the same distribution (in-distribution, ID). However, in the real world, they often suffer from an out-of-distribution (OOD) generalization problem, where tasks come from different distributions. OOD exacerbates inconsistencies in magnitudes and directions of task gradients, which brings challenges for GBML to optimize the meta-knowledge by minimizing the sum of task gradients in each minibatch. To address this problem, we propose RotoGBML, a novel approach to homogenize OOD task gradients. RotoGBML uses reweighted vectors to dynamically balance diverse magnitudes to a common scale and uses rotation matrixes to rotate conflicting directions close to each other. To reduce overhead, we homogenize gradients with the features rather than the network parameters. On this basis, to avoid the intervention of non-causal features (e.g., backgrounds), we also propose an invariant self-information (ISI) module to extract invariant causal features (e.g., the outlines of objects). Finally, task gradients are homogenized based on these invariant causal features. Experiments show that RotoGBML outperforms other state-of-the-art methods on various few-shot image classification benchmarks.

cs.CV↗
arXiv2023

The Solar Upper Transition Region Imager (SUTRI) onboard the SATech-01 satellite

The Solar Upper Transition Region Imager (SUTRI) onboard the Space Advanced Technology demonstration satellite (SATech-01), which was launched to a sun-synchronous orbit at a height of 500 km in July 2022, aims to test the on-orbit performance of our newly developed Sc-Si multi-layer reflecting mirror and the 2kx2k EUV CMOS imaging camera and to take full-disk solar images at the Ne VII 46.5 nm spectral line with a filter width of 3 nm. SUTRI employs a Ritchey-Chretien optical system with an aperture of 18 cm. The on-orbit observations show that SUTRI images have a field of view of 41.6'x41.6' and a moderate spatial resolution of 8" without an image stabilization system. The normal cadence of SUTRI images is 30 s and the solar observation time is about 16 hours each day because the earth eclipse time accounts for about 1/3 of SATech-01's orbit period. Approximately 15 GB data is acquired each day and made available online after processing. SUTRI images are valuable as the Ne VII 46.5 nm line is formed at a temperature regime of 0.5 MK in the solar atmosphere, which has rarely been sampled by existing solar imagers. SUTRI observations will establish connections between structures in the lower solar atmosphere and corona, and advance our understanding of various types of solar activity such as flares, filament eruptions, coronal jets and coronal mass ejections.

astro-ph.SR↗
arXiv2023

Learning Explicit Credit Assignment for Cooperative Multi-Agent Reinforcement Learning via Polarization Policy Gradient

Cooperative multi-agent policy gradient (MAPG) algorithms have recently attracted wide attention and are regarded as a general scheme for the multi-agent system. Credit assignment plays an important role in MAPG and can induce cooperation among multiple agents. However, most MAPG algorithms cannot achieve good credit assignment because of the game-theoretic pathology known as \textit{centralized-decentralized mismatch}. To address this issue, this paper presents a novel method, \textit{\underline{M}ulti-\underline{A}gent \underline{P}olarization \underline{P}olicy \underline{G}radient} (MAPPG). MAPPG takes a simple but efficient polarization function to transform the optimal consistency of joint and individual actions into easily realized constraints, thus enabling efficient credit assignment in MAPG. Theoretically, we prove that individual policies of MAPPG can converge to the global optimum. Empirically, we evaluate MAPPG on the well-known matrix game and differential game, and verify that MAPPG can converge to the global optimum for both discrete and continuous action spaces. We also evaluate MAPPG on a set of StarCraft II micromanagement tasks and demonstrate that MAPPG outperforms the state-of-the-art MAPG algorithms.

cs.LG↗
arXiv2023

Achieving ferroelectricity in a centrosymmetric high-performance semiconductor by strain engineering

Phase engineering by strains in 2D semiconductors is of great importance for a variety of applications. Here, we present a study of strain induced ferroelectric (FE) transition on bismuth oxyselenide (Bi$_2$O$_2$Se) films, a high-performance (HP) semiconductor for next-generation electronics. Bi$_2$O$_2$Se is non-FE at ambient. Upon a loading force $\gtrsim 400$ nN, piezoelectric force responses exhibit butterfly loops on magnitude and 180$^\textrm{o}$ phase switching. By carefully ruling out extrinsic factors, these features are attributed to a transition to FE phase. The transition is further proved by the appearance of a sharp peak on optical second harmonic generation under an uniaxial strain. Fundamentally, solids with paraelectric at ambient and FE under strains are scarce. FE transition is discussed with the help of first-principle calculations and theoretical simulations. The switching of FE polarization acts as a knob for Schottky barrier engineering at contacts and serves as basis for a memristor with a huge switching ratio of 10$^6$. Our work endows a new degree of freedom to a HP electronic/optoelectronic semiconductor and the integration of FE and HP semiconductivity paving the way for multiple exciting functionalities, including HP neuromorphic computation and bulk piezophotovoltaic.

cond-mat.mtrl-sci↗