arXiv (All)
open access
Optimal Transport with Cyclic Symmetry
We propose novel fast algorithms for optimal transport (OT) utilizing a cyclic symmetry structure of input data. Such OT with cyclic symmetry appears universally in various real-world examples: image processing, urban planning, and graph processing. Our main idea is to reduce OT to a small optimizat
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- From Mixing to Tearing: Graph Decomposition in Decentralized Optimization via Message Passing#1188420
- From Mixing to Tearing: Graph Decomposition in Decentralized Optimization via Message Passing#1181622
- PC-Diffuser: Path-Consistent Capsule CBF Safety Filtering for Diffusion-Based Trajectory Planner#1216253
- InfoOT: Information Maximizing Optimal Transport#643861
- A Decomposition-Based Data-Driven Branch-and-Bound Approach for Black-Box Global Optimization#1355457
Record · ID 1217232
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive