DataCupid: Stable Matching Repair for Training Data Acquisition with Delayed Feedback
cs.LG, cs.IT, math.IT
Submitted: 2026-10-09
Updated: 2026-10-09
Sources
- Optimal Best-Arm Identification in Bandits with Access to Offline Data
- Robust Stable Matchings: Dealing with Changes in Preferences
- Decentralized Competing Bandits in Non-Stationary Matching Markets
- Asynchronous Parallel Empirical Variance Guided Algorithms for the Thresholding Bandit Problem
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks