Cover Image

Many-to-Many Matching via Sparsity Controlled Optimal Transport

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Liu, Weijie, Bao, Han, Yamada, Makoto, Huang, Zenan, Zheng, Nenggan, Qian, Hui
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Learning Structured Representations by Embedding Class Hierarchy with Fast Optimal Transport
by: Zeng, Siqi, et al.
Published: (2024)

Many-Objective Multi-Solution Transport
by: Li, Ziyue, et al.
Published: (2024)

Efficient Identification of Critical Transitions via Flow Matching: A Scalable Generative Approach for Many-Body Systems
by: Lee, Qian-Rui, et al.
Published: (2025)

Diffusion Language Models Can Perform Many Tasks with Scaling and Instruction-Finetuning
by: Ye, Jiasheng, et al.
Published: (2023)

Regularized Offline Policy Optimization with Posterior Hybrid Bayesian Belief
by: Lin, Hongqiang, et al.
Published: (2026)

Many-vs-Many Missile Guidance via Virtual Targets
by: Schneider, Marc, et al.
Published: (2025)

LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport
by: Liu, Yanbin, et al.
Published: (2019)

A Flow Matching Algorithm for Many-Shot Adaptation to Unseen Distributions
by: Ingebrand, Tyler, et al.
Published: (2026)

Unified Microphone Conversion: Many-to-Many Device Mapping via Feature-wise Linear Modulation
by: Ryu, Myeonghoon, et al.
Published: (2024)

Towards Compute-Optimal Many-Shot In-Context Learning
by: Golchin, Shahriar, et al.
Published: (2025)

Nearly Instance-Optimal Parameter Recovery from Many Trajectories via Hellinger Localization
by: Shekhtman, Eliot, et al.
Published: (2025)

PhiNets: Brain-inspired Non-contrastive Learning Based on Temporal Prediction Hypothesis
by: Ishikawa, Satoki, et al.
Published: (2024)

The Many Faces of Optimal Weak-to-Strong Learning
by: Høgsgaard, Mikael Møller, et al.
Published: (2024)

From Few to Many: Self-Improving Many-Shot Reasoners Through Iterative Optimization and Generation
by: Wan, Xingchen, et al.
Published: (2025)

Improved Bandits in Many-to-one Matching Markets with Incentive Compatibility
by: Kong, Fang, et al.
Published: (2024)

A Theoretical Formulation of Many-body Message Passing Neural Networks
by: Han, Jiatong
Published: (2024)

Learning Partial Graph Matching via Optimal Partial Transport
by: Ratnayaka, Gathika, et al.
Published: (2024)

OMH: Structured Sparsity via Optimally Matched Hierarchy for Unsupervised Semantic Segmentation
by: Ozaydin, Baran, et al.
Published: (2024)

Few for Many: Tchebycheff Set Scalarization for Many-Objective Optimization
by: Lin, Xi, et al.
Published: (2024)

Predicting Many Crystal Properties via an Adaptive Transformer-based Framework
by: Xu, Haosheng, et al.
Published: (2024)

On Unbalanced Optimal Transport: Gradient Methods, Sparsity and Approximation Error
by: Nguyen, Quang Minh, et al.
Published: (2022)

Evaluating the Unseen Capabilities: How Many Theorems Do LLMs Know?
by: Li, Xiang, et al.
Published: (2025)

Star Elastic: Many-in-One Reasoning LLMs with Efficient Budget Control
by: Taghibakhshi, Ali, et al.
Published: (2026)

How Many Domains Suffice for Domain Generalization? A Tight Characterization via the Domain Shattering Dimension
by: Dwork, Cynthia, et al.
Published: (2025)

Structured Matching via Cost-Regularized Unbalanced Optimal Transport
by: Pardini, Emanuele, et al.
Published: (2025)

Diagonal Symmetrization of Neural Network Solvers for the Many-Electron Schrödinger Equation
by: Huang, Kevin Han, et al.
Published: (2025)

Pairing Regularization for Mitigating Many-to-One Collapse in GANs
by: Lin, Kuan-Yu, et al.
Published: (2026)

How Many Experts Are Enough? Towards Optimal Semantic Specialization for Mixture-of-Experts
by: Park, Sumin, et al.
Published: (2025)

Neural Pfaffians: Solving Many Many-Electron Schrödinger Equations
by: Gao, Nicholas, et al.
Published: (2024)

Towards Pre-trained Graph Condensation via Optimal Transport
by: Yan, Yeyu, et al.
Published: (2025)

On the Equivalence of Optimal Transport Problem and Action Matching with Optimal Vector Fields
by: Kornilov, Nikita, et al.
Published: (2025)

Necessary and Sufficient Watermark for Large Language Models
by: Takezawa, Yuki, et al.
Published: (2023)

Parameter-free Clipped Gradient Descent Meets Polyak
by: Takezawa, Yuki, et al.
Published: (2024)

Neural Importance Sampling of Many Lights
by: Figueiredo, Pedro, et al.
Published: (2025)

POMONAG: Pareto-Optimal Many-Objective Neural Architecture Generator
by: Lomurno, Eugenio, et al.
Published: (2024)

SAMSA: Efficient Transformer for Many Data Modalities
by: Lenhat, Minh, et al.
Published: (2024)

Convergence Rates for Distribution Matching with Sliced Optimal Transport
by: Thurin, Gauthier, et al.
Published: (2026)

FeatAug: Automatic Feature Augmentation From One-to-Many Relationship Tables
by: Qi, Danrui, et al.
Published: (2024)

One4Many-StablePacker: An Efficient Deep Reinforcement Learning Framework for the 3D Bin Packing Problem
by: Gao, Lei, et al.
Published: (2025)

Exploring "Many in Few" and "Few in Many" Properties in Long-Tailed, Highly-Imbalanced IC Defect Classification
by: Shao, Hao-Chiang, et al.
Published: (2025)