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.
New hybrid RL algorithm outperforms model-free and model-based methods.
problem Improving reinforcement learning algorithms for MDPs.
method Combines model-free and model-based learning, with a PAC analysis.
result Outperforms both model-free and model-based methods in most cases.
New algorithm fills gaps in offline data for hybrid RL, achieving similar gains without coverage assumptions.
problem Lack of provable benefits in hybrid RL with coverage assumptions.
method Warm-starting optimistic online algorithms with offline data in experience replay buffer.
result Hybrid RL gains similar to offline-only RL without coverage assumptions, demonstrating efficient exploration.
Hybrid models improve groundwater level prediction and uncertainty analysis.
problem Predicting and analyzing uncertainty of monthly groundwater levels.
method Six evolutionary optimization algorithms (GOA, CSO, WA, GA, KA, PSO) hybridized with ANFIS, ANN, and SVM.
result ANFIS-GOA outperformed other models in predicting groundwater levels.
This paper provides a geometrical derivation of the Hybrid Minimum Principle (HMP) for autonomous hybrid systems whose state manifolds constitute Lie groups (G,⋆) which are left invariant under the controlled dynamics of the system, and whose switching manifolds are defined as smooth embedded time invariant subma…
A new hybrid algorithm reduces stochastic gradient evaluations for nonconvex optimization.
problem Solving stochastic composite nonconvex optimization problems efficiently.
method Proposes a new hybrid variance-reduced proximal gradient method with a stochastic gradient estimator.
result Achieves optimal stochastic oracle complexity bound with one less gradient evaluation.
A new hybrid fuzzy-crisp clustering algorithm addresses imbalanced cluster sizes.
problem Imbalanced influence in fuzzy c-means clustering for large vs. small clusters.
method Hybrid fuzzy-crisp algorithm combining linear and quadratic membership functions, setting exact zero membership for sufficiently distant points.
result The hybrid algorithm outperforms conventional fuzzy and crisp clustering methods on imbalanced datasets.
A new hybrid federated learning algorithm for combining clinical and omics data.
problem Combining clinical and omics data in federated learning settings.
method Reformulated Kernel Regularized Least Squares algorithm for hybrid federated learning.
result Validation of two variants of the hybrid algorithm on well-established datasets.
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.
The present work proposes hybridization of Expectation-Maximization (EM) and K-Means techniques as an attempt to speed-up the clustering process. Though both K-Means and EM techniques look into different areas, K-means can be viewed as an approximate way to obtain maximum likelihood estimates for the means. Along with …
Hybrid LSTM-ARIMA model outperforms other algorithms in algorithmic investment strategies.
problem Developing an optimal algorithmic investment strategy.
method Combines LSTM and ARIMA models, using LSTM for final predictions and ARIMA residuals for boosting.
result LSTM-ARIMA algorithm outperforms all other algorithms across multiple equity indices.
Hybrid RL algorithms improve offline and online RL in linear MDPs.
problem Improving RL performance without single-policy concentrability.
method Developed computationally efficient algorithms for PAC and regret-minimizing RL in linear MDPs.
result Achieved sharper error or regret bounds for linear MDPs.
Paper proposes a hybrid RL algorithm that combines offline and online data without needing reward info.
problem How to efficiently use online data to improve RL policies using only offline data.
method A three-stage hybrid RL algorithm that uses reward-agnostic exploration and model-based offline RL.
result The hybrid RL algorithm outperforms both pure offline and pure online RL in sample complexity.
A new hybrid Newton algorithm improves convergence in logistic regression.
problem Solving large-scale binary classification problems efficiently.
method Proposes a hybrid stochastic Newton algorithm with two weighted components in the Hessian matrix estimation.
result Proves almost sure convergence to the true parameter of logistic regression.
Paper addresses hybrid learning with constrained adversaries, achieving optimal performance.
problem Hybrid learning problem with i.i.d. features and adversarial labels.
method Structured adversarial setting, efficient algorithm with ERM oracle.
result Oracle-efficient algorithm with regret scaling with Rademacher complexity.
The hybrid Monte Carlo (HMC) algorithm is used for Bayesian analysis of the generalized autoregressive conditional heteroscedasticity (GARCH) model. The HMC algorithm is one of Markov chain Monte Carlo (MCMC) algorithms and it updates all parameters at once. We demonstrate that how the HMC reproduces the GARCH paramete…
Hybrid approach for large-scale network synchronization using KF and PTP.
problem Synchronization of large-scale networks in 5G.
method Combines Kalman Filtering and PTP for pairwise synchronization, and Factor Graphs and Belief Propagation for end-to-end synchronization.
result Error in offset estimation remains below 5 ns in simulations.
This paper presents several numerical applications of deep learning-based algorithms that have been introduced in [HPBL18]. Numerical and comparative tests using TensorFlow illustrate the performance of our different algorithms, namely control learning by performance iteration (algorithms NNcontPI and ClassifPI), contr…
We introduce a hybrid stochastic estimator to design stochastic gradient algorithms for solving stochastic optimization problems. Such a hybrid estimator is a convex combination of two existing biased and unbiased estimators and leads to some useful property on its variance. We limit our consideration to a hybrid SARAH…
We present a hybrid algorithm for optimizing a convex, smooth function over the cone of positive semidefinite matrices. Our algorithm converges to the global optimal solution and can be used to solve general large-scale semidefinite programs and hence can be readily applied to a variety of machine learning problems. We…
Unified reinforcement learning methods using hybrid inference.
problem Combining model-based and model-free reinforcement learning approaches.
method Control as Hybrid Inference (CHI) framework.
result CHI algorithm balances model-based and model-free learning.
Meta learning optimizes neural network quantization for efficient inference.
problem Uniform bitwidth quantization is sub-optimal for neural network compression.
method Meta learning to automatically generate hybrid quantization policies.
result Meta learning outperforms uniform quantization and RL approaches.
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.
Most existing deep reinforcement learning (DRL) frameworks consider either discrete action space or continuous action space solely. Motivated by applications in computer games, we consider the scenario with discrete-continuous hybrid action space. To handle hybrid action space, previous works either approximate the hyb…
Variational Bayesian inference and (collapsed) Gibbs sampling are the two important classes of inference algorithms for Bayesian networks. Both have their advantages and disadvantages: collapsed Gibbs sampling is unbiased but is also inefficient for large count values and requires averaging over many samples to reduce …
Hybrid quantum-classical method optimizes financial index tracking.
problem Optimizing asset weights for financial index replication.
method Hybrid quantum-classical optimization with pruning algorithm.
result Improved performance through quantum and classical optimization.
Hybrid deep learning algorithm optimizes register allocation for compiler.
problem Efficiently coloring interference graphs for register allocation.
method Deep learning network trained on random graphs, augmented with a color correction phase.
result Hybrid algorithm performs well compared to optimal and greedy register allocators.
This paper considers the problem of estimating multiple related Gaussian graphical models from a p-dimensional dataset consisting of different classes. Our work is based upon the formulation of this problem as group graphical lasso. This paper proposes a novel hybrid covariance thresholding algorithm that can effecti…
In this paper we propose a hybrid architecture of actor-critic algorithms for reinforcement learning in parameterized action space, which consists of multiple parallel sub-actor networks to decompose the structured action space into simpler action spaces along with a critic network to guide the training of all sub-acto…
Two approximate lifted variational methods for hybrid domains improve inference scalability and accuracy.
problem Efficient inference in hybrid probabilistic relational models with multi-modality and continuous evidence.
method Two approximate lifted variational approaches applicable to hybrid domains, exploiting model symmetries.
result The proposed variational methods are scalable and can leverage approximate model symmetries, outperforming existing message-passing approaches.
This paper addresses how well we can recover a data matrix when only given a few of its elements. We present a randomized algorithm that element-wise sparsifies the data, retaining only a few its elements. Our new algorithm independently samples the data using sampling probabilities that depend on both the squares ($\e…
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.
Hybrid model improves wind speed prediction accuracy using MLP and WOA.
problem Improving wind speed prediction accuracy for renewable energy control.
method Combining MLP with Whale Optimization Algorithm (WOA) for data preprocessing and model optimization.
result The hybrid MLP-WOA model outperformed standalone MLP model in wind speed prediction accuracy.
Study improves electricity price forecasting accuracy using a hybrid model.
problem Accurate short-term electricity price forecasting is challenging due to social and natural factors.
method Hybrid model combining GARMA, G-GARCH, Wavelet, LLWNN, and optimization algorithms.
result The hybrid model outperforms other models in Nord Pool Electricity markets.
UPR hybrid model improves phase retrieval performance.
problem Recovering signals from phase-less measurements.
method Model-based data-driven deep architecture (UPR).
result UPR shows potential in improving phase retrieval.
Proposes hybrid reinforcement learning for both discrete and continuous control problems.
problem Real-world control problems involving both discrete and continuous decision variables.
method Solves hybrid problems by optimizing for discrete and continuous actions simultaneously.
result Efficiently solves hybrid reinforcement learning problems and improves upon expert heuristics.
We apply the hybrid Monte Carlo (HMC) algorithm to the financial time sires analysis of the stochastic volatility (SV) model for the first time. The HMC algorithm is used for the Markov chain Monte Carlo (MCMC) update of volatility variables of the SV model in the Bayesian inference. We compute parameters of the SV mod…
The hybrid Monte Carlo algorithm (HMCA) is applied for Bayesian parameter estimation of the realized stochastic volatility (RSV) model. Using the 2nd order minimum norm integrator (2MNI) for the molecular dynamics (MD) simulation in the HMCA, we find that the 2MNI is more efficient than the conventional leapfrog integr…
Improves decision complexity in hybrid environments.
problem Complexity in hybrid decision-making problems.
method General extension of DEC framework, model aggregation approach.
result Improved regret bounds for linear Q*/V* MDPs.
Unified hybrid RL algorithm improves online RL performance with offline data.
problem Improving reinforcement learning performance with limited online data.
method A unified hybrid RL algorithm combining offline and online data.
result Unified algorithm achieves state-of-the-art results in sub-optimality gap and online learning regret.
We develop a mixed least squares Monte Carlo-partial differential equation (LSMC-PDE) method for pricing Bermudan style options on assets whose volatility is stochastic. The algorithm is formulated for an arbitrary number of assets and volatility processes and we prove the algorithm converges almost surely for a class …
Hybrid model uses GNNs and pathfinding to optimize portfolio rebalancing costs.
problem Optimizing transaction costs in dynamic portfolio rebalancing.
method Combines GNNs for cost prediction and Dijkstra's algorithm for pathfinding.
result Significantly reduces transaction costs in financial asset graphs.
The paper optimizes RF training by improving tree building algorithms and CPU optimizations.
problem Improving the training performance of Random Forest models on CPU architectures.
method Investigated and improved tree building algorithms (BFS, DFS, hybrid BFS-DFS) and proposed optimizations.
result The hybrid BFS-DFS algorithm outperforms both BFS and DFS, and is more robust.
Hybridizes genetic algorithms with PROMOTHEE for better economic activity localization decisions.
problem Making optimal location decisions for economic activities considering multiple criteria.
method Hybridization of genetic algorithms with PROMOTHEE method for multicriteria analysis.
result Improves decision-making for economic activity localization.
A hybrid K-NN and SVM technique improves classification accuracy.
problem Improving classification accuracy in pattern recognition.
method Discriminative nearest neighbour classification combined with SVM.
result The hybrid technique outperforms state-of-the-art methods.
Hybrid deep architectures with reasoning layers show promising convergence and generalization properties.
problem Understanding the theoretical foundations of hybrid deep architectures with reasoning layers.
method Analyzing the interplay between algorithm layers and neural components in deep architectures.
result Properties of algorithm layers are closely related to the approximation and generalization abilities of end-to-end models.
Hybrid quantum algorithm tackles binary optimization problems with multiple constraints.
problem Efficiently solving binary optimization problems with multiple constraints using quantum algorithms.
method Combines QAOA with penalty dephasing and Zeno effect for non-Ising constraints.
result Significant improvement in solving practical aircraft loading problems.
The lasso model has been widely used for model selection in data mining, machine learning, and high-dimensional statistical analysis. However, with the ultrahigh-dimensional, large-scale data sets now collected in many real-world applications, it is important to develop algorithms to solve the lasso that efficiently sc…