Iñaki Esnaola
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
Iñaki Esnaola has a total of 100 co-authors. Here are the top co-authors by number of shared publications:
- Samir Medina Perlaza
INRIA, Centre Inria dUniversit Cte dAzur, Sophia Antipolis, France
29 shared publications - Harold Vincent Poor
Princeton University
18 shared publications - Javier Garcia-Frias
Department of Electrical and Computer Engineering, University of Delaware, Newark, DE, USA
12 shared publications - Antonia Maria Tulino
Department of Electrical Engineering, Universit degli Studi di Napoli Federico II, Naples, Italy
8 shared publications - Ke Sun
Shanghai University
6 shared publications H. Vincent Poor
Department of Electrical Engineering, Princeton University, Princeton, NJ, USA
5 shared publications
Latest Publications
- Open Access
- 21 October 2026
- Published by American Astronomical Society in The Astrophysical Journal
- Vol. 1011 (1) , 30
Solar Vortices as Conduits for Magnetoacoustic Waves: Multilayer Coupling and Their Role in Atmospheric Heating
Vortices are widespread throughout the solar atmosphere and commonly interpreted as channels for Alfvén wave energy transport. However, this interpretation has mostly been inferred from the apparent alignment of rotating plasma structures with the magnetic field, rather than direct evidence of the nature of the waves involved. We present observational and numerical evidence that solar vortices act as coherent waveguides dominated by magnetoacoustic waves in the lower atmosphere, combining high-resolution SST observations and Bifrost simulation data. Using Normalised Mutual Information and Jensen-Shannon Divergence as coupling diagnostics, we provide the first observational identification of a solar vortex footpoint through information-theoretic metrics, locating it in the photospheric region of highest shared information with the chromospheric swirl. Spectral proper orthogonal decomposition separates dominant dynamical patterns, allowing us to identify sausage, kink, and helical wave modes propagating along vortex structures. In the Bifrost simulation, we find no evidence for torsional Alfvén waves supported by vortices below 1 Mm. Instead, the waves supported by vortices are magnetoacoustic, and their energy transport is predominantly compressive in the lower atmosphere, with the magnetic component becoming dominant only at greater heights. Even the compressive wave component alone reaches nanoflare-level magnitudes (∼10 25 erg), indicating that vortex-associated compressive perturbations may provide an energetically relevant contribution in regimes where magnetic-energy transport dominates. The recovery of sausage and helical modes in temperature perturbations shows that these modes carry a thermal signature, further supporting their relevance for chromospheric energy transport and localized heating.
- 21 October 2026
- Published by American Astronomical Society in The Astrophysical Journal
- Vol. 1011 (1) , 30
Open AccessSolar Vortices as Conduits for Magnetoacoustic Waves: Multilayer Coupling and Their Role in Atmospheric Heating
Vortices are widespread throughout the solar atmosphere and commonly interpreted as channels for Alfvén wave energy transport. However, this interpretation has mostly been inferred from the apparent alignment of rotating plasma structures with the magnetic field, rather than direct evidence of the nature of the waves involved. We present observational and numerical evidence that solar vortices act as coherent waveguides dominated by magnetoacoustic waves in the lower atmosphere, combining high-resolution SST observations and Bifrost simulation data. Using Normalised Mutual Information and Jensen-Shannon Divergence as coupling diagnostics, we provide the first observational identification of a solar vortex footpoint through information-theoretic metrics, locating it in the photospheric region of highest shared information with the chromospheric swirl. Spectral proper orthogonal decomposition separates dominant dynamical patterns, allowing us to identify sausage, kink, and helical wave modes propagating along vortex structures. In the Bifrost simulation, we find no evidence for torsional Alfvén waves supported by vortices below 1 Mm. Instead, the waves supported by vortices are magnetoacoustic, and their energy transport is predominantly compressive in the lower atmosphere, with the magnetic component becoming dominant only at greater heights. Even the compressive wave component alone reaches nanoflare-level magnitudes (∼10 25 erg), indicating that vortex-associated compressive perturbations may provide an energetically relevant contribution in regimes where magnetic-energy transport dominates. The recovery of sausage and helical modes in temperature perturbations shows that these modes carry a thermal signature, further supporting their relevance for chromospheric energy transport and localized heating.
- 8 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 697-702
Distributed Synchronization of Heterogeneous Dynamical Networks With Nonlinear Diffusive Couplings
This letter investigates the problem of input-output synchronisation in a class of heterogeneous dynamical networks with nonlinear diffusive couplings in the presence of disturbances on the coupling links. Focusing on networks whose agent dynamics satisfy suitable relative dissipativity properties, distributed sufficient conditions are established to guarantee bounded edge disagreement in the presence of external disturbances. Specifically, these conditions can be verified using only local information associated with adjacent agents and coupling links. To illustrate the proposed results, a heterogeneous network of Goodwin oscillators is studied, and a numerical example further demonstrates the advantages of the proposed approach under network topology changes.
- 8 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 697-702
Distributed Synchronization of Heterogeneous Dynamical Networks With Nonlinear Diffusive Couplings
This letter investigates the problem of input-output synchronisation in a class of heterogeneous dynamical networks with nonlinear diffusive couplings in the presence of disturbances on the coupling links. Focusing on networks whose agent dynamics satisfy suitable relative dissipativity properties, distributed sufficient conditions are established to guarantee bounded edge disagreement in the presence of external disturbances. Specifically, these conditions can be verified using only local information associated with adjacent agents and coupling links. To illustrate the proposed results, a heterogeneous network of Goodwin oscillators is studied, and a numerical example further demonstrates the advantages of the proposed approach under network topology changes.
- 1 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 64 (01962892) , 5518710
Optically Authenticated Hyperspectral Imaging: Detection and Restoration of Manipulated Data
Ensuring the authenticity and integrity of hyper-spectral images is crucial for remote sensing applications, as unauthorized spectral modifications can compromise data reliability and decision-making processes. Traditional post-acquisition authentication methods leave hyperspectral data vulnerable to manipulation before applying digital protection mechanisms. We present an acquisition-stage optical authentication framework that embeds an optical key directly in the light path of a linescan hyperspectral imager before digitization. The optical key is designed from scene spectral statistics and jointly optimized for imperceptibility, manipulation detection, and post-attack spectral restoration in a data-driven manner. We initialize and optimize the optical key using distributions parameterized by per-band spectral variance from the training data, which adaptively scales the embedding strength across bands and improves robustness to variance-driven perturbations. To evaluate its resilience, we simulate an optimal attack scenario in which an adversary randomly alters 20%–80% of pixels within a target class. A detection network achieves a maximum accuracy of 97% under light perturbation and maintains above 92% even at 80% manipulation, while maintaining classification performance within 0.6-1.2% of unsigned data. The restoration network brings spectral signatures to within 0.9-1.3° SAM. Experiments on simulated and laboratory datasets show robustness gains of up to 4.7% over traditional methods, with preserved downstream performance.
- 1 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 64 (01962892) , 5518710
Optically Authenticated Hyperspectral Imaging: Detection and Restoration of Manipulated Data
Ensuring the authenticity and integrity of hyper-spectral images is crucial for remote sensing applications, as unauthorized spectral modifications can compromise data reliability and decision-making processes. Traditional post-acquisition authentication methods leave hyperspectral data vulnerable to manipulation before applying digital protection mechanisms. We present an acquisition-stage optical authentication framework that embeds an optical key directly in the light path of a linescan hyperspectral imager before digitization. The optical key is designed from scene spectral statistics and jointly optimized for imperceptibility, manipulation detection, and post-attack spectral restoration in a data-driven manner. We initialize and optimize the optical key using distributions parameterized by per-band spectral variance from the training data, which adaptively scales the embedding strength across bands and improves robustness to variance-driven perturbations. To evaluate its resilience, we simulate an optimal attack scenario in which an adversary randomly alters 20%–80% of pixels within a target class. A detection network achieves a maximum accuracy of 97% under light perturbation and maintains above 92% even at 80% manipulation, while maintaining classification performance within 0.6-1.2% of unsigned data. The restoration network brings spectral signatures to within 0.9-1.3° SAM. Experiments on simulated and laboratory datasets show robustness gains of up to 4.7% over traditional methods, with preserved downstream performance.
- Open Access
Empirical Risk Minimization with f-Divergence Regularization
In this paper, the solution to the empirical risk minimization problem with f-divergence regularization (ERM-f DR) is presented and conditions under which the solution also serves as the solution to the minimization of the expected empirical risk subject to an f -divergence constraint are established. The proposed approach extends applicability to a broader class of f -divergences than previously reported and yields theoretical results that recover previously known results. Additionally, the difference between the expected empirical risk of the ERMf DR solution and that of its reference measure is characterized, providing insights into previously studied cases of f -divergences. A central contribution is the introduction of the normalization function, a mathematical object that is critical in both the dual formulation and practical computation of the ERM-f DR solution. This work presents an implicit characterization of the normalization function as a nonlinear ordinary differential equation (ODE), establishes its key properties, and subsequently leverages them to construct a numerical algorithm for approximating the normalization factor under mild assumptions. Further analysis demonstrates structural equivalences between ERM-f DR problems with different f -divergences via transformations of the empirical risk. Finally, the proposed algorithm is used to compute the training and test risks of ERM-f DR solutions under different f -divergence regularizers. This numerical example highlights the practical implications of choosing different functions f in ERMf DR problems.
Open AccessEmpirical Risk Minimization with f-Divergence Regularization
In this paper, the solution to the empirical risk minimization problem with f-divergence regularization (ERM-f DR) is presented and conditions under which the solution also serves as the solution to the minimization of the expected empirical risk subject to an f -divergence constraint are established. The proposed approach extends applicability to a broader class of f -divergences than previously reported and yields theoretical results that recover previously known results. Additionally, the difference between the expected empirical risk of the ERMf DR solution and that of its reference measure is characterized, providing insights into previously studied cases of f -divergences. A central contribution is the introduction of the normalization function, a mathematical object that is critical in both the dual formulation and practical computation of the ERM-f DR solution. This work presents an implicit characterization of the normalization function as a nonlinear ordinary differential equation (ODE), establishes its key properties, and subsequently leverages them to construct a numerical algorithm for approximating the normalization factor under mild assumptions. Further analysis demonstrates structural equivalences between ERM-f DR problems with different f -divergences via transformations of the empirical risk. Finally, the proposed algorithm is used to compute the training and test risks of ERM-f DR solutions under different f -divergence regularizers. This numerical example highlights the practical implications of choosing different functions f in ERMf DR problems.
- Open Access
Empirical Risk Minimization with $f$-Divergence Regularization
In this paper, the solution to the empirical risk minimization problem with $f$-divergence regularization (ERM-$f$DR) is presented and conditions under which the solution also serves as the solution to the minimization of the expected empirical risk subject to an $f$-divergence constraint are established. The proposed approach extends applicability to a broader class of $f$-divergences than previously reported and yields theoretical results that recover previously known results. Additionally, the difference between the expected empirical risk of the ERM-$f$DR solution and that of its reference measure is characterized, providing insights into previously studied cases of $f$-divergences. A central contribution is the introduction of the normalization function, a mathematical object that is critical in both the dual formulation and practical computation of the ERM-$f$DR solution. This work presents an implicit characterization of the normalization function as a nonlinear ordinary differential equation (ODE), establishes its key properties, and subsequently leverages them to construct a numerical algorithm for approximating the normalization factor under mild assumptions. Further analysis demonstrates structural equivalences between ERM-$f$DR problems with different $f$-divergences via transformations of the empirical risk. Finally, the proposed algorithm is used to compute the training and test risks of ERM-$f$DR solutions under different $f$-divergence regularizers. This numerical example highlights the practical implications of choosing different functions $f$ in ERM-$f$DR problems.Open AccessEmpirical Risk Minimization with $f$-Divergence Regularization
In this paper, the solution to the empirical risk minimization problem with $f$-divergence regularization (ERM-$f$DR) is presented and conditions under which the solution also serves as the solution to the minimization of the expected empirical risk subject to an $f$-divergence constraint are established. The proposed approach extends applicability to a broader class of $f$-divergences than previously reported and yields theoretical results that recover previously known results. Additionally, the difference between the expected empirical risk of the ERM-$f$DR solution and that of its reference measure is characterized, providing insights into previously studied cases of $f$-divergences. A central contribution is the introduction of the normalization function, a mathematical object that is critical in both the dual formulation and practical computation of the ERM-$f$DR solution. This work presents an implicit characterization of the normalization function as a nonlinear ordinary differential equation (ODE), establishes its key properties, and subsequently leverages them to construct a numerical algorithm for approximating the normalization factor under mild assumptions. Further analysis demonstrates structural equivalences between ERM-$f$DR problems with different $f$-divergences via transformations of the empirical risk. Finally, the proposed algorithm is used to compute the training and test risks of ERM-$f$DR solutions under different $f$-divergence regularizers. This numerical example highlights the practical implications of choosing different functions $f$ in ERM-$f$DR problems. - Open Access
Decentralized Stealth Attacks on Cyber-Physical Systems
Decentralized stealth attack constructions that minimize the mutual information between the state variables and the measurements are proposed. The attack constructions are formulated as random Gaussian attacks targeting Cyber-physical systems that aims at minimizing the mutual information between the state variables and measurements while constraining the Kullback-Leibler divergence between the distribution of the measurements under attacks and the distribution of the measurements without attacks. The proposed information metrics adopted measure the disruption and attack detection both globally and locally. The decentralized attack constructions are formulated in a framework of normal games. The global and local information metrics yield games with global and local objectives in disruption and attack detection. We have proven the games are potential games and the convexity of the potential functions followed by the uniqueness and the achievability of the Nash Equilibrium, accordingly. We proposed a best response dynamics to achieve the Nash Equilibrium of the games. We numerically evaluate the performance of the proposed decentralized stealth random attacks on IEEE test systems and show it is feasible to exploit game theoretic techniques in decentralized attack constructions.
Open AccessDecentralized Stealth Attacks on Cyber-Physical Systems
Decentralized stealth attack constructions that minimize the mutual information between the state variables and the measurements are proposed. The attack constructions are formulated as random Gaussian attacks targeting Cyber-physical systems that aims at minimizing the mutual information between the state variables and measurements while constraining the Kullback-Leibler divergence between the distribution of the measurements under attacks and the distribution of the measurements without attacks. The proposed information metrics adopted measure the disruption and attack detection both globally and locally. The decentralized attack constructions are formulated in a framework of normal games. The global and local information metrics yield games with global and local objectives in disruption and attack detection. We have proven the games are potential games and the convexity of the potential functions followed by the uniqueness and the achievability of the Nash Equilibrium, accordingly. We proposed a best response dynamics to achieve the Nash Equilibrium of the games. We numerically evaluate the performance of the proposed decentralized stealth random attacks on IEEE test systems and show it is feasible to exploit game theoretic techniques in decentralized attack constructions.
- 7 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (8) , 6198-6226
Asymmetry of the Relative Entropy in the Regularization of Empirical Risk Minimization
The effect of relative entropy asymmetry is analyzed in the context of empirical risk minimization (ERM) with relative entropy regularization (ERM-RER). Two regularizations are considered: $(a)$ the relative entropy of the measure to be optimized with respect to a reference measure (Type-I ERM-RER); and $(b)$ the relative entropy of the reference measure with respect to the measure to be optimized (Type-II ERM-RER). The main result is the characterization of the solution to the Type-II ERM-RER problem and its key properties. By comparing the well-understood Type-I ERM-RER with Type-II ERM-RER, the effects of entropy asymmetry are highlighted. The analysis shows that in both cases, regularization by relative entropy forces the support of the solution to collapse into the support of the reference measure, introducing a strong inductive bias that negates the evidence provided by the training data. Finally, it is shown that Type-II regularization is equivalent to Type-I regularization with an appropriate transformation of the empirical risk function.
- 7 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (8) , 6198-6226
Asymmetry of the Relative Entropy in the Regularization of Empirical Risk Minimization
The effect of relative entropy asymmetry is analyzed in the context of empirical risk minimization (ERM) with relative entropy regularization (ERM-RER). Two regularizations are considered: $(a)$ the relative entropy of the measure to be optimized with respect to a reference measure (Type-I ERM-RER); and $(b)$ the relative entropy of the reference measure with respect to the measure to be optimized (Type-II ERM-RER). The main result is the characterization of the solution to the Type-II ERM-RER problem and its key properties. By comparing the well-understood Type-I ERM-RER with Type-II ERM-RER, the effects of entropy asymmetry are highlighted. The analysis shows that in both cases, regularization by relative entropy forces the support of the solution to collapse into the support of the reference measure, introducing a strong inductive bias that negates the evidence provided by the training data. Finally, it is shown that Type-II regularization is equivalent to Type-I regularization with an appropriate transformation of the empirical risk function.
- Open Access
Generalization Error of $f$-Divergence Stabilized Algorithms via Duality
The solution to empirical risk minimization with $f$-divergence regularization (ERM-$f$DR) is extended to constrained optimization problems, establishing conditions for equivalence between the solution and constraints. A dual formulation of ERM-$f$DR is introduced, providing a computationally efficient method to derive the normalization function of the ERM-$f$DR solution. This dual approach leverages the Legendre-Fenchel transform and the implicit function theorem, enabling explicit characterizations of the generalization error for general algorithms under mild conditions, and another for ERM-$f$DR solutions.
Open AccessGeneralization Error of $f$-Divergence Stabilized Algorithms via Duality
The solution to empirical risk minimization with $f$-divergence regularization (ERM-$f$DR) is extended to constrained optimization problems, establishing conditions for equivalence between the solution and constraints. A dual formulation of ERM-$f$DR is introduced, providing a computationally efficient method to derive the normalization function of the ERM-$f$DR solution. This dual approach leverages the Legendre-Fenchel transform and the implicit function theorem, enabling explicit characterizations of the generalization error for general algorithms under mild conditions, and another for ERM-$f$DR solutions.
- Open Access
Stealth Attacks Against Moving Target Defense for Smart Grid
Data injection attacks (DIAs) pose a significant cybersecurity threat to the Smart Grid by enabling an attacker to compromise the integrity of data acquisition and manipulate estimated states without triggering bad data detection procedures. To mitigate this vulnerability, the moving target defense (MTD) alters branch admittances to mismatch the system information that is available to an attacker, thereby inducing an imperfect DIA construction that results in degradation of attack performance. In this paper, we first analyze the existence of stealth attacks for the case in which the MTD strategy only changes the admittance of a single branch. Equipped with this initial insight, we then extend the results to the case in which multiple branches are protected by the MTD strategy. Remarkably, we show that stealth attacks can be constructed with information only about which branches are protected, without knowledge about the particular admittance value changes. Furthermore, we provide a sufficient protection condition for the MTD strategy via graph-theoretic tools that guarantee that the system is not vulnerable to DIAs. Numerical simulations are implemented on IEEE test systems to validate the obtained results.
Open AccessStealth Attacks Against Moving Target Defense for Smart Grid
Data injection attacks (DIAs) pose a significant cybersecurity threat to the Smart Grid by enabling an attacker to compromise the integrity of data acquisition and manipulate estimated states without triggering bad data detection procedures. To mitigate this vulnerability, the moving target defense (MTD) alters branch admittances to mismatch the system information that is available to an attacker, thereby inducing an imperfect DIA construction that results in degradation of attack performance. In this paper, we first analyze the existence of stealth attacks for the case in which the MTD strategy only changes the admittance of a single branch. Equipped with this initial insight, we then extend the results to the case in which multiple branches are protected by the MTD strategy. Remarkably, we show that stealth attacks can be constructed with information only about which branches are protected, without knowledge about the particular admittance value changes. Furthermore, we provide a sufficient protection condition for the MTD strategy via graph-theoretic tools that guarantee that the system is not vulnerable to DIAs. Numerical simulations are implemented on IEEE test systems to validate the obtained results.
- Open Access
- 4 November 2024
- Published by Elsevier in Water Research
- Vol. 268 (Pt B) , 122718
Information-theoretic sensor placement for large sewer networks
- 4 November 2024
- Published by Elsevier in Water Research
- Vol. 268 (Pt B) , 122718
Open AccessInformation-theoretic sensor placement for large sewer networks