Literatura científica selecionada sobre o tema "Offline Contextual Bandit"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Offline Contextual Bandit".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Offline Contextual Bandit"
Huang, Wen, e Xintao Wu. "Robustly Improving Bandit Algorithms with Confounded and Selection Biased Offline Data: A Causal Approach". Proceedings of the AAAI Conference on Artificial Intelligence 38, n.º 18 (24 de março de 2024): 20438–46. http://dx.doi.org/10.1609/aaai.v38i18.30027.
Texto completo da fonteNarita, Yusuke, Shota Yasui e Kohei Yata. "Efficient Counterfactual Learning from Bandit Feedback". Proceedings of the AAAI Conference on Artificial Intelligence 33 (17 de julho de 2019): 4634–41. http://dx.doi.org/10.1609/aaai.v33i01.33014634.
Texto completo da fonteDegroote, Hans, Patrick De Causmaecker, Bernd Bischl e Lars Kotthoff. "A Regression-Based Methodology for Online Algorithm Selection". Proceedings of the International Symposium on Combinatorial Search 9, n.º 1 (1 de setembro de 2021): 37–45. http://dx.doi.org/10.1609/socs.v9i1.18458.
Texto completo da fonteLi, Zhao, Junshuai Song, Zehong Hu, Zhen Wang e Jun Gao. "Constrained Dual-Level Bandit for Personalized Impression Regulation in Online Ranking Systems". ACM Transactions on Knowledge Discovery from Data 16, n.º 2 (21 de julho de 2021): 1–23. http://dx.doi.org/10.1145/3461340.
Texto completo da fonteVera, Alberto, Siddhartha Banerjee e Itai Gurvich. "Online Allocation and Pricing: Constant Regret via Bellman Inequalities". Operations Research 69, n.º 3 (maio de 2021): 821–40. http://dx.doi.org/10.1287/opre.2020.2061.
Texto completo da fonteAyle, Morgane, Jimmy Tekli, Julia El-Zini, Boulos El-Asmar e Mariette Awad. "BAR — A Reinforcement Learning Agent for Bounding-Box Automated Refinement". Proceedings of the AAAI Conference on Artificial Intelligence 34, n.º 03 (3 de abril de 2020): 2561–68. http://dx.doi.org/10.1609/aaai.v34i03.5639.
Texto completo da fonteSimchi-Levi, David, e Yunzong Xu. "Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability". Mathematics of Operations Research, 9 de dezembro de 2021. http://dx.doi.org/10.1287/moor.2021.1193.
Texto completo da fonteSoemers, Dennis, Tim Brys, Kurt Driessens, Mark Winands e Ann Nowé. "Adapting to Concept Drift in Credit Card Transaction Data Streams Using Contextual Bandits and Decision Trees". Proceedings of the AAAI Conference on Artificial Intelligence 32, n.º 1 (27 de abril de 2018). http://dx.doi.org/10.1609/aaai.v32i1.11411.
Texto completo da fonteCao, Junyu, e Wei Sun. "Tiered Assortment: Optimization and Online Learning". Management Science, 4 de outubro de 2023. http://dx.doi.org/10.1287/mnsc.2023.4940.
Texto completo da fonteZeng, Yingyan, Xiaoyu Chen e Ran Jin. "Ensemble Active Learning by Contextual Bandits for AI Incubation in Manufacturing". ACM Transactions on Intelligent Systems and Technology, 25 de outubro de 2023. http://dx.doi.org/10.1145/3627821.
Texto completo da fonteTeses / dissertações sobre o assunto "Offline Contextual Bandit"
Sakhi, Otmane. "Offline Contextual Bandit : Theory and Large Scale Applications". Electronic Thesis or Diss., Institut polytechnique de Paris, 2023. http://www.theses.fr/2023IPPAG011.
Texto completo da fonteThis thesis presents contributions to the problem of learning from logged interactions using the offline contextual bandit framework. We are interested in two related topics: (1) offline policy learning with performance certificates, and (2) fast and efficient policy learning applied to large scale, real world recommendation. For (1), we first leverage results from the distributionally robust optimisation framework to construct asymptotic, variance-sensitive bounds to evaluate policies' performances. These bounds lead to new, more practical learning objectives thanks to their composite nature and straightforward calibration. We then analyse the problem from the PAC-Bayesian perspective, and provide tighter, non-asymptotic bounds on the performance of policies. Our results motivate new strategies, that offer performance certificates before deploying the policies online. The newly derived strategies rely on composite learning objectives that do not require additional tuning. For (2), we first propose a hierarchical Bayesian model, that combines different signals, to efficiently estimate the quality of recommendation. We provide proper computational tools to scale the inference to real world problems, and demonstrate empirically the benefits of the approach in multiple scenarios. We then address the question of accelerating common policy optimisation approaches, particularly focusing on recommendation problems with catalogues of millions of items. We derive optimisation routines, based on new gradient approximations, computed in logarithmic time with respect to the catalogue size. Our approach improves on common, linear time gradient computations, yielding fast optimisation with no loss on the quality of the learned policies
Trabalhos de conferências sobre o assunto "Offline Contextual Bandit"
Li, Lihong, Wei Chu, John Langford e Xuanhui Wang. "Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms". In the fourth ACM international conference. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/1935826.1935878.
Texto completo da fonteBouneffouf, Djallel, Srinivasan Parthasarathy, Horst Samulowitz e Martin Wistuba. "Optimal Exploitation of Clustering and History Information in Multi-armed Bandit". In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/279.
Texto completo da fonteDegroote, Hans. "Online Algorithm Selection". In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/746.
Texto completo da fonteJanuszewski, Piotr, Dominik Grzegorzek e Paweł Czarnul. "Dataset Characteristics and Their Impact on Offline Policy Learning of Contextual Multi-Armed Bandits". In 16th International Conference on Agents and Artificial Intelligence. SCITEPRESS - Science and Technology Publications, 2024. http://dx.doi.org/10.5220/0012311000003636.
Texto completo da fonteAmeko, Mawulolo K., Miranda L. Beltzer, Lihua Cai, Mehdi Boukhechba, Bethany A. Teachman e Laura E. Barnes. "Offline Contextual Multi-armed Bandits for Mobile Health Interventions: A Case Study on Emotion Regulation". In RecSys '20: Fourteenth ACM Conference on Recommender Systems. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3383313.3412244.
Texto completo da fonte