Searcharxiv⌕ Search

arXiv subjects

Farokh Marvasti

Publications and source records attributed to Farokh Marvasti.

At least 19 recordsLinked to original sources

A Versatile Framework for Designing Group-Sparse Adversarial Attacks

Existing adversarial attacks often neglect perturbation sparsity, limiting their ability to model structural changes and to explain how deep neural networks (DNNs) process meaningful input patterns. We propose ATOS (Attack Through Overlapping Sparsity), a differentiable optimization framework that generates structured, sparse adversarial perturbations in element-wise, pixel-wise, and group-wise forms. For white-box attacks on image classifiers, we introduce the Overlapping Smoothed L0 (OSL0) function, which promotes convergence to a stationary point while encouraging sparse, structured perturbations. By grouping channels and adjacent pixels, ATOS improves interpretability and helps identify robust versus non-robust features. We approximate the L-infinity gradient using the logarithm of the sum of exponential absolute values to tightly control perturbation magnitude. On CIFAR-10 and ImageNet, ATOS achieves a 100% attack success rate while producing significantly sparser and more structurally coherent perturbations than prior methods. The structured group-wise attack highlights critical regions from the network's perspective, providing counterfactual explanations by replacing class-defining regions with robust features from the target class.

cs.CR↗

Resilient Signal Reflection under CSI Perturbations: A Robust Approach for Secure RIS Communication

Reconfigurable Intelligent Surfaces (RIS) have emerged as a transformative technology in wireless communication, enabling dynamic control over signal propagation. This paper tackles the challenge of mitigating Channel State Information (CSI) perturbations in RIS-aided systems, particularly for secure communication scenarios. Leveraging a first-order approximation technique, we develop a robust approach that strengthens the resilience of RIS configurations against CSI imperfections. The study considers both untrusted user interception and stealth radar applications, focusing on optimizing signal reflection and transmission in the presence of eavesdroppers. Simulation results demonstrate notable gains in security and efficiency while maintaining low computational complexity. By extending the stability range, the proposed method updates RIS elements using only a few matrix-vector multiplications, eliminating the need for repeated inverse or pseudo-inverse computations under small channel perturbations. Additionally, the framework provides a baseline for quantifying algorithmic sensitivity to CSI variations. Overall, the findings underscore the potential of RIS to enable secure and reliable communication in next-generation networks such as 6G.

eess.SP↗

Time-Varying Graph Learning for Data with Heavy-Tailed Distribution

Graph models provide efficient tools to capture the underlying structure of data defined over networks. Many real-world network topologies are subject to change over time. Learning to model the dynamic interactions between entities in such networks is known as time-varying graph learning. Current methodology for learning such models often lacks robustness to outliers in the data and fails to handle heavy-tailed distributions, a common feature in many real-world datasets (e.g., financial data). This paper addresses the problem of learning time-varying graph models capable of efficiently representing heavy-tailed data. Unlike traditional approaches, we incorporate graph structures with specific spectral properties to enhance data clustering in our model. Our proposed method, which can also deal with noise and missing values in the data, is based on a stochastic approach, where a non-negative vector auto-regressive (VAR) model captures the variations in the graph and a Student-t distribution models the signal originating from this underlying time-varying graph. We propose an iterative method to learn time-varying graph topologies within a semi-online framework where only a mini-batch of data is used to update the graph. Simulations with both synthetic and real datasets demonstrate the efficacy of our model in analyzing heavy-tailed data, particularly those found in financial markets.

cs.LG↗

Non-Orthogonal Time-Frequency Space Modulation

This paper proposes a Time-Frequency Space Transformation (TFST) to derive non-orthogonal bases for modulation techniques over the delay-doppler plane. A family of Overloaded Delay-Doppler Modulation (ODDM) techniques is proposed based on the TFST, which enhances flexibility and efficiency by expressing modulated signals as a linear combination of basis signals. A Non-Orthogonal Time-Frequency Space (NOTFS) digital modulation is derived for the proposed ODDM techniques, and simulations show that they offer high-mobility communication systems with improved spectral efficiency and low latency, particularly in challenging scenarios such as high overloading factors and Additive White Gaussian Noise (AWGN) channels. A modified sphere decoding algorithm is also presented to efficiently decode the received signal. The proposed modulation and decoding techniques contribute to the advancement of non-orthogonal approaches in the next-generation of mobile communication systems, delivering superior spectral efficiency and low latency, and offering a promising solution towards the development of efficient high-mobility communication systems.

cs.IT↗

Augmenting SEFDM Performance in High-Doppler Channels

This paper presents an innovative approach leveraging Spectrally Efficient Frequency Division Multiplexing (SEFDM) with enhancements, including Frequency Domain Cyclic Prefix (FDCP) and Modified Non-Linear (MNL) acceleration, to address challenges arising from delay and Doppler shift in mobile communication channels. Our methodology demonstrates superior performance and enhanced spectral efficiency while incurring minimal computational overhead. We conduct a rigorous evaluation of the SEFDM system model, examining the impact of the MNL acceleration on SEFDM detection, and assessing the effectiveness of FDCP in mitigating Doppler shift effects. Bit Error Rate (BER) results obtained through Regularized Sphere Decoding in diverse simulation scenarios affirm the capability of our proposed solution to effectively manage challenges, ensuring robust and high-quality connectivity in mobile communication networks.

eess.SP↗

Joint Signal Recovery and Graph Learning from Incomplete Time-Series

Learning a graph from data is the key to taking advantage of graph signal processing tools. Most of the conventional algorithms for graph learning require complete data statistics, which might not be available in some scenarios. In this work, we aim to learn a graph from incomplete time-series observations. From another viewpoint, we consider the problem of semi-blind recovery of time-varying graph signals where the underlying graph model is unknown. We propose an algorithm based on the method of block successive upperbound minimization (BSUM), for simultaneous inference of the signal and the graph from incomplete data. Simulation results on synthetic and real time-series demonstrate the performance of the proposed method for graph learning and signal recovery.

cs.LG↗

Distributed Estimation with Partially Accessible Information: An IMAT Approach to LMS Diffusion

Distributed algorithms, particularly Diffusion Least Mean Square, are widely favored for their reliability, robustness, and fast convergence in various industries. However, limited observability of the target can compromise the integrity of the algorithm. To address this issue, this paper proposes a framework for analyzing combination strategies by drawing inspiration from signal flow analysis. A thresholding-based algorithm is also presented to identify and utilize the support vector in scenarios with missing information about the target vector's support. The proposed approach is demonstrated in two combination scenarios, showcasing the effectiveness of the algorithm in situations characterized by sparse observations in the time and transform domains.

eess.SP↗

Iterative method for simultaneous sparse approximation

This paper studies the problem of Simultaneous Sparse Approximation (SSA). This problem arises in many applications which work with multiple signals maintaining some degree of dependency such as radar and sensor networks. In this paper, we introduce a new method towards joint recovery of several independent sparse signals with the same support. We provide an analytical discussion on the convergence of our method called Simultaneous Iterative Method with Adaptive Thresholding (SIMAT). Additionally, we compare our method with other group-sparse reconstruction techniques, i.e., Simultaneous Orthogonal Matching Pursuit (SOMP), and Block Iterative Method with Adaptive Thresholding (BIMAT) through numerical experiments. The simulation results demonstrate that SIMAT outperforms these algorithms in terms of the metrics Signal to Noise Ratio (SNR) and Success Rate (SR). Moreover, SIMAT is considerably less complicated than BIMAT, which makes it feasible for practical applications such as implementation in MIMO radar systems.

cs.IT↗

Algorithmic Trading Using Continuous Action Space Deep Reinforcement Learning

Price movement prediction has always been one of the traders' concerns in financial market trading. In order to increase their profit, they can analyze the historical data and predict the price movement. The large size of the data and complex relations between them lead us to use algorithmic trading and artificial intelligence. This paper aims to offer an approach using Twin-Delayed DDPG (TD3) and the daily close price in order to achieve a trading strategy in the stock and cryptocurrency markets. Unlike previous studies using a discrete action space reinforcement learning algorithm, the TD3 is continuous, offering both position and the number of trading shares. Both the stock (Amazon) and cryptocurrency (Bitcoin) markets are addressed in this research to evaluate the performance of the proposed algorithm. The achieved strategy using the TD3 is compared with some algorithms using technical analysis, reinforcement learning, stochastic, and deterministic strategies through two standard metrics, Return and Sharpe ratio. The results indicate that employing both position and the number of trading shares can improve the performance of a trading system based on the mentioned metrics.

cs.LG↗

Robust Adaptive Generalized Correntropy-based Smoothed Graph Signal Recovery with a Kernel Width Learning

This paper proposes a robust adaptive algorithm for smooth graph signal recovery which is based on generalized correntropy. A proper cost function is defined for this purpose. The proposed algorithm is derived and a kernel width learning-based version of the algorithm is suggested which the simulation results show the superiority of it to the fixed correntropy kernel version of the algorithm. Moreover, some theoretical analysis of the proposed algorithm are provided. In this regard, firstly, the convexity analysis of the cost function is discussed. Secondly, the uniform stability of the algorithm is investigated. Thirdly, the mean convergence analysis is also added. Finally, the complexity analysis of the algorithm is incorporated. In addition, some synthetic and real-world experiments show the advantage of the proposed algorithm in comparison to some other adaptive algorithms in the literature of adaptive graph signal recovery.

eess.SP↗

Ensemble Neural Representation Networks

Implicit Neural Representation (INR) has recently attracted considerable attention for storing various types of signals in continuous forms. The existing INR networks require lengthy training processes and high-performance computational resources. In this paper, we propose a novel sub-optimal ensemble architecture for INR that resolves the aforementioned problems. In this architecture, the representation task is divided into several sub-tasks done by independent sub-networks. We show that the performance of the proposed ensemble INR architecture may decrease if the dimensions of sub-networks increase. Hence, it is vital to suggest an optimization algorithm to find the sub-optimal structure of the ensemble network, which is done in this paper. According to the simulation results, the proposed architecture not only has significantly fewer floating-point operations (FLOPs) and less training time, but it also has better performance in terms of Peak Signal to Noise Ratio (PSNR) compared to those of its counterparts.

cs.LG↗

Efficient Sparse Artificial Neural Networks

The brain, as the source of inspiration for Artificial Neural Networks (ANN), is based on a sparse structure. This sparse structure helps the brain to consume less energy, learn easier and generalize patterns better than any other ANN. In this paper, two evolutionary methods for adopting sparsity to ANNs are proposed. In the proposed methods, the sparse structure of a network as well as the values of its parameters are trained and updated during the learning process. The simulation results show that these two methods have better accuracy and faster convergence while they need fewer training samples compared to their sparse and non-sparse counterparts. Furthermore, the proposed methods significantly improve the generalization power and reduce the number of parameters. For example, the sparsification of the ResNet47 network by exploiting our proposed methods for the image classification of ImageNet dataset uses 40 % fewer parameters while the top-1 accuracy of the model improves by 12% and 5% compared to the dense network and their sparse counterpart, respectively. As another example, the proposed methods for the CIFAR10 dataset converge to their final structure 7 times faster than its sparse counterpart, while the final accuracy increases by 6%.

cs.LG↗

Supervised Heart Rate Tracking using Wrist-Type Photoplethysmographic (PPG) Signals during Physical Exercise without Simultaneous Acceleration Signals

PPG based heart rate (HR) monitoring has recently attracted much attention with the advent of wearable devices such as smart watches and smart bands. However, due to severe motion artifacts (MA) caused by wristband stumbles, PPG based HR monitoring is a challenging problem in scenarios where the subject performs intensive physical exercises. This work proposes a novel approach to the problem based on supervised learning by Neural Network (NN). By simulations on the benchmark datasets [1], we achieve acceptable estimation accuracy and improved run time in comparison with the literature. A major contribution of this work is that it alleviates the need to use simultaneous acceleration signals. The simulation results show that although the proposed method does not process the simultaneous acceleration signals, it still achieves the acceptable Mean Absolute Error (MAE) of 1.39 Beats Per Minute (BPM) on the benchmark data set.

eess.SP↗

Sparsity Promoting Reconstruction of Delta Modulated Voice Samples by Sequential Adaptive Thresholds

In this paper, we propose the family of Iterative Methods with Adaptive Thresholding (IMAT) for sparsity promoting reconstruction of Delta Modulated (DM) voice signals. We suggest a novel missing sampling approach to delta modulation that facilitates sparsity promoting reconstruction of the original signal from a subset of DM samples with less quantization noise. Utilizing our proposed missing sampling approach to delta modulation, we provide an analytical discussion on the convergence of IMAT for DM coding technique. We also modify the basic IMAT algorithm and propose the Iterative Method with Adaptive Thresholding for Delta Modulation (IMATDM) algorithm for improved reconstruction performance for DM coded signals. Experimental results show that in terms of the reconstruction SNR, this novel method outperforms the conventional DM reconstruction techniques based on lowpass filtering. It is observed that by migrating from the conventional low pass reconstruction technique to the sparsity promoting reconstruction technique of IMATDM, the reconstruction performance is improved by an average of 7.6 dBs. This is due to the fact that the proposed IMATDM makes simultaneous use of both the sparse signal assumption and the quantization noise suppression effects by smoothing. The proposed IMATDM algorithm also outperforms some other sparsity promoting reconstruction methods.

cs.IT↗

Distributed interference cancellation in multi-agent scenarios

This paper considers the problem of detecting impaired and noisy nodes over network. In a distributed algorithm, lots of processing units are incorporating and communicating with each other to reach a global goal. Due to each one's state in the shared environment, they can help the other nodes or mislead them (due to noise or a deliberate attempt). Previous works mainly focused on proper locating agents and weight assignment based on initial environment state to minimize malfunctioning of noisy nodes. We propose an algorithm to be able to adapt sharing weights according to behavior of the agents. Applying the introduced algorithm to a multi-agent RL scenario and the well-known diffusion LMS demonstrates its capability and generality.

cs.MA↗

A Nonlinear Acceleration Method for Iterative Algorithms

Iterative methods have led to better understanding and solving problems such as missing sampling, deconvolution, inverse systems, impulsive and Salt and Pepper noise removal problems. However, the challenges such as the speed of convergence and or the accuracy of the answer still remain. In order to improve the existing iterative algorithms, a non-linear method is discussed in this paper. The mentioned method is analyzed from different aspects, including its convergence and its ability to accelerate recursive algorithms. We show that this method is capable of improving Iterative Method (IM) as a non-uniform sampling reconstruction algorithm and some iterative sparse recovery algorithms such as Iterative Reweighted Least Squares (IRLS), Iterative Method with Adaptive Thresholding (IMAT), Smoothed l0 (SL0) and Alternating Direction Method of Multipliers (ADMM) for solving LASSO problems family (including Lasso itself, Lasso-LSQR and group-Lasso). It is also capable of both accelerating and stabilizing the well-known Chebyshev Acceleration (CA) method. Furthermore, the proposed algorithm can extend the stability range by reducing the sensitivity of iterative algorithms to the changes of adaptation rate.

eess.SP↗

A Novel Approach to Sparse Inverse Covariance Estimation Using Transform Domain Updates and Exponentially Adaptive Thresholding

Sparse Inverse Covariance Estimation (SICE) is useful in many practical data analyses. Recovering the connectivity, non-connectivity graph of covariates is classified amongst the most important data mining and learning problems. In this paper, we introduce a novel SICE approach using adaptive thresholding. Our method is based on updates in a transformed domain of the desired matrix and exponentially decaying adaptive thresholding in the main domain (Inverse Covariance matrix domain). In addition to the proposed algorithm, the convergence analysis is also provided. In the Numerical Experiments Section, we show that the proposed method outperforms state-of-the-art methods in terms of accuracy.

cs.LG↗

A Fast Iterative Method for Removing Impulsive Noise from Sparse Signals

In this paper, we propose a new method to reconstruct a signal corrupted by noise where both signal and noise are sparse but in different domains. The problem investigated in this paper arises in different applications such as impulsive noise removal from images, audios and videos, decomposition of low-rank and sparse components of matrices, and separation of texts from images. First, we provide a cost function for our problem and then present an iterative method to find its local minimum. The analysis of the algorithm is also provided. As an application of this problem, we apply our algorithm for impulsive noise Salt-and-Pepper noise (SPN) and Random-Valued Impulsive Noise (RVIN)) removal from images and compare our results with other notable algorithms in the literature. Furthermore, we apply our algorithm for removing clicks from audio signals. Simulation results show that our algorithms is simple and fast, and it outperforms other state-of-the-art methods in terms of reconstruction quality and/or complexity.

eess.SP↗