This work introduces Riemannian Orthogonally Decoupled Regularization (RODR) to reformulate the optimization trajectory by disentangling the normal (fitting) and tangential (distribution) components and establishes a generic and interpretable framework for disentangled geometric optimization in point cloud processing.
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.
This work introduces a Nested Inductive Bias framework that utilizes a two-stage diffeomorphic composition to formally pull back non-Euclidean target geometries onto the SPD manifold, and proposes the Rational Conformal Metric (RCM), designed to establish state-of-the-art geometric robustness against outliers by boundi...
KGFT is proposed, a lightweight module that derives a geometric guidance matrix from the kernel Gram matrix and uses it to transform the covariance structure of feature representations, validating the generality and effectiveness of kernel-guided dual-manifold representation learning.
Wencong Zhang, Yue Zhang, Meiyan Huang et al.· 0 citations
Divergence-based regularization and Sharpness-Aware Minimization (SAM) are two prominent approaches for improving generalization in deep learning, both motivated by robustness to perturbations. However, their relationship has remained largely unexplored. Building on classical second-order expansions of $f$-divergences,...
This paper builds on the singular value decomposition factorization of adapters to develop a framework based on Stein variational gradient descent (SVGD), which delivers strong model calibration and attains higher prediction accuracy than SVGD and related uncertainty estimation methods that are formulated in Euclidean...
Quang-Duy Tran, Trung Le, Bao Duong et al.· 0 citations
A Riemannian optimization framework for solving the EDMC problem by formulating it as a low-rank matrix completion task over the space of positive semi-definite Gram matrices, which provides a geometric interpretation of matrix incoherence tailored to the EDMC setting and provides robustness guarantees for the method.
The Intrinsic Hybrid Latent Latent Diffusion Model (ILDM) is introduced, a generative framework that integrates probabilistic dimensionality reduction with geometry-aware diffusion on unknown manifolds and significantly improves generation quality.
Yizhu Wang, Mu Niu, Xiaochen Yang· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.