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

Trend · papers per month

275380106 · Jun 202019922001200920172026
48 results for genetic variants

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.

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.

VEGN uses graph neural networks to predict disease-causing mutations from genetic variants.

problem Identifying disease-causing mutations from millions of genetic variants.
method VEGN employs a graph neural network on a heterogeneous graph of genes and variants, learning gene-gene interactions.
result VEGN outperforms existing state-of-the-art models in variant effect prediction.

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.

EvoNUDGE uses graph neural networks to improve genetic programming performance.

problem Efficiency in evolutionary computation for problem solving.
method Graph neural network to elicit additional knowledge from symbolic regression problems.
result EvoNUDGE significantly outperforms conventional and neural genetic programming methods.

We propose a non-parametric regression methodology, Random Forests on Distance Matrices (RFDM), for detecting genetic variants associated to quantitative phenotypes representing the human brain's structure or function, and obtained using neuroimaging techniques. RFDM, which is an extension of decision forests, requires…

2013-09-24abs ↗pdf ↗

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.

Advances of modern sensing and sequencing technologies generate a deluge of high dimensional space-temporal physiological and next-generation sequencing (NGS) data. Physiological traits are observed either as continuous random functions, or on a dense grid and referred to as function-valued traits. Both physiological a…

2014-10-27abs ↗pdf ↗

New hierarchical model improves on standard practice for high-dimensional data.

problem Poor statistical performance in high-dimensional hierarchical models.
method Model effects as exchangeable across covariates and correlated across datasets.
result Empirical Bayes estimator outperforms classic approach in high-dimensional settings.

FlowSelect uses normalizing flows to control FDR in feature selection.

problem Controlled feature selection with knockoffs often fails to control false discovery rate (FDR).
method FlowSelect uses normalizing flows for accurate feature modeling and a novel MCMC-based p-value calculation to enforce knockoff properties.
result FlowSelect consistently controls FDR and demonstrates greater power compared to competing methods.

Quantum circuit optimization speeds up financial derivatives pricing.

problem Efficiently pricing financial derivatives on quantum computers.
method Pretraining conditional parameterized circuits for state-dependent functions.
result Quantum circuit implementation of derivatives' payoff function is more efficient.

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.

We introduce GeNet, a method for shotgun metagenomic classification from raw DNA sequences that exploits the known hierarchical structure between labels for training. We provide a comparison with state-of-the-art methods Kraken and Centrifuge on datasets obtained from several sequencing technologies, in which dataset s…

2019-01-30abs ↗pdf ↗

Genetic algorithms have been widely used in many practical optimization problems. Inspired by natural selection, operators, including mutation, crossover and selection, provide effective heuristics for search and black-box optimization. However, they have not been shown useful for deep reinforcement learning, possibly …

2017-11-03abs ↗pdf ↗

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 ↗

Optimizing a neural network's performance is a tedious and time taking process, this iterative process does not have any defined solution which can work for all the problems. Optimization can be roughly categorized into - Architecture and Hyperparameter optimization. Many algorithms have been devised to address this pr…

2018-11-05abs ↗pdf ↗

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.

The goal of feature selection is to identify important features that are relevant to explain an outcome variable. Most of the work in this domain has focused on identifying globally relevant features, which are features that are related to the outcome using evidence across the entire dataset. We study a more fine-grain…

2019-05-29abs ↗pdf ↗

As datasets grow richer, an important challenge is to leverage the full features in the data to maximize the number of useful discoveries while controlling for false positives. We address this problem in the context of multiple hypotheses testing, where for each hypothesis, we observe a p-value along with a set of feat…

2017-11-03abs ↗pdf ↗

This paper improves dynamic hedging accuracy using genetic programming to forecast implied volatilities.

problem Improving the accuracy of dynamic hedging using implied volatilities.
method The paper uses genetic programming to forecast implied volatilities and tests the performance of these forecasts in dynamic hedging strategies.
result Genetic programming-generated implied volatilities improve hedging accuracy compared to static training methods.

For every group genetic code with finite number of generating and at most with one defining relation we introduce the braid group of this genetic code. This construction includes the braid group of Euclidean plane, the braid groups of closed orientable surfaces, B type groups of Artin-Brieskorn, and allow us to study a…

2006-03-16abs ↗pdf ↗

Gradient GA uses gradient information to improve molecular design.

problem Random walk exploration limits genetic algorithms' quality and speed in molecular design.
method Gradient GA incorporates gradient information from the objective function into genetic algorithms, using a differentiable neural network and Discrete Langevin Proposal.
result Significantly improves convergence speed and solution quality over traditional genetic algorithms.

Proposes Genetic Thompson Sampling for multi-armed bandits, improving performance in nonstationary settings.

problem Improving sequential decision making tasks of online learning agents using multi-armed bandits.
method Integrates genetic principles into Thompson Sampling for multi-armed bandits.
result Significantly outperforms baselines in nonstationary settings.