arXiv subjects

Jiming Chen

Publications and source records attributed to Jiming Chen.

At least 109 records · Page 6Linked to original sources

arXiv2023

Global and Asymptotically Efficient Localization from Range Measurements

We consider the range-based localization problem, which involves estimating an object's position by using $m$ sensors, hoping that as the number $m$ of sensors increases, the estimate converges to the true position with the minimum variance. We show that under some conditions on the sensor deployment and measurement noises, the LS estimator is strongly consistent and asymptotically normal. However, the LS problem is nonsmooth and nonconvex, and therefore hard to solve. We then devise realizable estimators that possess the same asymptotic properties as the LS one. These estimators are based on a two-step estimation architecture, which says that any $\sqrt{m}$-consistent estimate followed by a one-step Gauss-Newton iteration can yield a solution that possesses the same asymptotic property as the LS one. The keypoint of the two-step scheme is to construct a $\sqrt{m}$-consistent estimate in the first step. In terms of whether the variance of measurement noises is known or not, we propose the Bias-Eli estimator (which involves solving a generalized trust region subproblem) and the Noise-Est estimator (which is obtained by solving a convex problem), respectively. Both of them are proved to be $\sqrt{m}$-consistent. Moreover, we show that by discarding the constraints in the above two optimization problems, the resulting closed-form estimators (called Bias-Eli-Lin and Noise-Est-Lin) are also $\sqrt{m}$-consistent. Plenty of simulations verify the correctness of our theoretical claims, showing that the proposed two-step estimators can asymptotically achieve the Cramer-Rao lower bound.

eess.SP↗

arXiv2022

$α$ DARTS Once More: Enhancing Differentiable Architecture Search by Masked Image Modeling

Differentiable architecture search (DARTS) has been a mainstream direction in automatic machine learning. Since the discovery that original DARTS will inevitably converge to poor architectures, recent works alleviate this by either designing rule-based architecture selection techniques or incorporating complex regularization techniques, abandoning the simplicity of the original DARTS that selects architectures based on the largest parametric value, namely $α$. Moreover, we find that all the previous attempts only rely on classification labels, hence learning only single modal information and limiting the representation power of the shared network. To this end, we propose to additionally inject semantic information by formulating a patch recovery approach. Specifically, we exploit the recent trending masked image modeling and do not abandon the guidance from the downstream tasks during the search phase. Our method surpasses all previous DARTS variants and achieves state-of-the-art results on CIFAR-10, CIFAR-100, and ImageNet without complex manual-designed strategies.

cs.CV↗

arXiv2022

Pixel-Aligned Non-parametric Hand Mesh Reconstruction

Non-parametric mesh reconstruction has recently shown significant progress in 3D hand and body applications. In these methods, mesh vertices and edges are visible to neural networks, enabling the possibility to establish a direct mapping between 2D image pixels and 3D mesh vertices. In this paper, we seek to establish and exploit this mapping with a simple and compact architecture. The network is designed with these considerations: 1) aggregating both local 2D image features from the encoder and 3D geometric features captured in the mesh decoder; 2) decoding coarse-to-fine meshes along the decoding layers to make the best use of the hierarchical multi-scale information. Specifically, we propose an end-to-end pipeline for hand mesh recovery tasks which consists of three phases: a 2D feature extractor constructing multi-scale feature maps, a feature mapping module transforming local 2D image features to 3D vertex features via 3D-to-2D projection, and a mesh decoder combining the graph convolution and self-attention to reconstruct mesh. The decoder aggregate both local image features in pixels and geometric features in vertices. It also regresses the mesh vertices in a coarse-to-fine manner, which can leverage multi-scale information. By exploiting the local connection and designing the mesh decoder, Our approach achieves state-of-the-art for hand mesh reconstruction on the public FreiHAND dataset.

cs.CV↗

arXiv2022

Performance forecasts for the primordial gravitational wave detection pipelines for AliCPT-1

AliCPT is the first Chinese cosmic microwave background (CMB) experiment which will make the most precise measurements of the CMB polarization in the northern hemisphere. The key science goal for AliCPT is the detection of primordial gravitational waves (PGWs). It is well known that an epoch of cosmic inflation, in the very early universe, can produce PGWs, which leave an imprint on the CMB in form of odd parity $B$-mode polarization. In this work, we study the performance of the component separation and parameter estimation pipelines in context of constraining the value of the tensor-to-scalar ratio. Based on the simulated data for one observation season, we compare five different pipelines with different working principles. Three pipelines perform component separation at map or spectra level before estimating $r$ from the cleaned spectra, while the other two pipelines performs a global fit for both foreground parameters and $r$. We also test different methods to account for the effects of time stream filtering systematics. This work shows that our pipelines provide consistent and robust constraints on the tensor-to-scalar ratio and a consistent sensitivity $σ(r) \sim 0.02$. This showcases the potential of precise $B$-mode polarization measurement with AliCPT-1. AliCPT will provide a powerful opportunity to detect PGWs, which is complementary with various ground-based CMB experiments in the southern hemisphere.

astro-ph.CO↗

arXiv2022

PrivTrace: Differentially Private Trajectory Synthesis by Adaptive Markov Model

Publishing trajectory data (individual's movement information) is very useful, but it also raises privacy concerns. To handle the privacy concern, in this paper, we apply differential privacy, the standard technique for data privacy, together with Markov chain model, to generate synthetic trajectories. We notice that existing studies all use Markov chain model and thus propose a framework to analyze the usage of the Markov chain model in this problem. Based on the analysis, we come up with an effective algorithm PrivTrace that uses the first-order and second-order Markov model adaptively. We evaluate PrivTrace and existing methods on synthetic and real-world datasets to demonstrate the superiority of our method.

cs.CR↗

arXiv2022

Generalized Global Ranking-Aware Neural Architecture Ranker for Efficient Image Classifier Search

Neural Architecture Search (NAS) is a powerful tool for automating effective image processing DNN designing. The ranking has been advocated to design an efficient performance predictor for NAS. The previous contrastive method solves the ranking problem by comparing pairs of architectures and predicting their relative performance. However, it only focuses on the rankings between two involved architectures and neglects the overall quality distributions of the search space, which may suffer generalization issues. A predictor, namely Neural Architecture Ranker (NAR) which concentrates on the global quality tier of specific architecture, is proposed to tackle such problems caused by the local perspective. The NAR explores the quality tiers of the search space globally and classifies each individual to the tier they belong to according to its global ranking. Thus, the predictor gains the knowledge of the performance distributions of the search space which helps to generalize its ranking ability to the datasets more easily. Meanwhile, the global quality distribution facilitates the search phase by directly sampling candidates according to the statistics of quality tiers, which is free of training a search algorithm, e.g., Reinforcement Learning (RL) or Evolutionary Algorithm (EA), thus it simplifies the NAS pipeline and saves the computational overheads. The proposed NAR achieves better performance than the state-of-the-art methods on two widely used datasets for NAS research. On the vast search space of NAS-Bench-101, the NAR easily finds the architecture with top 0.01$\unicode{x2030}$ performance only by sampling. It also generalizes well to different image datasets of NAS-Bench-201, i.e., CIFAR-10, CIFAR-100, and ImageNet-16-120 by identifying the optimal architectures for each of them.

cs.CV↗

arXiv2022

AsyncFedED: Asynchronous Federated Learning with Euclidean Distance based Adaptive Weight Aggregation

In an asynchronous federated learning framework, the server updates the global model once it receives an update from a client instead of waiting for all the updates to arrive as in the synchronous setting. This allows heterogeneous devices with varied computing power to train the local models without pausing, thereby speeding up the training process. However, it introduces the stale model problem, where the newly arrived update was calculated based on a set of stale weights that are older than the current global model, which may hurt the convergence of the model. In this paper, we present an asynchronous federated learning framework with a proposed adaptive weight aggregation algorithm, referred to as AsyncFedED. To the best of our knowledge this aggregation method is the first to take the staleness of the arrived gradients, measured by the Euclidean distance between the stale model and the current global model, and the number of local epochs that have been performed, into account. Assuming general non-convex loss functions, we prove the convergence of the proposed method theoretically. Numerical results validate the effectiveness of the proposed AsyncFedED in terms of the convergence rate and model accuracy compared to the existing methods for three considered tasks.

cs.LG↗

arXiv2022

VeriFi: Towards Verifiable Federated Unlearning

Federated learning (FL) is a collaborative learning paradigm where participants jointly train a powerful model without sharing their private data. One desirable property for FL is the implementation of the right to be forgotten (RTBF), i.e., a leaving participant has the right to request to delete its private data from the global model. However, unlearning itself may not be enough to implement RTBF unless the unlearning effect can be independently verified, an important aspect that has been overlooked in the current literature. In this paper, we prompt the concept of verifiable federated unlearning, and propose VeriFi, a unified framework integrating federated unlearning and verification that allows systematic analysis of the unlearning and quantification of its effect, with different combinations of multiple unlearning and verification methods. In VeriFi, the leaving participant is granted the right to verify (RTV), that is, the participant notifies the server before leaving, then actively verifies the unlearning effect in the next few communication rounds. The unlearning is done at the server side immediately after receiving the leaving notification, while the verification is done locally by the leaving participant via two steps: marking (injecting carefully-designed markers to fingerprint the leaver) and checking (examining the change of the global model's performance on the markers). Based on VeriFi, we conduct the first systematic and large-scale study for verifiable federated unlearning, considering 7 unlearning methods and 5 verification methods. Particularly, we propose a more efficient and FL-friendly unlearning method, and two more effective and robust non-invasive-verification methods. We extensively evaluate VeriFi on 7 datasets and 4 types of deep learning models. Our analysis establishes important empirical understandings for more trustworthy federated unlearning.

cs.CR↗

arXiv2022

Scalar quadratic maximum likelihood estimators for the CMB cross power spectrum

Estimating the cross-correlation power spectra of cosmic microwave background (CMB), in particular, the T B and EB spectra, is important for testing parity symmetry in cosmology and diagnosing insidious instruments systematics. The Quadratic Maximum Likelihood (QML) estimator provides the optimal estimates of power spectra, but it is computationally very expensive. The hybrid pseudo-Cl estimator is computationally fast but performs poorly on large scales. As a natural extension of previous work (Chen et al. 2021), in this article, we present a new unbiased estimator based on the Smith-Zaldarriaga (SZ) approach of E-B separation and scalar QML approach to reconstruct the cross-correlation power spectrum, called QML-SZ estimator. Our new estimator relies on the ability to construct scalar maps, which allows us to use a scalar QML estimator to obtain the cross-correlation power spectrum. By reducing the pixel number and algorithm complexity, the computational cost is nearly one order of magnitude smaller and the running time is nearly two orders of magnitude faster in the test situations.

astro-ph.IM↗

arXiv2021

AHEAD: Adaptive Hierarchical Decomposition for Range Query under Local Differential Privacy

For protecting users' private data, local differential privacy (LDP) has been leveraged to provide the privacy-preserving range query, thus supporting further statistical analysis. However, existing LDP-based range query approaches are limited by their properties, i.e., collecting user data according to a pre-defined structure. These static frameworks would incur excessive noise added to the aggregated data especially in the low privacy budget setting. In this work, we propose an Adaptive Hierarchical Decomposition (AHEAD) protocol, which adaptively and dynamically controls the built tree structure, so that the injected noise is well controlled for maintaining high utility. Furthermore, we derive a guideline for properly choosing parameters for AHEAD so that the overall utility can be consistently competitive while rigorously satisfying LDP. Leveraging multiple real and synthetic datasets, we extensively show the effectiveness of AHEAD in both low and high dimensional range query scenarios, as well as its advantages over the state-of-the-art methods. In addition, we provide a series of useful observations for deploying AHEAD in practice.

cs.CR↗

arXiv2021

FTPipeHD: A Fault-Tolerant Pipeline-Parallel Distributed Training Framework for Heterogeneous Edge Devices

With the increased penetration and proliferation of Internet of Things (IoT) devices, there is a growing trend towards distributing the power of deep learning (DL) across edge devices rather than centralizing it in the cloud. This development enables better privacy preservation, real-time responses, and user-specific models. To deploy deep and complex models to edge devices with limited resources, model partitioning of deep neural networks (DNN) model is necessary, and has been widely studied. However, most of the existing literature only considers distributing the inference model while still relying centralized cloud infrastructure to generate this model through training. In this paper, we propose FTPipeHD, a novel DNN training framework that trains DNN models across distributed heterogeneous devices with fault tolerance mechanism. To accelerate the training with time-varying computing power of each device, we optimize the partition points dynamically according to real-time computing capacities. We also propose a novel weight redistribution approach that replicates the weights to both the neighboring nodes and the central node periodically, which combats the failure of multiple devices during training while incurring limited communication cost. Our numerical results demonstrate that FTPipeHD is 6.8x faster in training than the state of the art method when the computing capacity of the best device is 10x greater than the worst one. It is also shown that the proposed method is able to accelerate the training even with the existence of device failures.

cs.LG↗

arXiv2021

Fast scalar quadratic maximum likelihood estimators for the CMB B-mode power spectrum

Constructing a fast and efficient estimator for the B-mode power spectrum of cosmic microwave background (CMB) is of critical importance for CMB science. For a general CMB survey, the Quadratic Maximum Likelihood (QML) estimator for CMB polarization has been proved to be the optimal estimator with minimal uncertainties, but it is computationally very expensive. In this article, we propose two new QML methods for B-mode power spectrum estimation. We use the Smith-Zaldarriaga approach to prepare pure-B mode map, and E-mode recycling method to obtain a leakage free B-mode map. We then use the scalar QML estimator to analyze the scalar pure-B map (QML-SZ) or B-mode map (QML-TC). The QML-SZ and QML-TC estimators have similar error bars as the standard QML estimators but their computational cost is nearly one order of magnitude smaller. The basic idea is that one can construct the pure B-mode CMB map by using the E-B separation method proposed by Smith-Zaldarriaga (SZ) or the one considering the template cleaning (TC) technique, then apply QML estimator to these scalar fields. By simulating potential observations of space-based and ground-based detectors, we test the reliability of these estimators by comparing them with the corresponding results of the traditional QML estimator and the pure B-mode pseudo-Cl estimator.

astro-ph.CO↗

arXiv2021

False Data Injection Attacks and the Distributed Countermeasure in DC Microgrids

In this paper, we consider a hierarchical control based DC microgrid (DCmG) equipped with unknown input observer (UIO) based detectors, where the potential false data injection (FDI) attacks and the distributed countermeasure are investigated. First, we find that the vulnerability of the UIO-based detector originates from the lacked knowledge of true unknown inputs. Zero trace stealthy (ZTS) attacks can be launched by secretly faking the unknown inputs, under which the detection residual will not be altered, and the impact on the DCmG in terms of voltage balancing and current sharing is theoretically analyzed. Then, to mitigate the ZTS attack, we propose an automatic and timely countermeasure based on the average point of common coupling (PCC) voltage obtained from the dynamic average consensus (DAC) estimator. The integrity of the communicated data utilized in DAC estimators is guaranteed via UIO-based detectors, where the DAC parameters are perturbed in a fixed period to be concealed from attackers. Finally, the detection and mitigation performance of the proposed countermeasure is rigorously investigated, and extensive simulations are conducted in Simulink/PLECS to validate the theoretical results.

eess.SY↗

arXiv2021

Reconstructing simulated CMB polarization power spectra with the Analytical Blind Separation method

Multi-frequency observations are needed to separate the CMB from foregrounds and accurately extract cosmological information from the data. The Analytical Blind Separation (ABS) method is dedicated to extracting the CMB power spectrum from multi-frequency observations in the presence of contamination from astrophysical foreground emission and instrumental noise. In this study, we apply the ABS method to simulated sky maps as could be observed with a future space-borne survey, in order to test the method's capability for determining the CMB polarization $E$- and $B$-mode power spectra. We present the ABS method performance on simulations for both a full-sky analysis and for an analysis concentrating on sky regions less impacted by Galactic foreground emission. We discuss the origin and minimization of biases in the estimated CMB polarization angular power spectra. We find that the ABS method performs quite well for the analysis of full-sky observations at intermediate and small angular scales, in spite of strong foreground contamination. On the largest scales, extra work is still required to reduce biases of various origins and the impact of confusion between CMB $E$ and $B$ polarization for partial-sky analyses.

astro-ph.CO↗

arXiv2021

Fairness-aware Outlier Ensemble

Outlier ensemble methods have shown outstanding performance on the discovery of instances that are significantly different from the majority of the data. However, without the awareness of fairness, their applicability in the ethical scenarios, such as fraud detection and judiciary judgement system, could be degraded. In this paper, we propose to reduce the bias of the outlier ensemble results through a fairness-aware ensemble framework. Due to the lack of ground truth in the outlier detection task, the key challenge is how to mitigate the degradation in the detection performance with the improvement of fairness. To address this challenge, we define a distance measure based on the output of conventional outlier ensemble techniques to estimate the possible cost associated with detection performance degradation. Meanwhile, we propose a post-processing framework to tune the original ensemble results through a stacking process so that we can achieve a trade off between fairness and detection performance. Detection performance is measured by the area under ROC curve (AUC) while fairness is measured at both group and individual level. Experiments on eight public datasets are conducted. Results demonstrate the effectiveness of the proposed framework in improving fairness of outlier ensemble results. We also analyze the trade-off between AUC and fairness.

cs.LG↗

arXiv2020

PrivSyn: Differentially Private Data Synthesis

In differential privacy (DP), a challenging problem is to generate synthetic datasets that efficiently capture the useful information in the private data. The synthetic dataset enables any task to be done without privacy concern and modification to existing algorithms. In this paper, we present PrivSyn, the first automatic synthetic data generation method that can handle general tabular datasets (with 100 attributes and domain size $>2^{500}$). PrivSyn is composed of a new method to automatically and privately identify correlations in the data, and a novel method to generate sample data from a dense graphic model. We extensively evaluate different methods on multiple datasets to demonstrate the performance of our method.

cs.CR↗

arXiv2020

Universal Urban Spreading Pattern of COVID-19 and Its Underlying Mechanism

Currently, the global situation of COVID-19 is aggravating, pressingly calling for efficient control and prevention measures. Understanding spreading pattern of COVID-19 has been widely recognized as a vital step for implementing non-pharmaceutical measures. Previous studies investigated such an issue in large-scale (e.g., inter-country or inter-state) scenarios while urban spreading pattern still remains an open issue. Here, we fill this gap by leveraging the trajectory data of 197,808 smartphone users (including 17,808 anonymous confirmed cases) in 9 cities in China. We find a universal spreading pattern in all cities: the spatial distribution of confirmed cases follows a power-law-like model and the spreading centroid is time-invariant. Moreover, we reveal that human mobility in a city drives the spatialtemporal spreading process: long average travelling distance results in a high growth rate of spreading radius and wide spatial diffusion of confirmed cases. With such insight, we adopt Kendall model to simulate urban spreading of COVID-19 that can well fit the real spreading process. Our results unveil the underlying mechanism behind the spatial-temporal urban evolution of COVID-19, and can be used to evaluate the performance of mobility restriction policies implemented by many governments and to estimate the evolving spreading situation of COVID-19.

physics.soc-ph↗

arXiv2020

PIDNet: An Efficient Network for Dynamic Pedestrian Intrusion Detection

Vision-based dynamic pedestrian intrusion detection (PID), judging whether pedestrians intrude an area-of-interest (AoI) by a moving camera, is an important task in mobile surveillance. The dynamically changing AoIs and a number of pedestrians in video frames increase the difficulty and computational complexity of determining whether pedestrians intrude the AoI, which makes previous algorithms incapable of this task. In this paper, we propose a novel and efficient multi-task deep neural network, PIDNet, to solve this problem. PIDNet is mainly designed by considering two factors: accurately segmenting the dynamically changing AoIs from a video frame captured by the moving camera and quickly detecting pedestrians from the generated AoI-contained areas. Three efficient network designs are proposed and incorporated into PIDNet to reduce the computational complexity: 1) a special PID task backbone for feature sharing, 2) a feature cropping module for feature cropping, and 3) a lighter detection branch network for feature compression. In addition, considering there are no public datasets and benchmarks in this field, we establish a benchmark dataset to evaluate the proposed network and give the corresponding evaluation metrics for the first time. Experimental results show that PIDNet can achieve 67.1% PID accuracy and 9.6 fps inference speed on the proposed dataset, which serves as a good baseline for the future vision-based dynamic PID study.

cs.CV↗