Linear programming word problems formulation using EnsembleCRF NER labeler and T5 text generator with data augmentations

12/30/2022
by   JiangLong He, et al.
12

We propose an ensemble approach to predict the labels in linear programming word problems. The entity identification and the meaning representation are two types of tasks to be solved in the NL4Opt competition. We propose the ensembleCRF method to identify the named entities for the first task. We found that single models didn't improve for the given task in our analysis. A set of prediction models predict the entities. The generated results are combined to form a consensus result in the ensembleCRF method. We present an ensemble text generator to produce the representation sentences for the second task. We thought of dividing the problem into multiple small tasks due to the overflow in the output. A single model generates different representations based on the prompt. All the generated text is combined to form an ensemble and produce a mathematical meaning of a linear programming problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/26/2022

Highlighting Named Entities in Input for Auto-Formulation of Optimization Problems

Operations research deals with modeling and solving real-world problems ...
research
03/14/2023

NL4Opt Competition: Formulating Optimization Problems Based on Their Natural Language Descriptions

The Natural Language for Optimization (NL4Opt) Competition was created t...
research
01/06/2023

OPD@NL4Opt: An ensemble approach for the NER task of the optimization problem

In this paper, we present an ensemble approach for the NL4Opt competitio...
research
12/13/2017

Ellipsoid Method for Linear Programming made simple

In this paper, ellipsoid method for linear programming is derived using ...
research
09/29/2020

A task-based approach to parallel parametric linear programming solving, and application to polyhedral computations

Parametric linear programming is a central operation for polyhedral comp...
research
11/29/2015

Exploiting Anonymity in Approximate Linear Programming: Scaling to Large Multiagent MDPs (Extended Version)

Many exact and approximate solution methods for Markov Decision Processe...
research
09/23/2020

A new look at departure time choice equilibrium models with heterogeneous users

This paper presents a systematic approach for analyzing the departure-ti...

Please sign up or login with your details

Forgot password? Click here to reset