Imagen de Portada

Sparse Random Matrices for Dimensionality Reduction

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Mackenzie, Pierre
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Beyond Worst-Case Dimensionality Reduction for Sparse Vectors
por: Silwal, Sandeep, et al.
Publicado: (2025)

Randomized Dimensionality Reduction for Euclidean Maximization and Diversity Measures
por: Gao, Jie, et al.
Publicado: (2025)

New Tools for Smoothed Analysis: Least Singular Value Bounds for Random Matrices with Dependent Entries
por: Bhaskara, Aditya, et al.
Publicado: (2024)

Dimensionality Reduction on Complex Vector Spaces for Euclidean Distance with Dynamic Weights
por: Moretti, Simone, et al.
Publicado: (2022)

Distance Reconstruction of Sparse Random Graphs
por: Bastide, Paul
Publicado: (2024)

Sum-of-Squares Lower Bounds for Independent Set in Ultra-Sparse Random Graphs
por: Kothari, Pravesh, et al.
Publicado: (2024)

Sparsifying Sums of Positive Semidefinite Matrices
por: Basu, Arpon, et al.
Publicado: (2025)

Random Multi-Type Spanning Forests for Synchronization on Sparse Graphs
por: Jaquard, Hugo, et al.
Publicado: (2024)

Accurate Analysis of Sparse Random Projections
por: Skórski, Maciej
Publicado: (2024)

A Faster Randomized Algorithm for Vertex Cover: An Automated Approach
por: Clinch, Katie, et al.
Publicado: (2025)

Improving the Threshold for Finding Rank-1 Matrices in a Subspace
por: Dastidar, Jeshu, et al.
Publicado: (2025)

Engineering Insights into Biclique Partitions and Fractional Binary Ranks of Matrices
por: Ghosal, Angikar, et al.
Publicado: (2025)

Fast Mixing in Sparse Random Ising Models
por: Liu, Kuikui, et al.
Publicado: (2024)

Random Matrices, Intrinsic Freeness, and Sharp Non-Asymptotic Inequalities
por: Bandeira, Afonso S.
Publicado: (2025)

Block Encoding of Sparse Matrices via Coherent Permutation
por: Setty, Abhishek
Publicado: (2025)

Optimal $e^{(γ+o(1))n}$-Approximation of the Permanent of Positive Semidefinite Matrices
por: Anari, Nima, et al.
Publicado: (2026)

Approximating Small Sparse Cuts
por: Anand, Aditya, et al.
Publicado: (2024)

Matrix Multiplication Reductions
por: Gola, Ashish, et al.
Publicado: (2024)

GraphBLAS Mathematical Opportunities: Parallel Hypersparse, Matrix Based Graph Streaming, and Complex-Index Matrices
por: Jananthan, Hayden, et al.
Publicado: (2025)

Listing 6-Cycles in Sparse Graphs
por: Williams, Virginia Vassilevska, et al.
Publicado: (2024)

Local Max-Cut on Sparse Graphs
por: Schwartzman, Gregory
Publicado: (2023)

Revisiting the Sparse Matrix Compression Problem
por: Jugé, Vincent, et al.
Publicado: (2026)

Testing Sparse Functions over the Reals
por: Arora, Vipul, et al.
Publicado: (2026)

An Improved Algorithm for Sparse Instances of SAT
por: Jain, Sanjay, et al.
Publicado: (2024)

Evaluating Regular Path Queries on Compressed Adjacency Matrices
por: Arroyuelo, Diego, et al.
Publicado: (2023)

Efficient Trace Frequency Queries in Sparse Graphs
por: Awofeso, Christine, et al.
Publicado: (2025)

Improved Sparse Recovery for Approximate Matrix Multiplication
por: Uffenheimer, Yahel, et al.
Publicado: (2026)

Fully Dynamic Shortest Paths in Sparse Digraphs
por: Karczmarz, Adam, et al.
Publicado: (2024)

Fully Dynamic Algorithms for Transitive Reduction
por: Goranci, Gramoz, et al.
Publicado: (2025)

Random Wheeler Automata
por: Becker, Ruben, et al.
Publicado: (2023)

Output-Sparse Matrix Multiplication Using Compressed Sensing
por: Bennett, Huck, et al.
Publicado: (2025)

Balancing the Spread of Two Opinions in Sparse Social Networks
por: Knop, Dušan, et al.
Publicado: (2021)

Streaming Diameter of High-Dimensional Points
por: Halldórsson, Magnús M., et al.
Publicado: (2025)

Near-Optimal Dimension Reduction for Facility Location
por: Huang, Lingxiao, et al.
Publicado: (2024)

A Weighted-to-Unweighted Reduction for Matroid Intersection
por: Dudeja, Aditi, et al.
Publicado: (2026)

Moderate Dimension Reduction for $k$-Center Clustering
por: Jiang, Shaofeng H. -C., et al.
Publicado: (2023)

New Separations and Reductions for Directed Preservers and Hopsets
por: Hoppenworth, Gary, et al.
Publicado: (2024)

Random-Order Interval Selection
por: Borodin, Allan, et al.
Publicado: (2024)

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness
por: Khanna, Sanjeev, et al.
Publicado: (2025)

Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes
por: Mallek, Nadym, et al.
Publicado: (2025)