Imagen de Portada

Sketching Meets Differential Privacy: Fast Algorithm for Dynamic Kronecker Projection Maintenance

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Song, Zhao, Yang, Xin, Yang, Yuanyuan, Zhang, Lichen
Formato:	Preprint
Publicado:	2022
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

On Differential Privacy for Adaptively Solving Search Problems via Sketching
por: Feng, Shiyuan, et al.
Publicado: (2025)

Fast and Compact Sketch-Based Dynamic Connectivity
por: De Man, Quinten, et al.
Publicado: (2025)

Differential Privacy for Euclidean Jordan Algebra with Applications to Private Symmetric Cone Programming
por: Song, Zhao, et al.
Publicado: (2025)

Lazy Kronecker Product
por: Song, Zhao
Publicado: (2026)

Fast Similarity Sketching
por: Dahlgaard, Søren, et al.
Publicado: (2017)

Fast Sampling Based Sketches for Tensors
por: Swartworth, William, et al.
Publicado: (2024)

Faster Algorithm for Structured John Ellipsoid Computation
por: Cao, Yang, et al.
Publicado: (2022)

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

Carbonyl4: A Sketch for Set-Increment Mixed Updates
por: Zhao, Yikai, et al.
Publicado: (2024)

Fully Dynamic Graph Algorithms with Edge Differential Privacy
por: Raskhodnikova, Sofya, et al.
Publicado: (2024)

Sublinear Time Quantum Algorithm for Attention Approximation
por: Song, Zhao, et al.
Publicado: (2026)

A Dynamic Low-Rank Fast Gaussian Transform
por: Huang, Baihe, et al.
Publicado: (2022)

Fast John Ellipsoid Computation with Differential Privacy Optimization
por: Li, Xiaoyu, et al.
Publicado: (2024)

SimiSketch: Efficiently Estimating Similarity of streaming Multisets
por: Dong, Fenghao, et al.
Publicado: (2024)

Fast algorithms for least square problems with Kronecker lower subsets
por: Malik, Osman Asif, et al.
Publicado: (2022)

Average-Distortion Sketching
por: Bao, Yiqiao, et al.
Publicado: (2024)

On Sketching Quadratic Forms
por: Andoni, Alexandr, et al.
Publicado: (2015)

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

Convex Optimization with Local Label Differential Privacy: Tight Bounds in All Privacy Regimes
por: Chua, Lynn, et al.
Publicado: (2026)

Meeting Utility Constraints in Differential Privacy: A Privacy-Boosting Approach
por: Jiang, Bo, et al.
Publicado: (2024)

Solving Linear Programs with Differential Privacy
por: Ene, Alina, et al.
Publicado: (2025)

Approaching 100% Confidence in Stream Summary through ReliableSketch
por: Wu, Yuhan, et al.
Publicado: (2024)

MagnifierSketch: Quantile Estimation Centered at One Point
por: Guo, Jiarui, et al.
Publicado: (2025)

Solving Positive Linear Programs with Differential Privacy
por: Ene, Alina, et al.
Publicado: (2026)

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

On Sketching Trimmed Statistics
por: Lin, Honghao, et al.
Publicado: (2025)

LMQ-Sketch: Lagom Multi-Query Sketch for High-Rate Online Analytics
por: Hilgendorf, Martin, et al.
Publicado: (2025)

Acceleration Meets Inverse Maintenance: Faster $\ell_{\infty}$-Regression
por: Adil, Deeksha, et al.
Publicado: (2024)

Fast and Efficient Matching Algorithm with Deadline Instances
por: Song, Zhao, et al.
Publicado: (2023)

Unifying Laplace Mechanism with Instance Optimality in Differential Privacy
por: Durfee, David
Publicado: (2025)

Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation
por: Pham, Ninh, et al.
Publicado: (2025)

Graph-based Nearest Neighbors with Dynamic Updates via Random Walks
por: Mishra, Nina, et al.
Publicado: (2025)

The Case for External Graph Sketching
por: Bender, Michael A., et al.
Publicado: (2025)

Sketching and Streaming for Dictionary Compression
por: Becker, Ruben, et al.
Publicado: (2023)

Sketching Cuts in Graphs and Hypergraphs
por: Kogan, Dmitry, et al.
Publicado: (2014)

Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
por: De Man, Quinten, et al.
Publicado: (2026)

A Comprehensive Evaluation of Vertex Elimination Algorithms for Algorithmic Differentiation
por: Crane, Alex, et al.
Publicado: (2026)

Did Fourier Really Meet Möbius? Fast Subset Convolution via FFT
por: Stoian, Mihail
Publicado: (2024)

A Faster Deterministic Algorithm for Fully Dynamic Maximal Matching
por: Chuzhoy, Julia, et al.
Publicado: (2026)

Log-concave Sampling from a Convex Body with a Barrier: a Robust and Unified Dikin Walk
por: Gu, Yuzhou, et al.
Publicado: (2024)