Tatiana Valentine Guy
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
Research Subjects
Tatiana Valentine Guy has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Miroslav Kárný
Institute of Information Theory and Automation, Prague, Czech Republic
5 shared publications - Jurij Ružejnikov
Department of Adaptive Systems, Institute of Information Theory and Automation, Czech Academy of Sciences
2 shared publications - Marko Ruman
Department of Adaptive Systems, Institute of Information Theory and Automation, Czech Academy of Sciences, Prague, Czech Republic
2 shared publications Miroslav Kárný
Institute of Information Theory and Automation Czech Academy of Sciences
2 shared publications- Adam Jedlička
Institute of Information Theory and Automation Czech Academy of Sciences
1 shared publication Aleksej Gaj
Department of Mathematics, Faculty of Nuclear Sciences and Physical Engineering, Czech Technical University in Prague, Prague, Czech Republic
1 shared publication
Latest Publications
- 19 August 2026
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 363 (15)
Adaptive Bayesian point-mass estimation
- 19 August 2026
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 363 (15)
Adaptive Bayesian point-mass estimation
- Open Access
- 23 March 2026
- Published by Taylor & Francis in Systems Science & Control Engineering
- Vol. 14 (1)
Robust sequential decision-making in adversarial environments
- 23 March 2026
- Published by Taylor & Francis in Systems Science & Control Engineering
- Vol. 14 (1)
Open AccessRobust sequential decision-making in adversarial environments
- Open Access
- 23 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 45964-45976
N -to-1 Knowledge Transfer in Reinforcement Learning via Adaptive Q -Function Selection
This paper tackles multi-source (N-to-1) knowledge transfer in reinforcement learning (RL), where an agent must adaptively solve a new task by leveraging a library of pre-learned skills. We consider a setting where these skills are represented as multiple Q-functions and corresponding environment models, without any explicit labels to guide the selection. To address this scenario, we introduce a theoretically grounded method that dynamically selects the most suitable Q-function at each learning stage. Instead of relying on noisy, short-term signals, our approach makes a farsighted choice by simulating the long-term performance of each skill while simultaneously evaluating the trustworthiness of its underlyingworld model. This allows the agent to intelligently transition from relying on transferred knowledge to using its own newly acquired policy. The proposed method is evaluated in three scenarios: (1) selection among multiple Q-functions to solve a fixed RL task, (2) adaptation in a dynamically changing environment, and (3) switching from a partially learned Q-function to a newly learned one. In all cases, our method accelerates learning and demonstrates robust adaptation, confirming its effectiveness for scalable multi-source transfer in RL.
- 23 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 45964-45976
Open AccessN -to-1 Knowledge Transfer in Reinforcement Learning via Adaptive Q -Function Selection
This paper tackles multi-source (N-to-1) knowledge transfer in reinforcement learning (RL), where an agent must adaptively solve a new task by leveraging a library of pre-learned skills. We consider a setting where these skills are represented as multiple Q-functions and corresponding environment models, without any explicit labels to guide the selection. To address this scenario, we introduce a theoretically grounded method that dynamically selects the most suitable Q-function at each learning stage. Instead of relying on noisy, short-term signals, our approach makes a farsighted choice by simulating the long-term performance of each skill while simultaneously evaluating the trustworthiness of its underlyingworld model. This allows the agent to intelligently transition from relying on transferred knowledge to using its own newly acquired policy. The proposed method is evaluated in three scenarios: (1) selection among multiple Q-functions to solve a fixed RL task, (2) adaptation in a dynamically changing environment, and (3) switching from a partially learned Q-function to a newly learned one. In all cases, our method accelerates learning and demonstrates robust adaptation, confirming its effectiveness for scalable multi-source transfer in RL.
- 12 September 2025
- Published by Springer Nature
- p. 351-365
Targeted Trust-Based Merging of Customers’ Opinions
- 12 September 2025
- Published by Springer Nature
- p. 351-365
Targeted Trust-Based Merging of Customers’ Opinions
- Open Access
- 13 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 177204-177218
Knowledge Transfer in Deep Reinforcement Learning via an RL-Specific GAN-Based Correspondence Function
Deep reinforcement learning has demonstrated superhuman performance in complex decision-making tasks, but it struggles with generalization and knowledge reuse—key aspects of true intelligence. This article introduces a novel approach that modifies Cycle Generative Adversarial Networks specifically for reinforcement learning, enabling effective one-to-one knowledge transfer between two tasks. Our method enhances the loss function with two new components: model loss, which captures dynamic relationships between source and target tasks, and Q-loss, which identifies states significantly influencing the target decision policy. Tested on the 2-D Atari game Pong, our method achieved 100% knowledge transfer in identical tasks and either 100% knowledge transfer or a 30% reduction in training time for a rotated task, depending on the network architecture. In contrast, using standard Generative Adversarial Networks or Cycle Generative Adversarial Networks led to worse performance than training from scratch in the majority of cases. The results demonstrate that the proposed method ensured enhanced knowledge generalization in deep reinforcement learning.
- 13 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 177204-177218
Open AccessKnowledge Transfer in Deep Reinforcement Learning via an RL-Specific GAN-Based Correspondence Function
Deep reinforcement learning has demonstrated superhuman performance in complex decision-making tasks, but it struggles with generalization and knowledge reuse—key aspects of true intelligence. This article introduces a novel approach that modifies Cycle Generative Adversarial Networks specifically for reinforcement learning, enabling effective one-to-one knowledge transfer between two tasks. Our method enhances the loss function with two new components: model loss, which captures dynamic relationships between source and target tasks, and Q-loss, which identifies states significantly influencing the target decision policy. Tested on the 2-D Atari game Pong, our method achieved 100% knowledge transfer in identical tasks and either 100% knowledge transfer or a 30% reduction in training time for a rotated task, depending on the network architecture. In contrast, using standard Generative Adversarial Networks or Cycle Generative Adversarial Networks led to worse performance than training from scratch in the majority of cases. The results demonstrate that the proposed method ensured enhanced knowledge generalization in deep reinforcement learning.
- Open Access
Exploration in Knowledge Transfer Utilizing Reinforcement Learning
The contribution focuses on the problem of exploration within the task of knowledge transfer. Knowledge transfer refers to the useful application of the knowledge gained while learning the source task in the target task. The intended benefit of knowledge transfer is to speed up the learning process of the target task. The article aims to compare several exploration methods used within a deep transfer learning algorithm, particularly Deep Target Transfer $Q$-learning. The methods used are $ε$-greedy, Boltzmann, and upper confidence bound exploration. The aforementioned transfer learning algorithms and exploration methods were tested on the virtual drone problem. The results have shown that the upper confidence bound algorithm performs the best out of these options. Its sustainability to other applications is to be checked.
Open AccessExploration in Knowledge Transfer Utilizing Reinforcement Learning
The contribution focuses on the problem of exploration within the task of knowledge transfer. Knowledge transfer refers to the useful application of the knowledge gained while learning the source task in the target task. The intended benefit of knowledge transfer is to speed up the learning process of the target task. The article aims to compare several exploration methods used within a deep transfer learning algorithm, particularly Deep Target Transfer $Q$-learning. The methods used are $ε$-greedy, Boltzmann, and upper confidence bound exploration. The aforementioned transfer learning algorithms and exploration methods were tested on the virtual drone problem. The results have shown that the upper confidence bound algorithm performs the best out of these options. Its sustainability to other applications is to be checked.
- Open Access
- 28 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 105008-105021
Indirect Dynamic Negotiation in the Nash Demand Game
The paper addresses a problem of sequential bilateral bargaining with incomplete information. We proposed a decision model that helps agents to successfully bargain by performing indirect negotiation and learning the opponent’s model. Methodologically the paper casts heuristically-motivated bargaining of a self-interested independent player into a framework of Bayesian learning and Markov decision processes. The special form of the reward implicitly motivates the players to negotiate indirectly, via closed-loop interaction. We illustrate the approach by applying our model to the Nash demand game, which is an abstract model of bargaining. The results indicate that the established negotiation: i) leads to coordinating players’ actions; ii) results in maximising success rate of the game and iii) brings more individual profit to the players.
- 28 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 105008-105021
Open AccessIndirect Dynamic Negotiation in the Nash Demand Game
The paper addresses a problem of sequential bilateral bargaining with incomplete information. We proposed a decision model that helps agents to successfully bargain by performing indirect negotiation and learning the opponent’s model. Methodologically the paper casts heuristically-motivated bargaining of a self-interested independent player into a framework of Bayesian learning and Markov decision processes. The special form of the reward implicitly motivates the players to negotiate indirectly, via closed-loop interaction. We illustrate the approach by applying our model to the Nash demand game, which is an abstract model of bargaining. The results indicate that the established negotiation: i) leads to coordinating players’ actions; ii) results in maximising success rate of the game and iii) brings more individual profit to the players.
- 13 August 2016
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 230-237
Deliberation-Aware Responder in Multi-proposer Ultimatum Game
- 13 August 2016
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 230-237
Deliberation-Aware Responder in Multi-proposer Ultimatum Game
- 30 January 2016
- Published by Springer Nature
- p. 185-191
Theoretical Models of Decision-Making in the Ultimatum Game: Fairness vs. Reason
- 30 January 2016
- Published by Springer Nature
- p. 185-191
Theoretical Models of Decision-Making in the Ultimatum Game: Fairness vs. Reason
- 10 February 2015
- Published by Springer Nature
- p. 55-89
On the Origins of Imperfection and Apparent Non-rationality
- 10 February 2015
- Published by Springer Nature
- p. 55-89
On the Origins of Imperfection and Apparent Non-rationality