Stochastic Matching Bandits under Preference Feedback
Matching bandits;Preference Feedback
Yes
No ethics review needed.
• Can you further explain the $\pi$ in exploration step and how it affects the regret analyis?   
• Tight regret bound is claimed for Thm 1. How does the regret bound compare to other matching bandit problem and is there a lower bound case?   
• Outside option is considered in the paper. How about collision such that two arm choose the same agent?   
• Please, see weaknesses and further elaborate on those points.
This paper fills an important gap in existing matching bandit literature that considers arm behavior as deterministic. It is indeed important in real world applications to not only focus on maximizing the likelihood of successful matches, but also learning arm preferences.
The paper develops an elimination-based algorithm to solve the stochastic matching bandit problem that can be divided into three phases, estimation, elimination and exploration. Detailed theory and proof is provided to prove the algorithm regret upper bound. The authors also discussed the computational complexity by optimization using $\alpha$-approximation oracle.
This paper considers stochastic matching bandit that allows stochastic choice behaviors of arms and inclusion of outside options. Multinomial Logit (MNL) choice model with feature information is used to describe the unknown preferences of arms. The new bandit model has applications in ride-hailing services, online job markets and online labor markets. The goal is to maximize the likelihood of successful matches and learn the unknown arm preferences. The authors analyze the regret bound of an elimination-based algorithm. They show the regret bound achieves $\tilde{O}(K\sqrt{rKT})$ regret where r is the rank of feature space. The algorithm is shown to outperform two existing deterministic matching bandit algorithms via simulation experiments.
The important and practically relevant aspect of the setting is stochastic matching developed using MNL choice model with feature information. The powerfulness of the model is not demonstrated well. The experiment section assumes uniformly distributed features and does not cover the learning of arm performances. Theorem 1 is the key result for the paper. While detailed analysis is provided, it would be good to explain the key insights of the proof and clearly demonstrate how the three steps of the main stage contributes to the regret and which dominates the regret. Also, it will be good to have a full comparison of regret bounds and computational hardness with existing methods.
Yes
No ethics review needed.
See Weaknesses.
1. The proposed model introduces an innovative framework for matching bandits, featuring novel stochastic behaviour of the arm that enhances its functionality in real-world application.
2. In addition to SMB (Algorithm 1), the integration of Algorithm 3 significantly addresses and mitigates computational challenges.
This study introduces a stochastic matching bandit framework using the Multinomial Logit model with features. Agents are matched to arms, which stochastically choose agents or reject all. The goal is to minimize regret by maximizing successful matches.
1. While the dynamic stochastic model presented is interesting, the objective in the given setting appears somewhat unreasonable. Specifically, in Section 3, the objective is to maximize the expected number of successful matches without regard to specific assignment matches, only focusing on whether there are no empty slots for each arm. This raises questions about the role of the MNL model introduced. It seems incongruent to assume the model includes preference feedback (in Line 172) when the objective disregards the resulting preferences, focusing solely on the absence/presence of assignment.

2. The significance of Theorem 1 and Theorem 3 is not clear. Notably, the dependency of $ K \sqrt{K} $ in the regret bounds is unusual within the bandit literature, where a dependency of $ \sqrt{K} $ is typically observed in most other bandit papers. Is  $ K \sqrt{K} $  unavoidable in this setting? Providing a tightness analysis for Theorem 1 and Theorem 3 would be valuable in elucidating the significance of these theoretical results.

3. The use of Baseline algorithms (i.e., ETC-GS and UCB-GS) is not suitable, as they are designed for a very different objective. Unfortunately, I don't have a good recommendation for the baseline.
Yes
No ethics review needed.
Here are some of my quiestions.

1. It seems that there is a monotone property in your reward function, i.e., if we increase one arm's $x_n^T \theta_k$, the reward is increasing. Because of this, you can estimate the UCB and LCB by Eq. (2). So I am wondering what if we do not have such a monotone property? For example, in the case that each agent has its own score, and we want to maximize the average score (your case can be seen as the special one that the score is always 1). What can we do in this case? Also, are there any possible efficient approximate oracles in this case?

2. For the regret upper bound, we believe the factor of $T$ and $r$ are tight, then what about the other two factors? For the $K$ term, do we have a lower bound? Also, for the $\kappa$ term, there is a result that removes it in general linear model [1], could we use similar analysis to reduce it?

3. What's the exact value of $\alpha$ in your approximate version of the algorithm?


[1] Lee J, Yun S Y, Jun K S. A Unified Confidence Sequence for Generalized Linear Models, with Applications to Bandits[J]. arXiv preprint arXiv:2407.13977, 2024.
The new model setting is well-motivated.

I read some of the proofs and they seem to be correct.

The writting is easy to understand (though there are some typos).
This paper studies a new kind of matching bandit model, in which several agents are assigned to an arm, and the arm accepts one of them (or none of them) following an MNL setting. The goal is to maximize the matching probability. Under general linear structure, the authors propose an elimination-based algorithm called SMB, which achieves a regret upper bound of $\tilde{O}(\sqrt{dK^3T}/\kappa )$. They also propose an approximate-oracle version algorithm to achieve a similar approximate regret, and use experiments to demonstrate the effectiveness of their algorithm.
I think the primary contribution of this paper is proposing the new model setting. The contributions from the perspective of theoretical analysis seem limited, as they all follow the existing frameworks. 

The SMB algorithm is not efficient, and its approximate version needs to use $\alpha$-oracle, but can only obtain an sublinear $\alpha^2$-approxiamte regret upper bound.

Since the target and dynamics of the model is totally different with UCB-GS and ETC-GS, it is not really fair to compare with them.


Some minor typos:

- In Assumption 2, should it be $\inf_{||\theta||_2 \le 1}$?
- In Eq. (4), it should be $R^{LCB}$ but not $R^{LBC}$.
Yes
No ethics review needed.
- Explain and define X=U \sum V^T.  How you get these from the inputs to your algorithm.

- Why multinomial logit is not a restriction?  Since one needs to find the right values of \theta so as to match to any probabilitic distribution.  

- Can your algorithm handles time-varying preference in selecting agents?

- Authors need to do a more comprehensive benchmarking and evaluation by comparing with other MAB-matching works.
The strength in this paper, as far as I am concern, is in the writing.

The authors did a good job in presenting the previous and related works, as well as in presenting the mathematical models.

The proposed algorithm (e.g., elimination-based) as well as the alpha-approximation algorithm, as far as I am concerned, are really simple extension of some of the previous algorithms.

The technical proof looks correct, but then again, if one is familiar about MAB or matching MAB, many of the previous works also followed the same line/style in proving the regret bounds.
The aim of this paper is to study a stochastic matching problem with multinomial logit choices in selecting agents.

The authors consider a model that has N agents with K arms. Each agent n as a d-dimensional feature vector, while each arm k has a d-dimensional latent vector \theta_k.  In each period, the algorithm assign some agents to an arm.  Each arm will probabilistically select an agent (including a null agent which implies no selection of any assigned agent) which follows the Multi-nomial Logit (MNL) model.  The goal is to maximize the expected number of successful matching.

The authors extend the previous works in two fronts:
   - allows select the null-agent (or not selecting any of the assigned agent);
   - instead of having a "deterministic preference" of accepting agents, the authors consider a "probabilistic model" using the multinomial logit function.

The authors proposed an elimination-based algorithm that wherein the regret bound is O(ln(T)) (plus other terms).  Also, there is a computational issues in their proposed elimination-based algorithm,  To address this, the authors an approximation (or \alpha-approximation oracle).

Finally, the authors carried out simulation to illustrate the merits of their works.
The major concern I have about this paper is about its novelty.

First of all, extending from previous matching MAB problem by allowing a null-agent (or arm can reject any of the assigned agent) is really a trivial extension.  In fact, many previous papers can  easily incorporate this case in their model.

Secondly, allowing arms to select an agent based on multinomial logit function for me is in fact a restriction.  Because in real-life, the preference probability can in fact be more "general" then the multinomial logit representation.  One may have a hard time fitting an arbitrary probability distribution using the multinomial logit function.  

Thirdly, the elimination-based algorithm is very similar to the previous work by Lattimore and Szepesvari (with minor alteration due to the mapping with the problem).  To resolve the computational issue using an approximation algorithm is also a very common technique, as stated by the authors, from Kakade et at in 2007. In fact, this form of alpha-approximation has been heavily used in many disciplines, from theoretical computer science to machine learning.

Fourthly, the explanation of the algorithm has some issues. The authors discussed about using SVD to compute X=U\sumV^T, but are they defined ?  It seems the authors just use the previous SVD approach to extract information.

Lastly, why just compare with ETC-GS and  UCB-GS?  For example, I want to see how the algorithm will compare when the preference is "deterministic" (as used by many previous matching MAB algorithms), and to see how the variation from the deterministic preference to stochastic preference can impact the complexity and accuracy of the proposed algorithms.
Yes
No ethics review needed.
- On page 7, there is a proof sketch for Theorem 1. Is this necessary? If so, could you briefly explain which part of the proof is novel?
- $\kappa$ seems to be the only parameter related to the rejection of the arm side. Thinking straightforwardly, can't we directly define like $(\kappa_{ij})\_{i = 1, ..., n, j = 1, ..., k}$, where $\kappa_{ij}$ is the probability that agent $i$ will be rejected from arm $j$? 
- S. Wang (ICML2018) should be cited since this work also works on combinatorial bandit with semi-bandit feedback. Shouldn't their algorithm, CTS, at least be compared in the experiment section?
- I would like to know if there is a proper real-world dataset for the experiment. This study would be even more interesting to have a numerical experiment with real-world data since it seems to be more focused on real-world applications.

[Reference]
- Siwei Wang and Wei Chen. Thompson Sampling for Combinatorial Semi-Bandits. ICML, 2018.
- This paper proposes a new bandit framework of matching, where the agents can be stochastically rejected from the arm side. This framework has some reasonable real-world applications.
- It discusses the computation issue of the algorithm, which often becomes one of the main aspects of combinatorial badits. It shows a regret bound when using an $\alpha$-approximation oracle.
This paper proposes a new bandit framework of stochastic matching model, where agents on one side are assigned to arms on the other side, and each arm stochastically accepts an agent among the assigned pool of agents based on its unknown preference, allowing a possible outside option of not accepting any.
- There is no lower bound for this framework, which weakens the contribution since we can not assess the upper bound quantitatively. Won't Merlis et al. (2020) help analyze the lower bound of MNL? 
- Although it proposes an algorithm with an approximation oracle, it is not shown in the experiment. It would be even better if there were numerical experiments showing that using an $\alpha$-approximation oracle improves calculation execution time.



[Reference]
- N. Merlis et al. Tight Lower Bounds for Combinatorial Multi-Armed Bandits. ACLT2020.
In this study, we propose a new bandit framework of stochastic matching employing the Multinomial Logit (MNL) choice model with feature information.
@inproceedings{
anonymous2024stochastic,
title={Stochastic Matching Bandits under Preference Feedback},
author={Anonymous},
booktitle={Submitted to The Thirteenth International Conference on Learning Representations},
year={2024},
url={https://openreview.net/forum?id=iKLSISIPH7},
note={under review}
}
In this study, we propose a new bandit framework of stochastic matching employing the Multinomial Logit (MNL) choice model with feature information. In this framework, agents on one side are assigned to arms on the other side, and each arm stochastically accepts an agent among the assigned pool of agents based on its unknown preference, allowing a possible outside option of not accepting any. 
The objective is to minimize regret by maximizing the probability of successful matching. 
For this framework, we first propose an elimination-based algorithm that achieves a regret bound of $\tilde{O}\big(K\sqrt{rKT} \big)$ over time horizon $T$, where $K$ is the number of arms and $r$ is the rank of feature space.  Furthermore, we propose an approach to resolve the computation issue regarding combinatorial optimization in the algorithm.
Lastly, we evaluate the performances of our algorithm through experiments comparing with the existing showing the superior performances of our algorithm.
I certify that there is no URL (e.g., github page) that could be used to find authors’ identity.
I acknowledge that I and all co-authors of this work have read and commit to adhering to the ICLR Code of Ethics.
Matching bandits Preference Feedback
I certify that there is no acknowledgement section in this submission for double blind review.
/pdf/1df6db9332985d982d334e168921c4ef53a70ea3.pdf
learning theory
I understand the reciprocal reviewing requirement as described on https://iclr.cc/Conferences/2025/CallForPapers. If none of the authors are registered as a reviewer, it may result in a desk rejection at the discretion of the program chairs. To request an exception, please complete this form at https://forms.gle/Huojr6VjkFxiQsUp6.
I certify that this submission complies with the submission instructions as described on https://iclr.cc/Conferences/2025/AuthorGuide.
/attachment/73c2bc191e2aaac9afb1d8e8b21bf6524a72c6be.zip
Stochastic Matching Bandits under Preference Feedback
ICLR 2025 Conference Submission
ICLR.cc/2025/Conference/Submission