Grassmannian
PulseAugur coverage of Grassmannian — every cluster mentioning Grassmannian across labs, papers, and developer communities, ranked by signal.
4 day(s) with sentiment data
-
New federated learning method enhances differential privacy on complex manifolds
Researchers have developed DP-RFedProj, a novel method for federated learning that enhances differential privacy on compact submanifolds. This approach privatizes gradients in a fixed ambient geometry, allowing clients …
-
New Lifted PCA method extends statistical analysis to Wasserstein space
Researchers have introduced Lifted PCA, a novel method for extending Principal Component Analysis (PCA) to data represented as probability distributions in Wasserstein space. This new technique addresses the lack of a c…
-
New Lifted PCA method extends dimension reduction to distribution-valued data
Researchers have introduced Lifted PCA, a novel method that extends Principal Component Analysis (PCA) to the Wasserstein space, enabling dimension reduction for distribution-valued data. This approach leverages convex …
-
New conformal prediction framework for Grassmann-valued regression unveiled
Researchers have developed a new conformal prediction framework designed for regression tasks involving Grassmann-valued responses. This method generates prediction regions as metric balls directly on the Grassmann mani…
-
New Adam Optimizer Generalizes to Manifolds for Transformer Training
Researchers have developed a novel method to generalize the Adam optimizer to various mathematical manifolds, which are crucial for optimizing neural networks. This new approach, detailed in an arXiv paper, leverages th…
-
Geo-LoRA framework enhances continual learning with geometry-aware subspace evolution
Researchers have developed Geo-LoRA, a novel geometry-aware framework designed to improve continual learning with LoRA adapters. This method explicitly regulates the evolution of low-rank subspaces, both shared and task…
-
New random features method approximates Grassmannian kernels efficiently
Researchers have developed a new method for approximating Grassmannian kernels using random feature maps. This approach addresses the computational and memory limitations of traditional methods when dealing with large, …
-
New method for asynchronous eigenspace computation on Grassmannian
This paper introduces a novel method for asynchronous eigenspace computation in distributed systems, focusing on the Grassmannian manifold. The proposed Grassmannian incremental aggregation technique minimizes per-updat…
-
New RPMA framework enhances spectral methods for robust clustering
Researchers have developed a new framework called Regularized Projection Matrix Approximation (RPMA) to improve the robustness of spectral methods in machine learning. RPMA incorporates a regularization term into classi…
-
cXGBoost adapts reduced-order models for engineering simulations
Researchers have developed a new framework called Constrained Extreme Gradient Boosting (cXGBoost) to improve the accuracy of reduced-order models (ROMs) used in engineering simulations. This method adapts the basis con…