Demo Data from EDBT 2026 / reviewers in the wild / expert
Alexander Kravberg
dblp:322/3564
· DBLP profile ↗
4ranked-venue papers
1as first author
4since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 1 first-author · 4 since 2021Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 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
2 papers |
Robot manipulation · 38% Motion planning and robot control · 29% Learning theory · 25% | |
| Theoretical computer science
1 paper |
Computational geometry · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Robotics › Robot manipulation
deformable object manipulation |
0.7 | 1 | 2023 | Elastic Context: Encoding Elasticity for Data-driven Models of Textiles Elastic Context: Encoding Elasticity for Data-driven Models of Textiles · ICRA 2023 |
Robotics › Motion planning and robot control
robot learning |
0.7 | 1 | 2023 | Elastic Context: Encoding Elasticity for Data-driven Models of Textiles Elastic Context: Encoding Elasticity for Data-driven Models of Textiles · ICRA 2023 |
Machine learning › Learning theory › nonparametric regression
nearest neighbor regression |
0.6 | 1 | 2022 | Active Nearest Neighbor Regression Through Delaunay Refinement · ICML 2022 |
Computational geometry
delaunay and voronoi tessellation |
0.6 | 1 | 2022 | Active Nearest Neighbor Regression Through Delaunay Refinement · ICML 2022 |
Robotics › Robot manipulation › medical robotics
assistive dressing |
0.2 | 1 | 2023 | Elastic Context: Encoding Elasticity for Data-driven Models of Textiles Elastic Context: Encoding Elasticity for Data-driven Models of Textiles · ICRA 2023 |
Machine learning › Generative modeling
latent space exploration |
0.2 | 1 | 2022 | Active Nearest Neighbor Regression Through Delaunay Refinement · ICML 2022 |
Methods — techniques the papers use, named apart from their topics
voronoi partitioning · 1.1delaunay refinement · 1.1stress-strain curve · 0.7elastic context encoding · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Hyperbolic Delaunay Geometric Alignment
Aniss Aiman Medbouhi, Giovanni Luca Marchetti, Vladislav Polianskii, Alexander Kravberg, Petra Poklukar, Anastasia Varava, Danica Kragic |
ECML/PKDD (3) | 4 |
| 2023 | Elastic Context: Encoding Elasticity for Data-driven Models of Textiles Elastic Context: Encoding Elasticity for Data-driven Models of TextilesabstractPhysical interaction with textiles, such as assistive dressing or household tasks, requires advanced dexterous skills. The complexity of textile behavior during stretching and pulling is influenced by the material properties of the yarn and by the textile's construction technique, which are often unknown in real-world settings. Moreover, identification of physical properties of textiles through sensing commonly available on robotic platforms remains an open problem. To address this, we introduce Elastic Context (EC), a method to encode the elasticity of textiles using stress-strain curves adapted from textile engineering for robotic applications. We employ EC to learn generalized elastic behaviors of textiles and examine the effect of EC dimension on accurate force modeling of real-world non-linear elastic behaviors. Alberta Longhini, Marco Moletta, Alfredo Reichlin, Michael C. Welle, Alexander Kravberg, Yufei Wang 0007, David Held, Zackory Erickson, Danica Kragic |
ICRA | 5 |
| 2022 | Active Nearest Neighbor Regression Through Delaunay RefinementabstractWe introduce an algorithm for active function approximation based on nearest neighbor regression. Our Active Nearest Neighbor Regressor (ANNR) relies on the Voronoi-Delaunay framework from computational geometry to subdivide the space into cells with constant estimated function value and select novel query points in a way that takes the geometry of the function graph into account. We consider the recent state-of-the-art active function approximator called DEFER, which is based on incremental rectangular partitioning of the space, as the main baseline. The ANNR addresses a number of limitations that arise from the space subdivision strategy used in DEFER. We provide a computationally efficient implementation of our method, as well as theoretical halting guarantees. Empirical results show that ANNR outperforms the baseline for both closed-form functions and real-world examples, such as gravitational wave parameter inference and exploration of the latent space of a generative model. Alexander Kravberg, Giovanni Luca Marchetti, Vladislav Polianskii, Anastasiia Varava, Florian T. Pokorny, Danica Kragic |
ICML | 1 |
| 2022 | Voronoi density estimator for high-dimensional data: Computation, compactification and convergenceabstractThe Voronoi Density Estimator (VDE) is an established density estimation technique that adapts to the local geometry of data. However, its applicability has been so far limited to problems in two and three dimensions. This is because Voronoi cells rapidly increase in complexity as dimensions grow, making the necessary explicit computations infeasible. We define a variant of the VDE deemed Compactified Voronoi Density Estimator (CVDE), suitable for higher dimensions. We propose computationally efficient algorithms for numerical approximation of the CVDE and formally prove convergence of the estimated density to the original one. We implement and empirically validate the CVDE through a comparison with the Kernel Density Estimator (KDE). Our results indicate that the CVDE outperforms the KDE on sound and image data. Vladislav Polianskii, Giovanni Luca Marchetti, Alexander Kravberg, Anastasiia Varava, Florian T. Pokorny, Danica Kragic |
UAI | 3 |