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.

169,341 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Dec 199319922001200920182026
48 results for Hybrid Method

New hybrid method combines ARIMA and ANN for better time series forecasting.

problem Improving forecasting accuracy of time series data.
method ARIMA-ANN hybrid method with empirical mode decomposition strategies.
result Our hybrid method outperforms traditional methods in forecasting accuracy.

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.

Hybridizes physical and data-driven methods for predicting physicochemical properties.

problem Predicting physicochemical properties accurately using limited data.
method Distills physical method predictions into a prior model and combines with sparse experimental data using Bayesian inference.
result Significant improvements in predicting activity coefficients at infinite dilution compared to baselines and ensemble methods.

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.

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.

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.

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), pp-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 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.

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.

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-MST improves preference aggregation from sparse data.

problem Recovering ratings from sparse and noisy pairwise data.
method Bayesian optimization and Bradley-Terry model for utility function, Gaussian-Hermite quadrature for EIG estimation, hybrid sampling strategy.
result Hybrid-MST outperforms state-of-the-art methods in preference aggregation.

Calibrates hybrid LSV models with stochastic rates using particle method and control variates.

problem Calibrating complex foreign exchange models with stochastic volatility and stochastic rates.
method Combines particle method with variance reduction techniques and control variates.
result Accelerates convergence in calibration process for a wide class of hybrid LSV models.

A new framework handles hybrid action spaces in reinforcement learning.

problem Handling reinforcement learning with both discrete and continuous actions.
method Parametrized Deep Q-Networks (P-DQN) framework integrating DQN and DDPG.
result Empirical validation of efficiency and effectiveness in simulated RoboCup soccer and game King of Glory.

Proposes a new metric learning method for image recognition.

problem Improving image recognition performance using learned distance representations.
method Introduces a Generalized Hybrid Metric Loss (GHM-Loss) to learn hybrid proximity features combining geometric and probabilistic spaces.
result Demonstrates superior performance compared to existing methods on public datasets.

The paper develops a faster surrogate model for simulators using hybrid methods.

problem The need for faster validation of automotive technologies using simulators.
method Testing classical methods and building hybrid models combining them.
result A hybrid surrogate model outperforms classical methods in multivariate time series prediction.

New hybrid SGD algorithms improve stochastic nonconvex optimization complexity.

problem Solving stochastic nonconvex optimization problems efficiently.
method Hybrid SARAH-SGD algorithm combining biased and unbiased estimators.
result Achieves better complexity bound for ε\varepsilon-stationary points.

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.

This paper considers the problem of estimating multiple related Gaussian graphical models from a pp-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…

2015-03-07abs ↗pdf ↗

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.

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.

Method improves simulation accuracy by mitigating distribution shift in hybrid systems.

problem Mitigating distribution shift in machine-learning augmented hybrid simulation.
method Tangent-space regularized estimator to control distribution shift.
result Marked improvements in simulation accuracy, especially for systems with high distribution shift.

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 ASR systems can model graphemes effectively using chenones, outperforming traditional methods.

problem Traditional hybrid ASR systems struggle with English's poor grapheme-phoneme correspondence.
method Leveraging tied context-dependent graphemes (chenones) to model graphemes directly.
result Chenone-based systems significantly outperform senone baselines by 4.5% to 11.1% on English datasets.

Hybrid subgroups found in non-arithmetic PU(2,1) lattices.

problem Exploring hybrid subgroups in non-arithmetic PU(2,1) lattices.
method Exploring hybrid subgroups of certain non-arithmetic lattices in PU(2,1). Showing that Mostow's lattices are virtually hybrids and some are hybrids of two non-commensurable arithmetic lattices in PU(1,1).
result Mostow's lattices are virtually hybrids and some are hybrids of two non-commensurable arithmetic lattices in PU(1,1).

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.

A hybrid method combines Jacobian and Gauss-Seidel updates for linearly constrained convex programming.

problem Solving linearly constrained convex programming problems with nonseparable constraints.
method Hybrid Jacobian and Gauss-Seidel proximal block coordinate update method.
result The hybrid method converges and performs as well as Gauss-Seidel method and better than a randomized primal-dual BCU method.

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.

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.

New hybrid stochastic optimization framework tackles nonconvex problems efficiently.

problem Efficiently solving stochastic composite nonconvex optimization problems.
method Combining two stochastic estimators to create a hybrid one, developing several variants of stochastic gradient methods.
result Achieved best-known complexity bounds for various optimization problems.