Cover Image

Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Smith, Chandler, Cai, HanQin, Tasissa, Abiy
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control Computational Geometry Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guarantees
by: Smith, Chandler, et al.
Published: (2024)

Structured Sampling for Robust Euclidean Distance Geometry
by: Kundu, Chandra, et al.
Published: (2024)

A Dual Basis Approach for Structured Robust Euclidean Distance Geometry
by: Kundu, Chandra, et al.
Published: (2025)

RACH-Space: Reconstructing Adaptive Convex Hull Space with Applications in Weak Supervision
by: Na, Woojoo, et al.
Published: (2023)

On the Robustness of Cross-Concentrated Sampling for Matrix Completion
by: Cai, HanQin, et al.
Published: (2024)

Sample-Efficient Geometry Reconstruction from Euclidean Distances using Non-Convex Optimization
by: Ghosh, Ipsita, et al.
Published: (2024)

Locality Regularized Reconstruction: Structured Sparsity and Delaunay Triangulations
by: Mueller, Marshall, et al.
Published: (2024)

Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery
by: Giampouras, Paris, et al.
Published: (2024)

Weighed l1 on the simplex: Compressive sensing meets locality
by: Tasissa, Abiy, et al.
Published: (2021)

Structured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completion
by: Cai, HanQin, et al.
Published: (2022)

Mathematical Programming Algorithms for Convex Hull Approximation with a Hyperplane Budget
by: Barbato, Michele, et al.
Published: (2024)

Robust Node Localization for Rough and Extreme Deployment Environments
by: Tasissa, Abiy, et al.
Published: (2025)

Recovering Wasserstein Distance Matrices from Few Measurements
by: Rana, Muhammad, et al.
Published: (2025)

K-Deep Simplex: Deep Manifold Learning via Local Dictionaries
by: Tankala, Pranay, et al.
Published: (2020)

Matrix Completion with Graph Information: A Provable Nonconvex Optimization Approach
by: Wang, Yao, et al.
Published: (2025)

Provable Reduction in Communication Rounds for Non-Smooth Convex Federated Learning
by: Palenzuela, Karlo, et al.
Published: (2025)

Optimal Regularization Under Uncertainty: Distributional Robustness and Convexity Constraints
by: Leong, Oscar, et al.
Published: (2025)

On Information Geometry and Iterative Optimization in Model Compression: Operator Factorization
by: Shumaylov, Zakhar, et al.
Published: (2025)

Non-Euclidean Broximal Point Method: A Blueprint for Geometry-Aware Optimization
by: Gruntkowska, Kaja, et al.
Published: (2025)

Hitting and Covering Affine Families of Convex Polyhedra, with Applications to Robust Optimization
by: Cardinal, Jean, et al.
Published: (2025)

Non-Euclidean High-Order Smooth Convex Optimization
by: Contreras, Juan Pablo, et al.
Published: (2024)

Provable Complexity Improvement of AdaGrad over SGD: Upper and Lower Bounds in Stochastic Non-Convex Optimization
by: Jiang, Ruichen, et al.
Published: (2024)

Natural Geometry of Robust Data Attribution: From Convex Models to Deep Networks
by: Li, Shihao, et al.
Published: (2025)

Non-Convex Robust Hypothesis Testing using Sinkhorn Uncertainty Sets
by: Wang, Jie, et al.
Published: (2024)

The Star Geometry of Critic-Based Regularizer Learning
by: Leong, Oscar, et al.
Published: (2024)

LyAm: Robust Non-Convex Optimization for Stable Learning in Noisy Environments
by: Mirzabeigi, Elmira, et al.
Published: (2025)

Reconstruction of manifold embeddings into Euclidean spaces via intrinsic distances
by: Puchkin, Nikita, et al.
Published: (2020)

Provably Efficient Exploration in Policy Optimization
by: Cai, Qi, et al.
Published: (2019)

A Provably-Correct and Robust Convex Model for Smooth Separable NMF
by: Pan, Junjun, et al.
Published: (2025)

Fun with Flags: Robust Principal Directions via Flag Manifolds
by: Mankovich, Nathan, et al.
Published: (2024)

The Computational Complexity of Finding Stationary Points in Non-Convex Optimization
by: Hollender, Alexandros, et al.
Published: (2023)

Provable Adaptivity of Adam under Non-uniform Smoothness
by: Wang, Bohan, et al.
Published: (2022)

Provable Acceleration of Nesterov's Accelerated Gradient for Rectangular Matrix Factorization and Linear Neural Networks
by: Xu, Zhenghao, et al.
Published: (2024)

Non-Euclidean Gradient Descent Operates at the Edge of Stability
by: Islamov, Rustem, et al.
Published: (2026)

Fast and Provable Tensor-Train Format Tensor Completion via Precondtioned Riemannian Gradient Descent
by: Bian, Fengmiao, et al.
Published: (2025)

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming
by: Olanubi, Valentine, et al.
Published: (2026)

Tightening the mixed integer linear formulation for the piecewise linear approximation in general dimensions
by: Ploussard, Quentin, et al.
Published: (2025)

Persistence-based topological optimization: a survey
by: Carriere, Mathieu, et al.
Published: (2026)

Unconstrained Robust Online Convex Optimization
by: Zhang, Jiujia, et al.
Published: (2025)

Momentum Benefits Non-IID Federated Learning Simply and Provably
by: Cheng, Ziheng, et al.
Published: (2023)