Image de couverture de livre

Sparse Random Matrices for Dimensionality Reduction

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Mackenzie, Pierre
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Beyond Worst-Case Dimensionality Reduction for Sparse Vectors
par: Silwal, Sandeep, et autres
Publié: (2025)

Randomized Dimensionality Reduction for Euclidean Maximization and Diversity Measures
par: Gao, Jie, et autres
Publié: (2025)

New Tools for Smoothed Analysis: Least Singular Value Bounds for Random Matrices with Dependent Entries
par: Bhaskara, Aditya, et autres
Publié: (2024)

Dimensionality Reduction on Complex Vector Spaces for Euclidean Distance with Dynamic Weights
par: Moretti, Simone, et autres
Publié: (2022)

Distance Reconstruction of Sparse Random Graphs
par: Bastide, Paul
Publié: (2024)

Sum-of-Squares Lower Bounds for Independent Set in Ultra-Sparse Random Graphs
par: Kothari, Pravesh, et autres
Publié: (2024)

Sparsifying Sums of Positive Semidefinite Matrices
par: Basu, Arpon, et autres
Publié: (2025)

Random Multi-Type Spanning Forests for Synchronization on Sparse Graphs
par: Jaquard, Hugo, et autres
Publié: (2024)

Accurate Analysis of Sparse Random Projections
par: Skórski, Maciej
Publié: (2024)

A Faster Randomized Algorithm for Vertex Cover: An Automated Approach
par: Clinch, Katie, et autres
Publié: (2025)

Improving the Threshold for Finding Rank-1 Matrices in a Subspace
par: Dastidar, Jeshu, et autres
Publié: (2025)

Engineering Insights into Biclique Partitions and Fractional Binary Ranks of Matrices
par: Ghosal, Angikar, et autres
Publié: (2025)

Fast Mixing in Sparse Random Ising Models
par: Liu, Kuikui, et autres
Publié: (2024)

Random Matrices, Intrinsic Freeness, and Sharp Non-Asymptotic Inequalities
par: Bandeira, Afonso S.
Publié: (2025)

Block Encoding of Sparse Matrices via Coherent Permutation
par: Setty, Abhishek
Publié: (2025)

Optimal $e^{(γ+o(1))n}$-Approximation of the Permanent of Positive Semidefinite Matrices
par: Anari, Nima, et autres
Publié: (2026)

Approximating Small Sparse Cuts
par: Anand, Aditya, et autres
Publié: (2024)

Matrix Multiplication Reductions
par: Gola, Ashish, et autres
Publié: (2024)

GraphBLAS Mathematical Opportunities: Parallel Hypersparse, Matrix Based Graph Streaming, and Complex-Index Matrices
par: Jananthan, Hayden, et autres
Publié: (2025)

Listing 6-Cycles in Sparse Graphs
par: Williams, Virginia Vassilevska, et autres
Publié: (2024)

Local Max-Cut on Sparse Graphs
par: Schwartzman, Gregory
Publié: (2023)

Revisiting the Sparse Matrix Compression Problem
par: Jugé, Vincent, et autres
Publié: (2026)

Testing Sparse Functions over the Reals
par: Arora, Vipul, et autres
Publié: (2026)

An Improved Algorithm for Sparse Instances of SAT
par: Jain, Sanjay, et autres
Publié: (2024)

Evaluating Regular Path Queries on Compressed Adjacency Matrices
par: Arroyuelo, Diego, et autres
Publié: (2023)

Efficient Trace Frequency Queries in Sparse Graphs
par: Awofeso, Christine, et autres
Publié: (2025)

Improved Sparse Recovery for Approximate Matrix Multiplication
par: Uffenheimer, Yahel, et autres
Publié: (2026)

Fully Dynamic Shortest Paths in Sparse Digraphs
par: Karczmarz, Adam, et autres
Publié: (2024)

Fully Dynamic Algorithms for Transitive Reduction
par: Goranci, Gramoz, et autres
Publié: (2025)

Random Wheeler Automata
par: Becker, Ruben, et autres
Publié: (2023)

Output-Sparse Matrix Multiplication Using Compressed Sensing
par: Bennett, Huck, et autres
Publié: (2025)

Balancing the Spread of Two Opinions in Sparse Social Networks
par: Knop, Dušan, et autres
Publié: (2021)

Streaming Diameter of High-Dimensional Points
par: Halldórsson, Magnús M., et autres
Publié: (2025)

Near-Optimal Dimension Reduction for Facility Location
par: Huang, Lingxiao, et autres
Publié: (2024)

A Weighted-to-Unweighted Reduction for Matroid Intersection
par: Dudeja, Aditi, et autres
Publié: (2026)

Moderate Dimension Reduction for $k$-Center Clustering
par: Jiang, Shaofeng H. -C., et autres
Publié: (2023)

New Separations and Reductions for Directed Preservers and Hopsets
par: Hoppenworth, Gary, et autres
Publié: (2024)

Random-Order Interval Selection
par: Borodin, Allan, et autres
Publié: (2024)

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness
par: Khanna, Sanjeev, et autres
Publié: (2025)

Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes
par: Mallek, Nadym, et autres
Publié: (2025)