- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper studies multi-objective contextual bandits with objective-specific user clusters. It maintains a separate user graph for each objective and pools observations over the arriving user’s neighborhood. The paper proposes COMOLB algorithm and includes its theoretical analysis. Experiments validates the algorithm's effectiveness.
Critical strengths
Objective-specific clustering is a useful modeling idea. The experiments include identification diagnostics, oracle comparisons, and ablations. The paper candidly reports settings where clustering underperforms independent learning and distinguishes the analyzed algorithms from heuristic variants.
Critical weaknesses
- The technical novelty beyond objective-wise replication of existing clustering machinery needs clearer justification. The structural formulation is meaningful, but much of the algorithm and proof follows established confidence-based clustering and post-identification UCB analysis. Neighborhood pooling is also present in prior work. A sharper account of the genuinely new technical obstacles would strengthen the contribution.
- The baseline evaluation is insufficient to establish competitiveness with existing clustering methods. Particularly relevant missing comparisons include UniCLUB/UniSCLUB and PhaseUniCLUB [1], which address the identification bottleneck through enhanced exploration, and CLUB-HG [2]. The nonlinear evaluation would also benefit from comparison with M-CNB [3], which is cited but not evaluated.
- The evaluation uses at most 40 users in the synthetic experiments and only the 50 most active users and 200 most-rated movies from MovieLens. This is substantially smaller than existing evaluations: SCLUB uses 1,000 users, while CLUB-HG evaluates 200 users on both MovieLens and Netflix. The small scale is particularly concerning.
[1] Li, Zhuohua, et al. "Demystifying online clustering of bandits: Enhanced exploration under stochastic and smoothed adversarial contexts." International Conference on Learning Representations. Vol. 2025. 2025.
[2] Cheng, Xiaotong, et al. "Parallel online clustering of bandits via hedonic game." International Conference on Machine Learning. PMLR, 2023.
[3] Ban, Yikun, et al. "Meta clustering of neural bandits." Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. 2024.
Questions for authors
- How robust is irreversible deletion to approximate clusters, reward-model misspecification, and inaccurate noise or parameter bounds?
- Which theoretical step fundamentally requires a new multi-objective argument beyond combining objective-wise clustering guarantees with a Pareto-UCB confidence-width argument?
- In experiments, especially the experiments on MovieLens, can the algorithm demonstrate useful learning and identification for both objectives, and evaluate several preference weights and more than two objectives? This would help establish that the benefits extend beyond favorable PSG values.
Dear Area Chair,
Thank you very much for your time and service in handling our submission (#36904).
Early in the discussion period (Nov 10), we posted a comprehensive rebuttal comprising 19 new experimental settings (690 runs) under a unified protocol to address every theoretical and empirical question raised by Reviewers
Qcvx,87aP, andLGa3. As the discussion period is closing without post-rebuttal reviewer responses yet, we respectfully summarize our key resolutions and main takeaways below (with full numerical tables available in our Nov 10 rebuttal comments):1. Theoretical Novelty & Algorithmic Design (
R-87aP,R-LGa3)COMONB-Frozenvs.COMOLB): When features are overparameterized (pk>rk) or nearly collinear (e.g., MovieLens or NTK representations), parameter-space confidence radii stall; in contrast,COMONB-Frozentests in prediction space over the active context subspace, remaining well-conditioned with an exact ∣S∣×∣S∣ kernelized form.2. Modern SOTA Baselines (2023–2025) & Threshold Calibration (
R-LGa3,R-Qcvx,R-87aP)UniCLUB(ICLR'25),PhaseUniCLUB(ICLR'25),CLUB-HG(ICML'23), and online neural clusteringM-CNB(KDD'24)—and verified thatCOMONB-Frozen's earlier gap on MovieLens Raw stemmed solely from overly conservative worst-case radii (α=1) prolonging initial mis-pooling.Indand all 2023–2025 linear/neural clustering baselines across MovieLens and nonlinear benchmarks (e.g., cutting scalarized regret by 79%–94% vs.Ind).3. Genuine User Feedback & Heterogeneous Cluster Geometries (
R-Qcvx,R-87aP)COMONB-Frozenforms effective collaboration pools and consistently outperforms bothIndand neuralM-CNBacross preference weights, confirming that our gains hold on noisy real-world user feedback.R-87aP's diagnostic scenario where close and distant clusters coexist,COMOLBadaptively separates distant clusters while keeping close clusters pooled, achieving large regret reductions over bothIndand single-graphI-CLUB.4. Scalability in Users, Objectives, and Graph Maintenance (
R-LGa3,R-Qcvx)I-CLUB,PhaseUniCLUB).5. Robustness Beyond Ideal Assumptions & Manuscript Updates (
R-Qcvx,R-87aP,R-LGa3)IndandM-CNB; we also provided concrete extensions (edge restoration and soft pooling) for non-stationary settings.We sincerely thank you again for your time and thoughtful consideration of our work.
Best regards,
Authors of Submission #36904