Search Results for author: Thomy Phan

Found 22 papers, 9 papers with code

ClusterComm: Discrete Communication in Decentralized MARL using Internal Representation Clustering

no code implementations7 Jan 2024 Robert Müller, Hasan Turalic, Thomy Phan, Michael Kölle, Jonas Nüßlein, Claudia Linnhoff-Popien

In the realm of Multi-Agent Reinforcement Learning (MARL), prevailing approaches exhibit shortcomings in aligning with human learning, robustness, and scalability.

Clustering Multi-agent Reinforcement Learning +1

Adaptive Anytime Multi-Agent Path Finding Using Bandit-Based Large Neighborhood Search

1 code implementation28 Dec 2023 Thomy Phan, Taoan Huang, Bistra Dilkina, Sven Koenig

State-of-the-art anytime MAPF is based on Large Neighborhood Search (LNS), where a fast initial solution is iteratively optimized by destroying and repairing a fixed number of parts, i. e., the neighborhood, of the solution, using randomized destroy heuristics and prioritized planning.

Multi-Agent Path Finding Thompson Sampling

Multi-Agent Quantum Reinforcement Learning using Evolutionary Optimization

no code implementations9 Nov 2023 Michael Kölle, Felix Topp, Thomy Phan, Philipp Altmann, Jonas Nüßlein, Claudia Linnhoff-Popien

We showed that our Variational Quantum Circuit approaches perform significantly better compared to a neural network with a similar amount of trainable parameters.

Autonomous Driving Multi-agent Reinforcement Learning +1

Capturing Dependencies within Machine Learning via a Formal Process Model

no code implementations10 Aug 2022 Fabian Ritz, Thomy Phan, Andreas Sedlmeier, Philipp Altmann, Jan Wieghardt, Reiner Schmid, Horst Sauer, Cornel Klein, Claudia Linnhoff-Popien, Thomas Gabor

We define a comprehensive SD process model for ML that encompasses most tasks and artifacts described in the literature in a consistent way.

VAST: Value Function Factorization with Variable Agent Sub-Teams

1 code implementation NeurIPS 2021 Thomy Phan, Fabian Ritz, Lenz Belzner, Philipp Altmann, Thomas Gabor, Claudia Linnhoff-Popien

We evaluate VAST in three multi-agent domains and show that VAST can significantly outperform state-of-the-art VFF, when the number of agents is sufficiently large.

Multi-agent Reinforcement Learning

Accelerating Evolutionary Construction Tree Extraction via Graph Partitioning

no code implementations9 Aug 2020 Markus Friedrich, Sebastian Feld, Thomy Phan, Pierre-Alain Fayolle

Extracting a Construction Tree from potentially noisy point clouds is an important aspect of Reverse Engineering tasks in Computer Aided Design.

Combinatorial Optimization graph partitioning

Insights on Training Neural Networks for QUBO Tasks

no code implementations29 Apr 2020 Thomas Gabor, Sebastian Feld, Hila Safi, Thomy Phan, Claudia Linnhoff-Popien

Current hardware limitations restrict the potential when solving quadratic unconstrained binary optimization (QUBO) problems via the quantum approximate optimization algorithm (QAOA) or quantum annealing (QA).

Traveling Salesman Problem

Cross Entropy Hyperparameter Optimization for Constrained Problem Hamiltonians Applied to QAOA

2 code implementations11 Mar 2020 Christoph Roch, Alexander Impertro, Thomy Phan, Thomas Gabor, Sebastian Feld, Claudia Linnhoff-Popien

Such algorithms are usually implemented in a variational form, combining a classical optimization method with a quantum machine to find good solutions to an optimization problem.

Quantum Physics

Uncertainty-Based Out-of-Distribution Classification in Deep Reinforcement Learning

no code implementations31 Dec 2019 Andreas Sedlmeier, Thomas Gabor, Thomy Phan, Lenz Belzner, Claudia Linnhoff-Popien

We further present a first viable solution for calculating a dynamic classification threshold, based on the uncertainty distribution of the training data.

Bayesian Inference Classification +4

Adaptive Thompson Sampling Stacks for Memory Bounded Open-Loop Planning

1 code implementation11 Jul 2019 Thomy Phan, Thomas Gabor, Robert Müller, Christoph Roch, Claudia Linnhoff-Popien

We propose Stable Yet Memory Bounded Open-Loop (SYMBOL) planning, a general memory bounded approach to partially observable open-loop planning.

Thompson Sampling

Emergent Escape-based Flocking Behavior using Multi-Agent Reinforcement Learning

no code implementations10 May 2019 Carsten Hahn, Thomy Phan, Thomas Gabor, Lenz Belzner, Claudia Linnhoff-Popien

In nature, flocking or swarm behavior is observed in many species as it has beneficial properties like reducing the probability of being caught by a predator.

Multi-agent Reinforcement Learning reinforcement-learning +1

Distributed Policy Iteration for Scalable Approximation of Cooperative Multi-Agent Policies

no code implementations25 Jan 2019 Thomy Phan, Kyrill Schmid, Lenz Belzner, Thomas Gabor, Sebastian Feld, Claudia Linnhoff-Popien

We experimentally evaluate STEP in two challenging and stochastic domains with large state and joint action spaces and show that STEP is able to learn stronger policies than standard multi-agent reinforcement learning algorithms, when combining multi-agent open-loop planning with centralized function approximation.

Decision Making Multi-agent Reinforcement Learning

Uncertainty-Based Out-of-Distribution Detection in Deep Reinforcement Learning

no code implementations8 Jan 2019 Andreas Sedlmeier, Thomas Gabor, Thomy Phan, Lenz Belzner, Claudia Linnhoff-Popien

Although prior work has shown that dropout-based variational inference techniques and bootstrap-based approaches can be used to model epistemic uncertainty, the suitability for detecting OOD samples in deep reinforcement learning remains an open question.

Bayesian Inference Open-Ended Question Answering +4

Preparing for the Unexpected: Diversity Improves Planning Resilience in Evolutionary Algorithms

no code implementations30 Oct 2018 Thomas Gabor, Lenz Belzner, Thomy Phan, Kyrill Schmid

As automatic optimization techniques find their way into industrial applications, the behavior of many complex systems is determined by some form of planner picking the right actions to optimize a given objective function.

Evolutionary Algorithms

Cannot find the paper you are looking for? You can Submit a new open access paper.