Utility/privacy trade-off as regularized optimal transport
From MaRDI portal
Publication:6201932
DOI10.1007/s10107-022-01811-warXiv1905.11148OpenAlexW4224234110MaRDI QIDQ6201932
Vianney Perchet, Etienne Boursier
Publication date: 21 February 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.11148
Applications of mathematical programming (90C90) Privacy of data (68P27) Optimal transportation (49Q22) Games with incomplete information, Bayesian games (91A27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- First-order methods of smooth convex optimization with inexact oracle
- A Lagrangian scheme à la Brenier for the incompressible Euler equations
- Signature classes of transportation polytopes
- Discretization of functionals involving the Monge-Ampère operator
- Fast homomorphic evaluation of deep discretized neural networks
- Subgradient methods for saddle-point problems
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC programming: overview.
- Coordinate descent algorithms
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Introduction to nonlinear and global optimization
- Global Optimization with Polynomials and the Problem of Moments
- Introduction to Global Optimization Exploiting Space-Filling Curves
- Local Matching Indicators for Transport Problems with Concave Costs
- Algorithms for the Assignment and Transportation Problems
- The Sinkhorn–Knopp Algorithm: Convergence and Applications
- On the Foundations of Quantitative Information Flow
- Some comments on Wolfe's ‘away step’
- Transportation problems which can be solved by the use of hirsch-paths for the dual problems
- The Variational Formulation of the Fokker--Planck Equation
- Business Cycle Dynamics under Rational Inattention
- Theoretical Insights Into the Optimization Landscape of Over-Parameterized Shallow Neural Networks
- Hybrid Block Successive Approximation for One-Sided Non-Convex Min-Max Problems: Algorithms and Applications
- Lagrangian Discretization of Crowd Motion and Linear Diffusion
- Distance makes the types grow stronger
- Minimal Geodesics Along Volume-Preserving Maps, Through Semidiscrete Optimal Transport
- Diagonal Equivalence to Matrices with Prescribed Row and Column Sums
- An introduction to continuous optimization for imaging
- Theory of Cryptography
- Introduction to global optimization.
This page was built for publication: Utility/privacy trade-off as regularized optimal transport