{"list":"other","total":55,"rows":[{"id":"1412.6980","title":"Adam: A Method for Stochastic Optimization","created":"2014-12-22","cited_by_count":37240},{"id":"1703.03400","title":"Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks","created":"2017-03-09","cited_by_count":4897},{"id":"1306.0895","title":"Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distances","created":"2013-06-04","cited_by_count":2316},{"id":"1603.05027","title":"Identity Mappings in Deep Residual Networks","created":"2016-03-16","cited_by_count":1965},{"id":"2003.03485","title":"Neural Operator: Graph Kernel Network for Partial Differential Equations","created":"2020-03-07","cited_by_count":734},{"id":"1703.10593","title":"Unpaired Image-to-Image Translation using Cycle-Consistent Adversarial Networks","created":"2017-03-30","cited_by_count":707},{"id":"1807.05960","title":"Meta-Learning with Latent Embedding Optimization","created":"2018-07-16","cited_by_count":476},{"id":"1807.01613","title":"Conditional Neural Processes","created":"2018-07-04","cited_by_count":426},{"id":"1609.07152","title":"Input Convex Neural Networks","created":"2016-09-22","cited_by_count":414},{"id":"2108.08481","title":"Neural Operator: Learning Maps Between Function Spaces","created":"2021-08-19","cited_by_count":414},{"id":"1706.00292","title":"Learning Generative Models with Sinkhorn Divergences","created":"2017-06-01","cited_by_count":314},{"id":"1705.08848","title":"Joint Distribution Optimal Transportation for Domain Adaptation","created":"2017-05-24","cited_by_count":282},{"id":"2012.02189","title":"Learned Initializations for Optimizing Coordinate-Based Neural Representations","created":"2020-12-03","cited_by_count":242},{"id":"1705.09634","title":"Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration","created":"2017-05-26","cited_by_count":223},{"id":"1902.00434","title":"Generalized Sliced Wasserstein Distances","created":"2019-02-01","cited_by_count":208},{"id":"2103.12828","title":"Learning to Optimize: A Primer and A Benchmark","created":"2021-03-23","cited_by_count":208},{"id":"1908.10962","title":"Optimal transport mapping via input convex neural networks","created":"2019-08-28","cited_by_count":206},{"id":"1506.05439","title":"Learning with a Wasserstein Loss","created":"2015-06-17","cited_by_count":196},{"id":"1904.12785","title":"Style Transfer by Relaxed Optimal Transport and Self-Similarity","created":"2019-04-29","cited_by_count":168},{"id":"1907.12059","title":"Wasserstein Fair Classification","created":"2019-07-28","cited_by_count":131},{"id":"2201.12220","title":"Neural Optimal Transport","created":"2022-01-28","cited_by_count":126},{"id":"1711.02283","title":"Large-Scale Optimal Transport and Mapping Estimation","created":"2017-11-07","cited_by_count":123},{"id":"2006.04678","title":"Primal Wasserstein Imitation Learning","created":"2020-06-08","cited_by_count":121},{"id":"1904.05877","title":"Max-Sliced Wasserstein Distance and its use for GANs","created":"2019-04-11","cited_by_count":119},{"id":"2201.12324","title":"Optimal Transport Tools (OTT): A JAX Toolbox for all things Wasserstein","created":"2022-01-28","cited_by_count":101},{"id":"1909.13082","title":"Wasserstein-2 Generative Networks","created":"2019-09-28","cited_by_count":97},{"id":"2106.01954","title":"Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmark","created":"2021-06-03","cited_by_count":96},{"id":"2106.06345","title":"Proximal Optimal Transport Modeling of Population Dynamics","created":"2021-06-11","cited_by_count":93},{"id":"2012.05942","title":"Convex Potential Flows: Universal Probability Distributions with Optimal Transport and Convex Optimization","created":"2020-12-10","cited_by_count":90},{"id":"2110.02999","title":"Generative Modeling with Optimal Transport Maps","created":"2021-10-06","cited_by_count":82},{"id":"2106.00736","title":"Large-Scale Wasserstein Gradient Flows","created":"2021-06-01","cited_by_count":77},{"id":"1803.04899","title":"Optimal Transport for Multi-source Domain Adaptation under Target Shift","created":"2018-03-13","cited_by_count":68},{"id":"2103.04737","title":"Low-Rank Sinkhorn Factorization","created":"2021-03-08","cited_by_count":67},{"id":"1511.03198","title":"Sliced Wasserstein Kernels for Probability Distributions","created":"2015-11-10","cited_by_count":65},{"id":"2106.01128","title":"Linear-Time Gromov Wasserstein Distances using Low Rank Couplings and Costs","created":"2021-06-02","cited_by_count":61},{"id":"2102.01752","title":"Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization","created":"2021-02-02","cited_by_count":51},{"id":"2110.03684","title":"Cross-Domain Imitation Learning via Optimal Transport","created":"2021-10-07","cited_by_count":49},{"id":"1806.07348","title":"Statistical Optimal Transport via Factored Couplings","created":"2018-06-19","cited_by_count":38},{"id":"1902.07197","title":"2-Wasserstein Approximation via Restricted Convex Potentials with Application to Improved Training for GANs","created":"2019-02-19","cited_by_count":33},{"id":"2008.12534","title":"Continuous Regularized Wasserstein Barycenters","created":"2020-08-28","cited_by_count":32},{"id":"1802.05570","title":"Optimal Transport: Fast Probabilistic Approximation with Exact Solvers","created":"2018-02-14","cited_by_count":27},{"id":"2010.12440","title":"Importance-Aware Semantic Segmentation in Self-Driving with Discrete Wasserstein Training","created":"2020-10-21","cited_by_count":27},{"id":"1710.07457","title":"Learning Wasserstein Embeddings","created":"2017-10-20","cited_by_count":26},{"id":"1906.08540","title":"Screening Sinkhorn Algorithm for Regularized Optimal Transport","created":"2019-06-20","cited_by_count":20},{"id":"1905.10099","title":"Subspace Detours: Building Transport Plans that are Optimal on Subspace Projections","created":"2019-05-24","cited_by_count":19},{"id":"1711.01851","title":"Overrelaxed Sinkhorn-Knopp Algorithm for Regularized Optimal Transport","created":"2017-11-06","cited_by_count":18},{"id":"2106.10272","title":"Riemannian Convex Potential Maps","created":"2021-06-18","cited_by_count":17},{"id":"2203.13417","title":"Amortized Projection Optimization for Sliced Wasserstein Generative Models","created":"2022-03-25","cited_by_count":17},{"id":"1904.03936","title":"Wasserstein Adversarial Regularization (WAR) on label noise","created":"2019-04-08","cited_by_count":16},{"id":"1911.00962","title":"Conservative Wasserstein Training for Pose Estimation","created":"2019-11-03","cited_by_count":11},{"id":"2003.00855","title":"Optimal transport: discretization and algorithms","created":"2020-03-02","cited_by_count":8},{"id":"2010.11852","title":"Efficient Robust Optimal Transport with Application to Multi-Label Classification","created":"2020-10-22","cited_by_count":6},{"id":"2102.12178","title":"Learning to Generate Wasserstein Barycenters","created":"2021-02-24","cited_by_count":6},{"id":"2110.10932","title":"Subspace Detours Meet Gromov-Wasserstein","created":"2021-10-21","cited_by_count":4},{"id":"2103.00899","title":"Computationally Efficient Wasserstein Loss for Structured Labels","created":"2021-03-01","cited_by_count":2}],"next_cursor":null}