Algorithms

Provably Auditing Ordinary Least Squares in Low Dimensions ICLR 2023 Quadratic Memory is Necessary for Optimal Query Complexity in Convex Optimization: Center-of-Mass is Pareto-Optimal COLT 2023 Quantum Multi-Model Fitting CVPR 2023 Query-Aware Quantization for Maximum Inner Product Search AAAI 2023 Range-Based Equal Error Rate for Spoof Localization Interspeech 2023 Ranking-based Argumentation Semantics Applied to Logical Argumentation IJCAI 2023 Regarding Topology and Variant Frame Rates for Differentiable WFST-based End-to-End ASR Interspeech 2023 Revisiting Rolling Shutter Bundle Adjustment: Toward Accurate and Fast Solution CVPR 2023 Revisiting Rotation Averaging: Uncertainties and Robust Losses CVPR 2023 Revisiting the P3P Problem CVPR 2023 Robust Algorithms on Adaptive Inputs from Bounded Adversaries ICLR 2023 RON: One-Way Circular Shortest Routing to Achieve Efficient and Bounded-waiting Spinlocks OSDI 2023 Scalable and Globally Optimal Generalized L₁ K-center Clustering via Constraint Generation in Mixed Integer Linear Programming AAAI 2023 Semi-Random Sparse Recovery in Nearly-Linear Time COLT 2023 SharpSSAT: A Witness-Generating Stochastic Boolean Satisfiability Solver AAAI 2023 Sketching Meets Differential Privacy: Fast Algorithm for Dynamic Kronecker Projection Maintenance ICML 2023 Solving Explainability Queries with Quantification: The Case of Feature Relevancy AAAI 2023 Sorting and Hypergraph Orientation under Uncertainty with Predictions IJCAI 2023 Sorting with Predictions NeurIPS 2023 Sparse PCA Beyond Covariance Thresholding COLT 2023 Speeding Up Bellman Ford via Minimum Violation Permutations ICML 2023 Speed-Oblivious Online Scheduling: Knowing (Precise) Speeds is not Necessary ICML 2023 Subquadratic Algorithms for Kernel Matrices via Kernel Density Estimation ICLR 2023 Subsampling in Large Graphs Using Ricci Curvature ICLR 2023 SUT: Active Defects Probing for Transcompiler Models EMNLP 2023