Cover Image

A Dual Basis Approach for Structured Robust Euclidean Distance Geometry

Fuente: arXiv

Saved in:

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

Similar Items

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

Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness
by: Smith, Chandler, et al.
Published: (2025)

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

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

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

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

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

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

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

A dual basis approach to multidimensional scaling
by: Lichtenberg, Samuel, et al.
Published: (2023)

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

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

Geometry, Computation, and Optimality in Stochastic Optimization
by: Cheng, Chen, et al.
Published: (2019)

Localization from structured distance matrices via low-rank matrix recovery
by: Lichtenberg, Samuel, et al.
Published: (2023)

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

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

Wasserstein Distributionally Robust Estimation in High Dimensions: Performance Analysis and Optimal Hyperparameter Tuning
by: Aolaritei, Liviu, et al.
Published: (2022)

Geometry of Distance Protection
by: Taylor, Josh A., et al.
Published: (2025)

The Plug-in Approach for Average-Reward and Discounted MDPs: Optimal Sample Complexity Analysis
by: Zurek, Matthew, et al.
Published: (2024)

Recovering Simultaneously Structured Data via Non-Convex Iteratively Reweighted Least Squares
by: Kümmerle, Christian, et al.
Published: (2023)

Property Inheritance for Subtensors in Tensor Train Decompositions
by: Cai, HanQin, et al.
Published: (2025)

Long-time dynamics and universality of nonconvex gradient descent
by: Han, Qiyang
Published: (2025)

Alternating minimization algorithm with initialization analysis for r-local and k-sparse unlabeled sensing
by: Abbasi, Ahmed, et al.
Published: (2022)

Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
by: Li, Gen, et al.
Published: (2021)

Ensemble-Conditional Gaussian Processes (Ens-CGP): Representation, Geometry, and Inference
by: Ravela, Sai, et al.
Published: (2026)

A Neural Network Algorithm for KL Divergence Estimation with Quantitative Error Bounds
by: Foss, Mikil, et al.
Published: (2025)

A Single-Loop First-Order Algorithm for Linearly Constrained Bilevel Optimization
by: Shen, Wei, et al.
Published: (2025)

Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation
by: Cui, Chengyu, et al.
Published: (2026)

Accelerating Ill-conditioned Hankel Matrix Recovery via Structured Newton-like Descent
by: Cai, HanQin, et al.
Published: (2024)

Linear regression with overparameterized linear neural networks: Tight upper and lower bounds for implicit $\ell^1$-regularization
by: Matt, Hannes, et al.
Published: (2025)

Finite-Time Minimax Bounds and an Optimal Lyapunov Policy in Queueing Control
by: Liu, Yujie, et al.
Published: (2025)

Span-Agnostic Optimal Sample Complexity and Oracle Inequalities for Average-Reward RL
by: Zurek, Matthew, et al.
Published: (2025)

On the Convergence Analysis of Muon
by: Shen, Wei, et al.
Published: (2025)

Optimal Single-Policy Sample Complexity and Transient Coverage for Average-Reward Offline RL
by: Zurek, Matthew, et al.
Published: (2025)

MLorc: Momentum Low-rank Compression for Memory Efficient Large Language Model Adaptation
by: Shen, Wei, et al.
Published: (2025)

Generalized Orthogonal Procrustes Problem under Arbitrary Adversaries
by: Ling, Shuyang
Published: (2021)

Span-Based Optimal Sample Complexity for Weakly Communicating and General Average Reward MDPs
by: Zurek, Matthew, et al.
Published: (2024)

Optimal Variance-Dependent Regret Bounds for Infinite-Horizon MDPs
by: Zamir, Guy, et al.
Published: (2026)

Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity
by: Yu, Qian, et al.
Published: (2024)

Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization
by: Shen, Wei, et al.
Published: (2023)