检索结果-内蒙古大学图书馆

Using Reinforcement Learning for Per-Instance Algorithm Configuration on the TSP

学校读者我要写书评

暂无评论

Using Reinforcement Learning for Per-Instance Algorithm Conf...

IEEE Symposium Series on Computational Intelligence (SSCI)

作者： Moritz Vinzent Seiler Jeroen Rook Jonathan Heins Oliver Ludger Preuß Jakob Bossek Heike Trautmann Data Science: Statistics and Optimization University of Münster Münster Germany Data Management and Biometrics University of Twente Enschede Netherlands Big Data Analytics in Transportation TU Dresden Dresden Germany Chair for AI Methodology RWTH Aachen University Aachen Germany Data Science: Statistics and Optimization University of Twente Enschede Netherlands

Automated Algorithm Configuration (AAC) usually takes a global perspective: it identifies a parameter configuration for an (optimization) algorithm that maximizes a performance metric over a set of instances. However, the optimal choice of parameters strongly depends on the instance at hand and should thus be calculated on a per-instance basis. We explore the potential of Per-Instance Algorithm Configuration (PIAC) by using Reinforcement Learning (RL). To this end, we propose a novel PIAC approach that is based on deep neural networks. We apply it to predict configurations for the Lin-Kernighan heuristic (LKH) for the Traveling Salesperson Problem (TSP) individually for every single instance. To train our PIAC approach, we create a large set of 100 000 TSP instances with 2 000 nodes each - currently the largest benchmark set to the best of our knowledge. We compare our approach to the state-of-the-art AAC method Sequential Model-based Algorithm Configuration (SMAC). The results show that our PIAC approach outperforms this baseline on both the newly created instance set and established instance sets.

关键词：

Reconstructing the Hubble parameter with future Gravitational Wave missions using Machine Learning

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Mukherjee, Purba Shah, Rahul Bhaumik, Arko Pal, Supratik Physics and Applied Mathematics Unit Indian Statistical Institute 203 B.T. Road Kolkata700 108 India Technology Innovation Hub on Data Science Big Data Analytics and Data Curation Indian Statistical Institute 203 B.T. Road Kolkata700 108 India

We study the prospects of Gaussian processes (GP), a machine learning (ML) algorithm, as a tool to reconstruct the Hubble parameter H(z) with two upcoming gravitational wave missions, namely the evolved Laser Interferometer Space Antenna (eLISA) and the Einstein Telescope (ET). Assuming various background cosmological models, the Hubble parameter has been reconstructed in a non-parametric manner with the help of GP using realistically generated catalogs for each mission. The effects of early-time and late-time priors on the reconstruction of H(z), and hence on the Hubble constant (H0), have also been focused on separately. Our analysis reveals that GP is quite robust in reconstructing the expansion history of the Universe within the observational window of the specific missions under consideration. We further confirm that both eLISA and ET would be able to provide constraints on H(z) and H0 which would be competitive to those inferred from current datasets. In particular, we observe that an eLISA run of ∼ 10-year duration with ∼ 80 detected bright siren events would be able to constrain H0 as good as a ∼ 3-year ET run assuming ∼ 1000 bright siren event detections. Further improvement in precision is expected for longer eLISA mission durations such as a ∼ 15-year time-frame having ∼ 120 events. Lastly, we discuss the possible role of these future gravitational wave missions in addressing the Hubble tension, for each model, on a case-by-case basis. Copyright © 2023, The Authors. All rights reserved.

关键词： Gravity waves

Learning from Semi-Factuals: A Debiased and Semantic-Aware Framework for Generalized Relation Discovery

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wang, Jiaxin Zhang, Lingling Liu, Jun Guo, Tianlin Wu, Wenjun The School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China The Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University Shaanxi Xi’an710049 China National Engineering Lab for Big Data Analytics Xi’an Jiaotong University Shaanxi Xi’an710049 China

We introduce a novel task, called Generalized Relation Discovery (GRD), for open-world relation extraction. GRD aims to identify unlabeled instances in existing pre-defined relations or discover novel relations by assigning instances to clusters as well as providing specific meanings for these clusters. The key challenges of GRD are how to mitigate the serious model biases caused by labeled pre-defined relations to learn effective relational representations and how to determine the specific semantics of novel relations during classifying or clustering unlabeled instances. We then propose a novel framework, SFGRD, for this task to solve the above issues by learning from semi-factuals in two stages. The first stage is semi-factual generation implemented by a tri-view debiased relation representation module, in which we take each original sentence as the main view and design two debiased views to generate semi-factual examples for this sentence. The second stage is semi-factual thinking executed by a dual-space tri-view collaborative relation learning module, where we design a cluster-semantic space and a class-index space to learn relational semantics and relation label indices, respectively. In addition, we devise alignment and selection strategies to integrate two spaces and establish a self-supervised learning loop for unlabeled data by doing semi-factual thinking across three views. Extensive experimental results show that SFGRD surpasses state-of-the-art models in terms of accuracy by 2.36% ∼5.78% and cosine similarity by 32.19%∼ 84.45% for relation label index and relation semantic quality, respectively. To the best of our knowledge, we are the first to exploit the efficacy of semi-factuals in relation extraction. Copyright © 2024, The Authors. All rights reserved.

关键词： Extraction

MOMENTUM BENEFITS NON-IID FEDERATED LEARNING SIMPLY AND PROVABLY

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Cheng, Ziheng Huang, Xinmeng Wu, Pengfei Yuan, Kun Peking University China University of Pennsylvania United States National Engineering Labratory for Big Data Analytics and Applications AI for Science Institute Beijing China

Federated learning is a powerful paradigm for large-scale machine learning, but it faces significant challenges due to unreliable network connections, slow communication, and substantial data heterogeneity across clients. FEDAVG and SCAFFOLD are two prominent algorithms to address these challenges. In particular, FEDAVG employs multiple local updates before communicating with a central server, while SCAFFOLD maintains a control variable on each client to compensate for "client drift" in its local updates. Various methods have been proposed to enhance the convergence of these two algorithms, but they either make impractical adjustments to the algorithmic structure or rely on the assumption of bounded data heterogeneity. This paper explores the utilization of momentum to enhance the performance of FEDAVG and SCAFFOLD. When all clients participate in the training process, we demonstrate that incorporating momentum allows FEDAVG to converge without relying on the assumption of bounded data heterogeneity even using a constant local learning rate. This is novel and fairly surprising as existing analyses for FEDAVG require bounded data heterogeneity even with diminishing local learning rates. In partial client participation, we show that momentum enables SCAFFOLD to converge provably faster without imposing any additional assumptions. Furthermore, we use momentum to develop new variance-reduced extensions of FEDAVG and SCAFFOLD, which exhibit state-of-the-art convergence rates. Our experimental results support all theoretical findings. Copyright © 2023, The Authors. All rights reserved.

关键词： Momentum

Optimizing Ethanol Production in Escherichia Coli Using a Hybrid of Particle Swarm Optimization and Artificial Bee Colony 22

学校读者我要写书评

暂无评论

Optimizing Ethanol Production in Escherichia Coli Using a Hy...

Proceedings of the 6th International Conference on Advances in Artificial Intelligence

作者： Mohamad Faiz Dzulkalnine Mohd Saberi Mohamad Yee Wen Choon Muhammad Akmal Remli Hany Alashwal Artificial Intelligence and Bioinformatics Research Group Faculty of Computing Universiti Teknologi Malaysia Malaysia Health Data Science Lab Department of Genetics and Genomics College of Medical and Health Sciences United Arab Emirates University UAE and Big Data Analytics Center United Arab Emirates University UAE Institute for Artificial Intelligence and Big Data Universiti Malaysia Kelantan Malaysia and Department of Data Science Universiti Malaysia Kelantan Malaysia Department of Computer Science and Software Engineering College of Information Technology United Arab Emirates University UAE and Big Data Analytics Center United Arab Emirates University UAE

ISBN: (纸本)9781450396943

Metabolic engineering for biomass production using microorganisms’ cell has received considerable attention in recent years. This is due to the biomass products being extensively used in the field of food additives, supplements, pharmaceuticals, and polymer materials. In this paper, ethanol production in Escherichia coli (E. coli) is the desired product. Sugarcane and corn are often used to produce ethanol. However, one of the problems to produce adequate amounts of ethanol is that large areas are needed to plant sugarcane and corn. Furthermore, the amount of time for the process of dry milling and wet milling is high, which are 40 to 50 hours and 24 to 48 hours, respectively. The wet laboratory is also having limitation on the production of ethanol in microorganisms because the amount of the ethanol produced is not satisfying. Hence, a lot of metabolic engineering techniques is introduced to enhance the production of ethanol in E. coli, such as gene knockout strategy, but the production is yet to meet the demand. Therefore, this paper proposes a hybrid algorithm of Particle Swarm Optimization with the Artificial Bee Colony algorithm (PSOABC) to identify the optimal set of gene knockout strategy to improve the ethanol production in E. coli. A list of genes to knockout, production of the desired product, and growth rate are presented in this paper. PSOABC has shown better performance in terms of production, growth rate and accuracy.

关键词： Gene Knockouts Particle Swarm Optimization Artificial Bee Colony Ethanol Flux Balance Analysis

Identifying novel protein biomarkers with cross-psychiatric disorders effects and potential intervention targets: Evidence from proteomic-Mendelian randomization

学校读者我要写书评

暂无评论

Progress in Neuro-Psychopharmacology and Biological Psychiatry 2025年 139卷 111396页

作者： Zhang, Ronghui Luo, Jia Wang, Tong Wang, Weijing Sun, Jing Zhang, Dongfeng Department of Epidemiology and Health Statistics The School of Public Health of Qingdao University Shandong Province Qingdao China Department of Big Data in Health Science School of Public Health Center of Clinical Big Data and Analytics of the Second Affiliated Hospital Zhejiang University School of Medicine Hangzhou China

Plasma proteins are the potential therapeutic targets for psychiatric disorders due to their important roles in signal transduction. We aimed to explore the plasma protein biomarkers with cross-psychiatric disorders effects. Proteome-wide Mendelian randomization (MR) and colocalization analyses were performed to investigate the potential causal relationship between plasma protein biomarkers and 12 psychiatric disorders and further identify the potential proteins with cross-effects. To assess the directionality and exclude potential reverse causation, Steiger directionality tests and reverse MR analyses were additionally conducted. Then, validation analysis was performed by employing summary data from cross-psychiatric disorder GWAS to validate the cross-psychiatric effects of proteins. Protein-protein interactions were conducted to evaluate the interaction between candidate proteins and druggability assessment was used to prioritize potential drug targets for psychiatric disorders. We identified novel plasma proteins that possessed cross-psychiatric disorder effects, especially BTN2A1 and BTN3A2 associated with major depressive disorder (MDD), schizophrenia (SCZ), and bipolar disorder (BIP);ITIH1, ITIH3, ITIH4 and FES associated with SCZ and BIP, and the cross-effects of these proteins on SCZ and BIP were confirmed by validation analyses. Steiger tests and reverse MR supported causal directionality. Besides, the protein-protein interactions (PPI) analysis indicated cross-effects proteins had significant interaction, especially ITIH1-ITIH3. The druggability assessment prioritized eight proteins, two of which (ITIH3 and NCAM1) has been targeted by antipsychotic drugs. Our findings provided insights into shared biological mechanisms underlying these conditions. © 2025 Elsevier Inc.

关键词： Biomarker Drug target Protein Proteome-wide Mendelian randomization Psychiatric disorders

An Enhanced BERTopic Framework and Algorithm for Improving Topic Coherence and Diversity

学校读者我要写书评

暂无评论

An Enhanced BERTopic Framework and Algorithm for Improving T...

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Sahil Sawant Jinhong Yu Kirtikumar Pandya Chun-Kit Ngan Rolf Bardeli Data Science Program Worcester Polytechnic Institute Worcester MA USA Big Data & Consumer Analytics Vodafone GmbH Duesseldorf NRW Germany

In this paper, we enhance and customize the existing BERTopic framework to develop and implement an automated pipeline that delivers a more coherent and diverse set of topics with an even moderate dataset. More specifically, the contributions of this work are threefold: (1) integrate a dynamic and advanced optimizer into the existing BERTopic framework to learn the optimal number of dimensions of different document embeddings, (2) develop a k-means-based algorithm in the optimizer to support the dimension-embedding learning, and (3) conduct an extensive experimental study on three distinct types of datasets, including DBPedia, AG News, and Reuters, to evaluate the performance of our approach in terms of the topic quality (TQ) score computed by the topic coherence and the topic diversity. From the results, we can conclude that our enhanced, automated BERTopic framework with its dimension-embedding learning algorithm on documents outperforms the TQ score of the existing framework by 4.49% (before removing the stop words) and 16.52% (after removing the stop words) among all the four representable document-embedding approaches, including the BERTopic's Default Sentence Transformer, Google's Universal Sentence Encoder, OpenAI GPT-2, and our investigators' developed Context-aware Embedding Model, on all the three datasets.

关键词： Heuristic algorithms Pipelines Coherence Transformers Internet Context modeling

A COLLECTION OF DEEP LEARNING-BASED FEATURE-FREE APPROACHES FOR CHARACTERIZING SINGLE-OBJECTIVE CONTINUOUS FITNESS LANDSCAPES

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Seiler, Moritz Vinzent Prager, Raphael Patrick Kerschke, Pascal Trautmann, Heike Data Science: Statistics and Optimization University of Münster Germany Big Data Analytics in Transportation Tu Dresden Germany University of Twente Netherlands

Exploratory Landscape Analysis is a powerful technique for numerically characterizing landscapes of single-objective continuous optimization problems. Landscape insights are crucial both for problem understanding as well as for assessing benchmark set diversity and composition. Despite the irrefutable usefulness of these features, they suffer from their own ailments and downsides. Hence, in this work we provide a collection of different approaches to characterize optimization landscapes. Similar to conventional landscape features, we require a small initial sample. However, instead of computing features based on that sample, we develop alternative representations of the original sample. These range from point clouds to 2D images and, therefore, are entirely feature-free. We demonstrate and validate our devised methods on the BBOB testbed and predict, with the help of Deep Learning, the high-level, expert-based landscape properties such as the degree of multimodality and the existence of funnel structures. The quality of our approaches is on par with methods relying on the traditional landscape features. Thereby, we provide an exciting new perspective on every research area which utilizes problem information such as problem understanding and algorithm design as well as automated algorithm configuration and selection. © 2022, CC BY.

关键词： Optimization

Hybridizing Target- and SHAP-encoded Features for Algorithm Selection in Mixed-variable Black-box Optimization

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Dietrich, Konstantin Prager, Raphael Patrick Doerr, Carola Trautmann, Heike Big Data Analytics in Transportation TU Dresden Germany ScaDS.AI Dresden Germany Data Science: Statistics and Optimization University of Münster Germany Sorbonne Université CNRS LIP6 Paris France Machine Learning and Optimisation Paderborn University Germany Data Management and Biometrics Group University of Twente Netherlands

Exploratory landscape analysis (ELA) is a well-established tool to characterize optimization problems via numerical features. ELA is used for problem comprehension, algorithm design, and applications such as automated algorithm selection and configuration. Until recently, however, ELA was limited to search spaces with either continuous or discrete variables, neglecting problems with mixed variable types. This gap was addressed in a recent study that uses an approach based on target-encoding to compute exploratory landscape features for mixed-variable problems. In this work, we investigate an alternative encoding scheme based on SHAP values. While these features do not lead to better results in the algorithm selection setting considered in previous work, the two different encoding mechanisms exhibit complementary performance. Combining both feature sets into a hybrid approach outperforms each encoding mechanism individually. Finally, we experiment with two different ways of meta-selecting between the two feature sets. Both approaches are capable of taking advantage of the performance complementarity of the models trained on target-encoded and SHAP-encoded feature sets, respectively. Copyright © 2024, The Authors. All rights reserved.

关键词： Optimization