"computational complexity" Papers
23 papers found
Bounds on the computational complexity of neurons due to dendritic morphology
Anamika Agrawal, Michael Buice
Improving Energy Natural Gradient Descent through Woodbury, Momentum, and Randomization
Andrés Guzmán-Cordero, Felix Dangel, Gil Goldshlager et al.
The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
Ioannis Anagnostides, Ioannis Panageas, Tuomas Sandholm et al.
VSSD: Vision Mamba with Non-Causal State Space Duality
Yuheng Shi, Mingjia Li, Minjing Dong et al.
A Class of Topological Pseudodistances for Fast Comparison of Persistence Diagrams
Rolando Kindelan Nuñez, Mircea Petrache, Mauricio Cerda et al.
Algorithm and Hardness for Dynamic Attention Maintenance in Large Language Models
Jan van den Brand, Zhao Song, Tianyi Zhou
Arrows of Time for Large Language Models
Vassilis Papadopoulos, Jérémie Wenger, Clement Hongler
Collaborative Learning with Different Labeling Functions
yuyang deng, Mingda Qiao
Cost Minimization for Equilibrium Transition
Haoqiang Huang, Zihe Wang, Zhide Wei et al.
Envy-Free House Allocation under Uncertain Preferences
Haris Aziz, Isaiah Iliffe, Bo Li et al.
Faster Maximum Inner Product Search in High Dimensions
Mo Tiwari, Ryan Kang, Jaeyong Lee et al.
How to Make Knockout Tournaments More Popular?
Juhi Chaudhary, Hendrik Molter, Meirav Zehavi
Improving Computational Complexity in Statistical Models with Local Curvature Information
Pedram Akbarian, Tongzheng Ren, Jiacheng Zhuo et al.
Locality-Sensitive Hashing-Based Efficient Point Transformer with Applications in High-Energy Physics
Siqi Miao, Zhiyuan Lu, Mia Liu et al.
Mobile Attention: Mobile-Friendly Linear-Attention for Vision Transformers
Zhiyu Yao, Jian Wang, Haixu Wu et al.
Non-flat ABA Is an Instance of Bipolar Argumentation
Markus Ulbricht, Nico Potyka, Anna Rapberger et al.
On the Tractability of SHAP Explanations under Markovian Distributions
Reda Marzouk, De la Higuera
Reachability of Fair Allocations via Sequential Exchanges
Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong et al.
Spatial Voting with Incomplete Voter Information
Aviram Imber, Jonas Israel, Markus Brill et al.
The Computational Complexity of Finding Second-Order Stationary Points
Andreas Kontogiannis, Vasilis Pollatos, Sotiris Kanellopoulos et al.
Theoretical Aspects of Generating Instances with Unique Solutions: Pre-assignment Models for Unique Vertex Cover
Takashi Horiyama, Yasuaki Kobayashi, Hirotaka Ono et al.
Transformers, parallel computation, and logarithmic depth
Clayton Sanford, Daniel Hsu, Matus Telgarsky
Unravelling Expressive Delegations: Complexity and Normative Analysis
Giannis Tyrovolas, Andrei Constantinescu, Edith Elkind