Using exploration and exploitation techniques to improve ranking models through (1+1)-Evolutionary Algorithms

Using exploration and exploitation techniques to improve ranking models through (1+1)-Evolutionary Algorithms | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Using exploration and exploitation techniques to improve ranking models through (1+1)-Evolutionary Algorithms Osman Ali Sadek Ibrahim This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-3866499/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract Exploration and exploitation are fundamental concepts within the domain of Nature-Inspired Algorithms (NIAs) when optimizing solutions. Exploration aims to traverse a substantial portion of the solution space, whereas exploitation is directed at refining the current solution toward either local or global optima. For example, mutation represents an exploration technique, while crossover and enhanced initialization strategies are employed for exploitation. In this research, four probability distributions are employed for mutation within NIAs, and ranking models derived from Dependent Click and Linear Regression (LR) are leveraged to enhance the exploitation process. Empirical findings indicate a preference for employing Gaussian Random Number (GRN) in conjunction with LR and Dependent Click initialization when evolving on the training dataset. Conversely, Levy Random Number generation in combination with LR demonstrates superior performance on the unseen test dataset, with GRN emerging as a strong contender. Furthermore, the integration of Simulated Annealing with the (1+1)-Evolutionary Strategy outperforms alternative methods in predictive ranking and evolutionary processes, both on the training and testing datasets, regardless of whether Linear ranking initialization is employed, in contrast to the novel (1+1)-Evolutionary Gradient Strategy and other (1+1)-Evolutionary Strategy variants. This paper presents experimental results conducted on the MQ2008 dataset and provides accompanying code packages. Information Retrieval and Management Learning to Rank Exploration Exploitation Information Retrieval Evolutionary Gradient Strategy Full Text Additional Declarations The authors declare no competing interests. Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-3866499","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":267179302,"identity":"8ab05ef1-45c6-4346-b40c-38fed66f3c60","order_by":0,"name":"Osman Ali Sadek Ibrahim","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA9UlEQVRIiWNgGAWjYPACiQQGBh6GAwwVYJ4BKVrOEK+FAayFgbGNCC38/KcTPxcwWOSZt589eOjmvG2JDezN2yQYKmpxapGckbtZegaDRLHMmbyEw7nbbic28Bwrk2A4cxynFoMbvBukeRgkEmcw5BhAtEjkmEkwth3DreX82c2/wVr43wC1zAFqkX8D1PIPj5YDudsgtkiAbGkA2cID1NJQg88v26x5DCSKJSSAtuQcu23cxpNWbJFw7ABOLfz8Zzff5qmoy5PgzzH+nFNzW7af/fDGGx9q6nBqgToPic0GIhIYDhPQggUQsmUUjIJRMApGEAAAwSdT1SCeRLcAAAAASUVORK5CYII=","orcid":"https://orcid.org/0000-0001-9254-3093","institution":"Minia University","correspondingAuthor":true,"prefix":"","firstName":"Osman","middleName":"Ali Sadek","lastName":"Ibrahim","suffix":""}],"badges":[],"createdAt":"2024-01-15 12:47:13","currentVersionCode":1,"declarations":{"humanSubjects":false,"vertebrateSubjects":true,"conflictsOfInterestStatement":false,"humanSubjectEthicalGuidelines":false,"humanSubjectConsent":false,"humanSubjectClinicalTrial":false,"humanSubjectCaseReport":false,"vertebrateSubjectEthicalGuidelines":true},"doi":"10.21203/rs.3.rs-3866499/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-3866499/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":49652839,"identity":"2b1ee7e8-df7d-4c40-8d53-b579090b2d4a","added_by":"auto","created_at":"2024-01-16 02:03:15","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":495156,"visible":true,"origin":"","legend":"","description":"","filename":"ExplorationandExploitationMethodsSpringer.pdf","url":"https://assets-eu.researchsquare.com/files/rs-3866499/v1_covered_b85a39b9-38f5-4af8-a815-34ed8b39338a.pdf"}],"financialInterests":"The authors declare no competing interests.","formattedTitle":"\u003cp\u003eUsing exploration and exploitation techniques to improve ranking models through (1+1)-Evolutionary Algorithms\u003c/p\u003e","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":true,"hideJournal":true,"highlight":"","institution":"Minia University","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Learning to Rank, Exploration, Exploitation, Information Retrieval, Evolutionary Gradient Strategy","lastPublishedDoi":"10.21203/rs.3.rs-3866499/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-3866499/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eExploration and exploitation are fundamental concepts within the domain of Nature-Inspired Algorithms (NIAs) when optimizing solutions. Exploration aims to traverse a substantial portion of the solution space, whereas exploitation is directed at refining the current solution toward either local or global optima. For example, mutation represents an exploration technique, while crossover and enhanced initialization strategies are employed for exploitation. In this research, four probability distributions are employed for mutation within NIAs, and ranking models derived from Dependent Click and Linear Regression (LR) are leveraged to enhance the exploitation process. Empirical findings indicate a preference for employing Gaussian Random Number (GRN) in conjunction with LR and Dependent Click initialization when evolving on the training dataset. Conversely, Levy Random Number generation in combination with LR demonstrates superior performance on the unseen test dataset, with GRN emerging as a strong contender. Furthermore, the integration of Simulated Annealing with the (1+1)-Evolutionary Strategy outperforms alternative methods in predictive ranking and evolutionary processes, both on the training and testing datasets, regardless of whether Linear ranking initialization is employed, in contrast to the novel (1+1)-Evolutionary Gradient Strategy and other (1+1)-Evolutionary Strategy variants. This paper presents experimental results conducted on the MQ2008 dataset and provides accompanying code packages.\u003c/p\u003e","manuscriptTitle":"Using exploration and exploitation techniques to improve ranking models through (1+1)-Evolutionary Algorithms","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2024-01-16 01:55:06","doi":"10.21203/rs.3.rs-3866499/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"864a25bc-df34-470e-b40e-7fc3b4f5533a","owner":[],"postedDate":"January 16th, 2024","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[{"id":28145262,"name":"Information Retrieval and Management"}],"tags":[],"updatedAt":"2024-01-16T01:55:06+00:00","versionOfRecord":[],"versionCreatedAt":"2024-01-16 01:55:06","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-3866499","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-3866499","identity":"rs-3866499","version":["v1"]},"buildId":"qtupq5eGEP_6zYnWcrvyt","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}