paper-with-me

Papers

Adaptive Mixture Importance Sampling for Automated Ads Auction Tuning

2024-09-20 · Yimeng Jia, Kaushal Paneri, Rong Huang, Kailash Singh Maurya, Pavan Mallapragada, Yifan Shi

This paper introduces Adaptive Mixture Importance Sampling (AMIS) as a novel approach for optimizing key performance indicators (KPIs) in large-scale recommender systems, such as online ad auctions. Traditional importance sampling (IS) methods face challenges in dynamic environments, particularly in navigating through complexities of multi-modal landscapes and avoiding entrapment in local optima for the optimization task. Instead of updating importance weights and mixing samples across iterations, as in canonical adaptive IS and multiple IS, our AMIS framework leverages a mixture distribution as the proposal distribution and dynamically adjusts both the mixture parameters and their mixing rates at each iteration, thereby enhancing search diversity and efficiency. Through extensive offline simulations, we demonstrate that AMIS significantly outperforms simple Gaussian Importance Sampling (GIS), particularly in noisy environments. Moreover, our approach is validated in real-world scenarios through online A/B experiments on a major search engine, where AMIS consistently identifies optimal tuning points that are more likely to be adopted as mainstream configurations. These findings indicate that AMIS enhances convergence in noisy environments, leading to more accurate and reliable decision-making in the context of importance sampling off-policy estimators.

📄 PDF Abstract BibTeX arXiv:2409.13655

Code (0)

등록된 구현이 없습니다.

Tasks

Decision MakingDiversityRecommendation Systems

Similar Papers 제목 키워드 기반

Tree pyramidal adaptive importance sampling

2019-12-18 · Javier Felip, Nilesh Ahuja, Omesh Tickoo

This paper introduces Tree-Pyramidal Adaptive Importance Sampling (TP-AIS), a novel iterated sampling method that outperforms state-of-the-art approaches like deterministic mixture population Monte Carlo (DM-PMC), mixtur…

Online Variance Reduction with Mixtures

2019-03-29 · Zalán Borsos, Sebastian Curi, Kfir. Y. Levy, Andreas Krause

Adaptive importance sampling for stochastic optimization is a promising approach that offers improved convergence through variance reduction. In this work, we propose a new framework for variance reduction that enables t…

Stochastic Optimization

No-Regret Algorithms in non-Truthful Auctions with Budget and ROI Constraints

2024-04-15 · Gagan Aggarwal, Giannis Fikioris, Mingfei Zhao

Advertisers increasingly use automated bidding to optimize their ad campaigns on online advertising platforms. Autobidding optimizes an advertiser's objective subject to various constraints, e.g. average ROI and budget c…

DynamixSFT: Dynamic Mixture Optimization of Instruction Tuning Collections

2025-08-16 · Haebin Shin, Lei Ji, Xiao Liu, Zhiwei Yu 외 arxiv

As numerous instruction-tuning datasets continue to emerge, dynamically balancing and optimizing their mixtures has become a critical challenge. To address this, we propose DynamixSFT, a dynamic and automated method for …

Automated Deterministic Auction Design with Objective Decomposition

2024-02-19 · Zhijian Duan, Haoran Sun, Yichong Xia, Siqiang Wang 외

Identifying high-revenue mechanisms that are both dominant strategy incentive compatible (DSIC) and individually rational (IR) is a fundamental challenge in auction design. While theoretical approaches have encountered b…