Martin Haugh

Wasserstein Logistic Regression with Mixed Features

  • Aras Selvi
  • Mohammad Reza Belbasi
  • Martin Haugh
  • Wolfram Wiesemann
    • Categories Convex Optimization, Linear, Cone and Semidefinite Programming, Robust Optimization Tags , ,

    Recent work has leveraged the popular distributionally robust optimization paradigm to combat overfitting in classical logistic regression. While the resulting classification scheme displays a promising performance in numerical experiments, it is inherently limited to numerical features. In this paper, we show that distributionally robust logistic regression with mixed (i.e., numerical and categorical) features, despite amounting … Read more

    Information Relaxation Bounds for Infinite Horizon Markov Decision Processes

  • David B. Brown
  • Martin Haugh
    • Categories Dynamic Programming, Scheduling, Stochastic Programming Tags , ,

    We consider the information relaxation approach for calculating performance bounds for stochastic dynamic programs (DPs), following Brown, Smith, and Sun (2010). This approach generates performance bounds by solving problems with relaxed nonanticipativity constraints and a penalty that punishes violations of these constraints. In this paper, we study infinite horizon DPs with discounted costs and consider … Read more