dorsal/arxiv
View SchemaMatch Made with Matrix Completion: Efficient Learning under Matching Interference
| Authors | Zhiyuan Tang, Wanning Chen, Kan Xu |
|---|---|
| Categories | |
| ArXiv ID | 2601.06982vv1 |
| URL | https://arxiv.org/abs/2601.06982 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
Matching markets face increasing needs to learn the matching qualities between demand and supply for effective design of matching policies. In practice, the matching rewards are high-dimensional due to the growing diversity of participants. We leverage a natural low-rank matrix structure of the matching rewards in these two-sided markets, and propose to utilize matrix completion to accelerate reward learning with limited offline data. A unique property for matrix completion in this setting is that the entries of the reward matrix are observed with matching interference -- i.e., the entries are not observed independently but dependently due to matching or budget constraints. Such matching dependence renders unique technical challenges, such as sub-optimality or inapplicability of the existing analytical tools in the matrix completion literature, since they typically rely on sample independence. In this paper, we first show that standard nuclear norm regularization remains theoretically effective under matching interference. We provide a near-optimal Frobenius norm guarantee in this setting, coupled with a new analytical technique. Next, to guide certain matching decisions, we develop a novel ``double-enhanced'' estimator, based off the nuclear norm estimator, with a near-optimal entry-wise guarantee. Our double-enhancement procedure can apply to broader sampling schemes even with dependence, which may be of independent interest. Additionally, we extend our approach to online learning settings with matching constraints such as optimal matching and stable matching, and present improved regret bounds in matrix dimensions. Finally, we demonstrate the practical value of our methods using both synthetic data and real data of labor markets.
{
"annotation_id": "616f8df3-25bd-431b-a8aa-37a8c1fd74cb",
"date_created": "2026-02-17T05:53:08.516000Z",
"date_modified": "2026-02-17T05:53:08.516000Z",
"file_hash": "2114060971382fbcd2134774a8180c53488bdde7cf5ab74cd4e139280d69ca9f",
"private": false,
"record": {
"abstract": "Matching markets face increasing needs to learn the matching qualities between demand and supply for effective design of matching policies. In practice, the matching rewards are high-dimensional due to the growing diversity of participants. We leverage a natural low-rank matrix structure of the matching rewards in these two-sided markets, and propose to utilize matrix completion to accelerate reward learning with limited offline data. A unique property for matrix completion in this setting is that the entries of the reward matrix are observed with matching interference -- i.e., the entries are not observed independently but dependently due to matching or budget constraints. Such matching dependence renders unique technical challenges, such as sub-optimality or inapplicability of the existing analytical tools in the matrix completion literature, since they typically rely on sample independence. In this paper, we first show that standard nuclear norm regularization remains theoretically effective under matching interference. We provide a near-optimal Frobenius norm guarantee in this setting, coupled with a new analytical technique. Next, to guide certain matching decisions, we develop a novel ``double-enhanced\u0027\u0027 estimator, based off the nuclear norm estimator, with a near-optimal entry-wise guarantee. Our double-enhancement procedure can apply to broader sampling schemes even with dependence, which may be of independent interest. Additionally, we extend our approach to online learning settings with matching constraints such as optimal matching and stable matching, and present improved regret bounds in matrix dimensions. Finally, we demonstrate the practical value of our methods using both synthetic data and real data of labor markets.",
"arxiv_id": "2601.06982",
"authors": [
"Zhiyuan Tang",
"Wanning Chen",
"Kan Xu"
],
"categories": [
"stat.ML",
"cs.LG"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "Match Made with Matrix Completion: Efficient Learning under Matching Interference",
"url": "https://arxiv.org/abs/2601.06982",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "66f733b1-3c38-4695-bd51-b016ce105786",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}