Copertina

Stop Relying on No-Choice and Do not Repeat the Moves: Optimal, Efficient and Practical Algorithms for Assortment Optimization

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Saha, Aadirupa, Gaillard, Pierre
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Machine Learning Information Retrieval
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Low-Rank Online Dynamic Assortment with Dual Contextual Information
di: Lee, Seong Jin, et al.
Pubblicazione: (2024)

Towards Efficient Pareto-optimal Utility-Fairness between Groups in Repeated Rankings
di: Mai, Phuong Dinh, et al.
Pubblicazione: (2024)

Stop Treating Collisions Equally: Qualification-Aware Semantic ID Learning for Recommendation at Industrial Scale
di: Hu, Zheng, et al.
Pubblicazione: (2026)

Transformers Meet ACT-R: Repeat-Aware and Sequential Listening Session Recommendation
di: Tran, Viet-Anh, et al.
Pubblicazione: (2024)

Proximal Ranking Policy Optimization for Practical Safety in Counterfactual Learning to Rank
di: Gupta, Shashank, et al.
Pubblicazione: (2024)

Do We Really Need Graph Convolution During Training? Light Post-Training Graph-ODE for Efficient Recommendation
di: Zhang, Weizhi, et al.
Pubblicazione: (2024)

Lower-Left Partial AUC: An Effective and Efficient Optimization Metric for Recommendation
di: Shi, Wentao, et al.
Pubblicazione: (2024)

Social Choice for Heterogeneous Fairness in Recommendation
di: Aird, Amanda, et al.
Pubblicazione: (2024)

Modeling User Exploration Saturation: When Recommender Systems Should Stop Pushing Novelty
di: Ayiku, Enock O., et al.
Pubblicazione: (2026)

Crafting Tomorrow: The Influence of Design Choices on Fresh Content in Social Media Recommendation
di: Saket, Srijan, et al.
Pubblicazione: (2024)

Optimal Baseline Corrections for Off-Policy Contextual Bandits
di: Gupta, Shashank, et al.
Pubblicazione: (2024)

Practical and Robust Safety Guarantees for Advanced Counterfactual Learning to Rank
di: Gupta, Shashank, et al.
Pubblicazione: (2024)

Practical Multi-Task Learning for Rare Conversions in Ad Tech
di: Dishi, Yuval, et al.
Pubblicazione: (2025)

Algorithm Adaptation Bias in Recommendation System Online Experiments
di: Zheng, Chen, et al.
Pubblicazione: (2025)

OptDist: Learning Optimal Distribution for Customer Lifetime Value Prediction
di: Weng, Yunpeng, et al.
Pubblicazione: (2024)

Do Not Wait: Learning Re-Ranking Model Without User Feedback At Serving Time in E-Commerce
di: Wang, Yuan, et al.
Pubblicazione: (2024)

RDSA: A Robust Deep Graph Clustering Framework via Dual Soft Assignment
di: Xiang, Yang, et al.
Pubblicazione: (2024)

Towards Lifelong Learning Embeddings: An Algorithmic Approach to Dynamically Extend Embeddings
di: Gomes, Miguel Alves, et al.
Pubblicazione: (2024)

A Scalable Crawling Algorithm Utilizing Noisy Change-Indicating Signals
di: Busa-Fekete, Róbert, et al.
Pubblicazione: (2025)

Advancements in Recommender Systems: A Comprehensive Analysis Based on Data, Algorithms, and Evaluation
di: Ma, Xin, et al.
Pubblicazione: (2024)

GEO: Generative Engine Optimization
di: Aggarwal, Pranjal, et al.
Pubblicazione: (2023)

Towards Practical Large-scale Dynamical Heterogeneous Graph Embedding: Cold-start Resilient Recommendation
di: Long, Mabiao, et al.
Pubblicazione: (2025)

Wisdom of the Crowds in Forecasting: Forecast Summarization for Supporting Future Event Prediction
di: Saha, Anisha, et al.
Pubblicazione: (2025)

PSQE: A Theoretical-Practical Approach to Pseudo Seed Quality Enhancement for Unsupervised Multimodal Entity Alignment
di: Hong, Yunpeng, et al.
Pubblicazione: (2026)

Drift-Adapter: A Practical Approach to Near Zero-Downtime Embedding Model Upgrades in Vector Databases
di: Vejendla, Harshil
Pubblicazione: (2025)

Efficient and Robust Regularized Federated Recommendation
di: Liu, Langming, et al.
Pubblicazione: (2024)

Do We Trust What They Say or What They Do? A Multimodal User Embedding Provides Personalized Explanations
di: Ren, Zhicheng, et al.
Pubblicazione: (2024)

EnhancedRL: An Enhanced-State Reinforcement Learning Algorithm for Multi-Task Fusion in Recommender Systems
di: Liu, Peng, et al.
Pubblicazione: (2024)

ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms
di: Manohar, Magdalen Dobson, et al.
Pubblicazione: (2023)

Intelligent Algorithm Selection for Recommender Systems: Meta-Learning via in-depth algorithm feature engineering
di: Decker, Jarne Mathi
Pubblicazione: (2025)

Modeling User Preferences as Distributions for Optimal Transport-Based Cross-Domain Recommendation under Non-Overlapping Settings
di: Xiao, Ziyin, et al.
Pubblicazione: (2025)

Parameter-Efficient Single Collaborative Branch for Recommendation
di: Moscati, Marta, et al.
Pubblicazione: (2025)

UnifiedRL: A Reinforcement Learning Algorithm Tailored for Multi-Task Fusion in Large-Scale Recommender Systems
di: Liu, Peng, et al.
Pubblicazione: (2024)

Listwise Preference Alignment Optimization for Tail Item Recommendation
di: Li, Zihao, et al.
Pubblicazione: (2025)

RewardRank: Optimizing True Learning-to-Rank Utility
di: Bhatt, Gaurav, et al.
Pubblicazione: (2025)

Scalable Bayesian Optimization with Sparse Gaussian Process Models
di: Yang, Ang
Pubblicazione: (2020)

Optimizing Product Deduplication in E-Commerce with Multimodal Embeddings
di: Kulunk, Aysenur, et al.
Pubblicazione: (2025)

UDuo: Universal Dual Optimization Framework for Online Matching
di: Li, Bin, et al.
Pubblicazione: (2025)

Optimizing Conversational Product Recommendation via Reinforcement Learning
di: Liu, Kang
Pubblicazione: (2025)

Position Paper: Why the Shooting in the Dark Method Dominates Recommender Systems Practice; A Call to Abandon Anti-Utopian Thinking
di: Rohde, David
Pubblicazione: (2024)