Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

A quantum machine learning algorithm based on generative models.

ABSTRACT: Quantum computing and artificial intelligence, combined together, may revolutionize future technologies. A significant school of thought regarding artificial intelligence is based on generative models. Here, we propose a general quantum algorithm for machine learning based on a quantum generative model. We prove that our proposed model is more capable of representing probability distributions compared with classical generative models and has exponential speedup in learning and inference at least for some instances if a quantum computer cannot be efficiently simulated classically. Our result opens a new direction for quantum machine learning and offers a remarkable example where a quantum algorithm shows exponential improvement over classical algorithms in an important application field.

SUBMITTER: Gao X

PROVIDER: S-EPMC6286170 | biostudies-literature | 2018 Dec

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

A quantum machine learning algorithm based on generative models.

Gao X X Zhang Z-Y ZY Duan L-M LM

Science advances 20181207 12

Quantum computing and artificial intelligence, combined together, may revolutionize future technologies. A significant school of thought regarding artificial intelligence is based on generative models. Here, we propose a general quantum algorithm for machine learning based on a quantum generative model. We prove that our proposed model is more capable of representing probability distributions compared with classical generative models and has exponential speedup in learning and inference at least ...[more]

PMID: 30539141

Similar Datasets

Improving medical machine learning models with generative balancing for equity and excellence.

Project description:Applying machine learning to clinical outcome prediction is challenging due to imbalanced datasets and sensitive tasks that contain rare yet critical outcomes and where equitable treatment across diverse patient groups is essential. Despite attempts, biases in predictions persist, driven by disparities in representation and exacerbated by the scarcity of positive labels, perpetuating health inequities. This paper introduces FairPlay, a synthetic data generation approach leveraging large language models, to address these issues. FairPlay enhances algorithmic performance and reduces bias by creating realistic, anonymous synthetic patient data that improves representation and augments dataset patterns while preserving privacy. Through experiments on multiple datasets, we demonstrate that FairPlay boosts mortality prediction performance across diverse subgroups, achieving up to a 21% improvement in F1 Score without requiring additional data or altering downstream training pipelines. Furthermore, FairPlay consistently reduces subgroup performance gaps, as shown by universal improvements in performance and fairness metrics across four experimental setups.

| S-EPMC11828851 | biostudies-literature

Generative machine learning produces kinetic models that accurately characterize intracellular metabolic states.

Project description:Generating large omics datasets has become routine for gaining insights into cellular processes, yet deciphering these datasets to determine metabolic states remains challenging. Kinetic models can help integrate omics data by explicitly linking metabolite concentrations, metabolic fluxes and enzyme levels. Nevertheless, determining the kinetic parameters that underlie cellular physiology poses notable obstacles to the widespread use of these mathematical representations of metabolism. Here we present RENAISSANCE, a generative machine learning framework for efficiently parameterizing large-scale kinetic models with dynamic properties matching experimental observations. Through seamless integration of diverse omics data and other relevant information, including extracellular medium composition, physicochemical data and expertise of domain specialists, RENAISSANCE accurately characterizes intracellular metabolic states in Escherichia coli. It also estimates missing kinetic parameters and reconciles them with sparse experimental data, substantially reducing parameter uncertainty and improving accuracy. This framework will be valuable for researchers studying metabolic variations involving changes in metabolite and enzyme levels and enzyme activity in health and biotechnology.

| S-EPMC11499278 | biostudies-literature

Quantum generative adversarial learning in a superconducting quantum circuit.

Project description:Generative adversarial learning is one of the most exciting recent breakthroughs in machine learning. It has shown splendid performance in a variety of challenging tasks such as image and video generation. More recently, a quantum version of generative adversarial learning has been theoretically proposed and shown to have the potential of exhibiting an exponential advantage over its classical counterpart. Here, we report the first proof-of-principle experimental demonstration of quantum generative adversarial learning in a superconducting quantum circuit. We demonstrate that, after several rounds of adversarial learning, a quantum-state generator can be trained to replicate the statistics of the quantum data output from a quantum channel simulator, with a high fidelity (98.8% on average) so that the discriminator cannot distinguish between the true and the generated data. Our results pave the way for experimentally exploring the intriguing long-sought-after quantum advantages in machine learning tasks with noisy intermediate-scale quantum devices.

| S-EPMC6357722 | biostudies-literature

Flow-based Generative Models for Learning Manifold to Manifold Mappings.

Project description:Many measurements or observations in computer vision and machine learning manifest as non-Euclidean data. While recent proposals (like spherical CNN) have extended a number of deep neural network architectures to manifold-valued data, and this has often provided strong improvements in performance, the literature on generative models for manifold data is quite sparse. Partly due to this gap, there are also no modality transfer/translation models for manifold-valued data whereas numerous such methods based on generative models are available for natural images. This paper addresses this gap, motivated by a need in brain imaging - in doing so, we expand the operating range of certain generative models (as well as generative models for modality transfer) from natural images to images with manifold-valued measurements. Our main result is the design of a two-stream version of GLOW (flow-based invertible generative models) that can synthesize information of a field of one type of manifold-valued measurements given another. On the theoretical side, we introduce three kinds of invertible layers for manifold-valued data, which are not only analogous to their functionality in flow-based generative models (e.g., GLOW) but also preserve the key benefits (determinants of the Jacobian are easy to calculate). For experiments, on a large dataset from the Human Connectome Project (HCP), we show promising results where we can reliably and accurately reconstruct brain images of a field of orientation distribution functions (ODF) from diffusion tensor images (DTI), where the latter has a 5 × faster acquisition time but at the expense of worse angular resolution.

| S-EPMC8394699 | biostudies-literature

Ab Initio Molecular Cavity Quantum Electrodynamics Simulations Using Machine Learning Models.

Project description:We present a mixed quantum-classical simulation of polariton dynamics for molecule-cavity hybrid systems. In particular, we treat the coupled electronic-photonic degrees of freedom (DOFs) as the quantum subsystem and the nuclear DOFs as the classical subsystem and use the trajectory surface hopping approach to simulate non-adiabatic dynamics among the polariton states due to the coupled motion of nuclei. We use the accurate nuclear gradient expression derived from the Pauli-Fierz quantum electrodynamics Hamiltonian without making further approximations. The energies, gradients, and derivative couplings of the molecular systems are obtained from the on-the-fly simulations at the level of complete active space self-consistent field (CASSCF), which are used to compute the polariton energies and nuclear gradients. The derivatives of dipoles are also necessary ingredients in the polariton nuclear gradient expression but are often not readily available in electronic structure methods. To address this challenge, we use a machine learning model with the Kernel ridge regression method to construct the dipoles and further obtain their derivatives, at the same level as the CASSCF theory. The cavity loss process is modeled with the Lindblad jump superoperator on the reduced density of the electronic-photonic quantum subsystem. We investigate the azomethane molecule and its photoinduced isomerization dynamics inside the cavity. Our results show the accuracy of the machine-learned dipoles and their usage in simulating polariton dynamics. Our polariton dynamics results also demonstrate the isomerization reaction of azomethane can be effectively tuned by coupling to an optical cavity and by changing the light-matter coupling strength and the cavity loss rate.

| S-EPMC10134431 | biostudies-literature

Towards provably efficient quantum algorithms for large-scale machine-learning models.

Project description:Large machine learning models are revolutionary technologies of artificial intelligence whose bottlenecks include huge computational expenses, power, and time used both in the pre-training and fine-tuning process. In this work, we show that fault-tolerant quantum computing could possibly provide provably efficient resolutions for generic (stochastic) gradient descent algorithms, scaling as [Formula: see text], where n is the size of the models and T is the number of iterations in the training, as long as the models are both sufficiently dissipative and sparse, with small learning rates. Based on earlier efficient quantum algorithms for dissipative differential equations, we find and prove that similar algorithms work for (stochastic) gradient descent, the primary algorithm for machine learning. In practice, we benchmark instances of large machine learning models from 7 million to 103 million parameters. We find that, in the context of sparse training, a quantum enhancement is possible at the early stage of learning after model pruning, motivating a sparse parameter download and re-upload scheme. Our work shows solidly that fault-tolerant quantum algorithms could potentially contribute to most state-of-the-art, large-scale machine-learning problems.

| S-EPMC10781664 | biostudies-literature

Enhancing combinatorial optimization with classical and quantum generative models.

Project description:Devising an efficient exploration of the search space is one of the key challenges in the design of combinatorial optimization algorithms. Here, we introduce the Generator-Enhanced Optimization (GEO) strategy: a framework that leverages any generative model (classical, quantum, or quantum-inspired) to solve optimization problems. We focus on a quantum-inspired version of GEO relying on tensor-network Born machines, and referred to hereafter as TN-GEO. To illustrate our results, we run these benchmarks in the context of the canonical cardinality-constrained portfolio optimization problem by constructing instances from the S&P 500 and several other financial stock indexes, and demonstrate how the generalization capabilities of these quantum-inspired generative models can provide real value in the context of an industrial application. We also comprehensively compare state-of-the-art algorithms and show that TN-GEO is among the best; a remarkable outcome given the solvers used in the comparison have been fine-tuned for decades in this real-world industrial application. Also, a promising step toward a practical advantage with quantum-inspired models and, subsequently, with quantum generative models.

| S-EPMC10980691 | biostudies-literature

Early Prediction of Sepsis Based on Machine Learning Algorithm.

Project description:Sepsis is an organ failure disease caused by an infection resulting in extremely high mortality. Machine learning algorithms XGBoost and LightGBM are applied to construct two processing methods: mean processing method and feature generation method, aiming to predict early sepsis 6 hours in advance. The feature generation methods are constructed by combining different features, including statistical strength features, window features, and medical features. Miceforest multiple interpolation method is applied to tackle large missing data problems. Results show that the feature generation method outperforms the mean processing method. XGBoost and LightGBM algorithms are both excellent in prediction performance (AUC: 0.910∼0.979), among which LightGBM boasts a faster running speed and is stronger in generalization ability especially on multidimensional data, with AUC reaching 0.979 in the feature generation method. PTT, WBC, and platelets are the key risk factors to predict early sepsis.

| S-EPMC8526252 | biostudies-literature

A machine learning-based Biding price optimization algorithm approach.

Project description:Trading companies of used product market are struggling to gain customers attentaion and to sell the products. The aim of this research is to develop a mechanism that can maximize the sale of products while considering profit implications. The literature review classifies the procurement mechanism. Given the limited-supply nature, that also includes unpredictable quality levels and a procurement mechanism that perceives the company offering prices to suppliers on a single-item basis. The academic literature has not covered such a mechanism. Techniques like those that improve the required bidding strategy are reviewed and considered fit to be included in the support tool as the procedures intention to maximize an objective function depending on the bidding price and contain the probability of winning the auction and the profit made from the proceeding, the motivation laid on the approach that predicts the probability. It is determined that this assembles a Response to Reverse Request for Quotation that meets the assumptions of a First-Price Sealed-Bid(FPSD) auction that potentially includes a hidden reservation price.

| S-EPMC10565696 | biostudies-literature

Prediction Models for Sepsis-Associated Thrombocytopenia Risk in Intensive Care Units Based on a Machine Learning Algorithm.

Project description:Sepsis-associated thrombocytopenia (SAT) is a common complication in the intensive care unit (ICU), which significantly increases the mortality rate and leads to poor prognosis of diseases. Machine learning (ML) is widely used in disease prediction in critically ill patients. Here, we aimed to establish prediction models for platelet decrease and severe platelet decrease in ICU patients with sepsis based on four common ML algorithms and identify the best prediction model. The research subjects were 1,455 ICU sepsis patients admitted to Dongyang People's Hospital affiliated with Wenzhou Medical University from January 1, 2015, to October 31, 2019. Basic clinical demographic information, biochemical indicators, and clinical outcomes were recorded. The prediction models were based on four ML algorithms: random forest, neural network, gradient boosting machine, and Bayesian algorithms. Thrombocytopenia was found to occur in 732 patients (49.7%). The mechanical ventilation time and length of ICU stay were longer, and the mortality rate was higher for the thrombocytopenia group than for the non-thrombocytopenia group. The models were validated on an online international database (Medical Information Mart for Intensive Care III). The areas under the receiver operating characteristic curves (AUCs) of the four models for the prediction of thrombocytopenia were between 0.54 and 0.72. The AUCs of the models for the prediction of severe thrombocytopenia were between 0.70 and 0.77. The neural network and gradient boosting machine models effectively predicted the occurrence of SAT, and the Bayesian models had the best performance in predicting severe thrombocytopenia. Therefore, these models can be used to identify such high-risk patients at an early stage and guide individualized clinical treatment, to improve the prognosis of diseases.

| S-EPMC8829034 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data