Image de couverture de livre

Approximating Tensor Network Contraction with Sketches

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Heddes, Mike, Nunes, Igor, Givargis, Tony, Nicolau, Alex
Format:	Preprint
Publié:	2026
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

Convolution and Cross-Correlation of Count Sketches Enables Fast Cardinality Estimation of Multi-Join Queries
par: Heddes, Mike, et autres
Publié: (2024)

Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation
par: Pham, Ninh, et autres
Publié: (2025)

Fast Sampling Based Sketches for Tensors
par: Swartworth, William, et autres
Publié: (2024)

Swift: High-Performance Sparse Tensor Contraction for Scientific Applications
par: Ensinger, Andrew, et autres
Publié: (2024)

Faster Approximate Fixed Points of $\ell_\infty$-Contractions
par: Feodorov, Andrei, et autres
Publié: (2026)

Quantum Sketches, Hashing, and Approximate Nearest Neighbors
par: Hashemian, Sajjad
Publié: (2026)

On Sketching Trimmed Statistics
par: Lin, Honghao, et autres
Publié: (2025)

On Sketching Quadratic Forms
par: Andoni, Alexandr, et autres
Publié: (2015)

Average-Distortion Sketching
par: Bao, Yiqiao, et autres
Publié: (2024)

Fast Similarity Sketching
par: Dahlgaard, Søren, et autres
Publié: (2017)

LMQ-Sketch: Lagom Multi-Query Sketch for High-Rate Online Analytics
par: Hilgendorf, Martin, et autres
Publié: (2025)

On the Optimal Linear Contraction Order of Tree Tensor Networks, and Beyond
par: Stoian, Mihail, et autres
Publié: (2022)

FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs
par: Lanzinger, Matthias, et autres
Publié: (2023)

The Case for External Graph Sketching
par: Bender, Michael A., et autres
Publié: (2025)

Sketching and Streaming for Dictionary Compression
par: Becker, Ruben, et autres
Publié: (2023)

Sketching Cuts in Graphs and Hypergraphs
par: Kogan, Dmitry, et autres
Publié: (2014)

Sublinear Sketches for Approximate Nearest Neighbor and Kernel Density Estimation
par: Danait, Ved, et autres
Publié: (2025)

Revisiting Approximate Leverage Score Sketching for Matrix Least Squares
par: Larsen, Brett W., et autres
Publié: (2022)

Correlation Sketches for Approximate Join-Correlation Queries
par: Santos, Aécio, et autres
Publié: (2021)

Almost Linear Size Edit Distance Sketch
par: Koucký, Michal, et autres
Publié: (2024)

Fast and Compact Sketch-Based Dynamic Connectivity
par: De Man, Quinten, et autres
Publié: (2025)

Multipass Linear Sketches for Geometric LP-Type Problems
par: Çekirge, N. Efe, et autres
Publié: (2025)

SimiSketch: Efficiently Estimating Similarity of streaming Multisets
par: Dong, Fenghao, et autres
Publié: (2024)

Unmasking Vulnerabilities: Cardinality Sketches under Adaptive Inputs
par: Ahmadian, Sara, et autres
Publié: (2024)

Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness
par: Gribelyuk, Elena, et autres
Publié: (2025)

MagnifierSketch: Quantile Estimation Centered at One Point
par: Guo, Jiarui, et autres
Publié: (2025)

Improved Approximations for Flexible Network Design
par: Hyatt-Denesik, Dylan, et autres
Publié: (2024)

On Differential Privacy for Adaptively Solving Search Problems via Sketching
par: Feng, Shiyuan, et autres
Publié: (2025)

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries
par: Cohen, Edith, et autres
Publié: (2025)

Near-optimal Size Linear Sketches for Hypergraph Cut Sparsifiers
par: Khanna, Sanjeev, et autres
Publié: (2024)

Carbonyl4: A Sketch for Set-Increment Mixed Updates
par: Zhao, Yikai, et autres
Publié: (2024)

A (Very) Nearly Optimal Sketch for $k$-Edge Connectivity Certificates
par: Sawettamalya, Pachara, et autres
Publié: (2025)

A New Approach for Approximating Directed Rooted Networks
par: Cohen, Sarel, et autres
Publié: (2024)

Sampling Methods for Inner Product Sketching
par: Daliri, Majid, et autres
Publié: (2023)

Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms
par: Assadi, Sepehr, et autres
Publié: (2025)

Sketching Meets Differential Privacy: Fast Algorithm for Dynamic Kronecker Projection Maintenance
par: Song, Zhao, et autres
Publié: (2022)

A Strong Separation for Adversarially Robust $\ell_0$ Estimation for Linear Sketches
par: Gribelyuk, Elena, et autres
Publié: (2024)

Near-optimal Linear Sketches and Fully-Dynamic Algorithms for Hypergraph Spectral Sparsification
par: Khanna, Sanjeev, et autres
Publié: (2025)

Efficient Contractions of Dynamic Graphs -- with Applications
par: Henzinger, Monika, et autres
Publié: (2025)

Approximation Algorithms for Network Design in Non-Uniform Fault Models
par: Chekuri, Chandra, et autres
Publié: (2024)