y0news
AnalyticsDigestsSourcesTopicsRSSAICrypto

#riemannian-geometry News & Analysis

8 articles tagged with #riemannian-geometry. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.

8 articles
AIBullisharXiv – CS AI · Jun 87/10
🧠

STREAM: Stochastic Riemannian Flow Matching with Anisotropic Decoder for Digital Histopathology Image Generation

Researchers introduce STREAM, a novel framework applying Riemannian flow matching to synthetic histopathology image generation. The approach leverages pretrained Vision Foundation Models as latent space rather than conditioning signals, addressing the "conditioning collapse" problem and achieving state-of-the-art results for medical image synthesis.

AIBullisharXiv – CS AI · May 127/10
🧠

MC-RFM: Geometry-Aware Few-Shot Adaptation via Mixed-Curvature Riemannian Flow Matching

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.

AINeutralarXiv – CS AI · Jun 96/10
🧠

Riemannian-Manifold Steering: Geometry-Aware Generative Autoencoders for Label-Free Steering

Researchers introduce a Riemannian-manifold framework for steering language models that eliminates the need for labeled data or predefined topologies. The method approximates output-space geometry using a learned encoder trained on concept tokens, enabling more natural intervention trajectories across diverse tasks without per-prompt labeling.

AINeutralarXiv – CS AI · Jun 86/10
🧠

Geometric Second-Order Feature Correlation Learning for Self-Supervised Speech Emotion Recognition

Researchers propose a Second-Order Correlation (SOC) layer that improves speech emotion recognition by modeling feature correlations as covariance descriptors rather than treating features independently. Using Log-Euclidean mapping to preserve geometric properties, the method demonstrates superior performance on standard emotion recognition datasets compared to conventional first-order aggregation approaches.

AINeutralarXiv – CS AI · Jun 16/10
🧠

Routing on the Stiefel Manifold: When Does Adaptive Subspace Selection Help for Cross-Domain EEG Decoding?

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.

AINeutralarXiv – CS AI · May 276/10
🧠

Model Merging on Loss Landscape: A Geometry Perspective

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.

AINeutralarXiv – CS AI · May 116/10
🧠

Geometric Kolmogorov--Arnold Network (GeoKAN)

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.

AINeutralarXiv – CS AI · Mar 34/104
🧠

Heterophily-Agnostic Hypergraph Neural Networks with Riemannian Local Exchanger

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.