{"list":"other","total":200,"rows":[{"id":"2006.11239","title":"Denoising Diffusion Probabilistic Models","created":"2020-06-19","cited_by_count":21076},{"id":"2011.13456","title":"Score-Based Generative Modeling through Stochastic Differential Equations","created":"2020-11-26","cited_by_count":9122},{"id":"1503.03585","title":"Deep Unsupervised Learning using Nonequilibrium Thermodynamics","created":"2015-03-12","cited_by_count":7058},{"id":"1907.05600","title":"Generative Modeling by Estimating Gradients of the Data Distribution","created":"2019-07-12","cited_by_count":4101},{"id":"2209.03003","title":"Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flow","created":"2022-09-07","cited_by_count":3700},{"id":"1505.07818","title":"Domain-Adversarial Training of Neural Networks","created":"2015-05-28","cited_by_count":3044},{"id":"2106.01946","title":"Convex optimization","created":"2021-06-03","cited_by_count":2515},{"id":"1306.0895","title":"Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distances","created":"2013-06-04","cited_by_count":2316},{"id":"1704.00028","title":"Improved Training of Wasserstein GANs","created":"2017-03-31","cited_by_count":2235},{"id":"1908.07873","title":"Federated Learning: Challenges, Methods, and Future Directions","created":"2019-08-21","cited_by_count":1538},{"id":"1911.02685","title":"A Comprehensive Survey on Transfer Learning","created":"2019-11-07","cited_by_count":1160},{"id":"2104.00680","title":"LoFTR: Detector-Free Local Feature Matching with Transformers","created":"2021-04-01","cited_by_count":984},{"id":"2110.11334","title":"Generalized Out-of-Distribution Detection: A Survey","created":"2021-10-21","cited_by_count":802},{"id":"2103.03097","title":"Generalizing to Unseen Domains: A Survey on Domain Generalization","created":"2021-03-02","cited_by_count":766},{"id":"1712.02560","title":"Maximum Classifier Discrepancy for Unsupervised Domain Adaptation","created":"2017-12-07","cited_by_count":683},{"id":"2101.09258","title":"Maximum Likelihood Training of Score-Based Diffusion Models","created":"2021-01-22","cited_by_count":672},{"id":"1804.08328","title":"Taskonomy: Disentangling Task Transfer Learning","created":"2018-04-23","cited_by_count":634},{"id":"1909.01377","title":"Deep Equilibrium Models","created":"2019-09-03","cited_by_count":615},{"id":"2106.01357","title":"Diffusion Schr\\\"odinger Bridge with Applications to Score-Based Generative Modeling","created":"2021-06-01","cited_by_count":602},{"id":"1911.05371","title":"Self-labelling via simultaneous clustering and representation learning","created":"2019-11-13","cited_by_count":528},{"id":"1507.00504","title":"Optimal Transport for Domain Adaptation","created":"2015-07-02","cited_by_count":463},{"id":"1805.09545","title":"On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transport","created":"2018-05-24","cited_by_count":426},{"id":"1609.07152","title":"Input Convex Neural Networks","created":"2016-09-22","cited_by_count":414},{"id":"1907.09693","title":"A Survey on Federated Learning Systems: Vision, Hype and Reality for Data Privacy and Protection","created":"2019-07-23","cited_by_count":374},{"id":"1706.00292","title":"Learning Generative Models with Sinkhorn Divergences","created":"2017-06-01","cited_by_count":314},{"id":"2007.03304","title":"Learning to Generate Novel Domains for Domain Generalization","created":"2020-07-07","cited_by_count":296},{"id":"1705.08848","title":"Joint Distribution Optimal Transportation for Domain Adaptation","created":"2017-05-24","cited_by_count":282},{"id":"1804.10745","title":"Generalizing Across Domains via Cross-Gradient Training","created":"2018-04-28","cited_by_count":268},{"id":"1711.10678","title":"AttGAN: Facial Attribute Editing by Only Changing What You Want","created":"2017-11-29","cited_by_count":242},{"id":"1903.04064","title":"Sliced Wasserstein Discrepancy for Unsupervised Domain Adaptation","created":"2019-03-10","cited_by_count":235},{"id":"1705.09634","title":"Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration","created":"2017-05-26","cited_by_count":223},{"id":"1910.05653","title":"Model Fusion via Optimal Transport","created":"2019-10-12","cited_by_count":219},{"id":"1310.4375","title":"Fast Computation of Wasserstein Barycenters","created":"2013-10-16","cited_by_count":216},{"id":"1803.10081","title":"DeepJDOT: Deep Joint Distribution Optimal Transport for Unsupervised Domain Adaptation","created":"2018-03-27","cited_by_count":214},{"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":"2105.15183","title":"Efficient and Modular Implicit Differentiation","created":"2021-05-31","cited_by_count":203},{"id":"1605.08527","title":"Stochastic Optimization for Large-scale Optimal Transport","created":"2016-05-27","cited_by_count":189},{"id":"2002.12462","title":"LEEP: A New Measure to Evaluate Transferability of Learned Representations","created":"2020-02-27","cited_by_count":188},{"id":"2103.14259","title":"OTA: Optimal Transport Assignment for Object Detection","created":"2021-03-26","cited_by_count":178},{"id":"1802.08665","title":"Learning Latent Permutations with Gumbel-Sinkhorn Networks","created":"2018-02-23","cited_by_count":175},{"id":"1805.09114","title":"Optimal Transport for structured data with application on graphs","created":"2018-05-23","cited_by_count":172},{"id":"2002.02923","title":"Geometric Dataset Distances via Optimal Transport","created":"2020-02-07","cited_by_count":158},{"id":"1508.07941","title":"Optimal Entropy-Transport problems and a new Hellinger-Kantorovich distance between positive measures","created":"2015-08-31","cited_by_count":139},{"id":"2110.11773","title":"Sinkformers: Transformers with Doubly Stochastic Attention","created":"2021-10-22","cited_by_count":138},{"id":"2007.11142","title":"FLOT: Scene Flow on Point Clouds Guided by Optimal Transport","created":"2020-07-22","cited_by_count":129},{"id":"1908.08142","title":"Transferability and Hardness of Supervised Classification Tasks","created":"2019-08-21","cited_by_count":127},{"id":"1901.06003","title":"Gromov-Wasserstein Learning for Graph Matching and Node Embedding","created":"2019-01-17","cited_by_count":126},{"id":"2103.03606","title":"Unbalanced minibatch Optimal Transport; applications to Domain Adaptation","created":"2021-03-05","cited_by_count":125},{"id":"1711.02283","title":"Large-Scale Optimal Transport and Mapping Estimation","created":"2017-11-07","cited_by_count":123},{"id":"1809.00013","title":"Gromov-Wasserstein Alignment of Word Embedding Spaces","created":"2018-08-31","cited_by_count":122},{"id":"1904.05877","title":"Max-Sliced Wasserstein Distance and its use for GANs","created":"2019-04-11","cited_by_count":119},{"id":"1905.11885","title":"Differentiable Ranks and Sorting using Optimal Transport","created":"2019-05-28","cited_by_count":113},{"id":"2004.11829","title":"A survey on domain adaptation theory: learning bounds and theoretical guarantees","created":"2020-04-24","cited_by_count":109},{"id":"1610.04420","title":"Theoretical Analysis of Domain Adaptation with Optimal Transport","created":"2016-10-14","cited_by_count":105},{"id":"1905.07645","title":"Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching","created":"2019-05-18","cited_by_count":103},{"id":"2201.12324","title":"Optimal Transport Tools (OTT): A JAX Toolbox for all things Wasserstein","created":"2022-01-28","cited_by_count":101},{"id":"1412.4430","title":"On the relation between optimal transport and Schr\\\"odinger bridges: A stochastic control viewpoint","created":"2014-12-15","cited_by_count":99},{"id":"1904.00597","title":"Learning Combinatorial Embedding Networks for Deep Graph Matching","created":"2019-04-01","cited_by_count":99},{"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":"1901.08949","title":"Subspace Robust Wasserstein Distances","created":"2019-01-25","cited_by_count":90},{"id":"1902.07906","title":"Wasserstein Adversarial Examples via Projected Sinkhorn Iterations","created":"2019-02-21","cited_by_count":89},{"id":"1910.04091","title":"Learning with minibatch Wasserstein : asymptotic and gradient properties","created":"2019-10-09","cited_by_count":87},{"id":"1805.11835","title":"Optimal Control Via Neural Networks: A Convex Approach","created":"2018-05-30","cited_by_count":85},{"id":"1905.11882","title":"Statistical bounds for entropic optimal transport: sample complexity and the central limit theorem","created":"2019-05-28","cited_by_count":85},{"id":"2001.09621","title":"Deep Graph Matching Consensus","created":"2020-01-27","cited_by_count":85},{"id":"2003.05783","title":"Statistical and Topological Properties of Sliced Probability Divergences","created":"2020-03-12","cited_by_count":85},{"id":"1710.06276","title":"Smooth and Sparse Optimal Transport","created":"2017-10-17","cited_by_count":83},{"id":"1909.04866","title":"Deep Declarative Networks: A New Hope","created":"2019-09-11","cited_by_count":78},{"id":"1610.06519","title":"Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems","created":"2016-10-20","cited_by_count":73},{"id":"2006.08172","title":"Faster Wasserstein Distance Estimation with the Sinkhorn Divergence","created":"2020-06-15","cited_by_count":73},{"id":"2002.07367","title":"Distributional Sliced-Wasserstein and Applications to Generative Modeling","created":"2020-02-18","cited_by_count":69},{"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":"2206.15469","title":"Watch and Match: Supercharging Imitation with Regularized Optimal Transport","created":"2022-06-30","cited_by_count":67},{"id":"1905.10124","title":"Sliced Gromov-Wasserstein","created":"2019-05-24","cited_by_count":66},{"id":"1511.03198","title":"Sliced Wasserstein Kernels for Probability Distributions","created":"2015-11-10","cited_by_count":65},{"id":"1709.08894","title":"On the regularization of Wasserstein GANs","created":"2017-09-26","cited_by_count":65},{"id":"1906.02085","title":"GOT: An Optimal Transport framework for Graph comparison","created":"2019-06-05","cited_by_count":64},{"id":"2012.08674","title":"Wasserstein Contrastive Representation Distillation","created":"2020-12-15","cited_by_count":64},{"id":"2103.13843","title":"OTCE: A Transferability Metric for Cross-Domain Cross-Task Representations","created":"2021-03-25","cited_by_count":62},{"id":"2002.03293","title":"On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm","created":"2020-02-09","cited_by_count":61},{"id":"2106.01128","title":"Linear-Time Gromov Wasserstein Distances using Low Rank Couplings and Costs","created":"2021-06-02","cited_by_count":61},{"id":"2206.14262","title":"Supervised Training of Conditional Monge Maps","created":"2022-06-28","cited_by_count":61},{"id":"2009.04266","title":"The Unbalanced Gromov Wasserstein Distance: Conic Formulation and Relaxation","created":"2020-09-09","cited_by_count":56},{"id":"1910.12958","title":"Sinkhorn Divergences for Unbalanced Optimal Transport","created":"2019-10-28","cited_by_count":55},{"id":"1307.5551","title":"Regularized Discrete Optimal Transport","created":"2013-07-21","cited_by_count":54},{"id":"1902.00342","title":"Tree-Sliced Variants of Wasserstein Distances","created":"2019-02-01","cited_by_count":54},{"id":"1905.05461","title":"Learning Generative Models across Incomparable Spaces","created":"2019-05-14","cited_by_count":53},{"id":"1906.10827","title":"Hierarchical Optimal Transport for Document Representation","created":"2019-06-26","cited_by_count":53},{"id":"2007.04462","title":"Scalable Computations of Wasserstein Barycenter via Input Convex Neural Networks","created":"2020-07-08","cited_by_count":50},{"id":"2205.02640","title":"Model-Based Deep Learning: On the Intersection of Deep Learning and Optimization","created":"2022-05-05","cited_by_count":50},{"id":"2211.01156","title":"Entropic Neural Optimal Transport via Diffusion Processes","created":"2022-11-02","cited_by_count":50},{"id":"2212.06359","title":"Score-based Generative Modeling Secretly Minimizes the Wasserstein Distance","created":"2022-12-13","cited_by_count":50},{"id":"2105.13353","title":"Unsupervised Action Segmentation by Joint Representation Learning and Online Clustering","created":"2021-05-27","cited_by_count":49},{"id":"2110.03684","title":"Cross-Domain Imitation Learning via Optimal Transport","created":"2021-10-07","cited_by_count":49},{"id":"2102.04014","title":"Point-set Distances for Learning Representations of 3D Point Clouds","created":"2021-02-08","cited_by_count":48}],"next_cursor":"100"}