Approximating Probability Distributions by Using Wasserstein Generative Adversarial Networks (Q6090834): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1137/22m149689x / rank
Normal rank
 
Property / cites work
 
Property / cites work: Neural Network Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: On parameter estimation with the Wasserstein distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Iterative Algorithm for Computing the Best Estimate of an Orthogonal Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation by superpositions of a sigmoidal function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Central limit theorems for empirical transportation cost in general dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4998995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5053236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Transport / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the capacity of deep generative networks for approximating distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error bounds for approximations with deep ReLU networks / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1137/22M149689X / rank
 
Normal rank

Latest revision as of 18:21, 30 December 2024

scientific article; zbMATH DE number 7768240
Language Label Description Also known as
English
Approximating Probability Distributions by Using Wasserstein Generative Adversarial Networks
scientific article; zbMATH DE number 7768240

    Statements

    Approximating Probability Distributions by Using Wasserstein Generative Adversarial Networks (English)
    0 references
    0 references
    0 references
    0 references
    20 November 2023
    0 references
    Wasserstein GAN
    0 references
    GroupSort neural networks
    0 references
    approximation
    0 references
    generalization error
    0 references
    capacity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references