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

306089119 · Jun 202019922001200920182026
48 results for genetic indicators

Improved genetic algorithm optimizes SVR for robust long-term stock index forecasting.

problem Inaccurate long-term stock price predictions.
method Adaptive Weighted Genetic Algorithm-Optimized SVR (IGA-SVR).
result Reduction in MAPE by 19.87% compared to LSTM and 50.03% compared to OGA-SVR.

This paper optimizes Iran's stock portfolio using neural networks and genetic algorithms.

problem Optimizing capital allocation in Iran's stock market with low risk and high return.
method Markowitz Mean-Variance-Skewness model with neural network prediction of stock returns and risks.
result Designing 8 different portfolios for various risk tolerance levels.

GA-MSSR optimizes forex trading rules for higher returns and reduced risk.

problem Noisy market data affects the consistency and profitability of trading algorithms.
method Optimized trading rules derived from technical indicators using a Genetic Algorithm.
result GA-MSSR achieved superior performance with significant positive returns and reduced risk factors.

New method identifies rare genetic markers for Alzheimer's disease using MRI and genomics.

problem Identifying rare genetic markers for Alzheimer's disease.
method Combining MRI data with genome sequencing, using CNNs for brain traits, and kernel-based tests for rare variants.
result CNNs provide precise brain traits and novel kernels identify rare genetic markers.

Improved chromosome for genetic algorithms handles large n and interaction terms.

problem Chromosome formulation struggles with large n and interaction terms.
method Introduced a modified chromosome formulation for better scalability and sparsity.
result Indexed chromosome formulation shows improved efficiency and sparsity on high-dimensional datasets.

This research develops an evolutionary approach to discover non-Gaussian stochastic dynamical systems.

problem Discovering explicit governing equations of stochastic dynamical systems with Lévy noise from data.
method ESSR approach using genetic programming, sparse regression, and nonlocal Kramers-Moyal formulas.
result The approach effectively extracts non-Gaussian stochastic dynamical systems from sample path data.

New heuristics improve genetic programming's parent selection for classification problems.

problem Improving genetic programming's parent selection for classification tasks.
method Proposed three heuristics inspired by specific classifiers' characteristics, using similarity measures.
result Combination of agreement-based selection and random selection outperforms classical and state-of-the-art schemes.

This study introduces a new GAS blending ensemble model for Bitcoin price prediction.

problem Predicting Bitcoin price fluctuations in the cryptocurrency market.
method Integrates advanced ensemble learning methods, feature selection algorithms, and sentiment analysis.
result The GAS model demonstrates excellent performance in daily Bitcoin trend prediction.

EB-VAE combines tumor growth and dropout data for personalized treatment response modeling.

problem Challenges in integrating longitudinal tumor measurements, dropout information, and genetic covariates.
method Extended EB-VAE framework to jointly model longitudinal and time-to-event data, incorporating dropout hazard and genetic covariates.
result Hybrid decoder formulation yields consistent treatment-effect parameters and prior predictive performance comparable to neural decoder.

ENN method uses expectile regression for genetic data analysis of complex diseases.

problem Discover additional genetic variants contributing to complex diseases.
method Developed an expectile neural network (ENN) method integrating expectile regression and neural networks.
result ENN method outperforms existing expectile regression in discovering genetic variants predisposing to sub-populations.

The paper develops methods to identify stable associations across multiple studies.

problem Identifying stable associations across multiple studies with possible distributional shifts.
method Modeling heterogeneous multi-source data with multiple high-dimensional regressions and devising a novel sampling method for valid confidence intervals of maximin effects.
result Significant maximin effects indicate stable associations that can be generalized to target populations.

Efficiently infers graph edges from genetic similarity data in landscape genetics.

problem Inferring unknown graph edges from genetic similarity data in a heterogeneous landscape.
method Developed an efficient first-order optimization method to solve the inverse landscape genetics problem.
result Our method provides fast and reliable convergence, significantly outperforming existing heuristics.

A co-evolutionary approach for Heston model calibration reduces overfitting with diverse datasets.

problem Overfitting and lack of generalization in Heston model calibration.
method Coupling a genetic algorithm with an evolving neural inverse map, using both GA-history sampling and Latin hypercube sampling.
result Diverse datasets improve out-of-sample stability and calibration accuracy.

Stein-Encoder isolates genetic signals in multi-modal biomedical data.

problem Integration of high-dimensional genomic data with clinical data obscures genetic predictive impact.
method White-box supervised framework using Stein's method and residualization.
result Stein-Encoder improves predictive accuracy and reveals specific biological mechanisms.

GPO uses genetic algorithms for deep policy optimization in reinforcement learning.

problem Catastrophic consequence of parameter crossovers in neural networks for deep reinforcement learning.
method GPO uses imitation learning for policy crossover in the state space and applies policy gradient methods for mutation.
result GPO achieves superior performance and comparable sample efficiency compared to state-of-the-art policy gradient methods.

Introduces Deep Genetic Network for optimizing neural network hyperparameters.

problem Optimizing neural network hyperparameters is a tedious and time-consuming task.
method Uses genetic algorithms within a deep neural network architecture to optimize hyperparameters during training.
result Deep Genetic Network successfully optimizes hyperparameters in various types of neural network layers.

Proposes counterfactual explainability for causal attribution, extending variance analysis methods.

problem Lack of mechanistic understanding in existing tools for explaining complex models.
method Extends global sensitivity analysis methods to causal explanations using directed acyclic graphs.
result Developed methods to estimate counterfactual explainability and applied to income inequality analysis.

GeNet classifies metagenomic sequences with less memory and comparable recall to state-of-the-art methods.

problem Classifying metagenomic sequences from raw DNA sequences.
method Exploits hierarchical structure between labels for training, using deep representations.
result GeNet achieves competitive precision and good recall with less memory requirements.

The model predicts stock price trends and opening, minimum, and maximum prices with reasonable accuracy.

problem Forecasting stock prices and trends for investment decisions.
method Improvement of a model based on the association of three LSTM neural networks.
result The model predicts stock price trends and opening, minimum, and maximum prices with reasonable accuracy.

New method uses DNN for genetic variant identification, controlling randomness and improving interpretability.

problem Challenges in interpreting deep neural networks for genetic variant identification.
method Interpretable neural network model with controlled variable selection using ensembling, knockoffs, and de-randomization.
result The proposed method leads to more discoveries compared to conventional methods.

We investigate the application of two heuristic methods, genetic algorithms and tabu/scatter search, to the optimisation of realistic portfolios. The model is based on the classical mean-variance approach, but enhanced with floor and ceiling constraints, cardinality constraints and nonlinear transaction costs which inc…

2005-01-04abs ↗pdf ↗

G2Ns combine genetic genes with neural networks for reinforcement learning.

problem Improving sample efficiency and performance in reinforcement learning.
method Genetic-Gated Networks (G2Ns) that integrate binary genetic genes with neural network hidden layers.
result G2Ns achieve significant improvements in sample efficiency and performance in reinforcement learning.

A distributed feature selection framework identifies genetic risk factors for Alzheimer's disease.

problem High dimensionality of GWAS data makes it hard to detect genetic risk factors for Alzheimer's disease.
method Distributed Feature Selection Framework (DFSF) with distributed group Lasso screening rules and stability selection.
result The method efficiently identifies relevant genetic risk factors for Alzheimer's disease across multiple institutions.

Paper uses AI to predict stock market volatility with neural networks and genetic algorithms.

problem Traditional methods for predicting stock market volatility have high errors.
method Back-propagation neural network and genetic algorithm integrated model.
result The model predicts future volatility with low errors and high accuracy.

A multilevel model combines genetic and imaging data for AD diagnosis.

problem Classification from multimodal genetic and brain imaging data with unbalanced contributions.
method Multilevel model with structured penalties for joint effects between modalities.
result The model reveals relationships between genes, brain regions, and disease status.

Predict genetic inheritance patterns using hypergraphs and latent models.

problem Diagnosing inherited diseases requires identifying family genetic patterns.
method Represent family trees as hypergraphs, use latent state space models for causal inference.
result Allows for explainable predictions of patient genotypes based on relatives' phenotypes.

Ensemble GP improves genetic programming by achieving better results with smaller models.

problem Improving genetic programming for binary classification problems.
method Ensemble GP uses an evolved population structure, fitness evaluation, and genetic operators inspired by ensemble learning methods.
result Ensemble GP outperformed standard GP on eight binary classification problems, achieving better results with smaller models.