Search Results for author:
Found 3 papers, 1 papers with code
Optimal 1-Wasserstein Distance for WGANs
The mathematical forces at work behind Generative Adversarial Networks raise challenging theoretical issues.
Accelerated Gradient Boosting
Gradient tree boosting is a prediction algorithm that sequentially produces a model in the form of linear combinations of decision trees, by solving an infinite-dimensional optimization problem.
Optimization by gradient boosting
Gradient boosting is a state-of-the-art prediction technique that sequentially produces a model in the form of linear combinations of simple predictors---typically decision trees---by solving an infinite-dimensional convex optimization problem.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
