arXiv Machine Learning By Cornelius V. Braun, Tilman Burghoff, Marc Toussaint

Manifold Sampling via Entropy Maximization

Read the original on arXiv Machine Learning →

The paper introduces MASEM, a method for uniform sampling on manifolds that may have multiple disconnected components defined by smooth constraints. It employs a resampling scheme that maximizes the entropy of the empirical distribution using k‑nearest neighbor density estimation, and shows that this approach reduces KL‑divergence exponentially with the number of resampling steps. Experiments on synthetic and robotics benchmarks demonstrate that MASEM achieves faster mixing and improves Sinkhorn distance by an order of magnitude compared to existing alternatives while maintaining competitive runtime.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Oct 2

Manifold-Aware Perturbations for Constrained Generative Modeling

The paper introduces a new method for perturbing data distributions in a way that respects equality constraints, allowing generative models to better handle constrained data. By adjusting the distribution while preserving the manifold geometry, the approach ensures support matches the ambient space dimension. Experiments with diffusion models and normalizing flows demonstrate improved data recovery and stable sampling across several tasks.

By Katherine Keegan, Lars Ruthotto