ملف الباحث

Ranka, Sanjay

ورقة واحدة في مجموعة PaperMetrix

المنشورات

أوراق هذا المؤلف

  1. Learning Permutations with Sinkhorn Policy Gradient

    2018 · arXiv (Cornell University)

    Many problems at the intersection of combinatorics and computer science require solving for a permutation that optimally matches, ranks, or sorts some data. These problems usually have a task-specific, often non-differentiable objective function that data-driven …