{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:6K5MYH4VDRXF4XVFFQ5SHKIINI","short_pith_number":"pith:6K5MYH4V","schema_version":"1.0","canonical_sha256":"f2bacc1f951c6e5e5ea52c3b23a9086a3234a23d05f724117d0b405a5bde2e40","source":{"kind":"arxiv","id":"2109.12004","version":3},"attestation_state":"computed","paper":{"title":"Entropic estimation of optimal transport maps","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Aram-Alexandre Pooladian, Jonathan Niles-Weed","submitted_at":"2021-09-24T14:57:26Z","abstract_excerpt":"We develop a computationally tractable method for estimating the optimal map between two distributions over $\\mathbb{R}^d$ with rigorous finite-sample guarantees. Leveraging an entropic version of Brenier's theorem, we show that our estimator -- the \\emph{barycentric projection} of the optimal entropic plan -- is easy to compute using Sinkhorn's algorithm. As a result, unlike current approaches for map estimation, which are slow to evaluate when the dimension or number of samples is large, our approach is parallelizable and extremely efficient even for massive data sets. Under smoothness assum"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2109.12004","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2021-09-24T14:57:26Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"1a4f1ee7cd71f18437b06c901c44e3e07c4a7b9a530ea5ff2942820a49e483d3","abstract_canon_sha256":"c3579ffa8cd084709025221808d6cf34c2e85377164167872d64b525f46f1fe2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:17:53.710910Z","signature_b64":"JI5FhUZBiQM8FiuKT3pV6roYnFBpcuTcqZmqZMZibIpVG6FYkt0CgWE6h7JDCzCYh/4AmmlJN3L7/4jMbiKHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2bacc1f951c6e5e5ea52c3b23a9086a3234a23d05f724117d0b405a5bde2e40","last_reissued_at":"2026-07-05T08:17:53.710476Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:17:53.710476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Entropic estimation of optimal transport maps","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Aram-Alexandre Pooladian, Jonathan Niles-Weed","submitted_at":"2021-09-24T14:57:26Z","abstract_excerpt":"We develop a computationally tractable method for estimating the optimal map between two distributions over $\\mathbb{R}^d$ with rigorous finite-sample guarantees. Leveraging an entropic version of Brenier's theorem, we show that our estimator -- the \\emph{barycentric projection} of the optimal entropic plan -- is easy to compute using Sinkhorn's algorithm. As a result, unlike current approaches for map estimation, which are slow to evaluate when the dimension or number of samples is large, our approach is parallelizable and extremely efficient even for massive data sets. Under smoothness assum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.12004","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.12004/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2109.12004","created_at":"2026-07-05T08:17:53.710530+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.12004v3","created_at":"2026-07-05T08:17:53.710530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.12004","created_at":"2026-07-05T08:17:53.710530+00:00"},{"alias_kind":"pith_short_12","alias_value":"6K5MYH4VDRXF","created_at":"2026-07-05T08:17:53.710530+00:00"},{"alias_kind":"pith_short_16","alias_value":"6K5MYH4VDRXF4XVF","created_at":"2026-07-05T08:17:53.710530+00:00"},{"alias_kind":"pith_short_8","alias_value":"6K5MYH4V","created_at":"2026-07-05T08:17:53.710530+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":19,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.23383","citing_title":"Near-Lipschitz stability of the Kim--Milman flow map","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2606.10767","citing_title":"Two-Sample Homogeneity Test via Entropic Optimal Transport","ref_index":60,"is_internal_anchor":false},{"citing_arxiv_id":"2606.07325","citing_title":"A Temporal Spatial Minimax Rate for Smoothly-Varying Distributions in Wasserstein Space","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2606.04683","citing_title":"Minimax Private Estimation of Smooth Optimal-Transport Maps","ref_index":88,"is_internal_anchor":false},{"citing_arxiv_id":"2605.24644","citing_title":"Quadratically Regularized Optimal Transport: Localization Bounds and Affine Case Analysis","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27694","citing_title":"Likelihood-Free Inference for Multivariate Generalized Pareto Models","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2606.00514","citing_title":"Generate in Reconstruction Space, Match in Semantic Space: Transport Geometry for One-Step Generation","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2304.04451","citing_title":"Quantitative contraction rates for Sinkhorn's algorithm: beyond bounded costs and compact marginals","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2412.12007","citing_title":"The entropic optimal (self-)transport problem: Limit distributions for decreasing regularization with application to score function estimation","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2602.03067","citing_title":"FlashSinkhorn: IO-Aware Entropic Optimal Transport on GPU","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2505.24384","citing_title":"Provably convergent stochastic fixed-point algorithm for free-support Wasserstein barycenter of continuous non-parametric measures","ref_index":69,"is_internal_anchor":false},{"citing_arxiv_id":"2511.01154","citing_title":"Stability of the Kim--Milman flow map","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2603.28910","citing_title":"Input-to-State Stability of Gradient Flows in Distributional Space","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11944","citing_title":"Generative Transfer for Entropic Optimal Transport with Unknown Costs","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26942","citing_title":"Hyper Input Convex Neural Networks for Shape Constrained Learning and Optimal Transport","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08705","citing_title":"Minimax Optimal Estimation of Transport-Growth Pairs in Unbalanced Optimal Transport","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22670","citing_title":"Curvature of optimal transport with respect to the cost and applications to inverse optimal transport","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22366","citing_title":"Statistical Estimation of Monge Transport Maps via Brenier Potentials","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21578","citing_title":"Entropic regularization of Monge's problem","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6K5MYH4VDRXF4XVFFQ5SHKIINI","json":"https://pith.science/pith/6K5MYH4VDRXF4XVFFQ5SHKIINI.json","graph_json":"https://pith.science/api/pith-number/6K5MYH4VDRXF4XVFFQ5SHKIINI/graph.json","events_json":"https://pith.science/api/pith-number/6K5MYH4VDRXF4XVFFQ5SHKIINI/events.json","paper":"https://pith.science/paper/6K5MYH4V"},"agent_actions":{"view_html":"https://pith.science/pith/6K5MYH4VDRXF4XVFFQ5SHKIINI","download_json":"https://pith.science/pith/6K5MYH4VDRXF4XVFFQ5SHKIINI.json","view_paper":"https://pith.science/paper/6K5MYH4V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.12004&json=true","fetch_graph":"https://pith.science/api/pith-number/6K5MYH4VDRXF4XVFFQ5SHKIINI/graph.json","fetch_events":"https://pith.science/api/pith-number/6K5MYH4VDRXF4XVFFQ5SHKIINI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6K5MYH4VDRXF4XVFFQ5SHKIINI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6K5MYH4VDRXF4XVFFQ5SHKIINI/action/storage_attestation","attest_author":"https://pith.science/pith/6K5MYH4VDRXF4XVFFQ5SHKIINI/action/author_attestation","sign_citation":"https://pith.science/pith/6K5MYH4VDRXF4XVFFQ5SHKIINI/action/citation_signature","submit_replication":"https://pith.science/pith/6K5MYH4VDRXF4XVFFQ5SHKIINI/action/replication_record"}},"created_at":"2026-07-05T08:17:53.710530+00:00","updated_at":"2026-07-05T08:17:53.710530+00:00"}