5 articles tagged with #riemannian-geometry. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
Researchers introduce MC-RFM, a novel framework for efficiently adapting frozen vision models to new tasks using mixed-curvature Riemannian geometry. The method represents adapted features on a product manifold combining hyperbolic and Euclidean spaces, outperforming existing parameter-efficient adaptation techniques across multiple benchmarks and backbone architectures.
Researchers propose dynamic Stiefel routing, a novel machine learning approach using expert projection filters on the Stiefel manifold to improve cross-domain EEG decoding without requiring target-domain calibration data. The method addresses a fundamental degeneracy problem where naive routing collapses to ensemble averaging, introducing three structural properties that enable genuine domain-specialized routing with significant accuracy improvements across datasets.
Researchers introduce EpiMer, a novel framework for merging machine learning models by treating it as a geometric optimization problem on Riemannian manifolds. The method uses low-rank task vectors and curvature information to improve knowledge integration without retraining, demonstrating superior performance when merging fine-tuned CLIP-ViT models across multiple image classification tasks.
Researchers introduce Geometric Kolmogorov-Arnold Networks (GeoKANs), an advancement in KAN-type neural networks that learn geometry-adapted coordinate systems rather than relying on fixed Euclidean inputs. By adapting a diagonal Riemannian metric during training, GeoKAN redistributes computational capacity toward regions of rapid variation, making it particularly effective for physics-informed learning and differential equation problems.
Researchers propose HealHGNN, a novel Hypergraph Neural Network that addresses limitations in traditional networks when dealing with heterophilic hypergraphs. The system uses Riemannian geometry and adaptive local heat exchangers to enable better long-range dependency modeling with linear complexity.
