linear programming

Improved Encodings of Acyclicity for Translating Answer Set Programming into Integer Programming IJCAI 2024 Learning Generalized Linear Programming Value Functions NeurIPS 2024 Learning to Pivot as a Smart Expert AAAI 2024 LP-based Construction of DC Decompositions for Efficient Inference of Markov Random Fields AISTATS 2024 Measures of diversity and space-filling designs for categorical data ICML 2024 On the Power of Small-size Graph Neural Networks for Linear Programming NeurIPS 2024 Optimal Extended Formulations from Optimal Dynamic Programming Algorithms IJCAI 2024 Optimal Transport with Cyclic Symmetry AAAI 2024 Privacy-Aware Randomized Quantization via Linear Programming UAI 2024 Provable Editing of Deep Neural Networks using Parametric Linear Relaxation NeurIPS 2024 Safe and Efficient: A Primal-Dual Method for Offline Convex CMDPs under Partial Data Coverage NeurIPS 2024 Safe Linear Bandits over Unknown Polytopes COLT 2024 Approximating a RUM from Distributions on k-Slates AISTATS 2023 A Study of Students’ Learning of Computing through an LP-Based Integrated Curriculum for Middle Schools AAAI 2023 Asymptotic confidence sets for random linear programs COLT 2023 Deep Contract Design via Discontinuous Networks NeurIPS 2023 Efficient Map Sparsification Based on 2D and 3D Discretized Grids CVPR 2023 Equity Promotion in Public Transportation AAAI 2023 Fairness in Matching under Uncertainty ICML 2023 Fast, Differentiable and Sparse Top-k: a Convex Analysis Perspective ICML 2023 Fully Online Matching with Stochastic Arrivals and Departures AAAI 2023 Optimal LP Rounding and Linear-Time Approximation Algorithms for Clustering Edge-Colored Hypergraphs ICML 2023 Predict+Optimize for Packing and Covering LPs with Unknown Parameters in Constraints AAAI 2023 Revisiting the Linear-Programming Framework for Offline RL with General Function Approximation ICML 2023 Rule Induction in Knowledge Graphs Using Linear Programming AAAI 2023