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

Trend · papers per month

86172257343 · Jun 202019922001200920172026
48 results for dynamic snapshot ensemble

GER learns particle dynamics from unpaired snapshots using physics-informed GANs.

problem Learning particle dynamics from unpaired snapshots with physics constraints.
method Physics-informed generative model to fit particle ensemble distributions.
result Inferred dynamics of particle ensembles governed by SODEs up to 100 dimensions.

This paper improves deep learning model consistency through ensemble methods.

problem Consistency and correct-consistency issues in deep learning models.
method Formal definition of consistency and correct-consistency, proving ensemble improvement, proposing dynamic snapshot ensemble method.
result Ensemble methods can improve correct-consistency of deep learning models.

This work improves distribution recovery from sparse data using Random Forest implicit regularization.

problem Distribution recovery from limited statistics.
method Closed-form estimator for scaled beta distributions, using composite quantile and moment matching.
result Improved classification accuracy through closed-form distribution recovery and implicit regularization.

CT-OT Flow estimates continuous-time dynamics from discrete snapshots.

problem Estimating continuous-time dynamics from temporally aggregated snapshots with noisy or uncertain timestamps.
method Two-stage framework: aligning neighboring intervals via partial optimal transport (POT) and reconstructing a continuous-time distribution through temporal kernel smoothing.
result Reduces distributional and trajectory errors compared with existing methods across synthetic and real datasets.

Physics-informed methods infer spatial dynamics from static snapshots, but limits exist.

problem Inferring spatial dynamics from static molecular patterns.
method Combining flexible representations with mechanistic constraints, analyzing structural identifiability, and adapting physics-informed schemes.
result Static spatial patterns can identify spatially varying dynamics, but limits exist due to modeling choices.

Ensembles of deep neural networks significantly improve generalization accuracy. However, training neural network ensembles requires a large amount of computational resources and time. State-of-the-art approaches either train all networks from scratch leading to prohibitive training cost that allows only very small ens…

2018-09-12abs ↗pdf ↗

DDD reformulated for sparse matrices, integrating trajectory and snapshot time series data.

problem Efficiently integrate trajectory and snapshot time series data.
method Reformulate DDD to use compact basis functions, reducing parameter scaling.
result Inference of sparse matrices reduces the number of parameters in DDD.

The loss functions of deep neural networks are complex and their geometric properties are not well understood. We show that the optima of these complex loss functions are in fact connected by simple curves over which training and test accuracy are nearly constant. We introduce a training procedure to discover these hig…

2018-02-27abs ↗pdf ↗

TNDE quantifies dynamic gene drivers from single-cell snapshots.

problem Reconstructing time-resolved regulatory effects in biological processes.
method Time-varying Network Driver Estimation (TNDE) using shared graph attention encoder and partial optimal transport.
result TNDE identifies stage-specific driver genes in mouse erythropoiesis.

Hybrid engine analyzes news sentiment for markets in real-time.

problem Real-time market analysis of news sentiment.
method Three-way ensemble learning combining financial lexicon, adaptive TF-IDF clustering, and auto-calibrated weighting.
result Adaptive statistical clustering learner improves adaptability to market changes.

Learning network representations is a fundamental task for many graph applications such as link prediction, node classification, graph clustering, and graph visualization. Many real-world networks are interpreted as dynamic networks and evolve over time. Most existing graph embedding algorithms were developed for stati…

2019-10-04abs ↗pdf ↗

New method infers population dynamics from snapshots using path space optimization.

problem Recover dynamics of a population from its temporal marginals.
method Grid-free algorithm using Schrödinger bridges coupled via noisy gradient descent in mean-field limit.
result Global convergence to min-entropy estimator with end-to-end theoretical guarantees.

SnapMMD forecasts cell differentiation outcomes from snapshot data.

problem Forecasting cell differentiation outcomes from limited snapshot data.
method SnapMMD learns dynamics by directly fitting the joint distribution of state measurements and observation time with MMD loss, allowing for unknown and state-dependent volatilities.
result SnapMMD delivers accurate forecasts and an R2-style statistic for diagnosing fit.

New method learns population dynamics from snapshots using JKO scheme and inverse optimization.

problem Recovering underlying process governing particle evolution from discrete time samples.
method Combines JKO scheme with inverse optimization techniques for end-to-end adversarial training.
result Improved performance over prior JKO-based methods with theoretical guarantees.

Efficient neural network ensembles improve image classification reliability and uncertainty quantification.

problem Uncertainty in neural network predictions for industrial image classification.
method Investigated efficient neural network ensembles (snapshot, batch, multi-input multi-output) for image classification reliability and uncertainty quantification.
result Batch ensemble is a cost-effective and competitive alternative to deep ensembles, offering savings in training and test time.

Unified framework for discrete diffusion modeling with flexible noising processes.

problem Efficient modeling of large discrete state spaces with arbitrary corruption dynamics.
method Generalized Discrete Diffusion from Snapshots (GDDS) framework that supports uniformization for fast noising and snapshot-based ELBO for reverse process.
result GDDS outperforms existing discrete diffusion methods in training efficiency and generation quality.

New method learns population dynamics from snapshots, outperforming existing models.

problem Capturing periodic and other dynamical properties of population dynamics.
method Wasserstein Lagrangian Mechanics (WLM) for learning second-order dynamics from observed marginals.
result WLM outperforms existing methods across various dynamics, including vortex dynamics, embryonic development, and flocking.

A neural network, IHT-Net, improves DOA estimation with sparse arrays.

problem Single-snapshot DOA estimation with sparse arrays in dynamic settings.
method IHT-inspired neural network with recurrent neural network and autoencoders.
result IHT-Net achieves faster convergence and higher accuracy in DOA estimation.

3MSBM learns smooth trajectories from multiple snapshots.

problem Capturing long-range temporal dependencies in complex systems.
method Lifts dynamics to phase space, generalizes stochastic bridges to multi-marginal conditional problems, learns transport maps preserving intermediate marginals.
result Significantly improves convergence and scalability in capturing complex dynamics.

Paper improves DOA estimation in sparse arrays using Siamese neural networks.

problem Challenges in DOA estimation with limited snapshots in sparse linear arrays.
method Introduces a Siamese neural network with a sparse augmentation layer for enhanced signal feature embedding.
result Demonstrates improved DOA estimation accuracy in sparse arrays.

Numerous networks in the real world change over time, in the sense that nodes and edges enter and leave the networks. Various dynamic random graph models have been proposed to explain the macroscopic properties of these systems and to provide a foundation for statistical inferences and predictions. It is of interest to…

2019-04-06abs ↗pdf ↗

Networks evolve continuously over time with the addition, deletion, and changing of links and nodes. Such temporal networks (or edge streams) consist of a sequence of timestamped edges and are seemingly ubiquitous. Despite the importance of accurately modeling the temporal information, most embedding methods ignore it …

2019-04-12abs ↗pdf ↗

This paper proves long-time accuracy of ensemble Kalman filters for chaotic and machine-learned systems.

problem Ensuring long-term accuracy of ensemble Kalman filters for complex dynamical systems.
method Established conditions for long-time accuracy of ensemble Kalman filters for chaotic and machine-learned dynamical systems.
result Ensemble Kalman filters maintain small estimation error over long time horizons for chaotic and machine-learned systems.

This paper studies recursive ensembles driven by Fibonacci updates, improving learning dynamics.

problem Improving learning dynamics in recursive ensemble learning.
method Develops second-order recursive architectures with Fibonacci-type update flows.
result Establishes global convergence conditions and generalization bounds for recursive ensembles.

We propose a non-parametric link prediction algorithm for a sequence of graph snapshots over time. The model predicts links based on the features of its endpoints, as well as those of the local neighborhood around the endpoints. This allows for different types of neighborhoods in a graph, each with its own dynamics (e.…

2012-06-27abs ↗pdf ↗

We describe tests validating progress made toward acceleration and automation of hydrodynamic codes in the regime of developed turbulence by three Deep Learning (DL) Neural Network (NN) schemes trained on Direct Numerical Simulations of turbulence. Even the bare DL solutions, which do not take into account any physics …

2018-10-16abs ↗pdf ↗