Multi-answer Constrained Optimal Querying: Maximum Information Gain Coding (2405.16753v1)
Abstract: As the rapidly developments of artificial intelligence and machine learning, behavior tree design in multiagent system or AI game become more important. The behavior tree design problem is highly related to the source coding in information theory. "Twenty Questions" problem is a typical example for the behavior tree design, usually used to explain the source coding application in information theory and can be solved by Huffman coding. In some realistic scenarios, there are some constraints on the asked questions. However, for general question set, finding the minimum expected querying length is an open problem, belongs to NP-hard. Recently, a new coding scheme has been proposed to provide a near optimal solution for binary cases with some constraints, named greedy binary separation coding (GBSC). In this work, we shall generalize it to D-ary cases and propose maximum information gain coding (MIGC) approach to solve the multi-answer decision constrained querying problem. The optimality of the proposed MIGC is discussed in theory. Later on, we also apply MIGC to discuss three practical scenarios and showcase that MIGC has better performance than GBSC and Shannon Coding in terms of bits persymbol.
- A. Karbasi and M. Zadimoghaddam, “Constrained binary identification problem,” in Proceedings of the 30th Symposium on Theoretical Aspects of Computer Science, 2013.
- Y. Fu, L. Qin, and Q. Yin, “A reinforcement learning behavior tree framework for game ai,” in 2016 International Conference on Economics, Social Science, Arts, Education and Management Engineering. Atlantis Press, 2016, pp. 573–579.
- Q. Zhang, L. Sun, P. Jiao, and Q. Yin, “Combining behavior trees with maxq learning to facilitate cgfs behavior modeling,” in 2017 4th International Conference on Systems and Informatics (ICSAI). IEEE, 2017, pp. 525–531.
- S. S. O. Venkata, R. Parasuraman, and R. Pidaparti, “Kt-bt: A framework for knowledge transfer through behavior trees in multirobot systems,” IEEE Transactions on Robotics, 2023.
- Y. Shi, P. Fan, Z. Zhu, C. Peng, F. Wang, and K. B. Letaief, “Sam: An efficient approach with selective aggregation of models in federated learning,” IEEE Internet of Things Journal, 2024.
- S. Wan, J. Lu, P. Fan, Y. Shao, C. Peng, and K. B. Letaief, “Convergence analysis and system design for federated learning over wireless networks,” IEEE Journal on Selected Areas in Communications, vol. 39, no. 12, pp. 3622–3639, 2021.
- Z. Zhu, S. Wan, P. Fan, and K. B. Letaief, “Federated multiagent actor–critic learning for age sensitive mobile-edge computing,” IEEE Internet of Things Journal, vol. 9, no. 2, pp. 1053–1067, 2021.
- S. Zhang, J. Sun, and S. Chen, “Constrained optimal querying: Huffman coding and beyond,” arXiv preprint arXiv:2210.04013, 2022.
- Mamta and Sharma, “Compression using huffman coding,” International Journal of Computer Science and Network Security Ijcsns, 2010.
- M. B. Baer, “Twenty (or so) questions: bounded-length huffman coding,” IEEE, 2006.
- L. L. Larmore and D. S. Hirschberg, “A fast algorithm for optimal length-limited huffman codes,” Journal of the ACM (JACM), vol. 37, no. 3, pp. 464–473, 1990.
- M. B. Baer, “D-ary bounded-length huffman coding,” in 2007 IEEE International Symposium on Information Theory. IEEE, 2007, pp. 896–900.
- S. J. Lee and C. W. Lee, “Determination of huffman parameters for memory-constrained entropy coding of multiple sources,” IEEE Signal Processing Letters, vol. 4, no. 3, pp. 65–67, 1997.
- H. Laurent and R. L. Rivest, “Constructing optimal binary decision trees is np-complete,” Information processing letters, vol. 5, no. 1, pp. 15–17, 1976.
- V. T. Chakaravarthy, V. Pandit, S. Roy, and Y. Sabharwal, “Approximating decision trees with multiway branches,” in International Colloquium on Automata, Languages, and Programming. Springer, 2009, pp. 210–221.
- S. R. Kosaraju, T. M. Przytycka, and R. Borgstrom, “On an optimal split tree problem,” in Workshop on Algorithms and Data Structures. Springer, 1999, pp. 157–168.
- S. Dasgupta, “Analysis of a greedy active learning strategy,” Advances in neural information processing systems, vol. 17, 2004.
- R. D. Nowak, “The geometry of generalized binary search,” IEEE Transactions on Information Theory, vol. 57, no. 12, pp. 7893–7906, 2011.
- T. Biedl, B. Brejová, E. D. Demaine, A. M. Hamel, A. López-Ortiz, and T. Vinař, “Finding hidden independent sets in interval graphs,” Theoretical Computer Science, vol. 310, no. 1-3, pp. 287–307, 2004.
- A. C. Hoffmann, D. Vallböhmer, K. Prenzel, R. Metzger, M. Heitmann, S. Neiss, F. Ling, A. H. Hölscher, and S. J. Brabender, “Methylated dapk and apc promoter dna detection in peripheral blood is significantly associated with apparent residual tumor and outcome,” Journal of Cancer Research&\&&Clinical Oncology, 2009.
- A. Fiat and A. Shamir, “How to find a battleship,” Networks, vol. 19, no. 3, pp. 361–371, 1989.
- Z. Zhu, Y. Shi, J. Luo, F. Wang, C. Peng, P. Fan, and K. B. Letaief, “Fedlp: Layer-wise pruning mechanism for communication-computation efficient federated learning,” in ICC 2023-IEEE International Conference on Communications. IEEE, 2023, pp. 1250–1255.
- Q. Wu, Y. Zhao, Q. Fan, P. Fan, J. Wang, and C. Zhang, “Mobility-aware cooperative caching in vehicular edge computing based on asynchronous federated and deep reinforcement learning,” IEEE Journal of Selected Topics in Signal Processing, vol. 17, no. 1, pp. 66–81, 2022.