Luiz F. O. Chamon

Luiz F. O. Chamon

Auto-generated profile, based on publicly available information

Luiz F. O. Chamon

Excellence Cluster for Simulation Technology, University of Stuttgart, Stuttgart, Germany

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 April 2019 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
MEMark Eisen
Mark Eisen
CZClark Zhang
Clark Zhang
LCLuiz F. O. Chamon
Luiz F. O. Chamon
DLDaniel D. Lee
Daniel D. Lee
ARAlejandro R. Ribeiro
Alejandro R. Ribeiro
This paper considers the design of optimal resource allocation policies in wireless communication systems which are generically modeled as a functional optimization problem with stochastic constraints. These optimization problems have the structure of a learning problem in which the statistical loss appears as a constraint, motivating the development of learning methodologies to attempt their solution. To handle stochastic constraints, training is undertaken in the dual domain. It is shown that this can be done with small loss of optimality when using near-universal learning parameterizations. In particular, since deep neural networks (DNN) are near-universal their use is advocated and explored. DNNs are trained here with a model-free primal-dual method that simultaneously learns a DNN parametrization of the resource allocation policy and optimizes the primal and dual variables. Numerical simulations demonstrate the strong performance of the proposed approach on a number of common wireless resource allocation problems.

22 February 2022 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
SPSantiago Paternain
Santiago Paternain
MCMiguel Calvo-Fullana
Miguel Calvo-Fullana
LCLuiz F. O. Chamon
Luiz F. O. Chamon
ARAlejandro Ribeiro
Alejandro Ribeiro
In this paper, we study the design of controllers in the context of stochastic optimal control under the assumption that the model of the system is not available. This is, we aim to control a Markov Decision Process (MDP) of which we do not know the transition probabilities, but we have access to sample trajectories through experience. We define safety as the agent remaining in a desired safe set with high probability during the operation time. The drawbacks of this formulation are twofold. The problem is non-convex and computing the gradients of the constraints with respect to the policies is prohibitive. Hence, we propose an ergodic relaxation of the constraints with the following advantages. (i) The safety guarantees are maintained in the case of episodic tasks and they hold until a given time horizon for continuing tasks. (ii) The constrained optimization problem despite its non-convexity has arbitrarily small duality gap if the parametrization of the controller is rich enough. (iii) The gradients of the Lagrangian associated to the safe learning problem can be computed using standard Reinforcement Learning (RL) results and stochastic approximation tools. Leveraging these adv

21 September 2017 in IEEE Transactions on Signal Processing
Verified
Journal Article
Open access
LCLuiz F. O. Chamon
Luiz F. O. Chamon
ARAlejandro Ribeiro
Alejandro Ribeiro
Sampling is a fundamental topic in graph signal processing, having found applications in estimation, clustering, and video compression. In contrast to traditional signal processing, the irregularity of the signal domain makes selecting a sampling set nontrivial and hard to analyze. Indeed, though conditions for graph signal interpolation from noiseless samples exist, they do not lead to a unique sampling set. The presence of noise makes choosing among these sampling sets a hard combinatorial problem. Although greedy sampling schemes are commonly used in practice, they have no performance guarantee. This work takes a twofold approach to address this issue. First, universal performance bounds are derived for the Bayesian estimation of graph signals from noisy samples. In contrast to currently available bounds, they are not restricted to specific sampling schemes and hold for any sampling sets. Second, this paper provides near-optimal guarantees for greedy sampling by introducing the concept of approximate submodularity and updating the classical greedy bound. It then provides explicit bounds on the approximate supermodularity of the interpolation mean-square error showing that it can be optimized with worst case guarantees using greedy search even though it is not supermodular. Simulations illustrate the derived bound for different graph models and show an application of graph signal sampling to reduce the complexity of kernel principal component analysis.

24 August 2021 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
LRLuana Ruiz
Luana Ruiz
LCLuiz F. O. Chamon
Luiz F. O. Chamon
ARAlejandro Ribeiro
Alejandro Ribeiro
Graphons are infinite-dimensional objects that represent the limit of convergent sequences of graphs as their number of nodes goes to infinity. This paper derives a theory of graphon signal processing centered on the notions of graphon Fourier transform and linear shift invariant graphon filters, the graphon counterparts of the graph Fourier transform and graph filters. It is shown that for convergent sequences of graphs and associated graph signals: (i) the graph Fourier transform converges to the graphon Fourier transform when the graphon signal is bandlimited; (ii) the spectral and vertex responses of graph filters converge to the spectral and vertex responses of graphon filters with the same coefficients. These theorems imply that for graphs that belong to certain families, i.e., that are part of sequences that converge to a certain graphon, graph Fourier analysis and graph filter design have well defined limits. In turn, these facts extend applicability of graph signal processing to graphs with large number of nodes - since signal processing pipelines designed for limit graphons can be applied to finite graphs - and to dynamic graphs - since we can relate the result of SP pipelines designed for different graphs from the same convergent graph sequence.

21 July 2023 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
LRLuana Ruiz
Luana Ruiz
LCLuiz F. O. Chamon
Luiz F. O. Chamon
ARAlejandro Ribeiro
Alejandro Ribeiro
Graph neural networks (GNNs) are composed of layers consisting of graph convolutions and pointwise nonlinearities. Due to their invariance and stability properties, GNNs are provably successful at learning representations from data supported on moderate-scale graphs. However, they are difficult to learn on large-scale graphs. In this paper, we study the problem of training GNNs on graphs of moderate size and transferring them to large-scale graphs. We use graph limits called graphons to define limit objects for graph filters and GNNs—graphon filters and graphon neural networks (WNNs)—which we interpret as generative models for graph filters and GNNs. We then show that graphon filters and WNNs can be approximated by graph filters and GNNs sampled from them on weighted and stochastic graphs. Because the error of these approximations can be upper bounded, by a triangle inequality argument we can further bound the error of transferring a graph filter or a GNN across graphs. Our results show that (i) the transference error decreases with the graph size, and (ii) that graph filters have a transferability-discriminability tradeoff that in GNNs is alleviated by the scattering behavior of the nonlinearity. These findings are demonstrated empirically in a recommendation problem and in a decentralized control task.

25 September 2023 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
MCMiguel Calvo-Fullana
Miguel Calvo-Fullana
SPSantiago Paternain
Santiago Paternain
LCLuiz F. O. Chamon
Luiz F. O. Chamon
ARAlejandro Ribeiro
Alejandro Ribeiro
A common formulation of constrained reinforcement learning involves multiple rewards that must individually accumulate to given thresholds. In this class of problems, we show a simple example in which the desired optimal policy cannot be induced by any weighted linear combination of rewards. Hence, there exist constrained reinforcement learning problems for which neither regularized nor classical primal-dual methods yield optimal policies. This work addresses this shortcoming by augmenting the state with Lagrange multipliers and reinterpreting primal-dual methods as the portion of the dynamics that drives the multipliers evolution. This approach provides a systematic state augmentation procedure that is guaranteed to solve reinforcement learning problems with constraints. Thus, as we illustrate by an example, while previous methods can fail at finding optimal policies, running the dual dynamics while executing the augmented policy yields an algorithm that provably samples actions from the optimal policy.