Algorithms

Fast, Parallel, Query-Efficient Binary Classification COLT 2026 Large Average Subtensor Problem: Ground-State, Algorithms, and Algorithmic Barriers ALT 2026 Overlap Analysis of the Shortest Path Problem: Local Search, Landscapes, and Franz-Parisi Potential COLT 2026 Randomization for Faster Exact Optimization of Discounted Markov Decision Processes COLT 2026 Reusing Samples in Variance Reduction ALT 2026 Robust Algorithms for Finding Cliques in Random Intersection Graphs via Sum-of-Squares COLT 2026 Spectral Valleys and Sharp Failures in Greedy Determinant Maximization COLT 2026 The matrix-vector complexity of Ax=b COLT 2026 Uncertainty-Aware Test-Time Search for Optimization Problem Solving ACL 2026 Change Point Detection in Hadamard Spaces by Alternating Minimization AISTATS 2025 Learning-Augmented Frequent Directions ICLR 2025 Limit-sure Reachability for Small Memory Policies in POMDPs is NP-complete UAI 2025 Lipschitz Bandits in Optimal Space ICLR 2025 Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes UAI 2025 Neural Graph Map: Dense Mapping with Efficient Loop Closure Integration WACV 2025 On Distributional Discrepancy for Experimental Design with General Assignment Probabilities AISTATS 2025 Privately Counting Partially Ordered Data ICLR 2025 Quantum (Inspired) D^2-sampling with Applications ICLR 2025 Sketch-and-Project Meets Newton Method: Global $O(1/k^2)$ Convergence with Low-Rank Updates AISTATS 2025 Streaming Algorithms For ℓ_p Flows and ℓ_p Regression ICLR 2025 A Fast and Provable Algorithm for Sparse Phase Retrieval ICLR 2024 Faster Spectral Density Estimation and Sparsification in the Nuclear Norm (Extended Abstract) COLT 2024 Improved algorithm and bounds for successive projection ICLR 2024 Independent-Set Design of Experiments for Estimating Treatment and Spillover Effects under Network Interference ICLR 2024 Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time ICLR 2024