Research
On-device research index

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.

168,657 papers · 148 categories

Trend · papers per month

205409614818 · Jun 202019922001200920172026
48 results for hybrid optimization

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.

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.

Hybrid Policy Optimization tackles reinforcement learning in hybrid spaces, improving performance over PPO.

problem Credit assignment issues and biased gradients in hybrid discrete-continuous action spaces.
method Mixed gradient estimator combining pathwise and score-function gradients, reformulating problems in hybrid form.
result HPO substantially outperforms PPO on inventory control and switched systems, with performance gaps increasing with continuous action dimension.

Hybrid framework optimizes reinsurance using generative models and reinforcement learning.

problem Traditional reinsurance optimization relies on restrictive assumptions and static designs.
method Combines VAEs for joint distribution learning and PPO for dynamic treaty parameter adaptation.
result Hybrid method produces more resilient outcomes with higher surpluses and lower tail risk.

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.

Hybrid QNN-LSTM predicts financial stock market trends using quantum computing.

problem Complex temporal dependencies and market fluctuations in financial time-series forecasting.
method Custom QNN regressor with hybrid optimization strategies.
result Hybrid models integrate quantum computing into financial forecasting workflows.

Bayesian hybrid models fuse physics-based insights with machine learning constructs to correct for systematic bias. In this paper, we compare Bayesian hybrid models against physics-based glass-box and Gaussian process black-box surrogate models. We consider ballistic firing as an illustrative case study for a Bayesian …

2019-12-12abs ↗pdf ↗

Unified framework for hybrid learning and optimization via active inference.

problem Sequential decisions in black-box evaluations requiring both task improvement and uncertainty reduction.
method Pragmatic Curiosity (PraC) framework that evaluates queries by balancing information gain and pragmatic value.
result Unified approach reduces decision risk and improves coverage of critical regions without task-specific rules.

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.

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 LSTM-PPO optimizes dynamic portfolios with better performance.

problem Dynamic portfolio optimization under non-stationary market conditions.
method Combines LSTM for forecasting and PPO for adaptive portfolio adjustments.
result Hybrid framework outperforms single-model and equal-weight approaches in various metrics.

Hybrid model improves sequential data prediction by combining neural and time series models.

problem Nonlinear prediction in online settings with domain-specific feature engineering issues.
method Joint optimization of LSTM for feature extraction and SARIMAX for time series data using state space representations.
result Significant improvements in real-life competition datasets.

Optimizes control of hybrid systems with multiple switching processes.

problem Optimal control of hybrid systems with multiple Markov switching processes.
method Combines two separate Markov chains into one synthetic chain, derives HJB equations, and solves the portfolio choice problem.
result Derives explicit solutions and value functions for the optimal control problem.

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…

2012-06-18abs ↗pdf ↗

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.

Existing imitation learning approaches often require that the complete demonstration data, including sequences of actions and states, are available. In this paper, we consider a more realistic and difficult scenario where a reinforcement learning agent only has access to the state sequences of an expert, while the expe…

2019-03-11abs ↗pdf ↗

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.

Quantum neural tangent kernels help understand variational quantum circuits in machine learning.

problem Designing and predicting performance of variational quantum circuits.
method Using quantum neural tangent kernels and dynamical equations for loss functions.
result Analytical solutions for training dynamics in variational quantum circuits.

We propose a neural hybrid model consisting of a linear model defined on a set of features computed by a deep, invertible transformation (i.e. a normalizing flow). An attractive property of our model is that both p(features), the density of the features, and p(targets | features), the predictive distribution, can be co…

2019-02-07abs ↗pdf ↗

Bayesian optimization uses triangulation candidates for better performance.

problem Non-convex and multi-modal optimization challenges in Bayesian optimization.
method Proposes using Delaunay triangulation candidates for discrete search over continuous optimization.
result Triangulation candidates outperform numerically optimized and random alternatives.

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.

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.

Hybrid regularization avoids double descent in random feature models.

problem Avoiding the double descent phenomenon in random feature models.
method Combines early stopping and weight decay, using GCV for hyperparameter selection.
result Hybrid method successfully avoids double descent and achieves comparable generalization.

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.

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.

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 LLM and quantum optimization improve CSA collateral management by 9-10%.

problem Finance-native collateral optimization under ISDA CSAs with legal constraints.
method Hybrid pipeline combining LLM, quantum-inspired exploration, and CP-SAT.
result Improves a strong classical baseline by 9.1-10.7% across different scenarios.

Novel method for efficient optimization of noisy, expensive hybrid models.

problem Efficient optimization of hybrid models with noisy observations and constraints.
method Constrained Upper Quantile Bound (CUQB) method exploiting composite structure.
result Significantly improved sampling efficiency and theoretical guarantees.

Optimizes hybrid insurance contracts for heavy-tailed losses.

problem Providing insurance against heavy-tailed losses with finite expected loss.
method Combines traditional and parametric insurance, using a Pareto-type criterion for optimization.
result The hybrid contract outperforms traditional contracts in simulations and real data.

A new method for optimizing functions without gradients, improving efficiency and convergence.

problem Optimizing functions without gradient information in machine learning.
method Hybrid Gradient Descent (HGE) using random and coordinate-wise gradient estimates.
result The proposed method achieves optimal convergence rates in convex cases and generalizes to non-convex cases.

Hybrid approach improves probabilistic forecasts for electricity trading.

problem Improving probabilistic forecasts for electricity trading markets.
method Combines QRA and factor-based averaging for probabilistic forecasting.
result The hybrid approach outperforms benchmarks in statistical measures and economic value.

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.

Physics-informed GCRL tackles sparse feedback learning with hybrid dynamics.

problem Sparse feedback learning with high-dimensional, hybrid, or contact-dependent dynamics.
method Introduces physics-informed inductive biases into goal-conditioned value learning.
result Contact-rich manipulation tasks degrade existing Pi-GCRL methods.