Searcharxiv⌕ Search

arXiv subjects

Jie Ding

Publications and source records attributed to Jie Ding.

At least 109 records · Page 6Linked to original sources

Learning Time Series from Scale Information

Sequentially obtained dataset usually exhibits different behavior at different data resolutions/scales. Instead of inferring from data at each scale individually, it is often more informative to interpret the data as an ensemble of time series from different scales. This naturally motivated us to propose a new concept referred to as the scale-based inference. The basic idea is that more accurate prediction can be made by exploiting scale information of a time series. We first propose a nonparametric predictor based on $k$-nearest neighbors with an optimally chosen $k$ for a single time series. Based on that, we focus on a specific but important type of scale information, the resolution/sampling rate of time series data. We then propose an algorithm to sequentially predict time series using past data at various resolutions. We prove that asymptotically the algorithm produces the mean prediction error that is no larger than the best possible algorithm at any single resolution, under some optimally chosen parameters. Finally, we establish the general formulations for scale inference, and provide further motivating examples. Experiments on both synthetic and real data illustrate the potential applicability of our approaches to a wide range of time series models.

cond-mat.mes-hall↗

Machine Learning Enabled Preamble Collision Resolution in Distributed Massive MIMO

Preamble collision is a bottleneck that impairs the performance of random access (RA) user equipment (UE) in grant-free RA (GFRA). In this paper, by leveraging distributed massive multiple input multiple output (mMIMO) together with machine learning, a novel machine learning based framework solution is proposed to address the preamble collision problem in GFRA. The key idea is to identify and employ the neighboring access points (APs) of a collided RA UE for its data decoding rather than all the APs, so that the mutual interference among collided RA UEs can be effectively mitigated. To this end, we first design a tailored deep neural network (DNN) to enable the preamble multiplicity estimation in GFRA, where an energy detection (ED) method is also proposed for performance comparison. With the estimated preamble multiplicity, we then propose a K-means AP clustering algorithm to cluster the neighboring APs of collided RA UEs and organize each AP cluster to decode the received data individually. Simulation results show that a decent performance of preamble multiplicity estimation in terms of accuracy and reliability can be achieved by the proposed DNN, and confirm that the proposed schemes are effective in preamble collision resolution in GFRA, which are able to achieve a near-optimal performance in terms of uplink achievable rate per collided RA UE, and offer significant performance improvement over traditional schemes.

eess.SP↗

On Statistical Efficiency in Learning

A central issue of many statistical learning problems is to select an appropriate model from a set of candidate models. Large models tend to inflate the variance (or overfitting), while small models tend to cause biases (or underfitting) for a given fixed dataset. In this work, we address the critical challenge of model selection to strike a balance between model fitting and model complexity, thus gaining reliable predictive power. We consider the task of approaching the theoretical limit of statistical learning, meaning that the selected model has the predictive performance that is as good as the best possible model given a class of potentially misspecified candidate models. We propose a generalized notion of Takeuchi's information criterion and prove that the proposed method can asymptotically achieve the optimal out-sample prediction loss under reasonable assumptions. It is the first proof of the asymptotic property of Takeuchi's information criterion to our best knowledge. Our proof applies to a wide variety of nonlinear models, loss functions, and high dimensionality (in the sense that the models' complexity can grow with sample size). The proposed method can be used as a computationally efficient surrogate for leave-one-out cross-validation. Moreover, for modeling streaming data, we propose an online algorithm that sequentially expands the model complexity to enhance selection stability and reduce computation cost. Experimental studies show that the proposed method has desirable predictive power and significantly less computational cost than some popular methods.

math.ST↗

Grant-Free Random Access in Machine-Type Communication: Approaches and Challenges

Massive machine-type communication (MTC) is expected to play a key role in supporting Internet of Things (IoT) applications such as smart cities, smart factory, and connected vehicles through cellular networks. MTC is characterized by a large number of MTC devices and their sparse activities, which are difficult to be supported by conventional approaches and motivate the design of new access technologies. In particular, in the 5th generation (5G), grant-free or 2-step random access schemes are introduced for MTC to be more efficient by reducing signaling overhead. In this article, we first introduce grant-free random access and discuss how it can be modified with massive multiple-input multiple-output (MIMO) to exploit a high spatial multiplexing gain. We then explain preamble designs that can improve the performance and variations based on the notion of non-orthogonal multiple access (NOMA). Finally, design challenges of grant-free random access towards next generation cellular systems are presented.

cs.IT↗

Assisted Learning: A Framework for Multi-Organization Learning

In an increasing number of AI scenarios, collaborations among different organizations or agents (e.g., human and robots, mobile units) are often essential to accomplish an organization-specific mission. However, to avoid leaking useful and possibly proprietary information, organizations typically enforce stringent security constraints on sharing modeling algorithms and data, which significantly limits collaborations. In this work, we introduce the Assisted Learning framework for organizations to assist each other in supervised learning tasks without revealing any organization's algorithm, data, or even task. An organization seeks assistance by broadcasting task-specific but nonsensitive statistics and incorporating others' feedback in one or more iterations to eventually improve its predictive performance. Theoretical and experimental studies, including real-world medical benchmarks, show that Assisted Learning can often achieve near-oracle learning performance as if data and training processes were centralized.

cs.LG↗

Fisher Auto-Encoders

It has been conjectured that the Fisher divergence is more robust to model uncertainty than the conventional Kullback-Leibler (KL) divergence. This motivates the design of a new class of robust generative auto-encoders (AE) referred to as Fisher auto-encoders. Our approach is to design Fisher AEs by minimizing the Fisher divergence between the intractable joint distribution of observed data and latent variables, with that of the postulated/modeled joint distribution. In contrast to KL-based variational AEs (VAEs), the Fisher AE can exactly quantify the distance between the true and the model-based posterior distributions. Qualitative and quantitative results are provided on both MNIST and celebA datasets demonstrating the competitive performance of Fisher AEs in terms of robustness compared to other AEs such as VAEs and Wasserstein AEs.

stat.ML↗

ASCII: ASsisted Classification with Ignorance Interchange

The rapid development in data collecting devices and computation platforms produces an emerging number of agents, each equipped with a unique data modality over a particular population of subjects. While the predictive performance of an agent may be enhanced by transmitting other data to it, this is often unrealistic due to intractable transmission costs and security concerns. While the predictive performance of an agent may be enhanced by transmitting other data to it, this is often unrealistic due to intractable transmission costs and security concerns. In this paper, we propose a method named ASCII for an agent to improve its classification performance through assistance from other agents. The main idea is to iteratively interchange an ignorance value between 0 and 1 for each collated sample among agents, where the value represents the urgency of further assistance needed. The method is naturally suitable for privacy-aware, transmission-economical, and decentralized learning scenarios. The method is also general as it allows the agents to use arbitrary classifiers such as logistic regression, ensemble tree, and neural network, and they may be heterogeneous among agents. We demonstrate the proposed method with extensive experimental studies.

cs.LG↗

The Efficacy of $L_1$ Regularization in Two-Layer Neural Networks

A crucial problem in neural networks is to select the most appropriate number of hidden neurons and obtain tight statistical risk bounds. In this work, we present a new perspective towards the bias-variance tradeoff in neural networks. As an alternative to selecting the number of neurons, we theoretically show that $L_1$ regularization can control the generalization error and sparsify the input dimension. In particular, with an appropriate $L_1$ regularization on the output layer, the network can produce a statistical risk that is near minimax optimal. Moreover, an appropriate $L_1$ regularization on the input layer leads to a risk bound that does not involve the input data dimension. Our analysis is based on a new amalgamation of dimension-based and norm-based complexity analysis to bound the generalization error. A consequent observation from our results is that an excessively large number of neurons do not necessarily inflate generalization errors under a suitable regularization.

cs.LG↗

Large Deviation Principle for the Whittaker 2d Growth Model

The Whittaker 2d growth model is a triangular continuous Markov diffusion process that appears in many scientific contexts. It has been theoretically intriguing to establish a large deviation principle for this 2d process with a scaling factor. The main challenge is the spatiotemporal interactions and dynamics that may depend on potential sample-path intersections. We develop such a principle with a novel rate function. Our approach is mainly based on Schider's Theorem, contraction principle, and special treatment for intersecting sample paths.

math.PR↗

Hysteresis and Linear Stability Analysis on Multiple Steady-State Solutions to the Poisson--Nernst--Planck equations with Steric Interactions

In this work, we numerically study linear stability of multiple steady-state solutions to a type of steric Poisson--Nernst--Planck (PNP) equations with Dirichlet boundary conditions, which are applicable to ion channels. With numerically found multiple steady-state solutions, we obtain $S$-shaped current-voltage and current-concentration curves, showing hysteretic response of ion conductance to voltages and boundary concentrations with memory effects. Boundary value problems are proposed to locate bifurcation points and predict the local bifurcation diagram near bifurcation points on the $S$-shaped curves. Numerical approaches for linear stability analysis are developed to understand the stability of the steady-state solutions that are only numerically available. Finite difference schemes are proposed to solve a derived eigenvalue problem involving differential operators. The linear stability analysis reveals that the $S$-shaped curves have two linearly stable branches of different conductance levels and one linearly unstable intermediate branch, exhibiting classical bistable hysteresis. As predicted in the linear stability analysis, transition dynamics, from a steady-state solution on the unstable branch to a one on the stable branches, are led by perturbations associated to the mode of the dominant eigenvalue. Further numerical tests demonstrate that the finite difference schemes proposed in the linear stability analysis are second-order accurate. Numerical approaches developed in this work can be applied to study linear stability of a class of time-dependent problems around their steady-state solutions that are computed numerically.

physics.comp-ph↗

Information Laundering for Model Privacy

In this work, we propose information laundering, a novel framework for enhancing model privacy. Unlike data privacy that concerns the protection of raw data information, model privacy aims to protect an already-learned model that is to be deployed for public use. The private model can be obtained from general learning methods, and its deployment means that it will return a deterministic or random response for a given input query. An information-laundered model consists of probabilistic components that deliberately maneuver the intended input and output for queries to the model, so the model's adversarial acquisition is less likely. Under the proposed framework, we develop an information-theoretic principle to quantify the fundamental tradeoffs between model utility and privacy leakage and derive the optimal design.

cs.CR↗

Imitation Privacy

In recent years, there have been many cloud-based machine learning services, where well-trained models are provided to users on a pay-per-query scheme through a prediction API. The emergence of these services motivates this work, where we will develop a general notion of model privacy named imitation privacy. We show the broad applicability of imitation privacy in classical query-response MLaaS scenarios and new multi-organizational learning scenarios. We also exemplify the fundamental difference between imitation privacy and the usual data-level privacy.

cs.CR↗

Forecasting with Multiple Seasonality

An emerging number of modern applications involve forecasting time series data that exhibit both short-time dynamics and long-time seasonality. Specifically, time series with multiple seasonality is a difficult task with comparatively fewer discussions. In this paper, we propose a two-stage method for time series with multiple seasonality, which does not require pre-determined seasonality periods. In the first stage, we generalize the classical seasonal autoregressive moving average (ARMA) model in multiple seasonality regime. In the second stage, we utilize an appropriate criterion for lag order selection. Simulation and empirical studies show the excellent predictive performance of our method, especially compared to a recently popular `Facebook Prophet' model for time series.

cs.LG↗

Towards Enabling Critical mMTC: A Review of URLLC within mMTC

Massive machine-type communication (mMTC) and ultra-reliable and low-latency communication (URLLC) are two key service types in the fifth-generation (5G) communication systems, pursuing scalability and reliability with low-latency, respectively. These two extreme services are envisaged to agglomerate together into \emph{critical mMTC} shortly with emerging use cases (e.g., wide-area disaster monitoring, wireless factory automation), creating new challenges to designing wireless systems beyond 5G. While conventional network slicing is effective in supporting a simple mixture of mMTC and URLLC, it is difficult to simultaneously guarantee the reliability, latency, and scalability requirements of critical mMTC (e.g., < 4ms latency, $10^6$ devices/km$^2$ for factory automation) with limited radio resources. Furthermore, recently proposed solutions to scalable URLLC (e.g., machine learning aided URLLC for driverless vehicles) are ill-suited to critical mMTC whose machine type users have minimal energy budget and computing capability that should be (tightly) optimized for given tasks. To this end, our paper aims to characterize promising use cases of critical mMTC and search for their possible solutions. To this end, we first review the state-of-the-art (SOTA) technologies for separate mMTC and URLLC services and then identify key challenges from conflicting SOTA requirements, followed by potential approaches to prospective critical mMTC solutions at different layers.

cs.NI↗

Subcarrier-wise Backscatter Communications over Ambient OFDM for Low Power IoT

Ambient backscatter communication (AmBC) over orthogonal-frequency-division-multiplexing (OFDM) signals has recently been proposed as an appealing technique for low power Internet-of-Things (IoT) applications. The special spectrum structure of OFDM signals provides a range of flexibility in terms of bit-error-rate (BER) performance, data rate, and power consumption. In this paper, we study subcarrier-wise backscatter communication over ambient OFDM signals. This new AmBC is to exploit the special spectrum structure of OFDM to transmit data over its squeezed orthogonal subcarriers. We propose a basis transmission scheme and its two modifications to support a higher data rate with superior BER performance compared to existing methods. The basis scheme can transmit one bit per subcarrier using on-off keying (OOK) modulation in the frequency domain. In the first modification, interleaved subcarrier block transmission model is employed to improve the BER performance of the system in frequency-selective channels. It results in a trade-off between the size of the blocks and data rate. Thus, in the second modification, interleaved index modulation (IM) is employed to mitigate the data rate decrementation of the former modification. It also stabilizes and controls the power of the signal to result in interference reduction for a legacy receiver. Analytical and numerical evaluations provide a proof to see the performance of the proposed method in terms of BER, data rate, and interference.

eess.SP↗

Short-Range Ambient Backscatter Communication Using Reconfigurable Intelligent Surfaces

Ambient backscatter communication (AmBC) has been introduced to address communication and power efficiency issues for short-range and low-power Internet-of-Things (IoT) applications. On the other hand, reconfigurable intelligent surface (RIS) has been recently proposed as a promising approach that can control the propagation environment especially in indoor communication environments. In this paper, we propose a new AmBC model over ambient orthogonal-frequency-division-multiplexing (OFDM) subcarriers in the frequency domain in conjunction with RIS for short-range communication scenarios. A tag transmits one bit per each OFDM subcarrier broadcasted from a WiFi access point. Then, RIS augments the signal quality at a reader by compensating the phase distortion effect of multipath channel on the incident signal. We also exploit the special spectrum structure of OFDM to transmit more data over its squeezed orthogonal subcarriers in the frequency domain. Consequently, the proposed method improves the bit-error-rate (BER) performance and provides a higher data rate compared to existing AmBC methods. Analytical and numerical evaluations show the superior performance of the proposed approach in terms of BER and data rate.

eess.SP↗

Non-escaping points of Zorich maps

We extend results about the dimension of the radial Julia set of certain exponential functions to quasiregular Zorich maps in higher dimensions. Our results improve on previous estimates of the dimension also in the special case of exponential functions.

math.DS↗

IoT Connectivity Technologies and Applications: A Survey

The Internet of Things (IoT) is rapidly becoming an integral part of our life and also multiple industries. We expect to see the number of IoT connected devices explosively grows and will reach hundreds of billions during the next few years. To support such a massive connectivity, various wireless technologies are investigated. In this survey, we provide a broad view of the existing wireless IoT connectivity technologies and discuss several new emerging technologies and solutions that can be effectively used to enable massive connectivity for IoT. In particular, we categorize the existing wireless IoT connectivity technologies based on coverage range and review diverse types of connectivity technologies with different specifications. We also point out key technical challenges of the existing connectivity technologies for enabling massive IoT connectivity. To address the challenges, we further review and discuss some examples of promising technologies such as compressive sensing (CS) random access, non-orthogonal multiple access (NOMA), and massive multiple input multiple output (mMIMO) based random access that could be employed in future standards for supporting IoT connectivity. Finally, a classification of IoT applications is considered in terms of various service requirements. For each group of classified applications, we outline its suitable IoT connectivity options.

eess.SP↗