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,181 papers · 148 categories

Trend · papers per month

4999148197 · Jun 202019922001200920182026
48 results for genetic factors

Sparse GFA identifies disease factors in FTD subgroups.

problem Heterogeneity in neurological disorders hinders understanding and treatment.
method Sparse Group Factor Analysis (GFA) with regularised horseshoe priors.
result Identified latent disease factors differentially expressed in FTD subgroups.

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.

Enhances genetic programming for stock alpha discovery with warm start and structural constraints.

problem Overwhelming search space and computational burden in traditional genetic programming for alpha factor discovery.
method Proposes a new GP framework with warm start and structural constraints to enhance search performance and interpretability.
result Superior out-of-sample prediction results and higher portfolio returns compared to benchmarks.

DL/FBF improves GPSR solutions by selecting compact, generalising expressions.

problem Overfitting and structural bloat in symbolic regression with genetic programming.
method Description length (DL) and fractional Bayes factor (FBF) criteria for selecting compact, generalising expressions.
result DL/FBF post-selection improves test performance compared to AIC/BIC baseline.

Method controls extrapolation in prediction profiles for statistical and machine learning models.

problem Avoiding invalid predictions due to extrapolation in prediction profiles.
method Genetic algorithm optimization over constrained factor regions.
result Optimal factor settings without constraint are often invalid and extrapolated.

BayesMR estimates causal effects and directionality from genetic data.

problem Challenges in finding good genetic instruments and estimating causal effects.
method Bayesian Mendelian randomization approach that accounts for pleiotropy and reverse causation.
result BayesMR provides a posterior distribution over causal effects and uncertainty.

Linear Mixed Models (LMMs) are important tools in statistical genetics. When used for feature selection, they allow to find a sparse set of genetic traits that best predict a continuous phenotype of interest, while simultaneously correcting for various confounding factors such as age, ethnicity and population structure…

2015-07-16abs ↗pdf ↗

Genetic Programming constructs features for physics experiments, improving classification accuracy.

problem Lack of interpretable feature construction for experimental physics.
method Combining Genetic Programming with dimensional consistency constraints.
result Constructed features improve classification accuracy by a significant margin.

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.

BoGA combines evolutionary search with Bayesian optimization for efficient protein design.

problem Designing novel proteins with specific characteristics is challenging due to sequence space complexity.
method BoGA integrates a genetic algorithm with Bayesian optimization to efficiently explore sequence space.
result BoGA accelerates discovery of high-confidence binders for diverse protein design objectives.

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.

Paper uses machine learning to analyze stock market anomalies, predicting drift direction and portfolio performance.

problem Capturing dynamics of Post-Earnings-Announcement Drift (PEAD) using machine learning.
method Uses Extreme Gradient Boosting (XGBoost) with genetic algorithm optimization to analyze PEAD dynamics.
result Demonstrates how PEAD dynamics are influenced by different factors across sectors and quarters.

Proposes a hybrid deep learning network for better heart failure survival prediction.

problem Improving survival prediction in heart failure patients.
method Joint analysis of cardiac motion features and clinical risk factors using a hybrid deep learning network.
result Optimal integration of clinical risk factors into deep prediction networks.

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.

Improved genetic programming by optimizing mutation operators for continuous program search.

problem Small syntactic mutations in genetic programming can lead to unpredictable behavioral shifts.
method Learned a compact trading-strategy DSL, created a block-factorized embedding, and designed geometry-compiled mutation operators.
result Geometry-compiled mutation operators discover strong strategies using fewer evaluations and achieve higher Sharpe ratios.

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.

This paper optimizes portfolio rebalancing under uncertain security returns using meta-heuristic algorithms.

problem Optimizing portfolio rebalancing under uncertain security returns with transaction costs.
method Meta-heuristic algorithms (genetic algorithm) for solving the portfolio rebalancing problem.
result Meta-heuristic algorithms provide better results than global optimization solvers for portfolio rebalancing under uncertainty.

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.

AlphaForge mines and dynamically combines alpha factors for better investment performance.

problem Inconsistency and inflexibility of fixed factor weights in alpha factor mining.
method Generative-predictive neural network for factor generation and dynamic weight adjustment.
result Demonstrated superior performance in formulaic alpha factor mining and portfolio returns.

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.

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.

Genetic sequence data are well described by hidden Markov models (HMMs) in which latent states correspond to clusters of similar mutation patterns. Theory from statistical genetics suggests that these HMMs are nonhomogeneous (their transition probabilities vary along the chromosome) and have large support for self tran…

2016-11-02abs ↗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.

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.

This paper compares Grid Search, Random Search, and Genetic Algorithm for NAS.

problem Hyperparameter optimization for neural architecture search.
method Comparison of Grid Search, Random Search, and Genetic Algorithm.
result Genetic Algorithm outperforms Grid Search and Random Search in terms of accuracy and execution time.