Efficient Algorithms for Global Inference in Internet Marketplaces

03/09/2021
by   Rohan Ramanath, et al.
0

Matching demand to supply in internet marketplaces (e-commerce, ride-sharing, food delivery, professional services, advertising) is a global inference problem that can be formulated as a Linear Program (LP) with (millions of) coupling constraints and (up to a billion) non-coupling polytope constraints. Until recently, solving such problems on web-scale data with an LP formulation was intractable. Recent work (Basu et al., 2020) developed a dual decomposition-based approach to solve such problems when the polytope constraints are simple. In this work, we motivate the need to go beyond these simple polytopes and show real-world internet marketplaces that require more complex structured polytope constraints. We expand on the recent literature with novel algorithms that are more broadly applicable to global inference problems. We derive an efficient incremental algorithm using a theoretical insight on the nature of solutions on the polytopes to project onto any arbitrary polytope, that shows massive improvements in performance. Using better optimization routines along with an adaptive algorithm to control the smoothness of the objective, improves the speed of the solution even further. We showcase the efficacy of our approach via experimental results on web-scale marketplace data.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

06/18/2012

LPQP for MAP: Putting LP Solvers to Better Use

MAP inference for general energy functions remains a challenging problem...
07/30/2021

Towards Efficient Large-Scale Network Slicing: An LP Rounding-and-Refinement Approach

In this paper, we propose an efficient algorithm for the network slicing...
11/04/2015

Train and Test Tightness of LP Relaxations in Structured Prediction

Structured prediction is used in areas such as computer vision and natur...
11/19/2019

Property Testing of LP-Type Problems

Given query access to a set of constraints S, we wish to quickly check i...
12/12/2016

An Optimization Framework For Online Ride-sharing Markets

Taxi services and product delivery services are instrumental for our mod...
12/13/2020

Uniform Capacitated Facility Location Problems with Penalties/Outliers

In this paper, we present a framework to design approximation algorithms...
11/22/2017

Multiagent Simple Temporal Problem: The Arc-Consistency Approach

The Simple Temporal Problem (STP) is a fundamental temporal reasoning pr...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.