Imagen de Portada

Approximately Optimal Core Shapes for Tensor Decompositions

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Ghadiri, Mehrdad, Fahrbach, Matthew, Fu, Gang, Mirrokni, Vahab
Formato:	Preprint
Publicado:	2023
Materias:	Data Structures and Algorithms Machine Learning Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Tight Lower Bound for the Approximation Guarantee of Higher-Order Singular Value Decomposition
por: Fahrbach, Matthew, et al.
Publicado: (2025)

Fast Tensor Completion via Approximate Richardson Iteration
por: Ghadiri, Mehrdad, et al.
Publicado: (2025)

PriorBoost: An Adaptive Algorithm for Learning from Aggregate Responses
por: Javanmard, Adel, et al.
Publicado: (2024)

Optimal Approximation -- Smoothness Tradeoffs for Soft-Max Functions
por: Epasto, Alessandro, et al.
Publicado: (2020)

Replicable Clustering
por: Esfandiari, Hossein, et al.
Publicado: (2023)

Procurement Auctions via Approximately Optimal Submodular Optimization
por: Deng, Yuan, et al.
Publicado: (2024)

SubGen: Token Generation in Sublinear Time and Memory
por: Zandieh, Amir, et al.
Publicado: (2024)

TurboQuant: Online Vector Quantization with Near-optimal Distortion Rate
por: Zandieh, Amir, et al.
Publicado: (2025)

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

Efficient Algorithms for Partitioning Circulant Graphs with Optimal Spectral Approximation
por: Gavva, Surya Teja, et al.
Publicado: (2025)

Lower Bounds for Greedy Teaching Set Constructions
por: Compton, Spencer, et al.
Publicado: (2025)

Combinatorial optimization of the coefficient of determination
por: Harary, Marc
Publicado: (2024)

Entrywise Approximate Laplacian Solving
por: Chen, Jingbang, et al.
Publicado: (2024)

Overcomplete Tensor Decomposition via Koszul-Young Flattenings
por: Kothari, Pravesh K., et al.
Publicado: (2024)

Optimal Communication for Classic Functions in the Coordinator Model and Beyond
por: Esfandiari, Hossein, et al.
Publicado: (2024)

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

Optimal Kernel Orchestration for Tensor Programs with Korch
por: Hu, Muyan, et al.
Publicado: (2024)

Optimal and Efficient Partite Decompositions of Hypergraphs
por: Krapivin, Andrew, et al.
Publicado: (2025)

Accelerated Relax-and-Round for Concave Coverage Problems
por: Fahrbach, Matthew, et al.
Publicado: (2026)

Quality control in sublinear time: a case study via random graphs
por: Marcussen, Cassandra, et al.
Publicado: (2025)

Computing Tree Decompositions with Small Independence Number
por: Dallard, Clément, et al.
Publicado: (2022)

A Unified View of Graph Regularity via Matrix Decompositions
por: Bodwin, Greg, et al.
Publicado: (2019)

Optimal Approximate Matrix Multiplication over Sliding Windows
por: Yao, Ziqi, et al.
Publicado: (2025)

A Simple Approximation Algorithm for Optimal Decision Tree
por: Zhuo, Zhengjia, et al.
Publicado: (2025)

A Faster Deterministic Approximation Algorithm for TTP-2
por: Kanaya, Yuga, et al.
Publicado: (2023)

Approximation and FPT Algorithms for Finding DM-Irreducible Spanning Subgraphs
por: Norose, Ryoma, et al.
Publicado: (2024)

Optimal Bounds for Distinct Quartics
por: Charalampopoulos, Panagiotis, et al.
Publicado: (2024)

Linear-Time Algorithms for k-Edge-Connected Components, k-Lean Tree Decompositions, and More
por: Korhonen, Tuukka
Publicado: (2024)

Faster Graph Embeddings via Coarsening
por: Fahrbach, Matthew, et al.
Publicado: (2020)

Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries
por: Nozaki, Yuta, et al.
Publicado: (2024)

Optimal Bounds for Open Addressing Without Reordering
por: Farach-Colton, Martin, et al.
Publicado: (2025)

Beyond Weisfeiler-Lehman: A Quantitative Framework for GNN Expressiveness
por: Zhang, Bohang, et al.
Publicado: (2024)

Ramsey Theorems for Trees and a General 'Private Learning Implies Online Learning' Theorem
por: Fioravanti, Simone, et al.
Publicado: (2024)

Optimal Algorithm for Paired-Domination in Distance-Hereditary Graphs
por: Mu, Ta-Yu, et al.
Publicado: (2024)

High-Dimensional Geometric Streaming for Nearly Low Rank Data
por: Esfandiari, Hossein, et al.
Publicado: (2024)

GIST: Greedy Independent Set Thresholding for Max-Min Diversification with Submodular Utility
por: Fahrbach, Matthew, et al.
Publicado: (2024)

Sampling and Identity-Testing Without Approximate Tensorization of Entropy
por: Gay, William, et al.
Publicado: (2025)

A refined graph container lemma and applications to the hard-core model on bipartite expanders
por: Jenssen, Matthew, et al.
Publicado: (2024)

Optimising Cylindrical Algebraic Coverings for use in SMT by Solving a Set Covering Problem with Reasons
por: Babatunde, Abiola, et al.
Publicado: (2026)

Sampling and counting triangle-free graphs near the critical density
por: Jenssen, Matthew, et al.
Publicado: (2024)