Pavel Kolev

Orcid: 0000-0001-9960-9171

According to our database1, Pavel Kolev authored at least 23 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Offline Diversity Maximization under Imitation Constraints.
RLJ, 2024

Learning Diverse Skills for Local Navigation under Multi-constraint Optimality.
Proceedings of the IEEE International Conference on Robotics and Automation, 2024

2023
Secretary and online matching problems with machine learned advice.
Discret. Optim., May, 2023

Diverse Offline Imitation via Fenchel Duality.
CoRR, 2023

On Imitation in Mean-field Games.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Online Learning under Adversarial Nonlinear Constraints.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Versatile Skill Control via Self-supervised Adversarial Imitation of Unlabeled Mixed Motions.
Proceedings of the IEEE International Conference on Robotics and Automation, 2023

Benchmarking Offline Reinforcement Learning on Real-Robot Hardware.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022
Physarum-inspired multi-commodity flow dynamics.
Theor. Comput. Sci., 2022

2021

2020
Convergence of the non-uniform Physarum dynamics.
Theor. Comput. Sci., 2020

Convergence of the non-uniform directed Physarum model.
Theor. Comput. Sci., 2020

Physarum Multi-Commodity Flow Dynamics.
CoRR, 2020

2019
Two results on slime mold computations.
Theor. Comput. Sci., 2019

A PTAS for ℓp-Low Rank Approximation.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Algorithmic Results for Clustering and Refined Physarum Analysis.
PhD thesis, 2018

A PTAS for 𝓁<sub>p</sub>-Low Rank Approximation.
CoRR, 2018

2017
Approximation Algorithms for ࡁ<sub>0</sub>-Low Rank Approximation.
CoRR, 2017

Approximation Algorithms for l<sub>0</sub>-Low Rank Approximation.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Density Independent Algorithms for Sparsifying k-Step Random Walks.
Proceedings of the Approximation, 2017

2016
A Note On Spectral Clustering.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
Faster Spectral Sparsification of Laplacian and SDDM Matrix Polynomials.
CoRR, 2015

2014
Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014


  Loading...