← Search

Dionysios S. Kalogerias

7 accepted papers

2023

Model-Free Learning of Optimal Beamformers for Passive IRS-Assisted Sumrate Maximization

ICASSP 2023accepted

Although Intelligent Reflective Surfaces (IRSs) are a cost-effective technology promising high spectral efficiency in future wireless networks, obtaining optimal IRS beamformers is a challenging problem with several practical limitations. Assuming fully-passive, sensing- free IRS operation, we intro…

Cited by 0SourceScholar
2020

A Zeroth-Order Learning Algorithm for Ergodic Optimization of Wireless Systems with no Models and no Gradients

ICASSP 2020accepted

Optimal resource allocation in real-world wireless systems is rather challenging, not only due to the unavailability of accurate statistical channel models, but also because expressions of maximal or achievable information rates are most often unknown, or not adequately precise. Under a modular stoc…

Cited by 0SourceScholar
2020

Better Safe Than Sorry: Risk-Aware Nonlinear Bayesian Estimation

ICASSP 2020accepted

Despite the simplicity and intuitive interpretation of minimum mean squared error (MMSE) estimators, their effectiveness in certain scenarios is questionable. Indeed, minimizing squared errors on average does not provide any form of stability, as the volatility of the estimation error is left uncons…

Cited by 0SourceScholar
2019

Learning Tree Structures from Noisy Data

AISTATS 2019poster

We provide high-probability sample complexity guarantees for exact structure recovery of tree-structured graphical models, when only noisy observations of the respective vertex emissions are available. We assume that the hidden variables follow either an Ising model or a Gaussian graphical model, an…

Cited by 18SourcePDFScholar
2017

Enhancing QoS in spatially controlled beamforming networks via distributed stochastic programming

ICASSP 2017accepted

We address the problem of enhancing Quality-of-Service (QoS) in power constrained, mobile relay beamforming networks, by controlling the motion of the relaying nodes. We consider a time slotted system, where the relays update their positions before the beginning of each time slot. Adopting a spatiot…

Cited by 0SourceScholar