approximate solution

Visual Diffusion Models are Geometric Solvers CVPR 2026 Almost Optimal Fully Dynamic k-Center Clustering with Recourse ICML 2025 Competitively Consistent Clustering ICML 2025 Decomposable Submodular Maximization in Federated Setting ICML 2024 Differentially Private Fair Division AAAI 2023 Very Fast, Approximate Counterfactual Explanations for Decision Forests AAAI 2023 Budgeted Sequence Submodular Maximization IJCAI 2022 DPCD: Discrete Principal Coordinate Descent for Binary Variable Problems AAAI 2022 On the Convergence of Inexact Predictor-Corrector Methods for Linear Programming ICML 2022 Sketching Algorithms and Lower Bounds for Ridge Regression ICML 2022 End-to-End Constrained Optimization Learning: A Survey IJCAI 2021 Approximate Representer Theorems in Non-reflexive Banach Spaces ALT 2020 Fully Dynamic Algorithm for Constrained Submodular Optimization NeurIPS 2020 Efficient Computation of Approximate Equilibria in Discrete Colonel Blotto Games IJCAI 2018 Solving Exist-Random Quantified Stochastic Boolean Satisfiability via Clause Selection IJCAI 2018 Fast SVM Trained by Divide-and-Conquer Anchors IJCAI 2017 Minimizing Quadratic Functions in Constant Time NeurIPS 2016 Guarantees for Approximate Incremental SVMs AISTATS 2010 Random Conic Pursuit for Semidefinite Programming NeurIPS 2010 What makes some POMDP problems easy to approximate? NeurIPS 2007