Novel hybrid method for Bayesian network structure learning reduces computational time without sacrificing accuracy.
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Trend · papers per month
New hybrid RL algorithm outperforms model-free and model-based methods.
New algorithm fills gaps in offline data for hybrid RL, achieving similar gains without coverage assumptions.
Hybrid models improve groundwater level prediction and uncertainty analysis.
This paper provides a geometrical derivation of the Hybrid Minimum Principle (HMP) for autonomous hybrid systems whose state manifolds constitute Lie groups 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.
A new hybrid fuzzy-crisp clustering algorithm addresses imbalanced cluster sizes.
A new hybrid federated learning algorithm for combining clinical and omics data.
Expert augmentation improves hybrid model generalization.
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.
Hybrid RL algorithms improve offline and online RL in linear MDPs.
Paper proposes a hybrid RL algorithm that combines offline and online data without needing reward info.
A new hybrid Newton algorithm improves convergence in logistic regression.
Paper addresses hybrid learning with constrained adversaries, achieving optimal performance.
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…
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.
Meta learning optimizes neural network quantization for efficient inference.
This paper explores data science applications in economics using a taxonomy of models and hybrid models showing higher accuracy.
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.
This paper considers the problem of estimating multiple related Gaussian graphical models from a -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…
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.
Study improves electricity price forecasting accuracy using a hybrid model.
UPR hybrid model improves phase retrieval performance.
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.
Unified hybrid RL algorithm improves online RL performance with offline data.
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.
A hybrid K-NN and SVM technique improves classification accuracy.
Register allocation, which is a crucial phase of a good optimizing compiler, relies on graph coloring. Hence, an efficient graph coloring algorithm is of paramount importance. In this work we try to learn a good heuristic for coloring interference graphs that are used in the register allocation phase. We aim to handle …
Hybrid deep architectures with reasoning layers show promising convergence and generalization properties.
Hybrid quantum algorithm tackles binary optimization problems with multiple constraints.
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…
We propose a hybrid tree-finite difference method in order to approximate the Heston model. We prove the convergence by embedding the procedure in a bivariate Markov chain and we study the convergence of European and American option prices. We finally provide numerical experiments that give accurate option prices in th…
Defines non-parabolic curves in spatial hybrid space with applications.
New algorithm solves nonconvex-convex minimax problems efficiently.
We present a novel hybrid algorithm for Bayesian network structure learning, called Hybrid HPC (H2PC). It first reconstructs the skeleton of a Bayesian network and then performs a Bayesian-scoring greedy hill-climbing search to orient the edges. It is based on a subroutine called HPC, that combines ideas from increment…
Hybrid SA algorithm optimizes index tracking for large indices.
Many real-world control problems involve both discrete decision variables - such as the choice of control modes, gear switching or digital outputs - as well as continuous decision variables - such as velocity setpoints, control gains or analogue outputs. However, when defining the corresponding optimal control or reinf…