2017
DOI: 10.48550/arxiv.1708.04733
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Geometric Enclosing Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2017
2017

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…Another approach is to estimate the data distribution using an implicit density function, without the need for analytical forms of p model (e.g., see [11] for further discussions). An idea is to borrow the principle of minimal enclosing ball [26] to train a generator in such a way that both training and generated data, after being mapped to the feature space, are enclosed in the same sphere [27]. However, the most notably pioneered class of this approach is the generative adversarial network (GAN) [10], an expressive generative model that is capable of producing sharp and realistic images for natural scenes.…”
Section: Introductionmentioning
confidence: 99%
“…Another approach is to estimate the data distribution using an implicit density function, without the need for analytical forms of p model (e.g., see [11] for further discussions). An idea is to borrow the principle of minimal enclosing ball [26] to train a generator in such a way that both training and generated data, after being mapped to the feature space, are enclosed in the same sphere [27]. However, the most notably pioneered class of this approach is the generative adversarial network (GAN) [10], an expressive generative model that is capable of producing sharp and realistic images for natural scenes.…”
Section: Introductionmentioning
confidence: 99%