Fetching the paper…
Reading the bibliography…
Strategic information is valuable either by remaining private (for instance if it is sensitive) or, on the other hand, by being used publicly to increase some utility.
On measures of entropy and information
A. Rényi · 1961
Earlier work this paper cites.
Diagonal equivalence to matrices with prescribed row and column sums
R. Sinkhorn · 1967
Earlier work this paper cites.
Repeated games with incomplete information
R. Aumann, M. Maschler, and R. Stearns · 1995
Earlier work this paper cites.
Convex analysis approach to DC programming: Theory, algorithms and applications
P. Tao and L. An · 1997
Earlier work this paper cites.
DC programming: overview
R. Horst and N. Thoai · 1999
Earlier work this paper cites.
Introduction to global optimization
R. Horst, P. Pardalos, and N. V. Thoai · 2000
Earlier work this paper cites.
Global optimization with polynomials and the problem of moments
J. Lasserre · 2001
Earlier work this paper cites.
Implications of rational inattention
C. Sims · 2003
Earlier work this paper cites.
Convex optimization
S. Boyd and L. Vandenberghe · 2004
Earlier work this paper cites.
Measuring anonymity revisited
G. Tóth, Z. Hornák, and F. Vajda · 2004
Earlier work this paper cites.
Calibrating noise to sensitivity in private data analysis
C. Dwork, F. McSherry, K. Nissim, and A. Smith · 2006
Earlier work this paper cites.
The sinkhorn–knopp algorithm: convergence and applications
P. Knight · 2008
Earlier work this paper cites.
Optimal transport: old and new , volume 338
C. Villani · 2008
Earlier work this paper cites.
On the foundations of quantitative information flow
G. Smith · 2009
Earlier work this paper cites.
Distance makes the types grow stronger: a calculus for differential privacy
J. Reed and B. Pierce · 2010
Earlier work this paper cites.
Differential privacy
C. Dwork · 2011
Cited alongside, same era.
Learning prices for repeated auctions with strategic buyers
K. Amin, A. Rostamizadeh, and U. Syed · 2013
Cited alongside, same era.
Sinkhorn distances: Lightspeed computation of optimal transport
M. Cuturi · 2013
Cited alongside, same era.
Repeated contextual auctions with strategic buyers
K. Amin, A. Rostamizadeh, and U. Syed · 2014
Cited alongside, same era.
Domain adaptation with regularized optimal transport
N. Courty, R. Flamary, and D. Tuia · 2014
Cited alongside, same era.
Learning with a Wasserstein loss
C. Frogner, C. Zhang, H. Mobahi, M. Araya-Polo, and T. Poggio · 2015
Cited alongside, same era.
Business cycle dynamics under rational inattention
Wasserstein generative adversarial networks
M. Arjovsky, S. Chintala, and L. Bottou · 2017
Later among the works it cites.
Rényi differential privacy
I. Mironov · 2017
Later among the works it cites.
Fast homomorphic evaluation of deep discretized neural networks
F. Bourse, M. Minelli, M. Minihold, and P. Paillier · 2018
Later among the works it cites.
Learning generative models with sinkhorn divergences
A. Genevay, G. Peyre, and M. Cuturi · 2018
Later among the works it cites.
Differential properties of sinkhorn approximation for learning with wasserstein distance
G. Luise, A. Rudi, M. Pontil, and C. Ciliberto · 2018
Later among the works it cites.
Improving gans using optimal transport
T. Salimans, D. Metaxas, H. Zhang, and A. Radford · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
B. Maćkowiak and M. Wiederholt · 2015
Cited alongside, same era.
Rational inattention to discrete choices: A new foundation for the multinomial logit model
F. Matějka and A. McKay · 2015
Cited alongside, same era.
Optimal transport for applied mathematicians
F. Santambrogio · 2015
Cited alongside, same era.
S. Wright · 2015
Cited alongside, same era.
Online pricing with strategic and patient buyers
M. Feldman, T. Koren, R. Livni, Y. Mansour, and A. Zohar · 2016
Cited alongside, same era.
Stochastic optimization for large-scale optimal transport
A. Genevay, M. Cuturi, G. Peyré, and F. Bach · 2016
Cited alongside, same era.
Tapas: Tricks to accelerate (encrypted) prediction as a service
A. Sanyal, M. Kusner, A. Gascon, and V. Kanade · 2018
Later among the works it cites.
Capacity bounded differential privacy
K. Chaudhuri, J. Imola, and A. Machanavajjhala · 2019
Closest in time.
Optimal Privacy-Constrained Mechanisms
R. Eilat, K. Eliaz, and X. Mu · 2019
Closest in time.
Interpolating between optimal transport and mmd using sinkhorn divergences
J. Feydy, T. Séjourné, F.-X. Vialard, S. i. Amari, A. Trouve, and G. Peyré · 2019
Closest in time.
Sample complexity of sinkhorn divergences
A. Genevay, L. Chizat, F. Bach, M. Cuturi, and G. Peyré · 2019
Closest in time.
Dynamic incentive-aware learning: Robust pricing in contextual auctions
N. Golrezaei, A. Javanmard, and V. Mirrokni · 2019
Closest in time.
Learning to bid in revenue-maximizing auctions
T. Nedelec, N. E. Karoui, and V. Perchet · 2019
Closest in time.
Computational optimal transport
G. Peyré and M. Cuturi · 2019
Closest in time.