computational complexity

An efficient encoder-decoder architecture with top-down attention for speech separation ICLR 2023 Approximate Vanishing Ideal Computations at Scale ICLR 2023 Bypass Exponential Time Preprocessing: Fast Neural Network Training via Weight-Data Correlation Preprocessing NeurIPS 2023 Complexity of Reasoning with Cardinality Minimality Conditions AAAI 2023 Complexity of Safety and coSafety Fragments of Linear Temporal Logic AAAI 2023 Computably Continuous Reinforcement-Learning Objectives Are PAC-Learnable AAAI 2023 Computational Asymmetries in Robust Classification ICML 2023 Computational Complexity of Learning Neural Networks: Smoothness and Degeneracy NeurIPS 2023 Computationally-Efficient Neural Image Compression with Shallow Decoders ICCV 2023 Computationally Efficient PAC RL in POMDPs with Latent Determinism and Conditional Embeddings ICML 2023 Conmer: Streaming Conformer Without Self-attention for Interactive Voice Assistants Interspeech 2023 Constrained Phi-Equilibria ICML 2023 Constraint Optimization over Semirings AAAI 2023 DeepPCR: Parallelizing Sequential Operations in Neural Networks NeurIPS 2023 Divide and Conquer Dynamic Programming: An Almost Linear Time Change Point Detection Methodology in High Dimensions ICML 2023 Do Not Marginalize Mechanisms, Rather Consolidate! NeurIPS 2023 Dynamic Token Pruning in Plain Vision Transformers for Semantic Segmentation ICCV 2023 Efficient Semiring-Weighted Earley Parsing ACL 2023 Hardness of Independent Learning and Sparse Equilibrium Computation in Markov Games ICML 2023 Importance Sparsification for Sinkhorn Algorithm JMLR 2023 Is Planted Coloring Easier than Planted Clique? COLT 2023 Learning Hidden Markov Models Using Conditional Samples COLT 2023 Low-complexity Broadband Beampattern Synthesis using Array Response Control Interspeech 2023 Memorization Capacity of Neural Networks with Conditional Computation ICLR 2023 Multitask Learning via Shared Features: Algorithms and Hardness COLT 2023