ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2209.15466
  4. Cited By
Sparsity-Constrained Optimal Transport

Sparsity-Constrained Optimal Transport

30 September 2022
Tianlin Liu
J. Puigcerver
Mathieu Blondel
    OT
ArXivPDFHTML

Papers citing "Sparsity-Constrained Optimal Transport"

14 / 14 papers shown
Title
Improving Routing in Sparse Mixture of Experts with Graph of Tokens
Improving Routing in Sparse Mixture of Experts with Graph of Tokens
Tam Minh Nguyen
Ngoc N. Tran
Khai Nguyen
Richard G. Baraniuk
MoE
59
0
0
01 May 2025
Tight Clusters Make Specialized Experts
Tight Clusters Make Specialized Experts
Stefan K. Nielsen
R. Teo
Laziz U. Abdullaev
Tan M. Nguyen
MoE
56
2
0
21 Feb 2025
When Graph Neural Networks Meet Dynamic Mode Decomposition
When Graph Neural Networks Meet Dynamic Mode Decomposition
Dai Shi
Lequan Lin
Andi Han
Zhiyong Wang
Yi Guo
Junbin Gao
AI4CE
23
0
0
08 Oct 2024
Submodular Framework for Structured-Sparse Optimal Transport
Submodular Framework for Structured-Sparse Optimal Transport
Piyushi Manupriya
Pratik Jawanpuria
Karthik S. Gurumoorthy
SakethaNath Jagarlapudi
Bamdev Mishra
OT
83
0
0
07 Jun 2024
Sparse Domain Transfer via Elastic Net Regularization
Sparse Domain Transfer via Elastic Net Regularization
Jingwei Zhang
Farzan Farnia
OT
43
0
0
13 May 2024
From Sparse to Soft Mixtures of Experts
From Sparse to Soft Mixtures of Experts
J. Puigcerver
C. Riquelme
Basil Mustafa
N. Houlsby
MoE
121
114
0
02 Aug 2023
High-Rate Phase Association with Travel Time Neural Fields
High-Rate Phase Association with Travel Time Neural Fields
Chengzhi Shi
Maarten V. de Hoop
Ivan Dokmanić
11
1
0
14 Jul 2023
Bringing regularized optimal transport to lightspeed: a splitting method
  adapted for GPUs
Bringing regularized optimal transport to lightspeed: a splitting method adapted for GPUs
Jacob Lindbäck
Zesen Wang
Mikael Johansson
OT
30
1
0
29 May 2023
Fast, Differentiable and Sparse Top-k: a Convex Analysis Perspective
Fast, Differentiable and Sparse Top-k: a Convex Analysis Perspective
Michael E. Sander
J. Puigcerver
Josip Djolonga
Gabriel Peyré
Mathieu Blondel
16
18
0
02 Feb 2023
Hybrid Gromov-Wasserstein Embedding for Capsule Learning
Hybrid Gromov-Wasserstein Embedding for Capsule Learning
Pourya Shamsolmoali
Masoumeh Zareapoor
Swagatam Das
Eric Granger
Salvador García
MedIm
19
2
0
01 Sep 2022
TPU-KNN: K Nearest Neighbor Search at Peak FLOP/s
TPU-KNN: K Nearest Neighbor Search at Peak FLOP/s
Felix Chern
Blake A. Hechtman
Andy Davis
Ruiqi Guo
David Majnemer
Surinder Kumar
94
22
0
28 Jun 2022
Unbiased Gradient Estimation with Balanced Assignments for Mixtures of
  Experts
Unbiased Gradient Estimation with Balanced Assignments for Mixtures of Experts
W. Kool
Chris J. Maddison
A. Mnih
26
10
0
24 Sep 2021
Regularized Optimal Transport and the Rot Mover's Distance
Regularized Optimal Transport and the Rot Mover's Distance
Arnaud Dessein
Nicolas Papadakis
Jean-Luc Rouas
OT
51
84
0
20 Oct 2016
New Perspectives on k-Support and Cluster Norms
New Perspectives on k-Support and Cluster Norms
Andrew M. McDonald
Massimiliano Pontil
Dimitris Stamos
50
58
0
06 Mar 2014
1