Guilherme Ramos

Guilherme Ramos

Auto-generated profile, based on publicly available information

Guilherme Ramos

Instituto Superior Técnico, Lisbon, Portugal and Instituto de Telecomunicações, Lisbon, Portugal

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
1 August 2017 in Automatica
Verified
Journal Article
Closed access
SPSérgio Pequito
Sérgio Pequito
GRGuilherme Ramos
Guilherme Ramos
SKSoummya Kar
Soummya Kar
A. Pedro AguiarA. Pedro Aguiar
A. Pedro Aguiar
JRJaime Ramos
Jaime Ramos

1 September 2022 in International Journal of Artificial Intelligence in Education
Verified
Journal Article
Open access
PDF file
MMMirko Marras
Mirko Marras
LBLudovico Boratto
Ludovico Boratto
GRGuilherme Ramos
Guilherme Ramos
GFGianni Fenu
Gianni Fenu
Online education platforms play an increasingly important role in mediating the success of individuals’ careers. Therefore, while building overlying content recommendation services, it becomes essential to guarantee that learners are provided with equal recommended learning opportunities, according to the platform principles, context, and pedagogy. Though the importance of ensuring equality of learning opportunities has been well investigated in traditional institutions, how this equality can be operationalized in online learning ecosystems through recommender systems is still under-explored. In this paper, we shape a blueprint of the decisions and processes to be considered in the context of equality of recommended learning opportunities, based on principles that need to be empirically-validated (no evaluation with live learners has been performed). To this end, we first provide a formalization of educational principles that model recommendations’ learning properties, and a novel fairness metric that combines them to monitor the equality of recommended learning opportunities among learners. Then, we envision a scenario wherein an educational platform should be arranged in such a way that the generated recommendations meet each principle to a certain degree for all learners, constrained to their individual preferences. Under this view, we explore the learning opportunities provided by recommender systems in a course platform, uncovering systematic inequalities. To reduce this effect, we propose a novel post-processing approach that balances personalization and equality of recommended opportunities. Experiments show that our approach leads to higher equality, with a negligible loss in personalization. This paper provides a theoretical foundation for future studies of learners’ preferences and limits concerning the equality of recommended learning opportunities.

1 March 2020 in Information Processing & Management
Verified
Journal Article
Closed access
GRGuilherme Ramos
Guilherme Ramos
LBLudovico Boratto
Ludovico Boratto
CCCarlos Caleiro
Carlos Caleiro

1 February 2022 in Future Generation Computer Systems
Verified
Journal Article
Closed access
EGElizabeth Gómez
Elizabeth Gómez
CZCarlos Shui Zhang
Carlos Shui Zhang
LBLudovico Boratto
Ludovico Boratto
MSMaria Salamó
Maria Salamó
GRGuilherme Ramos
Guilherme Ramos

30 December 2020 in International Journal of Control
Verified
Journal Article
Closed access
GRGuilherme Ramos
Guilherme Ramos
DSDaniel Silvestre
Daniel Silvestre
CSCarlos Silvestre
Carlos Silvestre
We address the problem of reaching resilient consensus among a set of agents in the presence of agents which are either under attack or behaving noisy (called faulty agents). Here, an attacked node is a node that is trying to make the consensus of the network to be driven to a value desired by the attacker, and a noisy node is a node that can be modeled as a random variable. We propose general algorithms to reach consensus in the presence of attacked nodes or noisy nodes. The algorithms are general since they receive as input a consensus algorithm, the network of nodes and initial nodes' values, and the number of maximum allowed attacked or noisy nodes. These algorithms let the agents identify the set of attacked nodes and correct the consensus value by ignoring the faulty nodes' values. We prove that if the number of faulty nodes is below the maximum allowed, then each non-faulty agent detects them with the guarantee of no false positives. If the input consensus algorithm is discrete-time and has polynomial-time complexity O ( C ) , then the proposed correction algorithms have polynomial-time complexity O ( C n f ) (and O ( C n ) for the detection of existing faulty nodes), where the number of nodes of the network is n, and the maximum allowed faulty nodes is f. Finally, we show the effectiveness of the algorithms through simulation, pointing out some attacking scenarios dealt with the aforementioned methods, which could not be tackled by the state-of-the-art. Also, we present examples where two different consensus algorithms are used as input.

13 April 2023 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
GRGuilherme Ramos
Guilherme Ramos
DSDaniel SILVESTRE
Daniel SILVESTRE
Carlos SilvestreCarlos Silvestre
Carlos Silvestre
We tackle the problem of a set of agents achieving resilient consensus in the presence of attacked agents. We present a discrete-time reputation-based consensus algorithm for synchronous and asynchronous networks by developing a local strategy where, at each time, each agent assigns a reputation (between zero and one) to each neighbor. The reputation is then used to weigh the neighbors' values in the update of its state. Under mild assumptions, we show that: (i) the proposed method converges exponentially to the consensus of the regular agents; (ii) if a regular agent identifies a neighbor as an attacked node, then it is indeed an attacked node; (iii) if the consensus value of the normal nodes differs from that of any of the attacked nodes' values, then the reputation that a regular agent assigns to the attacked neighbors goes to zero. Further, we extend our method to achieve resilience in scenarios where there are noisy nodes, dynamic networks, and stochastic node selection. Finally, we illustrate our algorithm with several examples, delineating some attacks that can be dealt with by the current proposal but not by the state-of-the-art approaches.