Quantum computer optimizes investment portfolios, outperforming traditional methods.
problem Minimizing risk while meeting return and budget constraints in investment portfolios.
method Used D-Wave quantum annealer and hybrid solvers to solve Portfolio Optimization problem.
result D-Wave quantum solution performs close to traditional commercial solvers for tested problem sizes.
D-Wave hybrid quantum-classical portfolio optimization shows classical decomposition is key, not quantum sampling.
problem Optimizing portfolios with constraints using hybrid quantum-classical methods.
method Operational decomposition audit of D-Wave's hybrid quantum-classical service on mean-variance-turnover instances.
result Classical decomposition and feasibility-aware reassembly are key to hybrid quantum-classical performance.
Study explores D-Wave QA for RBM training, finds modest benefits but no significant improvements.
problem Improving RBM training using D-Wave quantum annealing.
method Hybrid sampling approach combining classical and D-Wave QA methods.
result No significant improvements in RBM training using D-Wave QA, but potential for CF mitigation.
D-Wave computers struggle with sampling Boltzmann distributions efficiently.
problem Sampling Boltzmann distributions efficiently on D-Wave computers.
method Exploring various obstacles and remaining difficulties.
result Challenges remain in using D-Wave computers for efficient sampling.
Quantum optimization for portfolios with risk and diversification constraints.
problem Implementing complex constraints in portfolio optimization for financial applications.
method Transformed portfolio optimization into a quadratic binary optimization problem suitable for quantum annealers.
result Demonstrated practical implementation of daily constraints in real data using quantum processors.
Investigates quantum vs classical portfolio optimization of 60 stocks.
problem Optimizing risk vs return portfolios of 60 stocks using quantum and classical methods.
method Classical and quantum annealing approaches applied to historical data.
result Quantum and classical methods yield similar optimal portfolios.
Paper tackles dynamic portfolio optimization using quantum and quantum-inspired methods.
problem Optimizing investment portfolios over time considering transaction costs and constraints.
method Implemented quantum and quantum-inspired algorithms on different hardware platforms for real data.
result D-Wave Hybrid and Tensor Networks handle the largest systems up to 1272 qubits.
D-Wave quantum annealers represent a novel computational architecture and have attracted significant interest, but have been used for few real-world computations. Machine learning has been identified as an area where quantum annealing may be useful. Here, we show that the D-Wave 2X can be effectively used as part of an…
A D-Wave quantum annealer (QA) having a 2048 qubit lattice, with no missing qubits and couplings, allowed embedding of a complete graph of a Restricted Boltzmann Machine (RBM). A handwritten digit OptDigits data set having 8x7 pixels of visible units was used to train the RBM using a classical Contrastive Divergence. E…
Quantum annealing solves matrix factorization for large datasets.
problem Finding low-rank approximations of large real-valued matrices.
method Transformed real optimization into QUBO problems, solved on D-Wave quantum annealer.
result Quantum approach outperforms classical methods and finds better results.
D-Wave quantum annealing fails to improve sampling quality from RBMs compared to Gibbs sampling.
problem Improving sampling quality from RBMs using D-Wave quantum annealing.
method Comparison of D-Wave quantum annealing and Gibbs sampling for RBM sampling.
result D-Wave sampling does not significantly improve the number of local valleys compared to Gibbs sampling.
End-to-end portfolio optimization using quantum annealing for financial decision problems.
problem Optimizing financial portfolios with quantum computing constraints.
method Hybrid pipeline combining quantum and classical optimization.
result Quantum-assisted portfolio optimization can achieve competitive returns.
Quantum computer helps optimize stock portfolios.
problem Finding the best mix of stocks for optimal risk and return.
method Classical and quantum approaches to portfolio optimization.
result Quantum computer improves portfolio selection.
Study analyzes 3,171 stocks to pick efficient portfolios using quantum and classical solvers.
problem Creating efficient stock portfolios from a large dataset.
method Used classical and quantum solvers to optimize portfolios of 3,171 US stocks.
result Demonstrated the effectiveness of quantum and classical solvers in portfolio optimization.
We investigate a hybrid quantum-classical solution method to the mean-variance portfolio optimization problems. Starting from real financial data statistics and following the principles of the Modern Portfolio Theory, we generate parametrized samples of portfolio optimization problems that can be related to quadratic b…
We propose a regression algorithm that utilizes a learned dictionary optimized for sparse inference on a D-Wave quantum annealer. In this regression algorithm, we concatenate the independent and dependent variables as a combined vector, and encode the high-order correlations between them into a dictionary optimized for…
Kernel-based support vector machines (SVMs) are supervised machine learning algorithms for classification and regression problems. We introduce a method to train SVMs on a D-Wave 2000Q quantum annealer and study its performance in comparison to SVMs trained on conventional computers. The method is applied to both synth…
Quantum annealer speeds up RBM training for image classification.
problem Training RBM with contrastive divergence (CD) is slow and computationally expensive.
method Used D-Wave 2000Q quantum annealer to calculate model expectation of gradient learning for RBM.
result Quantum training yields similar classification performance to CD but faster.
Lossy compression of statistical data using quantum annealing.
problem Efficiently compressing statistical floating-point data.
method Representation learning with binary variables, classical optimization of basis vectors, quantum annealing for coefficients, bias correction.
result Quantum annealing shows promising results with 3.5x better compression than neural-network autoencoders.
Proposes a quantum-inspired algorithm for selecting representative data subsets.
problem Selecting the most representative subset of data from a larger dataset.
method Uses a Quadratic Unconstrained Binary Optimization (QUBO) problem approach.
result Demonstrates the effectiveness of the selector algorithm in finance applications.
Defines non-parabolic curves in spatial hybrid space with applications.
problem Defining and analyzing non-parabolic spatial hybrid framed curves.
method Definition and proof of existence and uniqueness theorem for non-parabolic spatial hybrid framed curves.
result Existence and uniqueness theorem for non-parabolic spatial hybrid framed curves.
Quantum computing techniques improve graph analysis and community detection.
problem Analyzing large graphs efficiently and accurately.
method Used quantum annealing and quantum gate computers for community detection and regularity checking.
result Demonstrated the effectiveness of quantum computing in solving complex graph problems.
A new penalty-free method optimizes portfolios without quantum annealing penalties.
problem Optimizing portfolios with quantum annealing penalties.
method Removing the penalty term and using a classical feasibility projector.
result Significant reduction in chain-break fractions and post-processed regret.
Discussing hybrid models in Bayesian networks.
problem Improving accuracy in network modeling.
method Hybrid semiparametric Bayesian approach.
result Enhanced model performance in complex networks.
Expert augmentation improves hybrid model generalization.
problem Limited generalization of hybrid models outside training distribution.
method Introducing expert augmentation to improve hybrid model performance.
result Expert augmentation improves generalization of hybrid models.
In this work we present a new approach on studying dynamical systems. Combining the two ways of expressing the uncertainty, using probabilistic theory and credibility theory, we have research the generalized fractional hybrid equations. We have introduced the concepts of generalized fractional Wiener process, generaliz…
We explore hybrid subgroups of certain non-arithmetic lattices in PU(2,1). We show that all of Mostow's lattices are virtually hybrids; moreover, we show that some of these non-arithmetic lattices are hybrids of two non-commensurable arithmetic lattices in PU(1,1).
Defines hybrid systems on principal bundles and studies impact effects.
problem Understanding impact effects in hybrid mechanical systems.
method Defines hybrid systems on principal bundles, studies underlying geometry, and finds conditions for impact preservation.
result Conditions for preservation of both exterior and interior impacts by mechanical connections.
Hybrid models forecast EPEC energy spot prices.
problem Forecasting energy spot prices in EPEC markets.
method Combining Naive, Fourier, ARMA/GARCH, mean-reversion, jump-diffusion, and RNN models.
result Improved accuracy in forecasting compared to individual models.
New method sparsifies hybrid neural ODEs for better performance and stability.
problem Excessive latent states and interactions from mechanistic models lead to training inefficiency and over-fitting.
method Automatic state selection and structure optimization combining domain-informed graph modifications with data-driven regularization.
result Improved predictive performance and robustness with desired sparsity.
Hybrid models combine interpretable and complex models for better performance and control.
problem Improving model performance and user transparency in machine learning.
method Investigates hybrid models from theory, taxonomy, and methodological perspectives.
result Hybrid models can outperform standalone black boxes and provide precise control over transparency.
A hybrid ASR system using conformer architecture improves word-error-rate and training speed.
problem Improving word-error-rate and training efficiency for hybrid ASR systems.
method Used conformer architecture, applied time downsampling, and transposed convolutions.
result Conformer-based hybrid model achieves competitive results and significantly outperforms BLSTM-based hybrid model.
We solve a multi-period portfolio optimization problem using D-Wave Systems' quantum annealer. We derive a formulation of the problem, discuss several possible integer encoding schemes, and present numerical examples that show high success rates. The formulation incorporates transaction costs (including permanent and t…
The paper introduces FMCI and hybrid decoding for hidden Markov models.
problem Computing distributions and decoding hidden state sequences in HMMs.
method Finite Markov chain imbedding (FMCI) and hybrid decoding.
result Hybrid decoding improves performance over traditional methods.
In the present paper, a fuzzy logic based method is combined with wavelet decomposition to develop a step-by-step dynamic hybrid model for the estimation of financial time series. Empirical tests on fuzzy regression, wavelet decomposition as well as the new hybrid model are conducted on the well known SP500 index fin…
Hybrid model improves music source separation by 1.4 dB.
problem Improving music source separation accuracy.
method End-to-end hybrid spectrogram and waveform model, using model decision for domain choice.
result 1.4 dB improvement in Signal-to-Distortion (SDR) on MusDB HQ dataset.
Develops numerical methods for PDEs on hypergraphs and networks.
problem Solving PDEs on complex geometric structures like hypergraphs and networks.
method Hybrid finite element methods, focusing on hybrid discontinuous Galerkin methods.
result Derives numerical approximations for PDEs on hypergraphs and networks.
Paper proposes a method to estimate scientific parameters in hybrid models without relying on model architecture.
problem Estimating unknown parameters in hybrid models combining machine learning and scientific models.
method Sharpness-aware minimization adapted for hybrid modeling, focusing on model simplicity.
result Demonstrates effectiveness of SAM-based hybrid model learning for scientific parameter estimation.
HyBO optimizes hybrid structures using diffusion kernels.
problem Optimizing complex interactions between discrete and continuous variables.
method HyBO uses diffusion kernels over hybrid spaces with additive kernel formulation.
result HyBO significantly outperforms state-of-the-art methods on real-world benchmarks.
Mathematical analysis of Riemann surfaces and their moduli spaces using hybrid Laplacians.
problem Analyzing the asymptotics of Arakelov Green functions on Riemann surfaces near boundary of moduli spaces.
method Introducing hybrid Laplacian, solving hybrid Poisson equation, and defining hybrid Green functions.
result Layered description of asymptotics of Arakelov Green functions on Riemann surfaces near boundary of their moduli spaces.
Restricted Boltzmann machines (RBMs) are powerful machine learning models, but learning and some kinds of inference in the model require sampling-based approximations, which, in classical digital computers, are implemented using expensive MCMC. Physical computation offers the opportunity to reduce the cost of sampling …
Novel hybrid method for Bayesian network structure learning reduces computational time without sacrificing accuracy.
problem Bayesian network structure learning efficiency and accuracy trade-off.
method Partitioned PC (pPC), p-value adjacency thresholding (PATH), hybrid greedy initialization (HGI). result pHGS achieves significant computational reductions compared to the PC algorithm without sacrificing structure learning accuracy.
Hybrid systems are characterized by having an interaction between continuous dynamics and discrete events. The contribution of this paper is to provide hybrid systems with a novel geometric formulation so that controls can be added. Using this framework we describe some new global controllability tests for hybrid contr…
A hybrid model for Bayesian optimization handles mixed variables using MCTS for categorical and GP for continuous.
problem Optimizing functions with mixed variable types (continuous, integer, categorical).
method Merges MCTS for categorical and GP for continuous variables, integrates UCTS search strategy, and dynamically selects kernels.
result Hybrid models outperform traditional methods in Bayesian optimization.
This paper explores data science applications in economics using a taxonomy of models and hybrid models showing higher accuracy.
problem Investigating data science applications in economics.
method Systematic literature review using Prisma method.
result Hybrid models showed higher prediction accuracy than other algorithms.
Regularization is an important component of predictive model building. The hybrid bootstrap is a regularization technique that functions similarly to dropout except that features are resampled from other training points rather than replaced with zeros. We show that the hybrid bootstrap offers superior performance to dr…
Optimizes train schedules and maintenance using CP and QA.
problem Optimizing train schedules and maintenance considering constraints.
method Used Constraint Programming and Quantum Annealing to model and solve the problem.
result Both CP and QA approaches produce comparable results on real quantum computers.
MES-LSTM hybrid method improves multivariate time series forecasting and mortality modeling.
problem Challenges in applying hybrid forecast methods to multivariate data.
method Generalized multivariate extension of ES-RNN, utilizing vectorized implementation.
result MES-LSTM shows significant improvement over pure statistical and deep learning methods in forecast accuracy and prediction interval construction.