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

8172533 · Jun 202019922001200920182026
48 results for biological realism

Unified framework trains spiking neural networks for various cognitive tasks.

problem Limitations of conventional neural network models in matching experimental neural dynamics.
method Modified SpikeProp learning algorithm, including biological features.
result Framework successfully trained spiking neural networks for diverse cognitive tasks.

The preceding three decades have seen the emergence, rise, and proliferation of machine learning (ML). From half-recognised beginnings in perceptrons, neural nets, and decision trees, algorithms that extract correlations (that is, patterns) from a set of data points have broken free from their origin in computational c…

2017-04-15abs ↗pdf ↗

The paper discusses quantifying realism in generated images.

problem Designing functions to reliably distinguish realistic data from unrealistic data.
method Drawing on insights from algorithmic information theory, the paper introduces the notion of a universal critic.
result A good generative model alone is insufficient to solve the problem of realism quantification.

New insights into image compression trade-offs with private randomness.

problem Trade-off between compression rate and perceptual quality in image compression.
method Characterization of rate-distortion trade-off with private randomness under different realism constraints.
result Encoder private randomness is not useful if compression rate is below source entropy, even with limited common and decoder private randomness.

Develops a new model for controllable and realistic traffic simulation.

problem Lack of models that offer both controllability and realism in traffic simulation.
method Guided Conditional Diffusion (CTG) model using diffusion modeling and differentiable logic.
result Improves controllability-realism tradeoff over strong baselines.

Synthetic social networks closely match real-world interactions.

problem Evaluating realism of synthetic social contact networks.
method Used multiple measures of graph complexity to compare synthetic networks with stylized models and empirical data.
result Synthetic networks are more realistic than stylized models.

The paper evaluates and improves uncertainty estimates in neural networks for safety-critical applications.

problem Quantifying uncertainty in neural networks for safety-critical systems.
method Proposes a statistical test for evaluating uncertainty realism in neural networks and transfers a classification architecture to image-to-image tasks.
result The variational U-Net architecture significantly improves uncertainty realism in image-to-image tasks compared to a plain model.

Agents learn to draw with human-like abstraction and realism.

problem Training generative models to produce realistic images without supervision.
method Reinforcement learning agents in a simulated painting environment, trained with a discriminator network.
result Generative agents can produce images with visual abstraction and realism.

CounteRGAN generates realistic, actionable counterfactuals for machine learning models.

problem Creating realistic and actionable counterfactuals for machine learning models.
method Applying Residual GANs to improve counterfactual realism and actionability.
result CounteRGAN produces counterfactuals with improved realism and actionability, achieving real-time applicability.

Examines optimal risk sharing with realistic risk attitudes, finding risk seeking in certain subdomains.

problem Optimal risk sharing with empirically realistic risk attitudes.
method Allows for risk-seeking agents, generalizes expected utility, and uses counter-monotonic improvement theorem.
result First empirical results on optimal risk sharing with realistic risk attitudes.

Extends driving model to control agent behavior in simulations.

problem Simulate realistic driving behavior for autonomous systems.
method Introduces Control-ITRA method to influence agent behavior through waypoint assignment and target speed modulation.
result Demonstrates controllable, infraction-free trajectories while preserving realism.

This paper uses CGANs to simulate and improve trading agent performance in limit order books.

problem Improving trading agent performance in limit order book environments.
method Investigates conditional generative models (CGANs) for order book simulation and adversarial attacks to enhance realism and robustness.
result CGANs can be improved to better simulate real market conditions and are more robust to adversarial attacks.

Study assesses market simulation metrics to highlight discrepancies between real and simulated markets.

problem Lack of fidelity in market simulation methods leads to discrepancies between real and simulated market data.
method Surveyed and applied a set of reference metrics to real and simulated market data.
result Significant discrepancies remain between real and simulated markets.

COCO-GAN generates images by parts using spatial coordinates, achieving state-of-the-art quality.

problem Generating full images from partial observations due to computational constraints.
method COCO-GAN uses conditional coordination to generate images by parts based on spatial coordinates, with a generator and discriminator learning to justify realism.
result COCO-GAN produces state-of-the-art-quality full images during inference, enabling novel applications like beyond-boundary generation and panorama generation.

Paper uses machine learning to evaluate financial simulations.

problem Quantify the realism of simulated financial time series.
method Machine learning classification of simulated vs real financial data.
result Improved simulation methods through competition results.

Quantum theory challenges traditional cause-effect relations, showing causal influences even without Bell inequality violations.

problem Challenging traditional concepts of cause-effect relations in quantum mechanics.
method Introducing a general framework to estimate causal influences without interventions or classical/quantum assumptions.
result Every pure bipartite entangled state violates classical bounds on causal influence, negating the idea that Bell inequalities are the only signature of incompatibility.

Data assimilation for subsurface flow using latent diffusion models shows that ensemble Kalman methods may overestimate posterior uncertainty, while Monte Carlo sampling is more reliable.

problem Data assimilation for subsurface flow
method Ensemble Kalman smoother and Markov chain Monte Carlo sampling
result Monte Carlo sampling is more reliable than ensemble Kalman methods

The paper tackles ambiguous image-to-image translation by modeling a distribution of possible outputs.

problem Ambiguity in image-to-image translation where a single input can have multiple possible outputs.
method The approach involves a conditional generative model that learns to map input images to a latent vector, which is then used to generate diverse outputs.
result The method produces more diverse and realistic outputs compared to other variants.

Study uses Bayesian networks to infer causal relationships from observational biological data.

problem Understanding causal interactions in biological systems from observational data.
method Bayesian networks applied to small simulated and real biological networks.
result Bayesian networks can reveal causal information flow in gene expression data.

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.

SFAG generates realistic financial data that passes trading tests.

problem Financial generative models often produce unrealistic and unstable trading outcomes.
method Introduces SFAG, a GAN variant that aligns stylized facts and optimizes with adversarial loss.
result SFAG generates synthetic data that preserves stylized facts and supports robust trading strategies.

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.

Extracts biological context from biomedical texts to associate with events.

problem Identifying biological context and associating it with biochemical events in texts.
method Analyzed an annotated corpus and developed classifiers using syntactic, distance, and frequency features.
result Developed and evaluated classifiers for context-event association.

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.

Diffusion-GAN uses diffusion to improve GAN training stability and realism.

problem Stability and realism issues in training GANs.
method Diffusion-GAN employs a forward diffusion chain to generate Gaussian-mixture distributed instance noise, with adaptive diffusion process and timestep-dependent discriminator.
result Diffusion-GAN produces more realistic images with higher stability and data efficiency.

New method evaluates text-to-image synthesis for realism, variety, and semantic accuracy.

problem Lack of metrics revealing semantic accuracy in text-to-image synthesis.
method Uses Inception network representations and t-SNE visualization for semantic evaluation.
result Classification accuracy of generated images to real images' visual concepts correlates with semantic accuracy.

SocialInteractionGAN generates realistic human interactions from low-dimensional data.

problem Generating realistic human interactions from limited data.
method Adversarial architecture with a recurrent encoder-decoder generator and dual-stream discriminator.
result SocialInteractionGAN produces high-quality action sequences of interacting people.

Generative Adversarial Networks simulate realistic market interactions.

problem Lack of agent-level historical data limits market simulation realism.
method Conditional Generative Adversarial Networks (CGANs) trained on real data.
result CGAN-based synthetic market generator outperforms previous methods in market responsiveness and realism.

Study compares different scoring rules for machine-learned weather forecasts, finding scale-awareness improves forecast realism.

problem Improving the accuracy of machine-learned probabilistic weather forecasts.
method Comparison of scoring rules (CRPS, fair global energy score, graph energy score) and analysis of their impact on forecast field spectra.
result Scale-awareness improves forecast realism, particularly in the tropics.

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.

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.

GUIDE-VAE generates user-guided data with improved realism and performance.

problem Generating data points for multi-user datasets while considering user information.
method Conditional generative model that integrates user embeddings and a pattern dictionary-based covariance composition.
result GUIDE-VAE outperforms conventional VAEs in multi-user settings, especially under data imbalance.

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.

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.

Paper explores BP's biological plausibility and alternative learning algorithms.

problem Backpropagation's biological plausibility in neural networks.
method Framing supervised learning in the Lagrangian framework to devise biologically plausible local algorithms.
result Biologically plausible learning algorithms can be devised based on saddle point search in the learning adjoint space.