Silvio Galesso

dblp:215/4448 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
3since 2021 · last 2025
0009-0007-0249-6029ORCID · reported

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

Artificial intelligence and machine learning · 4 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1 · 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
Motion planning and robot control · 35% Trustworthy machine learning · 22% Autonomous driving · 15%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot manipulation
learning from demonstration
0.812024
Compositional Servoing by Recombining Demonstrations · ICRA 2024
Machine learning › Trustworthy machine learning › robustness
out-of-distribution detection
0.812024
Diffusion for Out-of-Distribution Detection on Road Scenes and Beyond · ECCV (74) 2024
Robotics › Autonomous driving
perception
0.812024
Diffusion for Out-of-Distribution Detection on Road Scenes and Beyond · ECCV (74) 2024
Robotics › Motion planning and robot control
robot control
0.812024
Compositional Servoing by Recombining Demonstrations · ICRA 2024
Robotics › Motion planning and robot control › robot control › sensor-based control
visual servoing
0.812024
Compositional Servoing by Recombining Demonstrations · ICRA 2024
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
multi-hypothesis estimation
0.312018
Uncertainty Estimates and Multi-hypotheses Networks for Optical Flow · ECCV (7) 2018
Computer vision › 3D vision › motion estimation
optical flow
0.312018
Uncertainty Estimates and Multi-hypotheses Networks for Optical Flow · ECCV (7) 2018
Machine learning › Trustworthy machine learning
uncertainty estimation
0.312018
Uncertainty Estimates and Multi-hypotheses Networks for Optical Flow · ECCV (7) 2018
Robotics › Motion planning and robot control › robot learning
manipulation policy
0.212024
Compositional Servoing by Recombining Demonstrations · ICRA 2024

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

similarity functions · 0.8graph traversal · 0.8diffusion model · 0.8deep learning · 0.3
YearPublicationVenuePosition
2025 Overcoming Challenges of Long-Horizon Prediction in Driving World Models
abstract
Existing world models for autonomous driving struggle with long-horizon generation and generalization to challenging scenarios. In this work, we develop a model using simple design choices, and without additional supervision or sensors, such as maps, depth, or multiple cameras. We show that our model yields state-of-the-art performance, despite having only 469M parameters and being trained on 280h of video data. It particularly stands out in difficult scenarios like turning maneuvers and urban traffic. We test whether discrete token models possibly have advantages over continuous models based on flow matching. To this end, we set up a hybrid tokenizer that is compatible with both approaches and allows for a side-by-side comparison. Our study concludes in favor of the continuous autoregressive model, which is less brittle on individual design choices and more powerful than the model built on discrete tokens. Project page with code, model checkpoints and visualization can be found here: https://lmb-freiburg.github.io/orbis.github.io/
Arian Mousakhan, Sudhanshu Mittal, Silvio Galesso, Karim Farid, Thomas Brox
NeurIPS3
2024 Diffusion for Out-of-Distribution Detection on Road Scenes and Beyond
Silvio Galesso, Philipp Schröppel, Hssan Driss, Thomas Brox
ECCV (74)1
2024 Compositional Servoing by Recombining Demonstrations
abstract
Learning-based manipulation policies from image inputs often show weak task transfer capabilities. In contrast, visual servoing methods allow efficient task transfer in high-precision scenarios while requiring only a few demonstrations. In this work, we present a framework that formulates the visual servoing task as graph traversal. Our method not only extends the robustness of visual servoing, but also enables multitask capability based on a few task-specific demonstrations. We construct demonstration graphs by splitting existing demonstrations and recombining them. In order to traverse the demonstration graph in the inference case, we utilize a similarity function that helps select the best demonstration for a specific task. This enables us to compute the shortest path through the graph. Ultimately, we show that recombining demonstrations leads to higher task-respective success. We present extensive simulation and real-world experimental results that demonstrate the efficacy of our approach.
Max Argus, Abhijeet Nayak, Martin Büchner, Silvio Galesso, Abhinav Valada, Thomas Brox
ICRA4
2018 Uncertainty Estimates and Multi-hypotheses Networks for Optical Flow
Eddy Ilg, Özgün Çiçek, Silvio Galesso, Aaron Klein, Osama Makansi, Frank Hutter, Thomas Brox
ECCV (7)3