arXiv subjects

Feng Li

Publications and source records attributed to Feng Li.

At least 217 records · Page 12Linked to original sources

arXiv2023

Loss-difference-induced localization in a non-Hermitian honeycomb photonic lattice

Non-Hermitian systems with complex-valued energy spectra provide an extraordinary platform for manipulating unconventional dynamics of light. Here, we demonstrate the localization of light in an instantaneously reconfigurable non-Hermitian honeycomb photonic lattice that is established in a coherently-prepared atomic system. One set of the sublattices is optically modulated to introduce the absorptive difference between neighboring lattice sites, where the Dirac points in reciprocal space are extended into dispersionless local flat bands. When these local flat bands are broad enough due to larger loss difference, the incident beam is effectively localized at one set of the lattices with weaker absorption, namely, the commonly seen power exchange between adjacent channels in photonic lattices is effectively prohibited. The current work unlocks a new capability from non-Hermitian two-dimensional photonic lattices and provides an alternative route for engineering tunable local flat bands in photonic structures.

physics.optics↗

arXiv2022

Simultaneous creation of multiple vortex-antivortex pairs in momentum space in photonic lattices

Engineering of the orbital angular momentum (OAM) of light due to interaction with photonic lattices reveals rich physics and motivates potential applications. We report the experimental creation of regularly-distributed quantized vortex arrays in momentum space by probing the honeycomb and hexagonal photonic lattices with a single focused Gaussian beam. For the honeycomb lattice, the vortices are associated with Dirac points and mimic the Berry curvature sources. However, we show that the resulting spatial patterns of vortices are strongly defined by the symmetry of the wave packet evolving in the optical lattice but not by lattice topological properties. Our findings reveal the underlying physics by connecting the symmetry and OAM conversion, and provide a simple and efficient method to create regularly-distributed multiple vortices by unstructured light.

physics.optics↗

arXiv2022

Enhancing Federated Learning with spectrum allocation optimization and device selection

Machine learning (ML) is a widely accepted means for supporting customized services for mobile devices and applications. Federated Learning (FL), which is a promising approach to implement machine learning while addressing data privacy concerns, typically involves a large number of wireless mobile devices to collect model training data. Under such circumstances, FL is expected to meet stringent training latency requirements in the face of limited resources such as demand for wireless bandwidth, power consumption, and computation constraints of participating devices. Due to practical considerations, FL selects a portion of devices to participate in the model training process at each iteration. Therefore, the tasks of efficient resource management and device selection will have a significant impact on the practical uses of FL. In this paper, we propose a spectrum allocation optimization mechanism for enhancing FL over a wireless mobile network. Specifically, the proposed spectrum allocation optimization mechanism minimizes the time delay of FL while considering the energy consumption of individual participating devices; thus ensuring that all the participating devices have sufficient resources to train their local models. In this connection, to ensure fast convergence of FL, a robust device selection is also proposed to help FL reach convergence swiftly, especially when the local datasets of the devices are not independent and identically distributed (non-iid). Experimental results show that (1) the proposed spectrum allocation optimization method optimizes time delay while satisfying the individual energy constraints; (2) the proposed device selection method enables FL to achieve the fastest convergence on non-iid datasets.

cs.DC↗

arXiv2022

Asymptotic behavior of nonlocal $p$-Rayleigh quotients

Let $N\geq 1$, $s,k\in(0,1)$, $p\in(1,\infty)$. Let $t>1$, open bounded set $Ω\subset\mathbb R^N$, $R$ be the radius of $Ω$. Let $B_{tR}(Ω)$ be the ball containing $Ω$ with radius $tR$ and with the same center as $Ω$. In this article we study the asymptotic behavior of the first $(s,p)$-eigenvalue and corresponding first $(s,p)$-eigenfunctions during the approximation $k\rightarrow s$. We show that there exhibits a different phenomenon between the two directions of discontinuity of $k\rightarrow s^-$ and continuity of $k\rightarrow s^+$, which can be triggered by behaviors of eigenfunctions on the boundary points bearing the positive Besov Capacity. And this difference prompts us to study the boundary behavior of operators $(-Δ_p)^s$ on the irregular boundary points. We also characterize some equivalent forms of the continuity case when $k\rightarrow s^-$. In the end, we construct a counterexample for the discontinuity case during $k\rightarrow s^-$ based on the positivity of Besov capacity of Cantor set and the fine decay estimates up to the regular boundary points, used by P. Lindqvist and O. Martio. The proof works by reducing $\widetilde W^{s,p}_0(Ω)$ to the so-called Relative-nonlocal spaces $\widetilde W^{s,p}_{0,tR}(Ω)$ introduced here, which is equivalent to $\widetilde W^{s,p}_0(Ω)$, where $\widetilde W^{s,p}_0(Ω)$ is defined as the completion of $C^\infty_0(Ω)$ under the Gagliardo semi-norm $W^{s,p}(\mathbb R^N)$, and $\widetilde W^{s,p}_{0,tR}(Ω)$ defined as the completion of $C^\infty_0(Ω)$ under the Gagliardo semi-norm $W^{s,p}(B_{tR}(Ω))$. As a partial result, we established the Homemorphism of the operator $(-Δ_p)^s$ between $\widetilde W^{s,p}_0(Ω)$ and its dual space $\widetilde W^{-s,p^\prime}(Ω)$, where $1/p+1/p^\prime=1$.

math.AP↗

arXiv2022

Technical Report -- Competition Solution for Prompt Tuning using Pretrained Language Model

Prompt tuning recently becomes a hot-spot in the applications of large pretrained language models on specific downstream tasks. Regarding the Language Model as a Service (LMaaS), black-box tuning using derivative-free optimization (DFO) provides a novel approach to expand the practical scenarios of pretrained models and enrich the researches of few-shot learning. In this report, we present our solution in this competition that is based on the LMaaS scenario. Our solution consists of several modifications to BBTv2, including multiple label words, selection of P0, rolling update strategy, multi-task loss from MLP classifier, and finally using the ensemble method to further improve generalization ability. We also shared some strategies that we tried but didn't use in the final submission for further discussion. In the end we raised a question about the SNLI dataset and the impact on the results, as well as our concerns about the competition.

cs.CL↗

arXiv2022

Mask DINO: Towards A Unified Transformer-based Framework for Object Detection and Segmentation

In this paper we present Mask DINO, a unified object detection and segmentation framework. Mask DINO extends DINO (DETR with Improved Denoising Anchor Boxes) by adding a mask prediction branch which supports all image segmentation tasks (instance, panoptic, and semantic). It makes use of the query embeddings from DINO to dot-product a high-resolution pixel embedding map to predict a set of binary masks. Some key components in DINO are extended for segmentation through a shared architecture and training process. Mask DINO is simple, efficient, and scalable, and it can benefit from joint large-scale detection and segmentation datasets. Our experiments show that Mask DINO significantly outperforms all existing specialized segmentation methods, both on a ResNet-50 backbone and a pre-trained model with SwinL backbone. Notably, Mask DINO establishes the best results to date on instance segmentation (54.5 AP on COCO), panoptic segmentation (59.4 PQ on COCO), and semantic segmentation (60.8 mIoU on ADE20K) among models under one billion parameters. Code is available at \url{https://github.com/IDEACVR/MaskDINO}.

cs.CV↗

arXiv2022

Integrated optimization of train timetables rescheduling and response vehicles on a disrupted metro line

When an unexpected metro disruption occurs, metro managers need to reschedule timetables to avoid trains going into the disruption area, and transport passengers stranded at disruption stations as quickly as possible. This paper proposes a two-stage optimization model to jointly make decisions for two tasks. In the first stage, the timetable rescheduling problem with cancellation and short-turning strategies is formulated as a mixed integer linear programming (MILP). In particular, the instantaneous parameters and variables are used to describe the accumulation of time-varying passenger flow. In the second one, a system-optimal dynamic traffic assignment (SODTA) model is employed to dynamically schedule response vehicles, which is able to capture the dynamic traffic and congestion. Numerical cases of Beijing Metro Line 9 verify the efficiency and effectiveness of our proposed model, and results show that: (1) when occurring a disruption event during peak hours, the impact on the normal timetable is greater, and passengers in the direction with fewer train services are more affected; (2) if passengers stranded at the terminal stations of disruption area are not transported in time, they will rapidly increase at a speed of more than 300 passengers per minute; (3) compared with the fixed shortest path, using the response vehicles reduces the total travel time about 7%. However, it results in increased travel time for some passengers.

eess.SY↗

arXiv2022

DN-DETR: Accelerate DETR Training by Introducing Query DeNoising

We present in this paper a novel denoising training method to speedup DETR (DEtection TRansformer) training and offer a deepened understanding of the slow convergence issue of DETR-like methods. We show that the slow convergence results from the instability of bipartite graph matching which causes inconsistent optimization goals in early training stages. To address this issue, except for the Hungarian loss, our method additionally feeds ground-truth bounding boxes with noises into Transformer decoder and trains the model to reconstruct the original boxes, which effectively reduces the bipartite graph matching difficulty and leads to a faster convergence. Our method is universal and can be easily plugged into any DETR-like methods by adding dozens of lines of code to achieve a remarkable improvement. As a result, our DN-DETR results in a remarkable improvement ($+1.9$AP) under the same setting and achieves the best result (AP $43.4$ and $48.6$ with $12$ and $50$ epochs of training respectively) among DETR-like methods with ResNet-$50$ backbone. Compared with the baseline under the same setting, DN-DETR achieves comparable performance with $50\%$ training epochs. Code is available at \url{https://github.com/FengLi-ust/DN-DETR}.

cs.CV↗

arXiv2022

Learning Detail-Structure Alternative Optimization for Blind Super-Resolution

Existing convolutional neural networks (CNN) based image super-resolution (SR) methods have achieved impressive performance on bicubic kernel, which is not valid to handle unknown degradations in real-world applications. Recent blind SR methods suggest to reconstruct SR images relying on blur kernel estimation. However, their results still remain visible artifacts and detail distortion due to the estimation errors. To alleviate these problems, in this paper, we propose an effective and kernel-free network, namely DSSR, which enables recurrent detail-structure alternative optimization without blur kernel prior incorporation for blind SR. Specifically, in our DSSR, a detail-structure modulation module (DSMM) is built to exploit the interaction and collaboration of image details and structures. The DSMM consists of two components: a detail restoration unit (DRU) and a structure modulation unit (SMU). The former aims at regressing the intermediate HR detail reconstruction from LR structural contexts, and the latter performs structural contexts modulation conditioned on the learned detail maps at both HR and LR spaces. Besides, we use the output of DSMM as the hidden state and design our DSSR architecture from a recurrent convolutional neural network (RCNN) view. In this way, the network can alternatively optimize the image details and structural contexts, achieving co-optimization across time. Moreover, equipped with the recurrent connection, our DSSR allows low- and high-level feature representations complementary by observing previous HR details and contexts at every unrolling time. Extensive experiments on synthetic datasets and real-world images demonstrate that our method achieves the state-of-the-art against existing methods. The source code can be found at https://github.com/Arcananana/DSSR.

cs.CV↗

arXiv2022

Bridging Component Learning with Degradation Modelling for Blind Image Super-Resolution

Convolutional Neural Network (CNN)-based image super-resolution (SR) has exhibited impressive success on known degraded low-resolution (LR) images. However, this type of approach is hard to hold its performance in practical scenarios when the degradation process is unknown. Despite existing blind SR methods proposed to solve this problem using blur kernel estimation, the perceptual quality and reconstruction accuracy are still unsatisfactory. In this paper, we analyze the degradation of a high-resolution (HR) image from image intrinsic components according to a degradation-based formulation model. We propose a components decomposition and co-optimization network (CDCN) for blind SR. Firstly, CDCN decomposes the input LR image into structure and detail components in feature space. Then, the mutual collaboration block (MCB) is presented to exploit the relationship between both two components. In this way, the detail component can provide informative features to enrich the structural context and the structure component can carry structural context for better detail revealing via a mutual complementary manner. After that, we present a degradation-driven learning strategy to jointly supervise the HR image detail and structure restoration process. Finally, a multi-scale fusion module followed by an upsampling layer is designed to fuse the structure and detail features and perform SR reconstruction. Empowered by such degradation-based components decomposition, collaboration, and mutual optimization, we can bridge the correlation between component learning and degradation modelling for blind SR, thereby producing SR results with more accurate textures. Extensive experiments on both synthetic SR datasets and real-world images show that the proposed method achieves the state-of-the-art performance compared to existing methods.

cs.CV↗

arXiv2022

DQ-DETR: Dual Query Detection Transformer for Phrase Extraction and Grounding

In this paper, we study the problem of visual grounding by considering both phrase extraction and grounding (PEG). In contrast to the previous phrase-known-at-test setting, PEG requires a model to extract phrases from text and locate objects from images simultaneously, which is a more practical setting in real applications. As phrase extraction can be regarded as a $1$D text segmentation problem, we formulate PEG as a dual detection problem and propose a novel DQ-DETR model, which introduces dual queries to probe different features from image and text for object prediction and phrase mask prediction. Each pair of dual queries is designed to have shared positional parts but different content parts. Such a design effectively alleviates the difficulty of modality alignment between image and text (in contrast to a single query design) and empowers Transformer decoder to leverage phrase mask-guided attention to improve performance. To evaluate the performance of PEG, we also propose a new metric CMAP (cross-modal average precision), analogous to the AP metric in object detection. The new metric overcomes the ambiguity of Recall@1 in many-box-to-one-phrase cases in phrase grounding. As a result, our PEG pre-trained DQ-DETR establishes new state-of-the-art results on all visual grounding benchmarks with a ResNet-101 backbone. For example, it achieves $91.04\%$ and $83.51\%$ in terms of recall rate on RefCOCO testA and testB with a ResNet-101 backbone. Code will be availabl at \url{https://github.com/IDEA-Research/DQ-DETR}.

cs.CV↗

arXiv2022

Electromagnetic Nonreciprocity in a Magnetized Plasma Circulator

Nonreciprocal transport of electromagnetic waves within magnetized plasma is a powerful building block towards understanding and exploiting the properties of more general topological systems. Much recent attention has been paid to the theoretical issues of wave interaction within such a medium, but there is a lack of experimental verification that such systems can be viable in a lab or industrial setting. This work provides an experimental proof-of-concept by demonstrating nonreciprocity in a unit component, a microwave plasma circulator. We design an E-plane Y junction plasma circulator operating in the range of 4 to 6 GHz using standardized waveguide specifications. From both simulations and experiments, we observe wide band isolation for the power transmission through the circulator. The performance and the frequency band of the circulator can be easily tuned by changing the plasma density and the magnetic field strength. By linking simulations and experimental results, we estimate the plasma density for the device.

physics.plasm-ph↗

arXiv2022

A Unified Mutual Supervision Framework for Referring Expression Segmentation and Generation

Reference Expression Segmentation (RES) and Reference Expression Generation (REG) are mutually inverse tasks that can be naturally jointly trained. Though recent work has explored such joint training, the mechanism of how RES and REG can benefit each other is still unclear. In this paper, we propose a unified mutual supervision framework that enables two tasks to improve each other. Our mutual supervision contains two directions. On the one hand, Disambiguation Supervision leverages the expression unambiguity measurement provided by RES to enhance the language generation of REG. On the other hand, Generation Supervision uses expressions automatically generated by REG to scale up the training of RES. Such unified mutual supervision effectively improves two tasks by solving their bottleneck problems. Extensive experiments show that our approach significantly outperforms all existing methods on REG and RES tasks under the same setting, and detailed ablation studies demonstrate the effectiveness of all components in our framework.

cs.CV↗

arXiv2022

Cloud removal Using Atmosphere Model

Cloud removal is an essential task in remote sensing data analysis. As the image sensors are distant from the earth ground, it is likely that part of the area of interests is covered by cloud. Moreover, the atmosphere in between creates a constant haze layer upon the acquired images. To recover the ground image, we propose to use scattering model for temporal sequence of images of any scene in the framework of low rank and sparse models. We further develop its variant, which is much faster and yet more accurate. To measure the performance of different methods {\em objectively}, we develop a semi-realistic simulation method to produce cloud cover so that various methods can be quantitatively analysed, which enables detailed study of many aspects of cloud removal algorithms, including verifying the effectiveness of proposed models in comparison with the state-of-the-arts, including deep learning models, and addressing the long standing problem of the determination of regularisation parameters. The latter is companioned with theoretic analysis on the range of the sparsity regularisation parameter and verified numerically.

cs.CV↗

arXiv2022

Forecast combinations: an over 50-year review

Forecast combinations have flourished remarkably in the forecasting community and, in recent years, have become part of the mainstream of forecasting research and activities. Combining multiple forecasts produced from single (target) series is now widely used to improve accuracy through the integration of information gleaned from different sources, thereby mitigating the risk of identifying a single "best" forecast. Combination schemes have evolved from simple combination methods without estimation, to sophisticated methods involving time-varying weights, nonlinear combinations, correlations among components, and cross-learning. They include combining point forecasts and combining probabilistic forecasts. This paper provides an up-to-date review of the extensive literature on forecast combinations, together with reference to available open-source software implementations. We discuss the potential and limitations of various methods and highlight how these ideas have developed over time. Some important issues concerning the utility of forecast combinations are also surveyed. Finally, we conclude with current research gaps and potential insights for future research.

stat.ME↗

arXiv2022

Feature-based intermittent demand forecast combinations: bias, accuracy and inventory implications

Intermittent demand forecasting is a ubiquitous and challenging problem in production systems and supply chain management. In recent years, there has been a growing focus on developing forecasting approaches for intermittent demand from academic and practical perspectives. However, limited attention has been given to forecast combination methods, which have achieved competitive performance in forecasting fast-moving time series. The current study aims to examine the empirical outcomes of some existing forecast combination methods and propose a generalized feature-based framework for intermittent demand forecasting. The proposed framework has been shown to improve the accuracy of point and quantile forecasts based on two real data sets. Further, some analysis of features, forecasting pools and computational efficiency is also provided. The findings indicate the intelligibility and flexibility of the proposed approach in intermittent demand forecasting and offer insights regarding inventory decisions.

stat.AP↗

arXiv2022

Intelligent detect for substation insulator defects based on CenterMask

With the development of intelligent operation and maintenance of substations, the daily inspection of substations needs to process massive video and image data. This puts forward higher requirements on the processing speed and accuracy of defect detection. Based on the end-to-end learning paradigm, this paper proposes an intelligent detection method for substation insulator defects based on CenterMask. First, the backbone network VoVNet is improved according to the residual connection and eSE module, which effectively solves the problems of deep network saturation and gradient information loss. On this basis, an insulator mask generation method based on a spatial attentiondirected mechanism is proposed. Insulators with complex image backgrounds are accurately segmented. Then, three strategies of pixel-wise regression prediction, multi-scale features and centerness are introduced. The anchor-free single-stage target detector accurately locates the defect points of insulators. Finally, an example analysis is carried out with the substation inspection image of a power supply company in a certain area to verify the effectiveness and robustness of the proposed method.

eess.SY↗

arXiv2022

Machine Learning Prediction of COVID-19 Severity Levels From Salivaomics Data

The clinical spectrum of severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2), the strain of coronavirus that caused the COVID-19 pandemic, is broad, extending from asymptomatic infection to severe immunopulmonary reactions that, if not categorized properly, may be life-threatening. Researchers rate COVID-19 patients on a scale from 1 to 8 according to the severity level of COVID-19, 1 being healthy and 8 being extremely sick, based on a multitude of factors including number of clinic visits, days since the first sign of symptoms, and more. However, there are two issues with the current state of severity level designation. Firstly, there exists variation among researchers in determining these patient scores, which may lead to improper treatment. Secondly, researchers use a variety of metrics to determine patient severity level, including metrics involving plasma collection that require invasive procedures. This project aims to remedy both issues by introducing a machine learning framework that unifies severity level designations based on noninvasive saliva biomarkers. Our results show that we can successfully use machine learning on salivaomics data to predict the severity level of COVID-19 patients, indicating the presence of viral load using saliva biomarkers.

q-bio.QM↗