Inference on the value of a linear program
This paper studies inference on the value of a linear program (LP) when both the objective function and constraints are possibly unknown and must be estimated from data. We show that many inference problems in partially identified models can be reformulated in this way. Building on Shapiro (1991) and Fang and Santos (2019), we develop a pointwise valid inference procedure for the value of an LP. We modify this pointwise inference procedure to construct one-sided inference procedures that are uniformly valid over large classes of data-generating processes. Our results provide alternative testing procedures for problems considered in Andrews et al. (2023), Cox and Shi (2023), and Fang et al. (2023) (in the low-dimensional case), and remain valid when key components--such as the coefficient matrix--are unknown and must be estimated. Moreover, our framework also accommodates inference on the identified set of a subvector, in models defined by linear moment inequalities, and does so under weaker constraint qualifications than those in Gafarov (2025).
Code (0)
등록된 구현이 없습니다.
Tasks
validMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
A Fast Convoluted Story: Scaling Probabilistic Inference for Integer Arithmetic
As illustrated by the success of integer linear programming, linear integer arithmetic is a powerful tool for modelling combinatorial problems. Furthermore, the probabilistic extension of linear programming has been used…
Smooth and Strong: MAP Inference with Linear Convergence
Maximum a-posteriori (MAP) inference is an important task for many applications. Although the standard formulation gives rise to a hard combinatorial optimization problem, several effective approximations have been propo…
Combinatorial OptimizationSummary - TerpreT: A Probabilistic Programming Language for Program Induction
We study machine learning formulations of inductive program synthesis; that is, given input-output examples, synthesize source code that maps inputs to corresponding outputs. Our key contribution is TerpreT, a domain-spe…
Probabilistic ProgrammingProgram inductionProgram SynthesisSimple Inference on Functionals of Set-Identified Parameters Defined by Linear Moments
This paper considers uniformly valid inference for linear functionals and scalar subvectors of partially identified parameters defined by linear moment inequalities. Our proposed procedure amounts to bootstrapping the va…
validThe Integer Linear Programming Inference Cookbook
Over the years, integer linear programs have been employed to model inference in many natural language processing problems. This survey is meant to guide the reader through the process of framing a new inference problem …
Survey