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

Trend · papers per month

1.3%2.6%3.8%5.1% · May 201919922001200920172026
48 results for biological rewards

New AI learns like neurons, generalizing from sparse rewards.

problem Designing AI that learns without explicit instructions and applies that learning to sparse reward scenarios.
method Combining neuroscience principles with computational efficiency, creating the Neurons-in-a-Box architecture.
result The architecture can learn efficiently and generalize across various tasks, including challenging environments.

Paper tackles zero-shot policy learning for agents in new environments.

problem Learning in one environment and generalizing to unseen environments without additional data.
method Decomposes sparse rewards into spatial-temporal regions and uses Model Predictive Control (MPC).
result Method achieves natural generalization to new environments, demonstrated on various tasks.

New metrics improve scRNA-seq perturbation modeling by reducing mode collapse.

problem Outperformed by simple mean prediction in scRNA-seq perturbation modeling.
method Introduce DEG-aware metrics (WMSE, Rw2(Δ)R^{2}_{w}(Δ)) and negative/positive baselines.
result WMSE loss function reduces mode collapse and improves model performance.

BRAID fine-tunes diffusion models to optimize reward models in offline scenarios.

problem Combining generative modeling and model-based optimization in offline scenarios.
method Conservative fine-tuning of diffusion models using RL to optimize reward models.
result BRAID outperforms existing methods in offline data, avoiding invalid designs.

This study proposes hidden state curiosity to enhance RL models' resilience against noise.

problem Curiosity traps in RL models distract agents from discovering novel experiences.
method Proposed hidden state curiosity based on the Free Energy Principle to reward agents for KL divergence between predictive priors and posteriors.
result Agents with hidden state curiosity are more resilient against curiosity traps compared to those with prediction error curiosity.

This work improves online fine-tuning of diffusion models for specific properties.

problem Efficiently fine-tuning diffusion models to maximize specific properties.
method A novel reinforcement learning procedure that efficiently explores feasible samples.
result The method provides a regret guarantee and empirical validation across multiple domains.

Deep active inference agents learn complex environments using Monte-Carlo methods.

problem Understanding and modeling biological intelligence in complex, continuous state-spaces.
method Neural architecture for deep active inference agents using multiple forms of Monte-Carlo sampling.
result Deep active inference agents can learn environmental dynamics and plan future actions.

Researchers develop flexible kernels for biological sequences with guaranteed reliability.

problem Challenges in applying machine learning to biological sequences, including unreliable methods.
method Theoretical analysis and development of modified kernels to ensure reliability and accuracy.
result Developed kernels that are universal, characteristic, and metrize the space of distributions for biological sequences.

Skip connections improve biologically-inspired learning rules.

problem Biologically-inspired learning rules often underperform compared to backpropagation.
method Introduced skip connections between intermediate layers in biologically-motivated learning rules.
result Skip connections can match the performance of backpropagation and are robust to hyper-parameters.

New learning algorithm mimics biological neural networks.

problem Biologically implausible backpropagation for directed neural networks.
method Introduces new neuronal dynamics and learning rule for arbitrary architectures, sparsity-inducing pruning method, and dynamical-systems characterization.
result Prunes irrelevant connections and improves learning efficiency.

SENA-discrepancy-VAE interprets latent causal factors in biological pathways.

problem Interpreting latent causal factors in biological pathways.
method SENA-discrepancy-VAE, a model based on discrepancy-VAE, that produces interpretable latent causal factors.
result Sena-discrepancy-VAE achieves comparable predictive performance with non-interpretable counterparts while providing biologically meaningful causal factors.

Scalable GPLVM reduces complexity in scRNA-seq data, accounting for technical and biological confounders.

problem Complexity and confounders in scRNA-seq data hamper interpretation.
method Extended Gaussian process latent variable model (GPLVM) to handle large datasets.
result Framework reconstructs latent signatures and captures disease-specific gene expression.

Modulating masks improve lifelong reinforcement learning.

problem Catastrophic forgetting and task interference in lifelong reinforcement learning.
method Adapted modulating masks for deep lifelong reinforcement learning (LRL) with PPO and IMPALA agents.
result Superior performance in both discrete and continuous RL tasks compared to LRL baselines.

DeepSIBA predicts biological effects of chemical structures using graph neural networks.

problem Predicting biological effects of chemical structures for drug discovery.
method Siamese Graph Convolutional Neural Networks for structure-biological effect mapping.
result Highly accurate predictions of biological effects for structurally dissimilar compounds.

Proposes a novel network-based neighborhood regression for biological systems.

problem Lack of comprehensive analysis on biological modules using both global and local network data.
method Develops a community-wise least square optimization approach to analyze gene modules and their regulatory strength.
result Achieves exact minimax optimality and linear consistency in identifying gene module associations.

AR algorithm simplifies backpropagation with improved scalability and biological plausibility.

problem Improving backpropagation algorithms for complex neural networks and biological plausibility.
method Introducing learnable backwards weights and avoiding nonlinear derivative computations; relaxing frozen feedforward pass assumption.
result Simplified AR algorithm maintains performance on complex CNN architectures and challenging datasets.

We solve a lifecycle model in which the consumer's chronological age does not move in lockstep with calendar time. Instead, biological age increases at a stochastic non-linear rate in time like a broken clock that might occasionally move backwards. In other words, biological age could actually decline. Our paper is ins…

2018-11-25abs ↗pdf ↗

Minimum attention improves reinforcement learning performance in high-dimensional dynamics.

problem Improving reinforcement learning performance in high-dimensional nonlinear dynamics.
method Applying minimum attention as a regularization technique in reinforcement learning, including model-based and model-free approaches.
result Minimum attention outperforms state-of-the-art algorithms in few-shot adaptation and variance reduction.

Algorithm optimizes biological sequences using bootstrapped training with a score-conditioned generator.

problem Optimizing biological sequences for a black-box score function.
method Bootstrapped training of score-conditioned generator (BootGen) algorithm.
result Our method outperforms competitive baselines on biological sequential design tasks.

Fault-tolerant neural networks inspired by biological error correction codes.

problem Achieving reliable computation with unreliable neurons.
method Using biological error correction codes from grid cells in the mammalian cortex to develop a fault-tolerant neural network.
result Noisy biological neurons operate below a fault-tolerance threshold, suggesting a mechanism for reliable computation in the brain.

This tutorial reviews RL-based methods for optimizing diffusion models to maximize specific metrics.

problem Optimizing diffusion models to generate samples that maximize specific metrics in practical applications.
method Various RL algorithms including PPO, differentiable optimization, reward-weighted MLE, value-weighted sampling, and path consistency learning.
result Exploration of strengths and limitations of RL-based fine-tuning algorithms and their benefits compared to non-RL-based approaches.

Probabilistic graphical models (PGMs) have become a popular tool for computational analysis of biological data in a variety of domains. But, what exactly are they and how do they work? How can we use PGMs to discover patterns that are biologically relevant? And to what extent can PGMs help us formulate new hypotheses t…

2007-06-14abs ↗pdf ↗

New learning rules for wide neural networks without backpropagation.

problem Training wide neural networks efficiently and without backpropagation.
method Input-weight alignment driven by gradient descent in the NTK regime.
result Biologically-motivated learning rules equivalent to backpropagation in wide networks.

Machine learning predicts biologic therapy outcomes in psoriasis patients.

problem Predicting long-term biologic therapy outcomes in psoriasis patients.
method Machine learning algorithms were used to predict drug discontinuation and treatment duration.
result Machine learning models accurately predict outcomes with high diagnostic accuracy and low MAE.

Graph auto-encoder predicts unobserved node features from biological networks and omics data.

problem Integrating biological networks and continuous node features for better prediction.
method Graph neural networks and feature auto-encoders trained on feature reconstruction.
result Graph feature auto-encoder outperforms auto-encoders trained on graph reconstruction for predicting unobserved node features.

Unified framework improves gene prioritization in disease studies.

problem Identifying genes involved in diseases using heterogeneous biological data.
method Network propagation-based gene prioritization with integrated biological information.
result Significant improvements in prioritizing genes not identified by traditional methods.

Biological neural network mimics CCA for multi-channel data.

problem Implementing CCA in a biologically plausible neural network.
method Derive an online CCA algorithm with local synaptic updates for multi-compartmental neurons.
result The derived neural network architecture and synaptic updates resemble cortical pyramidal neuron behavior.

ODBAE detects complex phenotypes in biological data.

problem Challenges in identifying complex phenotypes from high-dimensional biological data.
method ODBAE (Outlier Detection using Balanced Autoencoders) identifies influential and high leverage points in latent relationships among multiple physiological parameters.
result ODBAE reveals novel metabolism-related genes and uncovers coordinated abnormalities across metabolic indicators.