{"id":"https://openalex.org/W7125797193","doi":"https://doi.org/10.48550/arxiv.2601.17196","title":"Accelerated Sinkhorn Algorithms for Partial Optimal Transport","display_name":"Accelerated Sinkhorn Algorithms for Partial Optimal Transport","publication_year":2026,"publication_date":"2026-01-23","ids":{"openalex":"https://openalex.org/W7125797193","doi":"https://doi.org/10.48550/arxiv.2601.17196"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2601.17196","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5123965617","display_name":"Nghia Thu Truong","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Truong, Nghia Thu","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123921521","display_name":"Qui Phu Pham","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pham, Qui Phu","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123908586","display_name":"Quang Nguyen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nguyen, Quang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5124046170","display_name":"Dung Luong","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Luong, Dung","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5124014675","display_name":"Mai Tran","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tran, Mai","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5123965617"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.34150001406669617,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.34150001406669617,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13362","display_name":"Slime Mold and Myxomycetes Research","score":0.08060000091791153,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.06030000001192093,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.6496000289916992},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6164000034332275},{"id":"https://openalex.org/keywords/acceleration","display_name":"Acceleration","score":0.49000000953674316},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.4146000146865845},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3971000015735626},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.322299987077713}],"concepts":[{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.6496000289916992},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6164000034332275},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5270000100135803},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.513700008392334},{"id":"https://openalex.org/C117896860","wikidata":"https://www.wikidata.org/wiki/Q11376","display_name":"Acceleration","level":2,"score":0.49000000953674316},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43560001254081726},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.4146000146865845},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3971000015735626},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3889000117778778},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.322299987077713},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3059999942779541},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.29510000348091125},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2948000133037567},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.2750999927520752},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2508000135421753}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2601.17196","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2601.17196","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.17196","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2601.17196","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Partial":[0],"Optimal":[1],"Transport":[2],"(POT)":[3],"addresses":[4],"the":[5,13,62,78,85,98],"problem":[6],"of":[7,12,68,77,101],"transporting":[8],"only":[9],"a":[10,66],"fraction":[11],"total":[14],"mass":[15],"between":[16],"two":[17],"distributions,":[18],"making":[19],"it":[20],"suitable":[21],"when":[22],"marginals":[23],"have":[24],"unequal":[25],"size":[26],"or":[27],"contain":[28],"outliers.":[29],"While":[30],"Sinkhorn-based":[31],"methods":[32],"are":[33],"widely":[34],"used,":[35],"their":[36],"complexity":[37,67],"bounds":[38],"for":[39,51,84],"POT":[40,52,63],"remain":[41],"suboptimal":[42],"and":[43,96],"can":[44],"limit":[45],"scalability.":[46],"We":[47,70],"introduce":[48],"Accelerated":[49],"Sinkhorn":[50,87],"(ASPOT),":[53],"which":[54],"integrates":[55],"alternating":[56],"minimization":[57],"with":[58],"Nesterov-style":[59],"acceleration":[60],"in":[61],"setting,":[64],"yielding":[65],"$\\mathcal{O}(n^{7/3}\\varepsilon^{-5/3})$.":[69],"also":[71],"show":[72],"that":[73],"an":[74],"informed":[75],"choice":[76],"entropic":[79],"parameter":[80],"$\u03b3$":[81],"improves":[82],"rates":[83],"classical":[86],"method.":[88],"Experiments":[89],"on":[90],"real-world":[91],"applications":[92],"validate":[93],"our":[94,102],"theories":[95],"demonstrate":[97],"favorable":[99],"performance":[100],"proposed":[103],"methods.":[104]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-01-28T00:00:00"}