Algorithms

Moments, Random Walks, and Limits for Spectrum Approximation COLT 2023 Monitor-Guided Decoding of Code LMs with Static Analysis of Repository Context NeurIPS 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 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 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 On Total-Order HTN Plan Verification with Method Preconditions – An Extension of the CYK Parsing Algorithm AAAI 2023 Optimal LP Rounding and Linear-Time Approximation Algorithms for Clustering Edge-Colored Hypergraphs ICML 2023 Optimal Pathfinding on Weighted Grid Maps AAAI 2023 Optimal Scoring Rules for Multi-dimensional Effort COLT 2023 Parallel Submodular Function Minimization NeurIPS 2023 Polyhedral Complex Extraction from ReLU Networks using Edge Subdivision ICML 2023 Practical Parallel Algorithms for Submodular Maximization Subject to a Knapsack Constraint with Nearly Optimal Adaptivity AAAI 2023