New algorithm reduces sample and computational complexities for matrix completion.
problem Recovering a rank-r matrix from n features. method Gradient-based non-convex optimization algorithm with linear convergence rate.
result Linear sample complexity and logarithmic computational complexity.
The Procrustes distance is used to quantify the similarity or dissimilarity of (3-dimensional) shapes, and extensively used in biological morphometrics. Typically each (normalized) shape is represented by N landmark points, chosen to be homologous (i.e. corresponding to each other), as far as possible, and the Procrust…
We solve a key problem in cross-lingual learning using a novel approach.
problem Aligning word embeddings across different languages.
method We devise a direct solution to the Wasserstein-Procrustes problem.
result Our method improves existing UCL approaches significantly.
Method preserves correlations in synthetic data.
problem Preserving dependence structure of original data.
method Orthogonal Procrustes problem for restoring Pearson correlation.
result Restores Pearson correlation structure while preserving feature distributions and downstream tasks performance.
We present the Procrustes measure, a novel measure based on Procrustes rotation that enables quantitative comparison of the output of manifold-based embedding algorithms (such as LLE (Roweis and Saul, 2000) and Isomap (Tenenbaum et al, 2000)). The measure also serves as a natural tool when choosing dimension-reduction …
A new method for computing shape barycenters from point clouds using Procrustes-Wasserstein distance.
problem Computing representative shapes from point clouds with precise alignment and shape preservation.
method Developed a new distance metric (Procrustes-Wasserstein) and algorithms for computing barycenters.
result Superior performance in precise alignment and shape preservation compared to existing OT approaches.
Multivariate Analysis (MVA) comprises a family of well-known methods for feature extraction that exploit correlations among input variables of the data representation. One important property that is enjoyed by most such methods is uncorrelation among the extracted features. Recently, regularized versions of MVA methods…
Extends metrics for SPD matrices to infinite dimensions.
problem Lack of generalized forms for Riemannian metrics.
method Unitized Hilbert-Schmidt operators and extended Mahalanobis norm.
result Improved performance in high-dimensional comparisons.
Paper proposes a KGE framework that reduces training time and carbon footprint.
problem Efficient KGE learning with reduced computational cost and environmental impact.
method Full batch learning, Orthogonal Procrustes Analysis, non-negative-sampling training.
result Significant reduction in training time and carbon footprint compared to state-of-the-art approaches.
Researchers mapped clinical jargon to consumer language using embeddings alignment.
problem Mapping and translating clinical jargon to consumer language for better communication.
method Trained embeddings on clinical and consumer language corpora, aligned them using Procrustes algorithm, and refined with adversarial training.
result Procrustes algorithm effectively aligned clinical and consumer language embeddings.
Study matches two noisy point clouds with geometric transformations and relabeling.
problem Matching two noisy point clouds with orthogonal transformations and relabeling.
method Information-theoretic results and Ping-Pong algorithm for computational alignment.
result The Ping-Pong algorithm retrieves the planted signal after one step.
Solves a fundamental problem in statistics and imaging with new methods.
problem Generalized Orthogonal Procrustes Problem (GOPP)
method Semidefinite relaxation (SDR) and generalized power method (GPM)
result GPM converges linearly to the global minimizer under large signal-to-noise ratio.
Algorithm recovers permutations of high-dimensional Gaussian vectors with constant correlation.
problem Recovering permutations of high-dimensional Gaussian vectors with constant correlation.
method Computing and comparing weighted counts of specially chosen wide trees.
result Polynomial-time algorithm for exact recovery at constant correlation.
The paper provides robustness bounds for manifold learning techniques.
problem Understanding the robustness of manifold learning methods.
method Derives perturbation bounds for Procrustes, Classical Scaling, and Trilateration.
result Performance bounds for Isomap, Landmark Isomap, and Maximum Variance Unfolding are derived.
New method visualizes brain activity changes over time.
problem Understanding representational dynamics in neural responses.
method Procrustes-aligned Multidimensional Scaling (pMDS) on RDM movies.
result Multidimensional scaling alignment captures representational dynamics.
A new algorithm reduces communication in distributed SVD by p factors.
problem Efficiently compute SVD in distributed systems.
method LocalPower algorithm with weighted aggregation and periodic decay of iterations.
result Reduces communication cost by a factor of p. LDLE embeds manifolds in lower dimensions with low distortion.
problem Embedding manifolds in lower dimensions with low distortion.
method Constructs local views using global eigenvectors of the graph Laplacian, registers them using Procrustes analysis, and tears manifolds apart for intrinsic dimension embedding.
result LDLE preserves distances up to a constant scale with low distortion.
Novel method detects changes in noisy dynamic networks.
problem Change detection in noisy dynamic networks with sparsity and degree heterogeneity.
method Adapted Procrustes analysis to embedded points for vertices in spectral embedding.
result CDP successfully detects various types of vertex-based changes.
A new method for aligning datasets without known correspondences.
problem Aligning datasets from different domains without labeled correspondences.
method Integrates MDS and Wasserstein Procrustes for joint optimization of embeddings and correspondences.
result Maps datasets to a common low-dimensional space without labeled correspondences.
New method aligns word embeddings without supervision.
problem Aligning word embeddings trained on monolingual data.
method Wasserstein Procrustes approach with orthogonal and permutation matrices.
result Obtains state-of-the-art results in unsupervised word translation.
New measures link neural representation geometry to decoding ability.
problem Understanding how neural representations relate to decoding ability.
method Showed that popular similarity measures can be interpreted from a decoding perspective.
result Proved that measures like CKA and CCA quantify alignment between optimal linear readouts.
Deep model predicts shapes of curves with multiple covariates.
problem Predicting shapes of planar curves with various covariates.
method Deep learning model using complex-valued functions, conditional covariance smoother with modality-specific encoders.
result Model accurately predicts shapes of curves with multimodal covariates.
The problem of estimating sparse eigenvectors of a symmetric matrix attracts a lot of attention in many applications, especially those with high dimensional data set. While classical eigenvectors can be obtained as the solution of a maximization problem, existing approaches formulate this problem by adding a penalty te…
We have observed an interesting, yet unexplained, phenomenon: Semidefinite programming (SDP) based relaxations of maximum likelihood estimators (MLE) tend to be tight in recovery problems with noisy data, even when MLE cannot exactly recover the ground truth. Several results establish tightness of SDP based relaxations…
Proposes BONMI for integrating noisy matrices from multi-source data.
problem Integrating noisy matrices from multi-source data with block-wise missingness.
method Exploits orthogonal Procrustes problem to align eigenspaces and completes missing blocks.
result Statistical rate for eigenspace of underlying matrix comparable to independently missing assumption.
The paper introduces metrics for robust unsupervised learning of vehicle interactions.
problem Robust representation learning of temporal dynamic interactions in robotics.
method Geometric approach using Procrustes distance and optimal transport for comparing interaction distributions.
result Metrics for assessing stability and comparing interaction learning algorithms.
Modified Wasserstein metric for Gaussian distributions, invariant to isometries.
problem Distance measurement for latent Gaussian distributions invariant to isometries.
method Modified Benamou-Brenier approach leading to a Procrustes Wasserstein metric.
result For Gaussian distributions, the metric reduces to Euclidean distance between eigenvalues.
Robustly computes intrinsic coordinates on point clouds using resampling and averaging.
problem Computing intrinsic coordinates on noisy or outlier-prone point clouds.
method Subsample data, vary hyperparameters, cluster candidate embeddings, identify representative embeddings, and average them using Procrustes analysis.
result Robust to noise and outliers, validated on synthetic and real data.
Proposes a method to align language and image data.
problem Aligning language and image data for better understanding.
method Uses triplet loss to learn consistent embeddings of language and images.
result Outperforms four baselines across multiple metrics.
In this letter, we consider two sets of observations defined as subspace signals embedded in noise and we wish to analyze the distance between these two subspaces. The latter entails evaluating the angles between the subspaces, an issue reminiscent of the well-known Procrustes problem. A Bayesian approach is investigat…
Python package for SPD matrix distances, reproducible and extensible.
problem Computing distances between SPD matrices for various applications.
method Unified, extensible framework supporting multiple SPD metrics.
result Reproducible and accessible SPD matrix comparison tool.
Study finds whitepaper narratives do not predict market factor structure.
problem Predicting market behavior from cryptocurrency whitepaper claims.
method Zero-shot NLP classification combined with CP tensor decomposition of market data.
result Weak alignment between whitepaper claims and market statistics and latent factors.
A new algorithm optimizes L1-norm error fitting problems efficiently.
problem Optimizing L1-norm error fitting models with data aggregation.
method Data aggregation-based algorithm with monotonic convergence to global optimum.
result The proposed algorithm optimally solves any L1-norm error fitting model.
FedPower improves eigenspace estimation privacy in federated learning.
problem Privacy breaches and communication challenges in federated eigenspace estimation.
method FedPower uses a power method with local power iterations and global aggregation, weighted by OPT, and adds Gaussian noise for privacy.
result FedPower provides convergence bounds and demonstrates effectiveness in experiments.
Gradient descent solves asymmetric low-rank matrix sensing without balancing.
problem Recovering asymmetric low-rank matrices from linear measurements.
method Gradient descent with spectral initialization, avoiding balancing term.
result Gradient descent converges linearly without balancing, factors stay balanced.
New metrics defined on SPD matrices link to divergences and curvature.
problem Defining and characterizing metrics on SPD matrices.
method Developed a principle of deformed metrics and introduced balanced bilinear forms.
result Introduce Mixed-Euclidean metrics with negative sectional curvature.
Geometric stability predicts steerability and detects drift in language models.
problem Predicting steerability and detecting drift in language models.
method Supervised and unsupervised geometric stability measures.
result Supervised geometric stability predicts steerability with high accuracy and detects drift earlier.
New algorithm for robust circular coordinates in recurrent time series data.
problem Inefficient and sensitive methods for finding circular coordinates on recurrent data.
method Subsampling, aligning, and averaging to correct uneven sampling density.
result More robust and efficient circular coordinates for neuronal recordings.
New method preserves privacy while detecting communities in distributed networks.
problem Privacy-preserving community detection in locally distributed multi-layer networks.
method Privacy-preserving Distributed Spectral Clustering (ppDSC) using randomized response mechanism.
result Developed a novel algorithm that maintains community structure while protecting privacy.
Survey of Locally Linear Embedding and its variants.
problem Representing high-dimensional data in a lower-dimensional space while preserving local structure.
method Explains various LLE and variant methods, including kernel LLE, inverse LLE, feature fusion, out-of-sample embedding, incremental LLE, landmark LLE, supervised LLE, robust LLE, fusion with other methods, and weighted LLE.
result Comprehensive overview of LLE and its variants.
Novel tRSA combines geometry and topology for brain and model analysis.
problem Traditional RSA overlooks topological information in neural representations.
method Topological RSA (tRSA) using nonlinear monotonic transforms.
result Robust model comparisons and novel insights into neural computation.
Geometric stability measures neural network robustness, distinguishing from similarity metrics.
problem Lack of robustness in neural network representations.
method Introduces geometric stability, quantified by Shesha metric measuring self-consistency.
result Stability and similarity are uncorrelated, revealing distinct properties of neural network robustness.
DFRot improves LLMs by reducing outlier and massive activation effects.
problem Reducing outlier and massive activation effects in rotated LLMs.
method Weighted loss function and orthogonal Procrustes transforms for rotation matrix refinement.
result DFRot achieves dual free (Outlier-Free and Massive Activation-Free) with significant improvements in perplexity.
Study finds no significant alignment between whitepaper claims and market structure.
problem Correlation between cryptocurrency whitepaper narratives and market behavior.
method Developed a contamination-aware pipeline for measuring structural correspondence, combining NLP classification and market statistics.
result No significant claims-market alignment detected in the sample.
New flows introduced for symplectic geometry.
problem No specific problem stated; focuses on new flows.
method Introduces several geometric flows on symplectic manifolds.
result Examples include the Hitchin gradient flow and dual Ricci flow.
Sylvester flows improve variational inference by making transformations more flexible.
problem Flexible approximate posterior distributions for variational inference.
method Introduce Sylvester normalizing flows as a generalization of planar flows.
result Sylvester flows perform favorably compared to planar and inverse autoregressive flows on various datasets.
The paper examines Ricci flows with closed and smooth tangent flows, proving uniqueness and characterizing ancient flows.
problem Characterizing and understanding Ricci flows with closed and smooth tangent flows.
method Analyzing ancient and finite-time singularity Ricci flows to prove uniqueness and characterizations.
result The tangent flow is unique and characterizes ancient and finite-time singularity flows.
Proves uniqueness of geometric flow in various Riemannian manifolds.
problem Proving uniqueness of geometric flow in general Riemannian manifolds.
method Two backward uniqueness theorems for extrinsic geometric flow.
result Backward uniqueness of extrinsic geometric flow in general ambient manifolds.