Search Results for author: Pavel Kolev

Found 10 papers, 1 papers with code

Dual-Force: Enhanced Offline Diversity Maximization under Imitation Constraints

no code implementations8 Jan 2025 Pavel Kolev, Marin Vlastelica, Georg Martius

While many algorithms for diversity maximization under imitation constraints are online in nature, many applications require offline algorithms without environment interactions.

Diversity

Learning Diverse Skills for Local Navigation under Multi-constraint Optimality

no code implementations3 Oct 2023 Jin Cheng, Marin Vlastelica, Pavel Kolev, Chenhao Li, Georg Martius

We demonstrate the effectiveness of our method on a local navigation task where a quadruped robot needs to reach the target within a finite horizon.

Diversity

Benchmarking Offline Reinforcement Learning on Real-Robot Hardware

2 code implementations28 Jul 2023 Nico Gürtler, Sebastian Blaes, Pavel Kolev, Felix Widmaier, Manuel Wüthrich, Stefan Bauer, Bernhard Schölkopf, Georg Martius

To coordinate the efforts of the research community toward tackling this problem, we propose a benchmark including: i) a large collection of data for offline learning from a dexterous manipulation platform on two tasks, obtained with capable RL agents trained in simulation; ii) the option to execute learned policies on a real-world robotic system and a simulation for efficient debugging.

Benchmarking reinforcement-learning +1

Offline Diversity Maximization Under Imitation Constraints

no code implementations21 Jul 2023 Marin Vlastelica, Jin Cheng, Georg Martius, Pavel Kolev

There has been significant recent progress in the area of unsupervised skill discovery, utilizing various information-theoretic objectives as measures of diversity.

D4RL Diversity +1

Physarum-Inspired Multi-Commodity Flow Dynamics

no code implementations3 Sep 2020 Vincenzo Bonifaci, Enrico Facca, Frederic Folz, Andreas Karrenbauer, Pavel Kolev, Kurt Mehlhorn, Giovanna Morigi, Golnoosh Shahkarami, Quentin Vermande

We formulate network design as the problem of constructing a network that efficiently supports a multi-commodity flow problem.

A PTAS for $\ell_p$-Low Rank Approximation

no code implementations16 Jul 2018 Frank Ban, Vijay Bhattiprolu, Karl Bringmann, Pavel Kolev, Euiwoong Lee, David P. Woodruff

On the algorithmic side, for $p \in (0, 2)$, we give the first $(1+\epsilon)$-approximation algorithm running in time $n^{\text{poly}(k/\epsilon)}$.

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