Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mareike Hasenpflug

dblp:337/2196 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 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
1 paper
Probabilistic and Bayesian machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods
markov chain monte carlo
0.912025
Geodesic Slice Sampling on the Sphere · J. Mach. Learn. Res. 2025
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods › markov chain monte carlo
slice sampling
0.912025
Geodesic Slice Sampling on the Sphere · J. Mach. Learn. Res. 2025
Machine learning › Probabilistic and Bayesian machine learning
directional statistics
0.312025
Geodesic Slice Sampling on the Sphere · J. Mach. Learn. Res. 2025

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

uniform ergodicity · 0.9shrinkage · 0.9geodesic slice sampling · 0.9
YearPublicationVenuePosition
2025 Geodesic Slice Sampling on the Sphere
abstract
Probability measures on the sphere form an important class of statistical models and are used, for example, in modeling directional data or shapes. Due to their widespread use, but also as an algorithmic building block, efficient sampling of distributions on the sphere is highly desirable. We propose a shrinkage based and an idealized geodesic slice sampling Markov chain, designed to generate approximate samples from distributions on the sphere. In particular, the shrinkage-based version of the algorithm can be implemented such that it runs efficiently and has no tuning parameters. We verify reversibility and prove that under weak regularity conditions geodesic slice sampling is uniformly ergodic. Numerical experiments show that the proposed slice samplers achieve excellent mixing on challenging targets including distributions arising in rigid-registration problems and mixtures of von Mises-Fisher distributions. In these settings our approach outperforms standard samplers such as random-walk Metropolis-Hastings and Hamiltonian Monte Carlo.
Michael Habeck, Mareike Hasenpflug, Shantanu Kodgirwar, Daniel Rudolf
J. Mach. Learn. Res.2