Benchmarking Regression Methods: A comparison with CGAN Article Swipe

MAKE IMPACT

Karan Aggarwal , Matthieu Kirchmeyer , Pranjul Yadav , S. Sathiya Keerthi , Patrick Gallinari · YOU? · · 2019 · Open Access · · DOI: https://doi.org/10.48550/arxiv.1905.12868

In recent years, impressive progress has been made in the design of implicit probabilistic models via Generative Adversarial Networks (GAN) and its extension, the Conditional GAN (CGAN). Excellent solutions have been demonstrated mostly in image processing applications which involve large, continuous output spaces. There is almost no application of these powerful tools to problems having small dimensional output spaces. Regression problems involving the inductive learning of a map, $y=f(x,z)$, $z$ denoting noise, $f:\mathbb{R}^n\times \mathbb{R}^k \rightarrow \mathbb{R}^m$, with $m$ small (e.g., $m=1$ or just a few) is one good case in point. The standard approach to solve regression problems is to probabilistically model the output $y$ as the sum of a mean function $m(x)$ and a noise term $z$; it is also usual to take the noise to be a Gaussian. These are done for convenience sake so that the likelihood of observed data is expressible in closed form. In the real world, on the other hand, stochasticity of the output is usually caused by missing or noisy input variables. Such a real world situation is best represented using an implicit model in which an extra noise vector, $z$ is included with $x$ as input. CGAN is naturally suited to design such implicit models. This paper makes the first step in this direction and compares the existing regression methods with CGAN. We notice however, that the existing methods like mixture density networks (MDN) and XGBoost do quite well compared to CGAN in terms of likelihood and mean absolute error, respectively. Both these methods are comparatively easier to train than CGANs. CGANs need more innovation to have a comparable modeling and ease-of-training with respect to the existing regression solvers. In summary, for modeling uncertainty MDNs are better while XGBoost is better for the cases where accurate prediction is more important.

Type

preprint

Language

en

Landing Page

http://arxiv.org/abs/1905.12868

PDF

https://arxiv.org/pdf/1905.12868

OA Status

green

Cited By

18

References

16

Related Works

10

OpenAlex ID

https://openalex.org/W2998663318

Raw OpenAlex JSON

OpenAlex ID

https://openalex.org/W2998663318

Canonical identifier for this work in OpenAlex

DOI

https://doi.org/10.48550/arxiv.1905.12868

Digital Object Identifier

Title

Benchmarking Regression Methods: A comparison with CGAN

Work title

Type

preprint

OpenAlex work type

Language

en

Primary language

Publication year

2019

Year of publication

Publication date

2019-05-30

Full publication date if available

Authors

Karan Aggarwal, Matthieu Kirchmeyer, Pranjul Yadav, S. Sathiya Keerthi, Patrick Gallinari

List of authors in order

Landing page

https://arxiv.org/abs/1905.12868

Publisher landing page

PDF URL

https://arxiv.org/pdf/1905.12868

Direct link to full text PDF

Open access

Yes

Whether a free full text is available

OA status

green

Open access status per OpenAlex

OA URL

https://arxiv.org/pdf/1905.12868

Direct OA link when available

Concepts

Benchmarking, Regression, Computer science, Statistics, Artificial intelligence, Mathematics, Business, Marketing

Top concepts (fields/topics) attached by OpenAlex

Cited by

18

Total citation count in OpenAlex

Citations by year (recent)

2024: 2, 2023: 2, 2022: 4, 2021: 6, 2020: 4

Per-year citation counts (last 5 years)

References (count)

16

Number of works referenced by this work

Related works (count)

10

Other works algorithmically related by OpenAlex

Full payload