Algorithms

Near-Optimal Quantum Algorithm for Minimizing the Maximal Loss ICLR 2024 A Convergent Single-Loop Algorithm for Relaxation of Gromov-Wasserstein in Graph Data ICLR 2023 Almost Linear Constant-Factor Sketching for ℓ_1 and Logistic Regression ICLR 2023 From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms JMLR 2023 Is Planted Coloring Easier than Planted Clique? COLT 2023 Kernel-based estimation for partially functional linear model: Minimax rates and randomized sketches JMLR 2023 KwikBucks: Correlation Clustering with Cheap-Weak and Expensive-Strong Signals ICLR 2023 Restarted Nonconvex Accelerated Gradient Descent: No More Polylogarithmic Factor in the in the O(epsilon^(-7/4)) Complexity JMLR 2023 Solving Constrained Variational Inequalities via a First-order Interior Point-based Method ICLR 2023 A generalization of the randomized singular value decomposition ICLR 2022 A Scalable Parallel Algorithm for Balanced Sampling (Student Abstract) AAAI 2022 Fast algorithm for overcomplete order-3 tensor decomposition COLT 2022 Fast Regression for Structured Inputs ICLR 2022 Lattice-Based Methods Surpass Sum-of-Squares in Clustering COLT 2022 Scalable Sampling for Nonsymmetric Determinantal Point Processes ICLR 2022 Sharper Rates for Separable Minimax and Finite Sum Optimization via Primal-Dual Extragradient Methods COLT 2022 The Query Complexity of Local Search and Brouwer in Rounds COLT 2022 Triangle and Four Cycle Counting with Predictions in Graph Streams ICLR 2022 You Only Derive Once (YODO): Automatic Differentiation for Efficient Sensitivity Analysis in Bayesian Networks PGM 2022 Efficient Coreset Constructions via Sensitivity Sampling ACML 2021 Exponentially Improved Dimensionality Reduction for l1: Subspace Embeddings and Independence Testing COLT 2021 GOT: Testing for Originality in Natural Language Generation ACL 2021 Learning a Latent Simplex in Input Sparsity Time ICLR 2021 Local Search Algorithms for Rank-Constrained Convex Optimization ICLR 2021 Near Optimal Distributed Learning of Halfspaces with Two Parties COLT 2021