RODR: Riemannian Orthogonally Decoupled Regularization for Disentangled Manifold Representation

• URL: http://arxiv.org/abs/2607.23958v1
• Date: Mon, 27 Jul 2026 03:12:14 GMT
• Title: RODR: Riemannian Orthogonally Decoupled Regularization for Disentangled Manifold Representation
• Abstract summary: We introduce a generic and interpretable framework for disentangled geometric optimization in point cloud processing.<n> Experiments demonstrate that RODR reaches performance comparable to state-of-the-art baselines.
• Score: 0.91963810502252
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Point cloud denoising is essentially a geometric recovery task that aims to reconstruct the intrinsic structure of a smooth 2D Riemannian manifold embedded in R^3 from noisy, discrete ambient-space samples. Despite the remarkable progress of modern manifold-aware encoders and generative transport models in geometric representation learning, a fundamental objective-geometry mismatch remains underexplored. Theoretically, we identified that this mismatched coupling leads to geometric gradient interference, where conflicting optimization objectives result in structural degradation and point clustering. We introduce Riemannian Orthogonally Decoupled Regularization (RODR) to reformulate the optimization trajectory by disentangling the normal (fitting) and tangential (distribution) components. Guided by a vector-attention and entropy-aware adaptive strategy, RODR effectively preserves high-fidelity geometric details while maintaining sampling uniformity. Experiments demonstrate that RODR reaches performance comparable to state-of-the-art baselines and suggests improved distribution regularity and reduced local aggregation effectively. Our work establishes a generic and interpretable framework for disentangled geometric optimization in point cloud processing.

Related papers

• Convolutional Symmetric AutoEncoders: enhancing latent stability via differential geometry [0.0]
  This study builds upon works by arXiv:2307.15288v2 and arXiv:2506.11641v1 by extending representation consistency for convolutional layers.<n>We introduce a novel class of symmetric Convolutional AutoEncoders (CAEs) designed to embody the primary properties of manifold parametrization mappings.
  arXiv  Detail & Related papers  (2026-07-01T09:16:37Z)
• Supervised Distributional Reduction via Optimal Transport and Dependence Maximization [1.0499611180329804]
  We propose Supervised Distribution Reduction (SDR), an algorithm for learning target-aware representations.<n>SDR builds on the Fused Gromov-Wasserstein (FGW) objective to align the relational structure of the input distribution with a set of representative points.<n>SDR naturally induces a data-dependent, non-stationary geometry that can be leveraged for settings such as Gaussian Process (GP) modelling.
  arXiv  Detail & Related papers  (2026-05-26T19:38:20Z)
• Model Merging on Loss Landscape: A Geometry Perspective [2.2624434825206543]
  EpiMer is a framework that casts model merging as solving the Fréchet mean on a Riemannian manifold.<n>Our theoretical analysis decomposes the merging error bound into the subspace Fréchet variance and the residual energy.<n>Merging fine-tuned CLIP-ViT models on eight image classification tasks, Epistemic Merging strictly outperforms the baselines on all three CLIP-ViT backbones at matched rank.
  arXiv  Detail & Related papers  (2026-05-26T08:33:30Z)
• Beyond Point-Wise Matching: Structural Representation Alignment for Accelerating Diffusion Transformers [93.3976834364707]
  We propose sREPA, a structural REPresentation Alignment framework to enforce consistency in the relational geometry of feature maps.<n>By encouraging the model to internalize holistic spatial layouts and structural correlations from pre-trained features, sREPA achieves faster and more stable convergence.
  arXiv  Detail & Related papers  (2026-05-16T12:01:04Z)
• Hyperbolic Enhanced Representation Learning for Incomplete Multi-view Clustering [57.38215918201251]
  We propose HERL, a Hyperbolic Enhanced Representation Learning framework for Incomplete Multi-View Clustering.<n> operating within the Poincaré ball, HERL constructs a structure-aware latent space to enhance representation learning.<n>We show that HERL consistently outperforms state-of-the-art approaches.
  arXiv  Detail & Related papers  (2026-04-18T10:50:46Z)
• LG-HCC: Local Geometry-Aware Hierarchical Context Compression for 3D Gaussian Splatting [77.81227097905865]
  Anchor-based 3DGS compression schemes reduce gaussian redundancy through some advanced context models.<n>We propose a Local Geometry-aware Hierarchical Context Compression framework for 3DGS that incorporates inter-anchor geometric correlations into anchor pruning and entropy coding for compact representation.<n>Experiments show that LG-HCC effectively alleviates structural preservation issues,achieving superior geometric integrity and rendering fidelity while reducing storage by up to 30.85x compared to the Scaffold-GS baseline on the Mip-NeRF360 dataset.
  arXiv  Detail & Related papers  (2026-03-30T13:39:35Z)
• Riemannian Flow Matching for Disentangled Graph Domain Adaptation [51.98961391065951]
  Graph Domain Adaptation (GDA) typically uses adversarial learning to align graph embeddings in Euclidean space.<n>DisRFM is a geometry-aware GDA framework that unifies embedding and flow-based transport.
  arXiv  Detail & Related papers  (2026-01-31T11:05:35Z)
• ARGUS: Adaptive Rotation-Invariant Geometric Unsupervised System [0.0]
  This paper introduces Argus, a framework that reconceptualizes drift detection as tracking local statistics over a fixed spatial partition of the data manifold.<n> Voronoi tessellations over canonical orthonormal frames yield drift metrics that are invariant to transformations.<n>A graph-theoretic characterization of drift propagation is developed that distinguishes coherent distributional shifts from isolated perturbations.
  arXiv  Detail & Related papers  (2026-01-03T22:39:20Z)
• SVRecon: Sparse Voxel Rasterization for Surface Reconstruction [60.92372415355283]
  We extend the recently proposed sparse voxelization paradigm to the task of high-fidelity surface reconstruction by integrating SVRecon.<n>Our method achieves strong reconstruction accuracy while having consistently speedy convergence.
  arXiv  Detail & Related papers  (2025-11-21T16:32:01Z)
• Guaranteed Noisy CP Tensor Recovery via Riemannian Optimization on the Segre Manifold [9.804487437104289]
  We exploit the intrinsic geometry of rank-one tensors by casting the recovery task as an optimization problem over the Segre manifold.<n>We prove that RGD converges at a local linear rate, while RGN exhibits an initial local quadratic convergence phase that transitions to a linear rate as the iterates approach the statistical noise floor.
  arXiv  Detail & Related papers  (2025-10-01T06:44:52Z)
• Preserving Topological and Geometric Embeddings for Point Cloud Recovery [43.26116605528137]
  We propose an end-to-end architecture named textbfTopGeoFormer, which maintains these critical properties throughout the sampling and restoration phases.<n>In experiments, we comprehensively analyze the circumstances using the conventional and learning-based sampling/up/recovery algorithms.
  arXiv  Detail & Related papers  (2025-07-25T09:58:41Z)
• Stable Nonconvex-Nonconcave Training via Linear Interpolation [51.668052890249726]
  This paper presents a theoretical analysis of linearahead as a principled method for stabilizing (large-scale) neural network training. We argue that instabilities in the optimization process are often caused by the nonmonotonicity of the loss landscape and show how linear can help by leveraging the theory of nonexpansive operators.
  arXiv  Detail & Related papers  (2023-10-20T12:45:12Z)
• Last-Iterate Convergence of Adaptive Riemannian Gradient Descent for Equilibrium Computation [52.73824786627612]
  This paper establishes new convergence results for textitgeodesic strongly monotone games.<n>Our key result shows that RGD attains last-iterate linear convergence in a textitgeometry-agnostic fashion.<n>Overall, this paper presents the first geometry-agnostic last-iterate convergence analysis for games beyond the Euclidean settings.
  arXiv  Detail & Related papers  (2023-06-29T01:20:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.