Imagen de Portada

OpenTensor: Reproducing Faster Matrix Multiplication Discovering Algorithms

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Sun, Yiwen, Li, Wenye
Formato:	Preprint
Publicado:	2024
Materias:	Artificial Intelligence Data Structures and Algorithms Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Discovering Data Structures: Nearest Neighbor Search and Beyond
por: Salemohamed, Omar, et al.
Publicado: (2024)

Instance-Optimal Matrix Multiplicative Weight Update and Its Quantum Applications
por: Gong, Weiyuan, et al.
Publicado: (2025)

Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning
por: Li, Dongyue, et al.
Publicado: (2025)

Contract Scheduling with Distributional and Multiple Advice
por: Angelopoulos, Spyros, et al.
Publicado: (2024)

Fast EXP3 Algorithms
por: Sato, Ryoma, et al.
Publicado: (2025)

On Tradeoffs in Learning-Augmented Algorithms
por: Benomar, Ziyad, et al.
Publicado: (2025)

Simulation of Graph Algorithms with Looped Transformers
por: de Luca, Artur Back, et al.
Publicado: (2024)

Positional Attention: Expressivity and Learnability of Algorithmic Computation
por: de Luca, Artur Back, et al.
Publicado: (2024)

Learning-Based Algorithms for Graph Searching Problems
por: DePavia, Adela Frances, et al.
Publicado: (2024)

An Algorithm for Learning Smaller Representations of Models With Scarce Data
por: de Wynter, Adrian
Publicado: (2020)

Pareto Optimal Algorithmic Recourse in Multi-cost Function
por: Chen, Wen-Ling, et al.
Publicado: (2025)

AlgoSelect: Universal Algorithm Selection via the Comb Operator
por: Yao, Jasper
Publicado: (2025)

Optimizing Text Search: A Novel Pattern Matching Algorithm Based on Ukkonen's Approach
por: Guan, Xinyu, et al.
Publicado: (2025)

A Fixed-Parameter Tractable Algorithm for Counting Markov Equivalence Classes with the same Skeleton
por: Sharma, Vidya Sagar
Publicado: (2023)

A Faster $k$-means++ Algorithm
por: Liang, Jiehao, et al.
Publicado: (2022)

Improved Algorithms for Kernel Matrix-Vector Multiplication Under Sparsity Assumptions
por: Indyk, Piotr, et al.
Publicado: (2025)

Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means
por: la Tour, Max Dupré, et al.
Publicado: (2024)

Faster Algorithms for Agnostically Learning Disjunctions and their Implications
por: Diakonikolas, Ilias, et al.
Publicado: (2025)

An Efficient Matrix Multiplication Algorithm for Accelerating Inference in Binary and Ternary Neural Networks
por: Dehghankar, Mohsen, et al.
Publicado: (2024)

No-Free-Lunch Theories for Tensor-Network Machine Learning Models
por: Wu, Jing-Chuan, et al.
Publicado: (2024)

A Faster Branching Algorithm for the Maximum $k$-Defective Clique Problem
por: Luo, Chunyu, et al.
Publicado: (2024)

Masked Matrix Multiplication for Emergent Sparsity
por: Wheatman, Brian, et al.
Publicado: (2024)

MACKO: Sparse Matrix-Vector Multiplication for Low Sparsity
por: Macko, Vladimír, et al.
Publicado: (2025)

Linear-Time Algorithms for Front-Door Adjustment in Causal Graphs
por: Wienöbst, Marcel, et al.
Publicado: (2022)

Linear-Time Primitives for Algorithm Development in Graphical Causal Inference
por: Wienöbst, Marcel, et al.
Publicado: (2025)

Tensor Decompositions and Adiabatic Quantum Computing for Discovering Practical Matrix Multiplication Algorithms
por: Uotila, Valter
Publicado: (2024)

Robust Second-Order Nonconvex Optimization and Its Application to Low Rank Matrix Sensing
por: Li, Shuyao, et al.
Publicado: (2024)

Learning-augmented smooth integer programs with PAC-learnable oracles
por: He, Hao-Yuan, et al.
Publicado: (2026)

Rethinking Flexible Graph Similarity Computation: One-step Alignment with Global Guidance
por: Liu, Zhouyang, et al.
Publicado: (2025)

Online Learning with Probing for Sequential User-Centric Selection
por: Xu, Tianyi, et al.
Publicado: (2025)

Improved Guarantees for Heterogeneous Treatment-Effect Estimation via Matrix Completion
por: Mehrotra, Anay, et al.
Publicado: (2026)

DiscQuant: A Quantization Method for Neural Networks Inspired by Discrepancy Theory
por: Chee, Jerry, et al.
Publicado: (2025)

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
por: Ganian, Robert, et al.
Publicado: (2025)

Asynchronous Algorithmic Alignment with Cocycles
por: Dudzik, Andrew, et al.
Publicado: (2023)

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

Causal Equal Protection as Algorithmic Fairness
por: Di Bello, Marcello, et al.
Publicado: (2024)

The CLRS-Text Algorithmic Reasoning Language Benchmark
por: Markeeva, Larisa, et al.
Publicado: (2024)

Scalable Algorithms for Individual Preference Stable Clustering
por: Mosenzon, Ron, et al.
Publicado: (2024)

Are Graph Neural Networks Optimal Approximation Algorithms?
por: Yau, Morris, et al.
Publicado: (2023)

Optimal Survival Trees: A Dynamic Programming Approach
por: Huisman, Tim, et al.
Publicado: (2024)