Searcharxiv⌕ Search

arXiv subjects

Sheetal Kalyani

Publications and source records attributed to Sheetal Kalyani.

At least 55 records · Page 3Linked to original sources

Rotate the ReLU to implicitly sparsify deep networks

In the era of Deep Neural Network based solutions for a variety of real-life tasks, having a compact and energy-efficient deployable model has become fairly important. Most of the existing deep architectures use Rectifier Linear Unit (ReLU) activation. In this paper, we propose a novel idea of rotating the ReLU activation to give one more degree of freedom to the architecture. We show that this activation wherein the rotation is learned via training results in the elimination of those parameters/filters in the network which are not important for the task. In other words, rotated ReLU seems to be doing implicit sparsification. The slopes of the rotated ReLU activations act as coarse feature extractors and unnecessary features can be eliminated before retraining. Our studies indicate that features always choose to pass through a lesser number of filters in architectures such as ResNet and its variants. Hence, by rotating the ReLU, the weights or the filters that are not necessary are automatically identified and can be dropped thus giving rise to significant savings in memory and computation. Furthermore, in some cases, we also notice that along with saving in memory and computation we also obtain improvement over the reported performance of the corresponding baseline work in the popular datasets such as MNIST, CIFAR-10, CIFAR-100, and SVHN.

cs.LG↗

The robust way to stack and bag: the local Lipschitz way

Recent research has established that the local Lipschitz constant of a neural network directly influences its adversarial robustness. We exploit this relationship to construct an ensemble of neural networks which not only improves the accuracy, but also provides increased adversarial robustness. The local Lipschitz constants for two different ensemble methods - bagging and stacking - are derived and the architectures best suited for ensuring adversarial robustness are deduced. The proposed ensemble architectures are tested on MNIST and CIFAR-10 datasets in the presence of white-box attacks, FGSM and PGD. The proposed architecture is found to be more robust than a) a single network and b) traditional ensemble methods.

cs.LG↗

A New Expression for the Product of Two $κ-μ$ Shadowed Random Variables and its Application to Wireless Communication

In this work, the product of two independent and non-identically distributed (i.n.i.d) $κ- μ$ shadowed random variables is studied. We derive the series expression for the probability density function (PDF), cumulative distribution function (CDF), and moment generating function (MGF) of the product of two (i.n.i.d) $κ- μ$ shadowed random variables. The derived formulation in this work is quite general as they incorporate most of the typically used fading channels. As an application example, outage probability (OP) has been derived for cascaded wireless systems and relay-assisted communications with a variable gain relay. Extensive Monte-Carlo simulations have also been carried out.

cs.IT↗

On the Asymptotic Performance Analysis of the k-th Best Link Selection over Non-identical Non-central Chi-square Fading Channels

This paper derives the asymptotic distribution of the normalized $k$-th maximum order statistics of a sequence of non-central chi-square random variables with non-identical non-centrality parameter. We demonstrate the utility of these results in characterizing the signal to noise ratio in three different applications in wireless communication systems where the statistics of the $k$-th maximum channel power over Rician fading links are of interest. Furthermore, we derive simple expressions for the asymptotic outage probability, average throughput, achievable throughput, and the average bit error probability. The proposed results are validated via extensive Monte Carlo simulations.

cs.IT↗

Cooperative 3D Beamforming for Small-Cell and Cell-Free 6G Systems

Three dimensional (3D) resource reuse is an important design requirement for the prospective 6G wireless communication systems. Hence, we propose a cooperative 3D beamformer for use in 3D space. Explicitly, we harness multiple base station antennas for joint zero forcing transmit pre-coding for beaming the transmit signals in specific 3D directions. The technique advocated is judiciously configured for use in both cell-based and cell-free wireless architectures. We evaluated the performance of the proposed scheme using the novel metric of Volumetric Spectral Efficiency (VSE). We also characterized the performance of the scheme in terms of its spectral efficiency (SE) and Bit Error Rate (BER) through extensive simulation studies.

eess.SP↗

How to boost autoencoders?

Autoencoders are a category of neural networks with applications in numerous domains and hence, improvement of their performance is gaining substantial interest from the machine learning community. Ensemble methods, such as boosting, are often adopted to enhance the performance of regular neural networks. In this work, we discuss the challenges associated with boosting autoencoders and propose a framework to overcome them. The proposed method ensures that the advantages of boosting are realized when either output (encoded or reconstructed) is used. The usefulness of the boosted ensemble is demonstrated in two applications that widely employ autoencoders: anomaly detection and clustering.

cs.LG↗

BayesAoA: A Bayesian method for Computation Efficient Angle of Arrival Estimation

The angle of Arrival (AoA) estimation is of great interest in modern communication systems. Traditional maximum likelihood-based iterative algorithms are sensitive to initialization and cannot be used online. We propose a Bayesian method to find AoA that is insensitive towards initialization. The proposed method is less complex and needs fewer computing resources than traditional deep learning-based methods. It has a faster convergence than the brute-force methods. Further, a Hedge type solution is proposed that helps to deploy the method online to handle the situations where the channel noise and antenna configuration in the receiver change over time. The proposed method achieves $92\%$ accuracy in a channel of noise variance $10^{-6}$ with $19.3\%$ of the brute-force method's computation.

eess.SP↗

Outage Probability Expressions for an IRS-Assisted System with and without Source-Destination Link for the Case of Quantized Phase Shifts in $κ-μ$ fading

In this work, we study the outage probability (OP) at the destination of an intelligent reflecting surface (IRS) assisted communication system in a $κ-μ$ fading environment. A practical system model that takes into account the presence of phase error due to quantization at the IRS when a) source-destination (SD) link is present and b) SD link is absent is considered. First, an exact expression is derived, and then we derive three simple approximations for the OP using the following approaches: (i) uni-variate dimension reduction, (ii) moment matching and, (iii) Kullback-Leibler divergence minimization. The resulting expressions for OP are simple to evaluate and quite tight even in the tail region. The validity of these approximations is demonstrated using extensive Monte Carlo simulations. We also study the impact of the number of bits available for quantization, the position of IRS with respect to the source and destination and the number of IRS elements on the OP for systems with and without an SD link.

cs.IT↗

Airplane-Aided Integrated Next-Generation Networking

A high-rate yet low-cost air-to-ground (A2G) communication backbone is conceived for integrating the space and terrestrial network by harnessing the opportunistic assistance of the passenger planes or high altitude platforms (HAPs) as mobile base stations (BSs) and millimetre wave communication. The airliners act as the network-provider for the terrestrial users while relying on satellite backhaul. Three different beamforming techniques relying on a large-scale planar array are used for transmission by the airliner/HAP for achieving a high directional gain, hence minimizing the interference among the users. Furthermore, approximate spectral efficiency (SE) and area spectral efficiency (ASE) expressions are derived and quantified for diverse system parameters.

eess.SP↗

Realizing Neural Decoder at the Edge with Ensembled BNN

In this work, we propose extreme compression techniques like binarization, ternarization for Neural Decoders such as TurboAE. These methods reduce memory and computation by a factor of 64 with a performance better than the quantized (with 1-bit or 2-bits) Neural Decoders. However, because of the limited representation capability of the Binary and Ternary networks, the performance is not as good as the real-valued decoder. To fill this gap, we further propose to ensemble 4 such weak performers to deploy in the edge to achieve a performance similar to the real-valued network. These ensemble decoders give 16 and 64 times saving in memory and computation respectively and help to achieve performance similar to real-valued TurboAE.

cs.IT↗

Deep learned SVT: Unrolling singular value thresholding to obtain better MSE

Affine rank minimization problem is the generalized version of low rank matrix completion problem where linear combinations of the entries of a low rank matrix are observed and the matrix is estimated from these measurements. We propose a trainable deep neural network by unrolling a popular iterative algorithm called the singular value thresholding (SVT) algorithm to perform this generalized matrix completion which we call Learned SVT (LSVT). We show that our proposed LSVT with fixed layers (say T) reconstructs the matrix with lesser mean squared error (MSE) compared with that incurred by SVT with fixed (same T) number of iterations and our method is much more robust to the parameters which need to be carefully chosen in SVT algorithm.

cs.LG↗

Green DetNet: Computation and Memory efficient DetNet using Smart Compression and Training

This paper introduces an incremental training framework for compressing popular Deep Neural Network (DNN) based unfolded multiple-input-multiple-output (MIMO) detection algorithms like DetNet. The idea of incremental training is explored to select the optimal depth while training. To reduce the computation requirements or the number of FLoating point OPerations (FLOPs) and enforce sparsity in weights, the concept of structured regularization is explored using group LASSO and sparse group LASSO. Our methods lead to an astounding $98.9\%$ reduction in memory requirement and $81.63\%$ reduction in FLOPs when compared with DetNet without compromising on BER performance.

cs.IT↗

Deep Reinforcement Learning based Blind mmWave MIMO Beam Alignment

Directional beamforming is a crucial component for realizing robust wireless communication systems using millimeter wave (mmWave) technology. Beam alignment using brute-force search of the space introduces time overhead while location aided blind beam alignment adds additional hardware requirements to the system. In this paper, we introduce a method for blind beam alignment based on the RF fingerprints of user equipment obtained by the base stations. The proposed system performs blind beam alignment on a multiple base station cellular environment with multiple mobile users using deep reinforcement learning. We present a novel neural network architecture that can handle a mix of both continuous and discrete actions and use policy gradient methods to train the model. Our results show that the proposed method can achieve a data rate of up to four times the traditional method without any overheads.

eess.SP↗

On the Differentially Private Nature of Perturbed Gradient Descent

We consider the problem of empirical risk minimization given a database, using the gradient descent algorithm. We note that the function to be optimized may be non-convex, consisting of saddle points which impede the convergence of the algorithm. A perturbed gradient descent algorithm is typically employed to escape these saddle points. We show that this algorithm, that perturbs the gradient, inherently preserves the privacy of the data. We then employ the differential privacy framework to quantify the privacy hence achieved. We also analyze the change in privacy with varying parameters such as problem dimension and the distance between the databases.

cs.LG↗

Cooperative relaying in a SWIPT network:Asymptotic analysis using extreme value theory for non-identically distributed RVs

This paper derives the distribution of the maximum end-to-end (e2e) signal to noise ratio (SNR) in an opportunistic relay selection based cooperative relaying (CR) network having large number of non-identical relay links between the source and destination node. The source node is assumed to be simultaneous wireless information and power transfer (SWIPT) enabled and the relays are capable of both time splitting (TS) and power splitting (PS) based energy harvesting (EH). Contrary to the majority of literature in communication, which uses extreme value theory (EVT) to derive the statistics of extremes of sequences of independent and identically distributed (i.i.d.) random variables (RVs), we demonstrate how tools from EVT can be used to derive the asymptotic statistics of sequences of independent and non-identically distributed (i.n.i.d.) normalised SNR RVs and hence characterise the distribution of the maximum e2e SNR RV. Using these results we derive the expressions for ergodic and outage capacities at the destination node. Finally, we present the utility of the asymptotic results for deciding the optimum TS and PS factors of the hybrid EH relays that (i) minimise outage probability and (ii) maximise ergodic capacity at the destination. Furthermore, we demonstrate how stochastic ordering results can be utilised for simplifying these optimisation problems.

cs.IT↗

Intelligent Reflecting Surface Assisted Beam Index-Modulation for Millimeter Wave Communication

Millimeter wave communication is eminently suitable for high-rate wireless systems, which may be beneficially amalgamated with intelligent reflecting surfaces (IRS), relying on beam-index modulation. Explicitly, we propose three different architectures based on IRSs for beam-index modulation in millimeter wave communication, which circumvent the line-of-sight blockage of millimeter wave frequencies. We conceive both the optimal maximum likelihood detector and a low-complexity compressed sensing detector for the proposed schemes. Finally, the schemes conceived are evaluated through extensive simulations, which are compared to our analytically obtained bounds.

eess.SP↗

Tune smarter not harder: A principled approach to tuning learning rates for shallow nets

Effective hyper-parameter tuning is essential to guarantee the performance that neural networks have come to be known for. In this work, a principled approach to choosing the learning rate is proposed for shallow feedforward neural networks. We associate the learning rate with the gradient Lipschitz constant of the objective to be minimized while training. An upper bound on the mentioned constant is derived and a search algorithm, which always results in non-divergent traces, is proposed to exploit the derived bound. It is shown through simulations that the proposed search method significantly outperforms the existing tuning methods such as Tree Parzen Estimators (TPE). The proposed method is applied to three different existing applications: a) channel estimation in OFDM systems, b) prediction of the exchange currency rates and c) offset estimation in OFDM receivers, and it is shown to pick better learning rates than the existing methods using the same or lesser compute power.

cs.LG↗

Subspace clustering without knowing the number of clusters: A parameter free approach

Subspace clustering, the task of clustering high dimensional data when the data points come from a union of subspaces is one of the fundamental tasks in unsupervised machine learning. Most of the existing algorithms for this task require prior knowledge of the number of clusters along with few additional parameters which need to be set or tuned apriori according to the type of data to be clustered. In this work, a parameter free method for subspace clustering is proposed, where the data points are clustered on the basis of the difference in statistical distribution of the angles subtended by the data points within a subspace and those by points belonging to different subspaces. Given an initial fine clustering, the proposed algorithm merges the clusters until a final clustering is obtained. This, unlike many existing methods, does not require the number of clusters apriori. Also, the proposed algorithm does not involve the use of an unknown parameter or tuning for one. %through cross validation. A parameter free method for producing a fine initial clustering is also discussed, making the whole process of subspace clustering parameter free. The comparison of proposed algorithm's performance with that of the existing state-of-the-art techniques in synthetic and real data sets, shows the significance of the proposed method.

stat.ML↗