Cover Image

Structure-Aware Spectral Sparsification via Uniform Edge Sampling

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	He, Kaiwen, Drineas, Petros, Khanna, Rajiv
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Space Complexity of Approximating Logistic Loss
by: Dexter, Gregory, et al.
Published: (2024)

Faster Spectral Density Estimation and Sparsification in the Nuclear Norm
by: Jin, Yujia, et al.
Published: (2024)

A Theory of Spectral CSP Sparsification
by: Khanna, Sanjeev, et al.
Published: (2025)

Stochastic Matching via Local Sparsification
by: Ahmadian, Sara, et al.
Published: (2026)

Online Sparsification of Bipartite-Like Clusters in Graphs
by: Das, Joyentanuj, et al.
Published: (2025)

Fast and Faithful Edge Bundling using Spectral Sparsification
by: Jiang, Xingjue, et al.
Published: (2026)

Near-optimal Linear Sketches and Fully-Dynamic Algorithms for Hypergraph Spectral Sparsification
by: Khanna, Sanjeev, et al.
Published: (2025)

Stochastic Rounding 2.0, with a View towards Complexity Analysis
by: Drineas, Petros, et al.
Published: (2024)

inGRASS: Incremental Graph Spectral Sparsification via Low-Resistance-Diameter Decomposition
by: Aghdaei, Ali, et al.
Published: (2024)

Importance Sparsification for Sinkhorn Algorithm
by: Li, Mengyu, et al.
Published: (2023)

Coreset Spectral Clustering
by: Jourdan, Ben, et al.
Published: (2025)

Dynamic Spectral Clustering with Provable Approximation Guarantee
by: Laenen, Steinar, et al.
Published: (2024)

Efficient Algorithms and New Characterizations for CSP Sparsification
by: Khanna, Sanjeev, et al.
Published: (2024)

Replicable Uniformity Testing
by: Liu, Sihan, et al.
Published: (2024)

Linear-Time Multilevel Graph Partitioning via Edge Sparsification
by: Gottesbüren, Lars, et al.
Published: (2025)

Fully Dynamic Spectral Sparsification of Hypergraphs
by: Goranci, Gramoz, et al.
Published: (2025)

Distribution Learning Meets Graph Structure Sampling
by: Bhattacharyya, Arnab, et al.
Published: (2024)

Instance-Optimal Uniformity Testing and Tracking
by: Blanc, Guy, et al.
Published: (2025)

Near-optimal Hypergraph Sparsification in Insertion-only and Bounded-deletion Streams
by: Khanna, Sanjeev, et al.
Published: (2025)

Oracle-based Uniform Sampling from Convex Bodies
by: Dang, Thanh, et al.
Published: (2025)

Fully Dynamic Spectral Sparsification for Directed Hypergraphs
by: Forster, Sebastian, et al.
Published: (2025)

Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms
by: Assadi, Sepehr, et al.
Published: (2025)

Efficient Sample-optimal Learning of Gaussian Tree Models via Sample-optimal Testing of Gaussian Mutual Information
by: Gayen, Sutanu, et al.
Published: (2024)

Sample-Efficient Optimization over Generative Priors via Coarse Learnability
by: Awasthi, Pranjal, et al.
Published: (2025)

Spectral Sparsification by Deterministic Discrepancy Walk
by: Lau, Lap Chi, et al.
Published: (2024)

Sample-Adaptivity Tradeoff in On-Demand Sampling
by: Haghtalab, Nika, et al.
Published: (2025)

Spectral Guarantees for Adversarial Streaming PCA
by: Price, Eric, et al.
Published: (2024)

Uniform Sampling of Negative Edge Weights in Shortest Path Networks
by: Geis, Lukas, et al.
Published: (2024)

Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond
by: Axiotis, Kyriakos, et al.
Published: (2024)

Leaf Stripping on Uniform Attachment Trees
by: Addario-Berry, Louigi, et al.
Published: (2024)

Faster Sampling from Log-Concave Densities over Polytopes via Efficient Linear Solvers
by: Mangoubi, Oren, et al.
Published: (2024)

Learning on the Edge: Online Learning with Stochastic Feedback Graphs
by: Esposito, Emmanuel, et al.
Published: (2022)

SpEx: A Spectral Approach to Explainable Clustering
by: Argov, Tal, et al.
Published: (2025)

Beyond Spectral Clustering: Probabilistic Cuts for Differentiable Graph Partitioning
by: Ghriss, Ayoub
Published: (2025)

Private Edge Density Estimation for Random Graphs: Optimal, Efficient and Robust
by: Chen, Hongjie, et al.
Published: (2024)

Matrix Product Sketching via Coordinated Sampling
by: Daliri, Majid, et al.
Published: (2025)

Fit Like You Sample: Sample-Efficient Generalized Score Matching from Fast Mixing Diffusions
by: Qin, Yilong, et al.
Published: (2023)

Thompson Sampling Itself is Differentially Private
by: Ou, Tingting, et al.
Published: (2024)

The Marked Edge Walk: A Novel MCMC Algorithm for Sampling of Graph Partitions
by: McWhorter, Atticus, et al.
Published: (2025)

Bootstrapping Dynamic APSP via Sparsification
by: Kyng, Rasmus, et al.
Published: (2024)