Proposes a scale-calibrated median-of-means estimator for robust aggregation of distributed PCA estimates on the product of Euclidean space and Grassmann manifold.
hub Canonical reference
Pearson,Liii
Canonical reference. 71% of citing Pith papers cite this work as background.
12
Pith papers citing it
9,317
external citations · Crossref
Background
71% of classified citations
hub tools
citation-role summary
background 5
method 2
citation-polarity summary
representative citing papers
A 10-qubit convolutional quantum graph neural network fed by autoencoder-compressed jet data achieves performance comparable to classical graph networks in distinguishing boosted Z jets from gluon jets.
A second-order method achieves local quadratic convergence on the Stiefel manifold without retractions by combining a modified Newton tangent step with Newton-Schulz normal steps for constraint satisfaction.
Soft-MSM is a smooth, gradient-enabled version of the context-aware MSM distance for time series alignment that outperforms Soft-DTW alternatives in clustering and nearest-centroid classification.
PuzzleMark provides a robust and imperceptible watermarking method for code datasets using adaptive variable name concatenation and statistical verification, achieving perfect detection rates with minimal performance impact.
A hierarchical prior-decoder model using CLIP latents generates more diverse text-conditional images than direct methods while preserving photorealism and caption fidelity.
EMSL groups material points into clusters, samples a reference strain per cluster once per increment, and computes a linearised stress estimate from the reference tangent and POD strain modes, yielding an affine reduced system that requires no iterations online and Pareto-dominates prior strain-cubc
A broad empirical benchmark shows how 15 existing test selection metrics perform for fault detection, performance estimation, and retraining under corrupted, adversarial, temporal, natural, and label shifts across image, text, and Android data.
LQE is a physics-constrained learnable dimensionality reduction technique that improves average mIoU in hyperspectral urban segmentation on three datasets while using only 12-36 parameters.
A new GPU-oriented batch SVD solver based on the one-sided Jacobi method delivers significant speedups over vendor libraries and prior open-source implementations across precisions and matrix shapes.
The effectiveness of dimensionality reduction before clustering depends on matching the specific technique and target dimension count to the data geometry and the clustering algorithm used.
Review of machine learning applications for analyzing Lyman-alpha forest observations to probe cosmology, reionization, and dark matter.
citing papers explorer
-
Machine Learning Techniques for Astrophysics and Cosmology: Lyman-$\alpha$ forest
Review of machine learning applications for analyzing Lyman-alpha forest observations to probe cosmology, reionization, and dark matter.