memory complexity

SBGD: Improving Graph Diffusion Generative Model via Stochastic Block Diffusion ICML 2025 Even Sparser Graph Transformers NeurIPS 2024 Optimal and Approximate Adaptive Stochastic Quantization NeurIPS 2024 Efficient Convex Optimization Requires Superlinear Memory (Extended Abstract) IJCAI 2023 Memory-Constrained Algorithms for Convex Optimization NeurIPS 2023 Quadratic Memory is Necessary for Optimal Query Complexity in Convex Optimization: Center-of-Mass is Pareto-Optimal COLT 2023 Learned Queries for Efficient Local Attention CVPR 2022 On The Memory Complexity of Uniformity Testing COLT 2022 Blocking-based Neighbor Sampling for Large-scale Graph Neural Networks IJCAI 2021 Debiasing a First-order Heuristic for Approximate Bi-level Optimization ICML 2021 Efficient Attention: Attention With Linear Complexities WACV 2021 Self-Attention Networks Can Process Bounded Hierarchical Languages ACL 2021 Enhancing the Locality and Breaking the Memory Bottleneck of Transformer on Time Series Forecasting NeurIPS 2019 Reversible GANs for Memory-Efficient Image-To-Image Translation CVPR 2019 Detecting Correlations with Little Memory and Communication COLT 2018 Matrix Norms in Data Streams: Faster, Multi-Pass and Row-Order ICML 2018 Approximate Policy Iteration Schemes: A Comparison ICML 2014 Memory Limited, Streaming PCA NeurIPS 2013