Fetching the paper…
Reading the bibliography…
With the rapid advancement of large language models (LLMs), the diversity of multi-LLM tasks and the variability in their pricing structures have become increasingly important, as costs can vary greatly between different LLMs.
Some aspects of the sequential design of experiments
Herbert Robbins · 1952
Earlier work this paper cites.
Weighted sums of certain dependent random variables
Kazuoki Azuma · 1967
Earlier work this paper cites.
Speeding-up linear programming using fast matrix multiplication
Pravin M Vaidya · 1989
Earlier work this paper cites.
Approximation algorithms for np-hard problems
Dorit S Hochba · 1997
Earlier work this paper cites.
Finite-time analysis of the multiarmed bandit problem
Peter Auer, Nicolo Cesa-Bianchi, and Paul Fischer · 2002
Earlier work this paper cites.
Convex optimization
Stephen P Boyd and Lieven Vandenberghe · 2004
Earlier work this paper cites.
Rouge: A package for automatic evaluation of summaries
Chin-Yew Lin · 2004
Earlier work this paper cites.
Dependent rounding and its applications to approximation algorithms
Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, and Aravind Srinivasan · 2006
Earlier work this paper cites.
Maximizing a submodular set function subject to a matroid constraint
Gruia Calinescu, Chandra Chekuri, Martin Pál, and Jan Vondrák · 2007
Earlier work this paper cites.
Dependent randomized rounding for matroid polytopes and applications
Chandra Chekuri, Jan Vondrák, and Rico Zenklusen · 2009
Earlier work this paper cites.
Concentration of measure for the analysis of randomized algorithms
Devdatt P Dubhashi and Alessandro Panconesi · 2009
Earlier work this paper cites.
Combinatorial network optimization with unknown variables: Multi-armed bandits with linear rewards and individual observations
Yi Gai, Bhaskar Krishnamachari, and Rahul Jain · 2012
Earlier work this paper cites.
Monotone closure of relaxed constraints in submodular optimization: Connections between minimization and maximization: Extended version
Rishabh Iyer, Stefanie Jegelka, and Jeff Bilmes · 2014
Earlier work this paper cites.
Combinatorial bandits revisited
Richard Combes, Mohammad Sadegh Talebi Mazraeh Shahi, Alexandre Proutiere, et al · 2015
Earlier work this paper cites.
Distilling the knowledge in a neural network
Geoffrey Hinton, Oriol Vinyals, and Jeff Dean · 2015
Earlier work this paper cites.
Combinatorial multi-armed bandit and its extension to probabilistically triggered arms
Wei Chen, Yajun Wang, Yang Yuan, and Qinshi Wang · 2016
Earlier work this paper cites.
Contextual combinatorial cascading bandits
Shuai Li, Baoxiang Wang, Shengyu Zhang, and Wei Chen · 2016
Earlier work this paper cites.
Improving regret bounds for combinatorial semi-bandits with probabilistically triggered arms and its applications
Qinshi Wang and Wei Chen · 2017
Earlier work this paper cites.
Crowdsourcing multiple choice science questions
Johannes Welbl, Nelson F Liu, and Matt Gardner · 2017
Earlier work this paper cites.
Approximation schemes for 0-1 knapsack
Timothy M Chan · 2018
Earlier work this paper cites.
Beyond the click-through rate: Web link selection with multi-level feedback
Kun Chen, Kechao Cai, Longbo Huang, and John Lui · 2018
Earlier work this paper cites.
Combinatorial semi-bandits with knapsacks
Karthik Abinav Sankararaman and Aleksandrs Slivkins · 2018
Cited alongside, same era.
Model selection for contextual bandits
Dylan J Foster, Akshay Krishnamurthy, and Haipeng Luo · 2019
Cited alongside, same era.
Batch-size independent regret bounds for the combinatorial multi-armed bandit problem
Nadav Merlis and Shie Mannor · 2019
Cited alongside, same era.
Julian Salazar, Davis Liang, Toan Q Nguyen, and Katrin Kirchhoff · 2019
Cited alongside, same era.
Distilbert, a distilled version of bert: smaller, faster, cheaper and lighter
Victor Sanh, Lysandre Debut, Julien Chaumond, and Thomas Wolf · 2019
Cited alongside, same era.
Claude AI LLM API
Claude · 2023
Later among the works it cites.
Forefront AI LLM API
Forefront-AI · 2023
Later among the works it cites.
Alleviating matthew effect of offline reinforcement learning in interactive recommendation
Chongming Gao, Kexin Huang, Jiawei Chen, Yuan Zhang, Biao Li, Peng Jiang, Shiqin Wang, Zhong Zhang, and Xiangnan He · 2023
Later among the works it cites.
Metagpt: Meta programming for multi-agent collaborative framework
Sirui Hong, Xiawu Zheng, Jonathan Chen, Yuheng Cheng, Jinlin Wang, Ceyao Zhang, Zili Wang, Steven Ka Shing Yau, Zijuan Lin, Liyang Zhou, et al · 2023
Later among the works it cites.
Big little transformer decoder
Sehoon Kim, Karttikeya Mangalam, Jitendra Malik, Michael W Mahoney, Amir Gholami, and Kurt Keutzer · 2023
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
David Saxton, Edward Grefenstette, Felix Hill, and Pushmeet Kohli · 2019
Cited alongside, same era.
Introduction to multi-armed bandits
Aleksandrs Slivkins et al · 2019
Cited alongside, same era.
Dyne: Dynamic ensemble decoding for multi-document summarization
Chris Hokamp, Demian Gholipour Ghalandari, Nghia The Pham, and John Glover · 2020
Cited alongside, same era.
Bandit algorithms
Tor Lattimore and Csaba Szepesvári · 2020
Cited alongside, same era.
Tight lower bounds for combinatorial multi-armed bandits
Nadav Merlis and Shie Mannor · 2020
Cited alongside, same era.
Submodular bandit problem under multiple constraints
Sho Takemori, Masahiro Sato, Takashi Sonoda, Janmajay Singh, and Tomoko Ohkuma · 2020
Cited alongside, same era.
Conversational contextual bandit: Algorithm and application
Xiaoying Zhang, Hong Xie, Hang Li, and John C.S. Lui · 2020
Cited alongside, same era.
Variance-adaptive algorithm for probabilistic maximum coverage bandits with general feedback
Xutong Liu, Jinhang Zuo, Hong Xie, Carlee Joe-Wong, and John CS Lui · 2023
Later among the works it cites.
Automix: Automatically mixing language models
Aman Madaan, Pranjal Aggarwal, Ankit Anand, Srividya Pranavi Potharaju, Swaroop Mishra, Pei Zhou, Aditya Gupta, Dheeraj Rajagopal, Karthik Kappaganthu, Yiming Yang, et al · 2023
Later among the works it cites.
OpenAI LLM API
OpenAI · 2023
Later among the works it cites.
Check your facts and try again: Improving large language models with external knowledge and automated feedback.(2023)
Baolin Peng, Michel Galley, Pengcheng He, Hao Cheng, Yujia Xie, Yu Hu, Qiuyuan Huang, Lars Liden, Zhou Yu, Weizhu Chen, et al · 2023
Later among the works it cites.
A survey on offline reinforcement learning: Taxonomy, review, and open problems
Rafael Figueiredo Prudencio, Marcos R. O. A. Maximo, and Esther Luna Colombini · 2023
Later among the works it cites.
Simple deterministic approximation for submodular multiple knapsack problem
Xiaoming Sun, Jialin Zhang, and Zhijie Zhang · 2023
Later among the works it cites.
Efficient multilingual sexism detection via large language model cascades
Lin Tian, Nannan Huang, and Xiuzhen Zhang · 2023
Later among the works it cites.
Tabi: An efficient multi-level inference system for large language models
Yiding Wang, Kai Chen, Haisheng Tan, and Kun Guo · 2023
Later among the works it cites.
Investlm: A large language model for investment using financial domain instruction tuning
Yi Yang, Yixuan Tang, and Kar Yan Tam · 2023
Later among the works it cites.
On optimal caching and model multiplexing for large model inference
Banghua Zhu, Ying Sheng, Lianmin Zheng, Clark Barrett, Michael I Jordan, and Jiantao Jiao · 2023
Later among the works it cites.
Opensearch
Alibabacloud-Opensearch · 2024
Closest in time.
The matrix: A bayesian learning model for llms
Siddhartha Dalal and Vishal Misra · 2024
Closest in time.
Hybrid llm: Cost-efficient and quality-aware query routing
Dujian Ding, Ankur Mallick, Chi Wang, Robert Sim, Subhabrata Mukherjee, Victor Ruhle, Laks VS Lakshmanan, and Ahmed Hassan Awadallah · 2024
Closest in time.
Efficient exploration for llms
Vikranth Dwaracherla, Seyed Mohammad Asghari, Botao Hao, and Benjamin Van Roy · 2024
Closest in time.
Language model cascades: Token-level uncertainty and beyond
Neha Gupta, Harikrishna Narasimhan, Wittawat Jitkrittum, Ankit Singh Rawat, Aditya Krishna Menon, and Sanjiv Kumar · 2024
Closest in time.