conftrace_

approximate solution

16 papers

Explore in graph

Co-occurring keywords

kernel methods (1097) support vector machine (978) resource allocation (251) combinatorial optimization (1039) oblivious sketching (5) covering number (34) subspace embedding (16) fair division (158) pareto optimization (78) interior point method (19)

Papers

Differentially Private Fair Division AAAI 2023
Very Fast, Approximate Counterfactual Explanations for Decision Forests AAAI 2023
Budgeted Sequence Submodular Maximization IJCAI 2022
Sketching Algorithms and Lower Bounds for Ridge Regression ICML 2022
On the Convergence of Inexact Predictor-Corrector Methods for Linear Programming ICML 2022
DPCD: Discrete Principal Coordinate Descent for Binary Variable Problems AAAI 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 NIPS 2020
Solving Exist-Random Quantified Stochastic Boolean Satisfiability via Clause Selection IJCAI 2018
Efficient Computation of Approximate Equilibria in Discrete Colonel Blotto Games IJCAI 2018
Fast SVM Trained by Divide-and-Conquer Anchors IJCAI 2017
Minimizing Quadratic Functions in Constant Time NIPS 2016
Guarantees for Approximate Incremental SVMs AISTATS 2010
Random Conic Pursuit for Semidefinite Programming NIPS 2010
What makes some POMDP problems easy to approximate? NIPS 2007