Co-occurring keywords · papers mentioning both
Papers
Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression
JMLR 2024
Near-Optimal Solutions of Constrained Learning Problems
ICLR 2024
Predicting Lagrangian Multipliers for Mixed Integer Linear Programs
ICML 2024
Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression
COLT 2023
Learning to Optimize with Stochastic Dominance Constraints
AISTATS 2023
Global Optimal K-Medoids Clustering of One Million Samples
NeurIPS 2022
Zonotope Domains for Lagrangian Neural Network Verification
NeurIPS 2022
A Constrained Multi-Objective Reinforcement Learning Framework
CoRL 2021
A Unified Framework for Planning with Learned Neural Network Transition Models
AAAI 2021
Improved CP-Based Lagrangian Relaxation Approach with an Application to the TSP
IJCAI 2021
Domain Knowledge Empowered Structured Neural Net for End-to-End Event Temporal Relation Extraction
EMNLP 2020
Efficient Optimistic Exploration in Linear-Quadratic Regulators via Lagrangian Relaxation
ICML 2020
A Dual Approach to Verify and Train Deep Networks
IJCAI 2019
Efficient Neural Network Verification with Exactness Characterization
UAI 2019
MAP Inference via Block-Coordinate Frank-Wolfe Algorithm
CVPR 2019
Target Language-Aware Constrained Inference for Cross-lingual Dependency Parsing
EMNLP 2019
Efficient Discontinuous Phrase-Structure Parsing via the Generalized Maximum Spanning Arborescence
EMNLP 2017
Semantic Dependency Parsing via Book Embedding
ACL 2017
Multi-target Tracking by Lagrangian Relaxation to Min-cost Network Flow
CVPR 2013
Optimal Web-Scale Tiering as a Flow Problem
NeurIPS 2010