Foundations

Mini-batch k-means terminates within O(d/ε) iterations ICLR 2023 Minimalistic Predictions to Schedule Jobs with Online Precedence Constraints ICML 2023 Minimal Solutions to Uncalibrated Two-view Geometry with Known Epipoles ICCV 2023 Minimizing Reachability Times on Temporal Graphs via Shifting Labels IJCAI 2023 Moments, Random Walks, and Limits for Spectrum Approximation COLT 2023 Monitor-Guided Decoding of Code LMs with Static Analysis of Repository Context NeurIPS 2023 Moral Planning Agents with LTL Values IJCAI 2023 Morphological Inflection with Phonological Features ACL 2023 Multiagent MST Cover: Pleasing All Optimally via a Simple Voting Rule AAAI 2023 Multi-objective Search via Lazy and Efficient Dominance Checks IJCAI 2023 Multi-Swap k-Means++ NeurIPS 2023 NCDL: A Framework for Deep Learning on non-Cartesian Lattices NeurIPS 2023 Near-optimal fitting of ellipsoids to random points COLT 2023 Neural Texture Synthesis With Guided Correspondence CVPR 2023 NeuSE: Neural SE(3)-Equivariant Embedding for Consistent Spatial Understanding with Objects RSS 2023 Now We’re Talking: Better Deliberation Groups through Submodular Optimization AAAI 2023 NuWLS: Improving Local Search for (Weighted) Partial MaxSAT by New Weighting Techniques AAAI 2023 Ollivier-Ricci Curvature for Hypergraphs: A Unified Framework ICLR 2023 On Distribution Dependent Sub-Logarithmic Query Time of Learned Indexing ICML 2023 One-Shot Compression of Large Edge-Exchangeable Graphs using Bits-Back Coding ICML 2023 Online Algorithms with Costly Predictions AISTATS 2023 Online List Labeling with Predictions NeurIPS 2023 On Testing and Learning Quantum Junta Channels COLT 2023 On the Complexity of SHAP-Score-Based Explanations: Tractability via Knowledge Compilation and Non-Approximability Results JMLR 2023 On the Expressive Power of Geometric Graph Neural Networks ICML 2023