Searcharxiv⌕ Search

arXiv subjects

Aris L. Moustakas

Publications and source records attributed to Aris L. Moustakas.

At least 19 recordsLinked to original sources

SGPMIL: Sparse Gaussian Process Multiple Instance Learning

Multiple Instance Learning (MIL) offers a natural solution for settings where only coarse, bag-level labels are available, without having access to instance-level annotations. This is usually the case in digital pathology, which consists of gigapixel-sized images. While deterministic attention-based MIL approaches achieve strong bag-level performance, they often overlook the uncertainty inherent in instance relevance. In this paper, we address the lack of uncertainty quantification in instance-level attention scores by introducing SGPMIL, a new probabilistic attention-based MIL framework grounded in Sparse Gaussian Processes (SGP). By learning a posterior distribution over attention scores, SGPMIL enables principled uncertainty estimation, resulting in more reliable and calibrated instance relevance maps. Our approach not only preserves competitive bag-level performance but also significantly improves the quality and interpretability of instance-level predictions under uncertainty. SGPMIL extends prior work by introducing feature scaling in the SGP predictive mean function, leading to faster training, improved efficiency, and enhanced instance-level performance. Extensive experiments on multiple well-established digital pathology datasets highlight the effectiveness of our approach across both bag- and instance-level evaluations. Our code is available at https://github.com/mandlos/SGPMIL.

cs.CV↗

CAPRMIL: Context-Aware Patch Representations for Multiple Instance Learning

In computational pathology, weak supervision has become the standard for deep learning due to the gigapixel scale of WSIs and the scarcity of pixel-level annotations, with Multiple Instance Learning (MIL) established as the principal framework for slide-level model training. In this paper, we introduce a novel setting for MIL methods, inspired by proceedings in Neural Partial Differential Equation (PDE) Solvers. Instead of relying on complex attention-based aggregation, we propose an efficient, aggregator-agnostic framework that removes the complexity of correlation learning from the MIL aggregator. CAPRMIL produces rich context-aware patch embeddings that promote effective correlation learning on downstream tasks. By projecting patch features -- extracted using a frozen patch encoder -- into a small set of global context/morphology-aware tokens and utilizing multi-head self-attention, CAPRMIL injects global context with linear computational complexity with respect to the bag size. Paired with a simple Mean MIL aggregator, CAPRMIL matches state-of-the-art slide-level performance across multiple public pathology benchmarks, while reducing the total number of trainable parameters by 48%-92.8% versus SOTA MILs, lowering FLOPs during inference by 52%-99%, and ranking among the best models on GPU memory efficiency and training time. Our results indicate that learning rich, context-aware instance representations before aggregation is an effective and scalable alternative to complex pooling for whole-slide analysis. Our code is available at https://github.com/mandlos/CAPRMIL

cs.CV↗

Multi-RIS-Empowered Communication Systems: Capacity Analysis and Optimization

In this chapter, using statistical physics methods, asymptotic closed-form expressions for the mean and variance of the mutual information for a multi-antenna transmitter-receiver pair in the presence of multiple Reconfigurable Intelligent Surfaces (RISs) are presented. While nominally valid in the large-system limit, it is shown that the derived Gaussian approximation for the mutual information can be quite accurate, even for modest-sized antenna arrays and metasurfaces. The above results are particularly useful when fast-fading conditions are present, which renders channel estimation challenging. The derived analysis indicates that, when the channel close to an RIS is correlated, for instance due to small angle spread which is reasonable for wireless systems with increasing carrier frequencies, the communication link benefits significantly from statistical RIS optimization, resulting in gains that are surprisingly higher than the nearly uncorrelated case. More importantly, the presented novel asymptotic properties of the correlation matrices of the impinging and outgoing signals at the RISs can be deployed to optimize the metasurfaces without brute-force numerical optimization. The numerical investigation demonstrates that, when the desired reflection from any of the RISs departs significantly from geometrical optics, the metasurfaces can be optimized to provide robust communication links, without significant need for their optimal placement.

cs.IT↗

Landscape Complexity for the Empirical Risk of Generalized Linear Models: Discrimination between Structured Data

We use the Kac-Rice formula and results from random matrix theory to obtain the average number of critical points of a family of high-dimensional empirical loss functions, where the data are correlated $d$-dimensional Gaussian vectors, whose number has a fixed ratio with their dimension. The correlations are introduced to model the existence of structure in the data, as is common in current Machine-Learning systems. Under a technical hypothesis, our results are exact in the large-$d$ limit, and characterize the annealed landscape complexity, namely the logarithm of the expected number of critical points at a given value of the loss. We first address in detail the landscape of the loss function of a single perceptron and then generalize it to the case where two competing data sets with different covariance matrices are present, with the perceptron seeking to discriminate between them. The latter model can be applied to understand the interplay between adversity and non-trivial data structure. For completeness, we also treat the case of a loss function used in training Generalized Linear Models in the presence of correlated input data.

cs.LG↗

Spectral Efficiency Expression for the Non-Linear Schrödinger Channel in the Low Noise Limit Using Scattering Data

Transmission through optical fibers offers ultra-fast and long-haul communications. However, the search for its ultimate capacity limits in the presence of distributed amplifier noise is complicated by the competition between wave dispersion and non-linearity. In this paper, we exploit the integrability of the Nonlinear Schrödinger Equation, which accurately models optical fiber communications, to derive an expression for the spectral efficiency of an optical fiber communications channel, expressed fully in the scattering data domain of the Non-linear Fourier Transform and valid in the limit of low amplifier noise. We utilize the relationship between the derived noise-covariance operator and the Jacobian of the mapping between the signal and the scattering data to obtain the properties of the former. Emerging from the structure of the covariance operator is the significance of the Gordon-Haus effect in moderating and finally reversing the increase of the spectral efficiency with power. This effect is showcased in numerical simulations for Gaussian input in the high-bandwidth regime.

cs.IT↗

MIMO MAC Empowered by Reconfigurable Intelligent Surfaces: Capacity Region and Large System Analysis

Smart wireless environments enabled by multiple distributed Reconfigurable Intelligent Surfaces (RISs) have recently attracted significant research interest as a wireless connectivity paradigm for sixth Generation (6G) networks. In this paper, using random matrix theory methods, we calculate the mean of the sum Mutual Information (MI) for the correlated Multiple-Input Multiple-Output (MIMO) Multiple Access Channel (MAC) in the presence of multiple RISs, in the large-antenna number limit. We thus obtain the capacity region boundaries, after optimizing over the tunable RISs' phase configurations. Furthermore, we obtain a closed-form expression for the variance of the sum-MI metric, which together with the mean provides a tight Gaussian approximation for the outage probability. The derived results become relevant in the presence of fast-fading, when channel estimation is extremely challenging. Our numerical investigations showcased that, when the angle-spread in the neighborhood of each RIS is small, which is expected for higher carrier frequencies, the communication link strongly improves from optimizing the ergodic MI of the multiple RISs.We also found that, increasing the number of transmitting users in such MIMO-MAC-RIS systems results to rapidly diminishing sum-MI gains, hence, providing limits on the number of users that can be efficiently served by a given RIS.

cs.IT↗

Reconfigurable Intelligent Surfaces and Capacity Optimization: A Large System Analysis

Reconfigurable Intelligent Surfaces (RISs), comprising large numbers of low-cost and almost passive metamaterials with tunable reflection properties, have been recently proposed as an enabling technology for programmable wireless propagation environments. In this paper, we present asymptotic closed-form expressions for the mean and variance of the mutual information metric for a multi-antenna transmitter-receiver pair in the presence of multiple RISs, using methods from statistical physics. While nominally valid in the large system limit, we show that the derived Gaussian approximation for the mutual information can be quite accurate, even for modest-sized antenna arrays and metasurfaces. The above results are particularly useful when fast-fading conditions are present, which renders instantaneous channel estimation extremely challenging. We find that, when the channel close to an RIS is correlated, for instance due to small angle spread, which is reasonable for wireless systems with increasing carrier frequencies, the communication link benefits significantly from statistical RIS phase optimization, resulting in gains that are surprisingly higher than the nearly uncorrelated case. Using our novel asymptotic properties of the correlation matrices of the impinging and outgoing signals at the RISs, we can optimize the metasurfaces without brute-force numerical optimization. Furthermore, when the desired reflection from any of the RISs departs significantly from geometrical optics, the metasurfaces can be optimized to provide robust communication links, without significant need for their optimal placement.

cs.IT↗

On the Uplink Performance of Finite-Capacity Radio Stripes

Cell-Free (CF) Massive MIMO (mMIMO) is a technology which can potentially augment not only the deployment of 5G, but also the deployment of beyond 5G (B5G) wireless networks. However, the cost for rolling out such systems may be significant. Radio stripes form a promising solution which offers the potential of scalability at a reduced price. This paper investigates the uplink scenario of a CF mMIMO system, implemented with a limited-capacity radio stripe which integrates a novel arrangement of access points (APs), fully exploiting macro-diversity benefits. We also analyze a heuristic Compare-and-Forward (CnF) strategy, which, by comparing normalized linear minimum mean square error (N-LMMSE) soft estimates, enables optimal dynamic cooperation clustering, thus leading to a user-centric radio stripe network approach. Aiming at maximizing the per-user uplink spectral efficiency (SE), we ensure that, under finite capacity constraints, our solution can guarantee better performance than existing radio stripe architectures, especially when system size increases.

cs.IT↗

Capacity Optimization using Reconfigurable Intelligent Surfaces: A Large System Approach

Reconfigurable Intelligent Surfaces (RISs), comprising large numbers of low-cost and passive metamaterials with tunable reflection properties, have been recently proposed as an enabler for programmable radio propagation environments. However, the role of the channel conditions near the RISs on their optimizability has not been analyzed adequately. In this paper, we present an asymptotic closed-form expression for the mutual information of a multi-antenna transmitter-receiver pair in the presence of multiple RISs, in the large-antenna limit, using the random matrix and replica theories. Under mild assumptions, asymptotic expressions for the eigenvalues and the eigenvectors of the channel covariance matrices are derived. We find that, when the channel close to an RIS is correlated, for instance due to small angle spread, the communication link benefits significantly from the RIS optimization, resulting in gains that are surprisingly higher than the nearly uncorrelated case. Furthermore, when the desired reflection from the RIS departs significantly from geometrical optics, the surface can be optimized to provide robust communication links. Building on the properties of the eigenvectors of the covariance matrices, we are able to find the optimal response of the RISs in closed form, bypassing the need for brute-force optimization.

cs.IT↗

Random Möbius Maps: Distribution of Reflection in Non-Hermitian 1D Disordered Systems

Using the properties of random Möbius transformations, we investigate the statistical properties of the reflection coefficient in a random chain of lossy scatterers. We explicitly determine the support of the distribution and the condition for coherent perfect absorption to be possible. We show that at its boundaries the distribution has Lifshits-like tails, which we evaluate. We also obtain the extent of penetration of incoming waves into the medium via the Lyapunov exponent. Our results agree well when compared to numerical simulations in a specific random system.

cond-mat.stat-mech↗

Gallager Bound for MIMO Channels: Large-N Asymptotics

The use of multiple antenna arrays in transmission and reception has become an integral part of modern wireless communications. To quantify the performance of such systems, the evaluation of bounds on the error probability of realistic finite length codewords is important. In this paper, we analyze the standard Gallager error bound for both constraints of maximum average power and maximum instantaneous power. Applying techniques from random matrix theory, we obtain analytic expressions of the error exponent when the length of the codeword increases to infinity at a fixed ratio with the antenna array dimensions. Analyzing its behavior at rates close to the ergodic rate, we find that the Gallager error bound becomes asymptotically close to an upper error bound obtained recently by Hoydis et al. 2015. We also obtain an expression for the Gallager exponent in the case when the codelength spans several Rayleigh fading blocks, hence taking into account the situation when the channel varies during each transmission.

cs.IT↗

Modern Telecommunications: A Playground for Physicists?

This report summarizes some of the material that was presented by the author during the 2015 Les Houches Summerschool on "Random Matrices and Stochastic Processes". In these Lectures, various applications of Random Matrix Theory in modern telecommunications are reviewed. The aim is to introduce the Physics community to a number of relevant problems that can be analyzed using such tools, while at the same time briefly describing the way these methods are applied. More specifically, two applications on wireless communications and two on optical communications are presented.

cond-mat.stat-mech↗

Boltzmann meets Nash: Energy-efficient routing in optical networks under uncertainty

Motivated by the massive deployment of power-hungry data centers for service provisioning, we examine the problem of routing in optical networks with the aim of minimizing traffic-driven power consumption. To tackle this issue, routing must take into account energy efficiency as well as capacity considerations; moreover, in rapidly-varying network environments, this must be accomplished in a real-time, distributed manner that remains robust in the presence of random disturbances and noise. In view of this, we derive a pricing scheme whose Nash equilibria coincide with the network's socially optimum states, and we propose a distributed learning method based on the Boltzmann distribution of statistical mechanics. Using tools from stochastic calculus, we show that the resulting Boltzmann routing scheme exhibits remarkable convergence properties under uncertainty: specifically, the long-term average of the network's power consumption converges within $\varepsilon$ of its minimum value in time which is at most $\tilde O(1/\varepsilon^2)$, irrespective of the fluctuations' magnitude; additionally, if the network admits a strict, non-mixing optimum state, the algorithm converges to it - again, no matter the noise level. Our analysis is supplemented by extensive numerical simulations which show that Boltzmann routing can lead to a significant decrease in power consumption over basic, shortest-path routing schemes in realistic network conditions.

cs.NI↗

Optical Fiber MIMO Channel Model and its Analysis

Technology is moving towards space division multiplexing in optical fiber to keep up the trend in rate increase over time and to avoid an imminent capacity crunch. Thus, it is of paramount interest to estimate the potential gains of this approach. As more spatial channels are being packed into a single fiber, the increased crosstalk necessitates the use of MIMO to guarantee reliable operation. In this paper, we exploit the analogy between an optical fiber and a model from mesoscopic physics - a chaotic cavity - to obtain a novel channel model for the optical fiber. The model captures both random distributed crosstalk and modedependent loss, which are described within the framework of scattering theory. Using tools from replica theory and random matrix theory, we derive the capacity of the fiber optical MIMO channel model.

cs.IT↗

Outage and Capacity Comparisons For Ground Relaying Systems Using Stochastic Geometry

Concurrent cooperative transmission for relaying purposes in mobile communication networks is relevant in current institutional systems with limited infrastructure, and and may be viewed as a potential range-extension mechanism for future commercial networks, including vehicular autonomous networking. The complexity of the overall system has encouraged certain abstractions at the physical layer which are critically analyzed in the present paper. We show via analytic stochastic geometry tools that the receiver structure plays a crucial role in the outage behavior of the relays, particularly for realistic flooding protocols. This approach aims to help understand the cross-layer aspects of such networks.

cs.IT↗

In an Uncertain World: Distributed Optimization in MIMO Systems with Imperfect Information

In this paper, we introduce a distributed algorithm that optimizes the Gaussian signal covariance matrices of multi-antenna users transmitting to a common multi-antenna receiver under imperfect and possibly delayed channel state information. The algorithm is based on an extension of exponential learning techniques to a semidefinite setting and it requires the same information as distributed water-filling methods. Unlike water-filling however, the proposed matrix exponential learning (MXL) algorithm converges to the system's optimum signal covariance profile under very mild conditions on the channel uncertainty statistics; moreover, the algorithm retains its convergence properties even in the presence of user update asynchronicities, random delays and/or ergodically changing channel conditions. In particular, by properly tuning the algorithm's learning rate (or step size), the algorithm converges within a few iterations, even for large numbers of users and/or antennas per user. Our theoretical analysis is complemented by numerical simulations which illustrate the algorithm's robustness and scalability in realistic network conditions.

cs.IT↗

Cost-Efficient Throughput Maximization in Multi-Carrier Cognitive Radio Systems

Cognitive radio (CR) systems allow opportunistic, secondary users (SUs) to access portions of the spectrum that are unused by the network's licensed primary users (PUs), provided that the induced interference does not compromise the primary users' performance guarantees. To account for interference constraints of this type, we consider a flexible spectrum access pricing scheme that charges secondary users based on the interference that they cause to the system's primary users (individually, globally, or both), and we examine how secondary users can maximize their achievable transmission rate in this setting. We show that the resulting non-cooperative game admits a unique Nash equilibrium under very mild assumptions on the pricing mechanism employed by the network operator, and under both static and ergodic (fast-fading) channel conditions. In addition, we derive a dynamic power allocation policy that converges to equilibrium within a few iterations (even for large numbers of users), and which relies only on local signal-to-interference-and-noise measurements; importantly, the proposed algorithm retains its convergence properties even in the ergodic channel regime, despite the inherent stochasticity thereof. Our theoretical analysis is complemented by extensive numerical simulations which illustrate the performance and scalability properties of the proposed pricing scheme under realistic network conditions.

cs.IT↗

Large System Analysis of the Energy Consumption Distribution in Multi-User MIMO Systems with Mobility

In this work, we consider the downlink of a single-cell multi-user MIMO system in which the base station (BS) makes use of $N$ antennas to communicate with $K$ single-antenna user equipments (UEs). The UEs move around in the cell according to a random walk mobility model. We aim at determining the energy consumption distribution when different linear precoding techniques are used at the BS to guarantee target rates within a finite time interval $T$. The analysis is conducted in the asymptotic regime where $N$ and $K$ grow large with fixed ratio under the assumption of perfect channel state information (CSI). Both recent and standard results from large system analysis are used to provide concise formulae for the asymptotic transmit powers and beamforming vectors for all considered schemes. These results are eventually used to provide a deterministic approximation of the energy consumption and to study its fluctuations around this value in the form of a central limit theorem. Closed-form expressions for the asymptotic means and variances are given. Numerical results are used to validate the accuracy of the theoretical analysis and to make comparisons. We show how the results can be used to approximate the probability that a battery-powered BS runs out of energy and also to design the cell radius for minimizing the energy consumption per unit area. The imperfect CSI case is also briefly considered.

cs.IT↗