Research map / Architectures and efficiency / RNNs and normalization
Differentiable Range-Partition Entropy for Entropy-Sensitive Geometric Algorithms
Ibne Farabi Shihab, Sanjeda Akter, Anuj Sharma
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Introduces Differentiable Entropy Regularization (DER), a gradient-optimizable surrogate for range-partition entropy of learned geometric partitions, separating normalized and runtime-scaled entropy measures.
Problem
Range-partition entropy is a structural complexity measure in entropy-sensitive computational geometry, but it is not differentiable, so learned geometric partitions cannot be directly optimized for it.
Approach
A gradient-optimizable surrogate (DER) for the entropy of learned geometric partitions, with explicit separation between the normalized entropy H_norm(S) that DER optimizes and the runtime-scaled entropy H_work(S) = n · H(...).
Closest papers by meaning
- Entropic Gromov-Wasserstein Distances: Stability and Algorithms (JMLR 2024 · similarity 0.85)
- Revisiting Tree-Sliced Wasserstein Distance Through the Lens of the Fermat–Weber Problem (ICLR 2026 · similarity 0.85)
- The GeometricKernels Package: Heat and Matérn Kernels for Geometric Learning on Manifolds, Meshes, and Graphs (JMLR 2025 · similarity 0.84)
- Local Regularization of Noisy Point Clouds: Improved Global Geometric Estimates and Data Analysis (JMLR 2019 · similarity 0.84)
- Bridging Arbitrary and Tree Metrics via Differentiable Gromov Hyperbolicity (NeurIPS 2025 · similarity 0.83)
- Sample-Efficient Geometry Reconstruction from Euclidean Distances using Non-Convex Optimization (NeurIPS 2024 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
