2 citations · 2 across the 9 of their papers we have counts for
12 papers
LLCT: Learnable Linear Canonical Transform Family with Stability for Visual Feature Processing
Zunwei Fu, Zhen Wang, Dachun Yang +1
Visual structures are often characterized by directional geometry, local oscillation, and spatial--frequency coupling. To overcome the limitations of conventional spatial convoluti…
Online Tokenization with Optimal Delay in Linear Time
Mina Dalirrooyfard, Christopher Ye
Tokenization is an essential preprocessing step in almost all large language models (LLMs). One of the most popular frameworks is BPE tokenization, which consists of special token…
Almost Optimal Multiple Source Shortest Paths and Reachability
Barna Saha, Yinzhan Xu, Christopher Ye
Given a graph, computing distances and reachabilities from a small set of vertices to the whole graph is an important primitive both in theory and in practice. In undirected unweig…
Furthest Pair Requires Quadratic Time in Superconstant Dimension under SETH
Barna Saha, Yinzhan Xu, Christopher Ye
Several fundamental problems in computational geometry admit algorithms with running time for points in dimensions, making them among the most pro…
On the Computational Hardness of Transformers
Barna Saha, Yinzhan Xu, Christopher Ye +1
The transformer has revolutionized modern AI across language, vision, and beyond. It consists of layers, each running attention heads in parallel and feeding the combined o…
Subquadratic Algorithms and Hardness for Attention with Any Temperature
Shreya Gupta, Boyang Huang, Barna Saha +2
Despite the popularity of the Transformer architecture, the standard algorithm for computing Attention suffers from quadratic time complexity in context length . Alman and Song…
Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence
Jakob Nogler, Adam Polak, Barna Saha +3
The tree edit distance (TED) between two rooted ordered trees with nodes labeled from an alphabet is the minimum cost of transforming one tree into the other by a sequence…
Fine-Grained Optimality of Partially Dynamic Shortest Paths and More
Barna Saha, Virginia Vassilevska Williams, Yinzhan Xu +1
Single Source Shortest Paths () is among the most well-studied problems in computer science. In the incremental (resp. decremental) setting, the goal is to maintain…
The I/O Complexity of Attention, or How Optimal is Flash Attention?
Barna Saha, Christopher Ye
Self-attention is at the heart of the popular Transformer architecture, yet suffers from quadratic time and memory complexity. The breakthrough FlashAttention algorithm revealed I/…
Faster Approximate All Pairs Shortest Paths
Barna Saha, Christopher Ye
The all pairs shortest path problem (APSP) is one of the foundational problems in computer science. For weighted dense graphs on vertices, no truly sub-cubic algorithms exist t…
On the Complexity of Algorithms with Predictions for Dynamic Graph Problems
Monika Henzinger, Barna Saha, Martin P. Seybold +1
{\em Algorithms with predictions} incorporate machine learning predictions into algorithm design. A plethora of recent works incorporated predictions to improve on worst-case optim…
Predicting the Stereoselectivity of Chemical Transformations by Machine Learning
Justin Li, Dakang Zhang, Yifei Wang +3
Stereoselective reactions (both chemical and enzymatic reactions) have been essential for origin of life, evolution, human biology and medicine. Since late 1960s, there have been n…