MCMartina Cardone

Martina Cardone

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Martina Cardone has a total of 27 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    A Reinforcement Learning-Based Hybrid Scheduling Mechanism for mmWave Networks

    by Mine Gokce Dogan, Martina Cardone, Christina Fragouli

    Millimeter-wave (mmWave) technology is expected to support next-generation wireless networks by expanding the available spectrum and supporting multi-gigabit services. While mmWave communications hold great promise, mmWave links are vulnerable against link blockages, which can severely impact their performance. This paper aims to develop resilient transmission mechanisms to suitably distribute traffic across multiple paths in mmWave networks. The main contributions include: (a) the development of proactive transmission mechanisms to build resilience against link blockages in advance, while achieving a high end-to-end packet rate; (b) the design of a heuristic path selection algorithm to efficiently select (in polynomial time in the network size) multiple proactively resilient paths that have high capacity; and (c) the development of a hybrid scheduling algorithm that combines the proposed path selection algorithm with a deep reinforcement learning (DRL) based online approach for decentralized adaptation to blockages. To achieve resilience against link blockages and to adapt the information flow through the network, a state-of-the-art Soft Actor-Critic DRL algorithm is investigated. The proposed scheduling algorithm robustly adapts to blockages and channel variations over different topologies, channels, and blockage realizations while outperforming alternative algorithms which include a conventional congestion control algorithm additive increase multiplicative decrease. Specifically, it achieves the desired packet rate in over 99% of the episodes in static networks with blockages (where up to 80% of the paths are blocked), and in 100% of the episodes in time-varying networks with blockages and link capacity variations – compared to 0.5% to 45% success rates achieved by the baseline methods under the same conditions.

  • Probabilistic Group Testing for Distributed Matrix-Vector Products With Attacked Workers

    by Sarthak Jain, Martina Cardone, Soheil Mohajer

    In this work, we consider the problem of distributed matrix-vector product, where a server distributes the task of the computation among n worker nodes. In particular, it is assumed that T matrix-vector products have to be computed, where the matrix remains constant, whereas the vector changes each time. It is assumed that L out of the n workers are compromised (but non-communicating) and may return incorrect results to the task assigned to them. Moreover, these compromised workers are unreliable, that is, each compromised worker may return an incorrect and correct result with probabilities $\alpha $ and $1-\alpha $ , respectively, at any given time. The server aims to identify this set of unreliable compromised workers so that it can remove them from future computations. This work proposes and analyzes three probabilistic group testing schemes to achieve this: 1) a noise-level-independent non-adaptive scheme, 2) a noise-level-dependent non-adaptive scheme, and 3) a noise-level-dependent two-stage adaptive scheme. In particular, the third scheme is shown to be order-optimal, up to a constant multiplicative factor, for certain regimes of $\alpha $ and L. Using the proposed group testing schemes, sparse parity-check codes are constructed, which are used in the considered distributed computing framework for encoding, decoding, and identifying the unreliable workers. This methodology has two distinct features: 1) the computational cost of identifying the set of L unreliable workers at the server is considerably lower than existing distributed computing methods in the literature, and 2) the encoding and decoding functions are computationally efficient.


  • Multilevel Coding for Achieving Low Latency and Low Outage in mmWave Networks

    by Mine Gokce Dogan, Jaimin Shah, Martina Cardone, Christina Fragouli, Wei Mao, Hosein Nikopour, Rath Vannithamby

    Achieving ultra-reliable low-latency communications (URLLC) is critical for the operation of data-intensive applications and for ensuring seamless connectivity. Millimeter-wave (mmWave) technology is expected to support URLLC by expanding the available spectrum and providing multi-gigabit services. However, a well-recognized challenge is that mmWave communication links are susceptible to blockage, which may lead to communication disruptions. Conventional approaches, such as interleaving and feedback mechanisms provide resilience against such blockages at the cost of incurring additional delay, which may be too large to support URLLC effectively. This calls for novel techniques to develop resilient transmission mechanisms that can support URLLC. This paper develops gracefully resilient transmission mechanisms by deploying multilevel codes over space and over time. These codes allow the control of the received information and they accommodate different quality of service requirements of different information streams. Our evaluations, carried out also within the ns-3 network simulator, show that deploying these codes leads to attractive trade-offs between rate, delay, and outage probability.


  • A Comprehensive Study on Ziv-Zakai Lower Bounds on the MMSE

    by Minoh Jeong, Alex Dytso, Martina Cardone

    This paper explores Bayesian lower bounds on the minimum mean squared error (MMSE) that belong to the well-known Ziv-Zakai family. The Ziv-Zakai technique relies on connecting the bound to an $\mathsf M$ -ary hypothesis testing problem. There are three versions of the Ziv-Zakai bound (ZZB): the first version relies on the so-called valley-filling function, the second one is a relaxation of the first bound which omits the valley-filling function, and the third one, namely the single-point ZZB (SZZB), replaces the integration present in the first two bounds with a single point maximization. The first part of this paper focuses on providing the most general version of the bounds. It is shown that these bounds hold without any assumption on the distribution of the estimand. This makes the bounds applicable to discrete and mixed distributions. Then, the SZZB is extended to an $\mathsf M$ -ary setting and a version of it that holds for the multivariate setting is provided. In the second part, general properties of these bounds are provided. First, unlike the Bayesian Cramér-Rao bound, it is shown that all the versions of the ZZB tensorize. Second, a characterization of the high-noise asymptotic is provided, which is used to argue about the tightness of the bounds. Third, a complete low-noise asymptotic is provided under the assumptions of mixed-input distributions and Gaussian additive noise channels. In the low-noise, it is shown that the ZZB is generally tight, but there are examples for which the SZZB is not tight. In the third part, the tightness of the bounds is evaluated. First, it is shown that in the low-noise regime the ZZB without the valley-filling function, and, therefore, also the ZZB with the valley-filling function, are tight for mixed-input distributions and Gaussian additive noise channels. Second, for discrete inputs it is shown that the ZZB with the valley-filling function is always sub-optimal, and equal to zero without the valley-filling function. Third, unlike for the ZZB, an example is shown for which the SZZB is tight to the MMSE for discrete inputs. Fourth, sufficient and necessary conditions for the tightness of the bounds are provided. Finally, some examples are provided in which the bounds in the Ziv-Zakai family outperform other well-known Bayesian lower bounds, namely the Cramér-Rao bound and the maximum entropy bound.


  • Retrieving Data Permutations From Noisy Observations: Asymptotics

    by Minoh Jeong, Alex Dytso, Martina Cardone

    This paper studies the problem of data permutation recovery, where the goal is to estimate the ordering of an n -dimensional data vector given a noisy observation of it. The focus is on scenarios where the noise is additive Gaussian with an arbitrary known covariance matrix. The goal is to characterize the probability of error and its behavior when a linear decoder (that is, a linear estimator followed by a sorting operation) is employed. First, a general expression is derived for the probability of error when a linear decoder is used. The derived expression holds for any continuous distribution of the input data vector, and when the noise has memory. Then, the rates of convergence of the probability of error in the low-noise and high-noise regimes are investigated when a simple linear decoder is used. It is shown that in the low-noise regime, the probability of error can quadratically increase with n , and in the high-noise regime it behaves as 1-1/ n ! for several distributions of interest. Finally, upper and lower bounds on the probability of correctness with respect to n are derived for the case of an i.i.d. data distribution and show that the rate of convergence is at least exponential in n . The results showcase that the permutation recovery problem is noise dominated, which motivates the study of more relaxed versions of the permutation recovery problem that are also discussed.


  • Design of a Spiral Coil for High-Frequency Wireless Power Transfer Systems Using Machine Learning

    by Minki Kim, Minoh Jeong, Martina Cardone, Jungwon Choi

    This paper presents a novel design method based on machine learning (ML) for a spiral coil in a wireless power transfer (WPT) system operating at high frequencies. While a MHz frequency operation provides high power density for battery-powered applications, optimizing the spiral coil design becomes challenging due to the complex electromagnetic analysis, such as skin and proximity effects. Even though a three-dimensional (3D) electromagnetic simulator provides a practical analysis of different coil structures, it cannot quickly optimize the coil design due to its computing time. Therefore, an ML-based method is first proposed to estimate the $Q$ factor of a spiral coil, a critical parameter to determine the efficiency of a WPT system. Towards this end, a feed-forward neural network is trained using around $20 \cdot 10^{3}$ data samples collected by using a 3D quasi-static electromagnetic field simulator. It is shown that this method is effective; that is, it ensures an accuracy of up to 96%. Then, a spiral coil design method leveraging the designed ML-based $Q$ factor estimation is proposed. This method offers high performance (the intersection over union metric takes values up to 70%) and significant computation time savings (at least five orders of magnitude), compared to commonly adopted software simulators. Finally, the effectiveness of the proposed method is verified by the actual fabrication of several spiral coils.


  • When is Mimo Massive in Radar?

    by Jaimin Shah, Martina Cardone, Alex Dytso, Cynthia Rush

    This work considers a co-located MIMO radar with M T transmitting and M R receiving antennas in a so-called massive MIMO regime, that is, where the number of virtual spatial antennas N = M T M R is large. Recently, it has been demonstrated that as N grows to infinity, one can fully characterize the false alarm and detection probabilities with very minimal assumptions on the disturbance vector. In this work, these results are partially refined and a lower bound on the probability of detection is provided for any fixed, finite N under certain randomness models for the noise. This result can serve as a rule of thumb for the design of massive MIMO radar systems by indicating the number of antennas required to attain a desired target detection probability.

  • Meta Derivative Identity for the Conditional Expectation

    by Alex Dytso, Martina Cardone, Ian Zieder

    Consider a pair of random vectors (X,Y) and the conditional expectation operator E[X|Y = y]. This work studies analytical properties of the conditional expectation by characterizing various derivative identities. The paper consists of two parts. In the first part of the paper, a general derivative identity for the conditional expectation is derived. Specifically, for the Markov chain U ↔ X ↔ Y, a compact expression for the Jacobian matrix of E[ψ(Y,U)|Y = y] for a smooth function ψ is derived. In the second part of the paper, the main identity is specialized to the exponential family and two main applications are shown. First, it is demonstrated that, via various choices of the random vector U and function ψ, one can recover and generalize several known identities (e.g., Tweedie’s formula) and derive some new ones. For example, a new relationship between conditional expectations and conditional cumulants is established. Second, it is demonstrated how the derivative identities can be used to establish new lower bounds on the estimation error. More specifically, using one of the derivative identities in conjunction with a Poincaré inequality, a new lower bound on the minimum mean squared error, which holds for all prior distributions on the input signal, is derived. The new lower bound is shown to be tight in the high-noise regime for the additive Gaussian noise setting.


  • Entropic Central Limit Theorem for Order Statistics

    by Martina Cardone, Alex Dytso, Cynthia Rush

    It is well known that central order statistics exhibit a central limit behavior and converge to a Gaussian distribution as the sample size grows. This paper strengthens this known result by establishing an entropic version of the central limit theorem that ensures a stronger mode of convergence using the relative entropy. This upgrade in convergence is shown at the expense of extra regularity conditions, which can be considered as mild. To prove this result, ancillary results on order statistics are derived, which might be of independent interest. For instance, a rather general bound on the moments of order statistics, and an upper bound on the mean squared error of estimating the p ϵ (0, 1)-th quantile of an unknown cumulative distribution function, are derived. Finally, a discussion on the necessity of the derived conditions for convergence and on the rate of convergence and monotonicity of the relative entropy is provided.