Copertina

Exact Causal Attention with 10% Fewer Operations

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Rybin, Dmitry, Zhang, Yushun, Tian, Ding, Lin, Zhihang, Luo, Zhi-Quan
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Machine Learning Discrete Mathematics Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Efficient Exact Resistance Distance Computation on Small-Treewidth Graphs: a Labelling Approach
di: Liao, Meihao, et al.
Pubblicazione: (2025)

Online Correlation Clustering: Simultaneously Optimizing All $\ell_p$-norms
di: Davies, Sami, et al.
Pubblicazione: (2025)

Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges
di: Crane, Alex, et al.
Pubblicazione: (2025)

Graph Inference with Effective Resistance Queries
di: Bennett, Huck, et al.
Pubblicazione: (2025)

Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees
di: Veldt, Nate, et al.
Pubblicazione: (2025)

Worst-case Error Bounds for Online Learning of Smooth Functions
di: Xie, Weian
Pubblicazione: (2025)

Foundational theory for optimal decision tree problems. I. Algorithmic and geometric foundations
di: He, Xi
Pubblicazione: (2025)

Comparative algorithm performance evaluation and prediction for the maximum clique problem using instance space analysis
di: Sharman, Bharat, et al.
Pubblicazione: (2025)

Optimal hypersurface decision trees
di: He, Xi
Pubblicazione: (2025)

Partial Optimality in the Preordering Problem
di: Stein, David, et al.
Pubblicazione: (2026)

Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint
di: Tukan, Murad, et al.
Pubblicazione: (2024)

Discretely Beyond $1/e$: Guided Combinatorial Algorithms for Submodular Maximization
di: Chen, Yixin, et al.
Pubblicazione: (2024)

Breaking Hard Isomorphism Benchmarks with DRESS
di: Velilla, Eduar Castrillo
Pubblicazione: (2026)

An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum $s$-Bundle Problem
di: Xue, Jinghui, et al.
Pubblicazione: (2024)

A 4-approximation algorithm for min max correlation clustering
di: Heidrich, Holger, et al.
Pubblicazione: (2023)

An Exact Solver for Submodular Knapsack Problems
di: Münch, Sabine, et al.
Pubblicazione: (2025)

UAIC_Twin_Width: An Exact yet Efficient Twin-Width Algorithm
di: Arhire, Andrei, et al.
Pubblicazione: (2025)

Efficient Online Sensitivity Analysis For The Injective Bottleneck Path Problem
di: Kaymakov, Kirill V., et al.
Pubblicazione: (2024)

Approximately covering vertices by order-$5$ or longer paths
di: Gong, Mingyang, et al.
Pubblicazione: (2024)

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

Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
di: Holtgrefe, Niels, et al.
Pubblicazione: (2024)

A Unified Approach to Submodular Maximization Under Noise
di: Bhawalkar, Kshipra, et al.
Pubblicazione: (2025)

Learning to Prune Instances of Steiner Tree Problem in Graphs
di: Zhang, Jiwei, et al.
Pubblicazione: (2022)

Approximation algorithms for non-sequential star packing problems
di: Hu, Mengyuan, et al.
Pubblicazione: (2024)

Exact Spin Elimination in Ising Hamiltonians and Energy-Based Machine Learning
di: Berloff, Natalia G.
Pubblicazione: (2025)

Improved Streaming Algorithm for Fair $k$-Center Clustering
di: Guo, Longkun, et al.
Pubblicazione: (2025)

Bipartite Exact Matching in P
di: Du, Yuefeng
Pubblicazione: (2026)

The Computational Complexity of Positive Non-Clashing Teaching in Graphs
di: Ganian, Robert, et al.
Pubblicazione: (2025)

Language Generation and Identification From Partial Enumeration: Tight Density Bounds and Topological Characterizations
di: Kleinberg, Jon, et al.
Pubblicazione: (2025)

Non-adaptive Learning of Random Hypergraphs with Queries
di: Austhof, Bethany, et al.
Pubblicazione: (2025)

Difference of Submodular Minimization via DC Programming
di: Halabi, Marwa El, et al.
Pubblicazione: (2023)

Total Variation Distance Meets Probabilistic Inference
di: Bhattacharyya, Arnab, et al.
Pubblicazione: (2023)

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

Minimum Sum Set Cover: Structures and Algorithm
di: Zhang, Zhongyi, et al.
Pubblicazione: (2026)

Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification
di: Jeronimo, Fernando Granha, et al.
Pubblicazione: (2022)

A Tale of Santa Claus, Hypergraphs and Matroids
di: Davies, Sami, et al.
Pubblicazione: (2018)

A Constant-Approximation Algorithm for Budgeted Sweep Coverage with Mobile Sensors
di: Liang, Wei, et al.
Pubblicazione: (2024)

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
di: Wang, Chen, et al.
Pubblicazione: (2024)

Deterministic counting from coupling independence
di: Chen, Xiaoyu, et al.
Pubblicazione: (2024)

On the Expressive Power of Spectral Invariant Graph Neural Networks
di: Zhang, Bohang, et al.
Pubblicazione: (2024)