Fetching the paper…
Reading the bibliography…
The sorting operation is one of the most commonly used building blocks in computer programming.
The proof and measurement of association between two things
Spearman, C · 1904
Earlier work this paper cites.
The generalized simplex method for minimizing a linear form under linear inequality restraints
Dantzig, G. B., Orden, A., and Wolfe, P · 1955
Earlier work this paper cites.
Robust estimation of a location parameter
Huber, P. J · 1964
Earlier work this paper cites.
Concerning nonnegative matrices and doubly stochastic matrices
Sinkhorn, R. and Knopp, P · 1967
Earlier work this paper cites.
Submodular functions, matroids, and certain polyhedra
Edmonds, J · 1970
Earlier work this paper cites.
Permutation polyhedra
Bowman, V · 1972
Earlier work this paper cites.
Least median of squares regression
Rousseeuw, P. J · 1984
Earlier work this paper cites.
On the limited memory BFGS method for large scale optimization
Liu, D. C. and Nocedal, J · 1989
Earlier work this paper cites.
Minimizing separable convex functions subject to simple chain constraints
Best, M. J., Chakravarti, N., and Ubhaya, V. A · 2000
Earlier work this paper cites.
Order statistics
David, H. A. and Nagaraja, H. N · 2004
Earlier work this paper cites.
Robust regression and outlier detection , volume 589
Rousseeuw, P. J. and Leroy, A. M · 2005
Earlier work this paper cites.
Label ranking by learning pairwise preferences
Hüllermeier, E., Fürnkranz, J., Cheng, W., and Brinker, K · 2008
Earlier work this paper cites.
Softrank: optimizing non-smooth rank metrics
Taylor, M., Guiver, J., Robertson, S., and Minka, T · 2008
Earlier work this paper cites.
Lectures on polytopes , volume 152
Ziegler, G. M · 2008
Earlier work this paper cites.
Decision tree and instance-based learning for label ranking
Cheng, W., Hühn, J., and Hüllermeier, E · 2009
Earlier work this paper cites.
Gradient descent optimization of smoothed information retrieval metrics
Chapelle, O. and Wu, M · 2010
Cited alongside, same era.
A general approximation framework for direct optimization of information retrieval measures
Qin, T., Liu, T.-Y., and Li, H · 2010
Cited alongside, same era.
Ranking via sinkhorn propagation
Adams, R. P. and Zemel, R. S · 2011
Cited alongside, same era.
LIBSVM datasets , 2011
Fan, R.-E. and Lin, C.-J · 2011
Cited alongside, same era.
Scikit-learn: Machine learning in Python
Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., Vanderplas, J., Passos, A., Cournapeau, D., Brucher, M., Perrot, M., and Duchesnay, E · 2011
Cited alongside, same era.
Online linear optimization over permutations
Loss functions for top-k error: Analysis and insights
Lapin, M., Hein, M., and Schiele, B · 2016
Later among the works it cites.
Efficient bregman projections onto the permutahedron and related polytopes
Lim, C. H. and Wright, S. J · 2016
Later among the works it cites.
From softmax to sparsemax: A sparse model of attention and multi-label classification
Martins, A. F. and Astudillo, R. F · 2016
Later among the works it cites.
Differentiable learning of submodular models
Djolonga, J. and Krause, A · 2017
Later among the works it cites.
Computational Optimal Transport
Peyré, G. and Cuturi, M · 2017
Later among the works it cites.
A structured prediction approach for label ranking
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Yasutake, S., Hatano, K., Kijima, S., Takimoto, E., and Takeda, M · 2011
Cited alongside, same era.
Online prediction under submodular constraints
Suehiro, D., Hatano, K., Kijima, S., Takimoto, E., and Nagano, K · 2012
Cited alongside, same era.
Learning with submodular functions: A convex optimization perspective
Bach, F · 2013
Cited alongside, same era.
Sinkhorn distances: Lightspeed computation of optimal transport
Cuturi, M · 2013
Cited alongside, same era.
Adam: A method for stochastic optimization
Kingma, D. P. and Ba, J · 2014
Cited alongside, same era.
Orbit regularization
Negrinho, R. and Martins, A · 2014
Cited alongside, same era.
The ordered weighted ℓ 1 \ell_{1} norm: Atomic formulation and conditional gradient algorithm
Zeng, X. and Figueiredo, M. A · 2015
Cited alongside, same era.
Korba, A., Garcia, A., and d’Alché Buc, F · 2018
Later among the works it cites.
Deep Learning est mort. Vive Differentiable Programming! , 2018
LeCun, Y · 2018
Later among the works it cites.
SparseMAP: Differentiable sparse structured inference
Niculae, V., Martins, A. F., Blondel, M., and Cardie, C · 2018
Later among the works it cites.
Structured prediction with projection oracles
Blondel, M · 2019
Later among the works it cites.
Learning classifiers with Fenchel-Young losses: Generalized entropies, margins, and algorithms
Blondel, M., Martins, A. F., and Niculae, V · 2019
Later among the works it cites.
Learning with Fenchel-Young losses
Blondel, M., Martins, A. F., and Niculae, V · 2019
Later among the works it cites.
Differentiable ranking and sorting using optimal transport
Cuturi, M., Teboul, O., and Vert, J.-P · 2019
Later among the works it cites.
Stochastic optimization of sorting networks via continuous relaxations
Grover, A., Wang, E., Zweig, A., and Ermon, S · 2019
Later among the works it cites.
Optimizing rank-based metrics with blackbox differentiation
Rolínek, M., Musil, V., Paulus, A., Vlastelica, M., Michaelis, C., and Martius, G · 2020
Closest in time.