{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VXXCVLGF5XEGFKQZVM2OVNPPIW","short_pith_number":"pith:VXXCVLGF","schema_version":"1.0","canonical_sha256":"adee2aacc5edc862aa19ab34eab5ef45bc82d88a59954b1d2b799a98863736df","source":{"kind":"arxiv","id":"1905.10155","version":2},"attestation_state":"computed","paper":{"title":"Concentration bounds for linear Monge mapping estimation and optimal transport domain adaptation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Andr\\'e Ferrari, Karim Lounici, R\\'emi Flamary","submitted_at":"2019-05-24T11:31:34Z","abstract_excerpt":"This article investigates the quality of the estimator of the linear Monge mapping between distributions. We provide the first concentration result on the linear mapping operator and prove a sample complexity of $n^{-1/2}$ when using empirical estimates of first and second order moments. This result is then used to derive a generalization bound for domain adaptation with optimal transport. As a consequence, this method approaches the performance of theoretical Bayes predictor under mild conditions on the covariance structure of the problem. We also discuss the computational complexity of the l"},"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":"1905.10155","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-24T11:31:34Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"79c1a8b54f33243bb9c6de7c475f76232697ab9950b9e28d9e2e480e4daab48f","abstract_canon_sha256":"2d150a330898b8b6ca497a701777dc207a4dbef0bfa9b79fce6a0c5553b8ba4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:55:27.491610Z","signature_b64":"zioqn1SbMEHndmx1CQKM6z6cABX4gRloYPKx1KPCUikQ1s9Kfqkq+Wfb5uZciPcLW8UBQ0K7yP6bu24M5nAyDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adee2aacc5edc862aa19ab34eab5ef45bc82d88a59954b1d2b799a98863736df","last_reissued_at":"2026-07-05T01:55:27.491232Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:55:27.491232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Concentration bounds for linear Monge mapping estimation and optimal transport domain adaptation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Andr\\'e Ferrari, Karim Lounici, R\\'emi Flamary","submitted_at":"2019-05-24T11:31:34Z","abstract_excerpt":"This article investigates the quality of the estimator of the linear Monge mapping between distributions. We provide the first concentration result on the linear mapping operator and prove a sample complexity of $n^{-1/2}$ when using empirical estimates of first and second order moments. This result is then used to derive a generalization bound for domain adaptation with optimal transport. As a consequence, this method approaches the performance of theoretical Bayes predictor under mild conditions on the covariance structure of the problem. We also discuss the computational complexity of the l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10155","kind":"arxiv","version":2},"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/1905.10155/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":"1905.10155","created_at":"2026-07-05T01:55:27.491282+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.10155v2","created_at":"2026-07-05T01:55:27.491282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10155","created_at":"2026-07-05T01:55:27.491282+00:00"},{"alias_kind":"pith_short_12","alias_value":"VXXCVLGF5XEG","created_at":"2026-07-05T01:55:27.491282+00:00"},{"alias_kind":"pith_short_16","alias_value":"VXXCVLGF5XEGFKQZ","created_at":"2026-07-05T01:55:27.491282+00:00"},{"alias_kind":"pith_short_8","alias_value":"VXXCVLGF","created_at":"2026-07-05T01:55:27.491282+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"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":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VXXCVLGF5XEGFKQZVM2OVNPPIW","json":"https://pith.science/pith/VXXCVLGF5XEGFKQZVM2OVNPPIW.json","graph_json":"https://pith.science/api/pith-number/VXXCVLGF5XEGFKQZVM2OVNPPIW/graph.json","events_json":"https://pith.science/api/pith-number/VXXCVLGF5XEGFKQZVM2OVNPPIW/events.json","paper":"https://pith.science/paper/VXXCVLGF"},"agent_actions":{"view_html":"https://pith.science/pith/VXXCVLGF5XEGFKQZVM2OVNPPIW","download_json":"https://pith.science/pith/VXXCVLGF5XEGFKQZVM2OVNPPIW.json","view_paper":"https://pith.science/paper/VXXCVLGF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.10155&json=true","fetch_graph":"https://pith.science/api/pith-number/VXXCVLGF5XEGFKQZVM2OVNPPIW/graph.json","fetch_events":"https://pith.science/api/pith-number/VXXCVLGF5XEGFKQZVM2OVNPPIW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VXXCVLGF5XEGFKQZVM2OVNPPIW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VXXCVLGF5XEGFKQZVM2OVNPPIW/action/storage_attestation","attest_author":"https://pith.science/pith/VXXCVLGF5XEGFKQZVM2OVNPPIW/action/author_attestation","sign_citation":"https://pith.science/pith/VXXCVLGF5XEGFKQZVM2OVNPPIW/action/citation_signature","submit_replication":"https://pith.science/pith/VXXCVLGF5XEGFKQZVM2OVNPPIW/action/replication_record"}},"created_at":"2026-07-05T01:55:27.491282+00:00","updated_at":"2026-07-05T01:55:27.491282+00:00"}