Large language models (LLMs) possess exceptional capabilities, but their effectiveness is limited by their knowledge base. Retrieval-Augmented Generation (RAG) techniques integrate external knowledge to enhance performance in question-answering tasks. However, RAG techniques may encounter difficulties in dealing with irrelevant content, complex queries, as well as accurately evaluating the importance and relevance of information. To address these challenges, we developed an optimization question-answering system General Adaptive RAG (GARAG), specifically tailored for question-and-answer tasks. Our system utilizes a retrieval agent to identify relevant content and a generation agent to construct answers based on the question and retrieved information. Additionally, we incorporated modules for question complexity measurement, question correction, query transformation, query routing, and adaptive retrieval to improve intent recognition and document retrieval. We implemented an answer corrector and discriminator, as well as a self-reflection mechanism, to enhance output quality and factuality. Empirical experiments conducted on real-world questions validate the effectiveness of our question-and-answer system.
This paper introduces a dataset encompassing images from domains such as pornography, gambling, violence, and drugs. It addresses the gap in harmful image recognition by including data on gambling and drugs, which were previously lacking in this field. This dataset can be utilized to construct and evaluate methods for recognizing harmful images. The paper also proposes a harmful image recognition method based on CLIP model, coupled with strongly and weakly associated prompts, achieving zero-shot learning. The method achieves great accuracy on the dataset presented in the paper, and it incurs low learning costs. These innovations not only underscore the adaptability of the vision-language models but also provide a new paradigm to safeguard children from the potential harms of explicit content, violence, gambling, and drugs in the evolving digital landscape.
The myopic strategy is one of the most important strategies when studying bandit problems. In 2018, Nouiehed and Ross put forward a conjecture about Feldman’s bandit problem (J. Appl. Prob. (2018) 55, 318–324). They proposed that for Bernoulli two-armed bandit problems, the myopic strategy stochastically maximizes the number of wins. In this paper we consider the two-armed bandit problem with more general distributions and utility functions. We confirm this conjecture by proving a stronger result: if the agent playing the bandit has a general utility function, the myopic strategy is still optimal if and only if this utility function satisfies reasonable conditions.
In this paper, we study an independent Bernoulli two-armed bandit with unknown parameters and , where and have a pair of priori distributions such that and is an arbitrary positive measure on . Berry proposed the conjecture that, given a pair of priori distributions of parameters and , the arm with R is the current optimal choice if and the expectation of is not less than that of . We give an easily verifiable equivalent form of Berry’s conjecture and use it to prove that Berry’s conjecture holds when R and L are two-point distributions as well as when R and L are beta distributions and the number of trials .