linear programming

Safely Learning Dynamical Systems from Short Trajectories L4DC 2021 Scaling the Convex Barrier with Active Sets ICLR 2021 Trembling-Hand Perfection and Correlation in Sequential Games AAAI 2021 Wasserstein barycenters can be computed in polynomial time in fixed dimension JMLR 2021 Approximate Pareto Set for Fair and Efficient Allocation: Few Agent Types or Few Resource Types IJCAI 2020 Asking the Right Questions to the Right Users: Active Learning with Imperfect Oracles AAAI 2020 A Unified Model for the Two-stage Offline-then-Online Resource Allocation IJCAI 2020 Defending with Shared Resources on a Network AAAI 2020 DLWL: Improving Detection for Lowshot Classes With Weakly Labelled Data CVPR 2020 ECLIPSE: An Extreme-Scale Linear Program Solver for Web-Applications ICML 2020 Extrapolating the profile of a finite population COLT 2020 Fastened CROWN: Tightened Neural Network Robustness Certificates AAAI 2020 Faster Randomized Infeasible Interior Point Methods for Tall/Wide Linear Programs NeurIPS 2020 Finding Robust Nash equilibria ALT 2020 Finer Metagenomic Reconstruction via Biodiversity Optimization NeurIPS 2020 Improved Vector Pruning in Exact Algorithms for Solving POMDPs UAI 2020 Interior Point Solving for LP-based prediction+optimisation NeurIPS 2020 Learning Linear Programs from Optimal Decisions NeurIPS 2020 Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes AAAI 2020 Simple and Fast Algorithm for Binary Integer and Online Linear Programming NeurIPS 2020 Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems AAAI 2020 Sparsified Linear Programming for Zero-Sum Equilibrium Finding ICML 2020 Steady-State Policy Synthesis in Multichain Markov Decision Processes IJCAI 2020 The Convex Relaxation Barrier, Revisited: Tightened Single-Neuron Relaxations for Neural Network Verification NeurIPS 2020 Tight Approximation for Proportional Approval Voting IJCAI 2020