Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Vittorio Giammarino

dblp:263/6539 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
4since 2021 · last 2025
0000-0001-7082-3262ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Reinforcement learning · 62% Robot manipulation · 12% Motion planning and robot control · 9%

Topics — the 12 heaviest of 14, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
goal-conditioned reinforcement learning
1.722025
Automaton Constrained Q-Learning · NeurIPS 2025
Physics-informed Value Learner for Offline Goal-Conditioned Reinforcement Learning · NeurIPS 2025
Machine learning › Reinforcement learning › imitation learning › occupancy matching
adversarial imitation learning
0.912025
Visually Robust Adversarial Imitation Learning from Videos with Contrastive Learning · ICRA 2025
Machine learning › Reinforcement learning
imitation learning
0.912025
Visually Robust Adversarial Imitation Learning from Videos with Contrastive Learning · ICRA 2025
Robotics › Robot manipulation › learning from demonstration
learning from video demonstration
0.912025
Visually Robust Adversarial Imitation Learning from Videos with Contrastive Learning · ICRA 2025
Machine learning › Reinforcement learning
offline reinforcement learning
0.912025
Physics-informed Value Learner for Offline Goal-Conditioned Reinforcement Learning · NeurIPS 2025
Robotics › Motion planning and robot control
robot learning
0.912025
Visually Robust Adversarial Imitation Learning from Videos with Contrastive Learning · ICRA 2025
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › temporal planning
temporal logic planning
0.912025
Automaton Constrained Q-Learning · NeurIPS 2025
Machine learning › Reinforcement learning
value-based reinforcement learning
0.912025
Physics-informed Value Learner for Offline Goal-Conditioned Reinforcement Learning · NeurIPS 2025
Machine learning › Reinforcement learning
value function estimation
0.912025
Physics-informed Value Learner for Offline Goal-Conditioned Reinforcement Learning · NeurIPS 2025
Machine learning › Representation and self-supervised learning
contrastive learning
0.312025
Visually Robust Adversarial Imitation Learning from Videos with Contrastive Learning · ICRA 2025
Robotics › Robot navigation and mapping › mobile robot navigation
long-horizon navigation
0.312025
Physics-informed Value Learner for Offline Goal-Conditioned Reinforcement Learning · NeurIPS 2025
Machine learning › Representation and self-supervised learning › representation learning
visual representation learning
0.312025
Visually Robust Adversarial Imitation Learning from Videos with Contrastive Learning · ICRA 2025

Methods — techniques the papers use, named apart from their topics

temporal difference learning · 0.9q-learning · 0.9off-policy adversarial imitation learning · 0.9linear-time temporal logic · 0.9hierarchical implicit q-learning · 0.9eikonal partial differential equation · 0.9data augmentation · 0.9contrastive learning · 0.9automaton representation · 0.9
YearPublicationVenuePosition
2025 Visually Robust Adversarial Imitation Learning from Videos with Contrastive Learning
abstract
We propose C-LAIfO, a computationally efficient algorithm designed for imitation learning from videos in the presence of visual mismatch between agent and expert domains. We analyze the problem of imitation from expert videos with visual discrepancies, and introduce a solution for robust latent space estimation using contrastive learning and data augmentation. Provided a visually robust latent space, our algorithm performs imitation entirely within this space using off-policy adversarial imitation learning. We conduct a thorough ablation study to justify our design and test C-LAIfO on high-dimensional continuous robotic tasks. Additionally, we demonstrate how C LAIfO can be combined with other reward signals to facilitate learning on a set of challenging hand manipulation tasks with sparse rewards. Our experiments show improved performance compared to baseline methods, highlighting the effectiveness of C-LAIfO. To ensure reproducibility, we open source our code.
Vittorio Giammarino, James Queeney, Ioannis Paschalidis
ICRA1
2025 Physics-informed Value Learner for Offline Goal-Conditioned Reinforcement Learning
abstract
Offline Goal-Conditioned Reinforcement Learning (GCRL) holds great promise for domains such as autonomous navigation and locomotion, where collecting interactive data is costly and unsafe. However, it remains challenging in practice due to the need to learn from datasets with limited coverage of the state-action space and to generalize across long-horizon tasks. To improve on these challenges, we propose a Physics-informed (Pi) regularized loss for value learning, derived from the Eikonal Partial Differential Equation (PDE) and which induces a geometric inductive bias in the learned value function. Unlike generic gradient penalties that are primarily used to stabilize training, our formulation is grounded in continuous-time optimal control and encourages value functions to align with cost-to-go structures. The proposed regularizer is broadly compatible with temporal-difference-based value learning and can be integrated into existing Offline GCRL algorithms. When combined with Hierarchical Implicit Q-Learning (HIQL), the resulting method, Eikonal-regularized HIQL (Eik-HIQL), yields significant improvements in both performance and generalization, with pronounced gains in stitching regimes and large-scale navigation tasks. Code is available at https://github.com/VittorioGiammarino/Eik-HIQL.
Vittorio Giammarino, Ruiqi Ni, Ahmed H. Qureshi
NeurIPS1
2025 Automaton Constrained Q-Learning
abstract
Real-world robotic tasks often require agents to achieve sequences of goals while respecting time-varying safety constraints. However, standard Reinforcement Learning (RL) paradigms are fundamentally limited in these settings. A natural approach to these problems is to combine RL with Linear-time Temporal Logic (LTL), a formal language for specifying complex, temporally extended tasks and safety constraints. Yet, existing RL methods for LTL objectives exhibit poor empirical performance in complex and continuous environments. As a result, no scalable methods support both temporally ordered goals and safety simultaneously, making them ill-suited for realistic robotics scenarios. We propose Automaton Constrained Q-Learning (ACQL), an algorithm that addresses this gap by combining goal-conditioned value learning with automaton-guided reinforcement. ACQL supports most LTL task specifications and leverages their automaton representation to explicitly encode stage-wise goal progression and both stationary and non-stationary safety constraints. We show that ACQL outperforms existing methods across a range of continuous control tasks, including cases where prior methods fail to satisfy either goal-reaching or safety constraints. We further validate its real-world applicability by deploying ACQL on a 6-DOF robotic arm performing a goal-reaching task in a cluttered, cabinet-like space with safety constraints. Our results demonstrate that ACQL is a robust and scalable solution for learning robotic behaviors according to rich temporal specifications.
Anastasios Manganaris, Vittorio Giammarino, Ahmed H. Qureshi
NeurIPS2
2021 Traffic Flow on a Ring With a Single Autonomous Vehicle: An Interconnected Stability Perspective
abstract
In recent years, field experiments have been performed on ring roadways with human-driven vehicles or with a mix of human-driven and autonomous vehicles. While these experiments demonstrate the potential for controlling traffic flows by a small number of autonomous vehicles, the theoretical framework about such a possibility is to a large extent incomplete. Indeed, most work on mixed traffic focused on classical asymptotical stability notions, neglecting that human drivers are prone to the interconnected instability known in the literature as string instability. This work aims to enhance the existing theories to meet the questions raised by the field experiments. It starts from the observation that the standard notion of string stability on a ring roadway is too demanding for a mixed traffic scenario: therefore, a new interconnected stability definition, named weak ring stability, is proposed. This new interconnected stability notion, in combination with classical stability, is able to explain phenomena observed in field experiments and to highlight possibilities and limitations of traffic control via sparse autonomous vehicle. Furthermore, it allows designing AV controllers with improved string stability specifications, at the price of reducing the sparsity of the autonomous vehicles.
Vittorio Giammarino, Simone Baldi, Paolo Frasca, Maria Laura Delle Monache
IEEE Trans. Intell. Transp. Syst.1