Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers

DOI10.1142/s0218195922500078zbMath1523.68058OpenAlexW4312050604MaRDI QIDQ6173264

No author found.

Publication date: 21 July 2023

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195922500078

zbMATH Keywords

robust optimizationcomputational geometryrandom projection

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of mathematical programming (90C90) Learning and adaptive systems in artificial intelligence (68T05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kernels as features: on kernels, margins, and low-dimensional mappings
• Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
• Support-vector networks
• Stronger data poisoning attacks break data sanitization defenses
• Robust support vector machines based on the rescaled hinge loss function
• Feature selection for linear SVM with provable guarantees
• An algorithmic theory of learning: Robust concepts and random projection
• A sparse Johnson
• Dimensionality Reduction for k-Means Clustering and Low Rank Approximation
• Randomized Dimensionality Reduction for <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Means Clustering
• Sparser Johnson-Lindenstrauss Transforms
• Extensions of Lipschitz mappings into a Hilbert space
• Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
• Approximate clustering via core-sets
• Embeddings of surfaces, curves, and moving points in euclidean space
• The Persistent Homology of Distance Functions under Random Projection
• An elementary proof of a theorem of Johnson and Lindenstrauss
• A survey on unsupervised outlier detection in high‐dimensional numerical data
• Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction
• The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
• Performance of Johnson-Lindenstrauss transform for k -means and k -medians clustering
• Coresets for polytope distance
• An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set

This page was built for publication: Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers