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

15304560 · Jun 202019922001200920172026
48 results for all-atom details

DiAMoNDBack models protein backmapping from coarse-grained Cα traces.

problem Restoring all-atom details from coarse-grained protein representations.
method Autoregressive denoising diffusion model for residue-by-residue backmapping.
result Achieves state-of-the-art reconstruction performance in diverse applications.

A new machine-learned CG model predicts protein structures efficiently.

problem Developing a universal, computationally efficient protein simulation model.
method Combining deep learning with all-atom protein simulations to create a transferable CG force field.
result The model predicts protein structures, intermediates, and fluctuations efficiently.

Improved CG force-field learning from all-atom data.

problem Training accurate coarse-grained models from all-atom simulations is challenging.
method Optimized force mapping to improve statistical efficiency of force-field learning.
result Substantially improved CG force-fields can be learned from the same simulation data.

A new method speeds up sampling of Boltzmann distribution in high-dimensional systems.

problem High computational cost of obtaining Jacobian of flow-based models in high dimensions.
method Flow perturbation method that incorporates stochastic perturbations and reweighting.
result Achieves unbiased sampling of Boltzmann distribution with orders of magnitude speedup.

Molecular dynamics simulations provide theoretical insight into the microscopic behavior of materials in condensed phase and, as a predictive tool, enable computational design of new compounds. However, because of the large temporal and spatial scales involved in thermodynamic and kinetic phenomena in materials, atomis…

2018-12-06abs ↗pdf ↗

Timewarp accelerates molecular dynamics by learning to simulate long timescales.

problem Efficiently simulating long timescales in molecular dynamics.
method Uses a normalizing flow to learn large time steps in Markov chain Monte Carlo.
result Generalizes to unseen small peptides, accelerating sampling.

New algorithm efficiently trains machine learning models to atomic forces data.

problem Efficiently training machine learning models to large amounts of force data.
method Developed an efficient algorithm for training machine learning models to all available force data.
result Training to all available force data is only a few times more expensive than training to energies alone.

We prove that the exponential growth rate of the regular language of penetration sequences is smaller than the growth rate of the regular language of normal form words, if the acceptor of the regular language of normal form words is strongly connected. Moreover, we show that the latter property is satisfied for all irr…

2014-03-11abs ↗pdf ↗

Atomistic or ab-initio molecular dynamics simulations are widely used to predict thermodynamics and kinetics and relate them to molecular structure. A common approach to go beyond the time- and length-scales accessible with such computationally expensive simulations is the definition of coarse-grained molecular models.…

2018-12-04abs ↗pdf ↗

New method uses geometric moments for accurate machine learning potentials.

problem Creating high-dimensional potential energy surfaces efficiently.
method Feed-forward neural networks with invariant local molecular descriptors based on geometric moments.
result Accuracy comparable to established models, high efficiency.

Framework learns surrogates for molecular dynamics across multiple time-scales.

problem Stable molecular dynamics simulations require small time-steps, but long-time-scale moments need repeated simulations.
method Implicit Transfer Operator Learning with denoising diffusion probabilistic models and SE(3) equivariant architecture.
result Models can generate self-consistent stochastic dynamics across multiple time-scales.

New neural network predicts accurate protein complex structures.

problem Predicting accurate protein complex structures from atomic coordinates.
method Rotation-equivariant neural network combining point-based representation, equivariance, local convolutions, and hierarchical subsampling.
result Significant improvement in identifying accurate structural models.

We propose a data-driven, coarse-graining formulation in the context of equilibrium statistical mechanics. In contrast to existing techniques which are based on a fine-to-coarse map, we adopt the opposite strategy by prescribing a probabilistic coarse-to-fine map. This corresponds to a directed probabilistic model wher…

2016-05-26abs ↗pdf ↗

DECAF optimizes molecular graphs for ensemble properties, improving drug design accuracy.

problem Designing molecules with ensemble properties rather than single conformations.
method DECAF uses Boltzmann-expected design with decoupled annealing flows to optimize molecular graphs.
result DECAF optimizes molecular graphs to shift ensemble properties towards targets, improving accuracy over single-conformer methods.

We test a historical price time series in a financial market (the NASDAQ 100 index) for a statistical property known as detailed balance. The presence of detailed balance would imply that the market can be modeled by a stochastic process based on a Markov chain, thus leading to equilibrium. In economic terms, a positiv…

2014-03-14abs ↗pdf ↗

Cyclic Boosting offers detailed prediction understanding for machine learning models.

problem Complex machine learning models are often black boxes, making individual predictions hard to understand.
method Cyclic Boosting is a novel machine learning algorithm that provides detailed understanding of predictions.
result Cyclic Boosting enables detailed understanding of how predictions are made, even for complex models.

In this paper, firstly the axis of a slant helix is found with a method. Secondly, the theorem which characterizes a unit speed curve to be a slant helix is proved in detail. The importance of this theorem is stemed from that it has led to many papers regarding slant helices in the differential geometry literature.

2012-03-20abs ↗pdf ↗

Deep learning has significant potential for medical imaging. However, since the incident rate of each disease varies widely, the frequency of classes in a medical image dataset is imbalanced, leading to poor accuracy for such infrequent classes. One possible solution is data augmentation of infrequent classes using syn…

2018-11-28abs ↗pdf ↗

MCFNet recovers spatial detail and fuses it with semantic information for real-time segmentation.

problem Recovering spatial detail information and fusing it with semantic information in real-time.
method Proposes a new architecture (MCFNet) with feature refinement and fusion modules, and a gating unit.
result Achieves competitive performance with high speed (75.5% mIOU, 151.3 FPS on Cityscapes).

Compact models for methane/air combustion reduce complexity without sacrificing accuracy.

problem Creating accurate, computationally efficient models for methane combustion.
method Data-oriented three-step methodology: 1) Remove non-essential species, 2) Numerically optimize to key species profiles, 3) Machine learning to refine parameters.
result Produced 19 and 15 species compact models that outperform current state-of-the-art models in accuracy and range of conditions.

Big data from phone calls improves credit scoring models and profits.

problem Improving credit scoring models to enhance financial inclusion.
method Combining call-detail records and traditional data to build scorecards using social network analytics.
result Combining call-detail records with traditional data significantly increases model performance and profit.

Schrödinger and Onsager's ideas linked in nonequilibrium thermodynamics.

problem Linking Schrödinger's variational problem with Onsager's nonequilibrium statistical mechanics.
method Analyzing the historical context and comparing the two approaches.
result Schrödinger's ideas have not yet been fully integrated into the classical context of Onsager's work.

GAS models have been recently proposed in time-series econometrics as valuable tools for signal extraction and prediction. This paper details how financial risk managers can use GAS models for Value-at-Risk (VaR) prediction using the novel GAS package for R. Details and code snippets for prediction, comparison and back…

2016-11-18abs ↗pdf ↗

In math.GT/0106017 it was shown that thin position on Heegaard spines can be a useful tool for analyzing the topology of knots in 3-space. The proof there (specifically, of the Goda-Teragaito conjecture) requires masses of technical detail; it is easy to lose track of the underlying ideas. The present paper gives an ov…

2001-08-10abs ↗pdf ↗

A new router uses attention-based reinforcement learning to solve detailed routing problems efficiently.

problem Solving detailed routing in integrated circuits while adhering to complex design rules.
method Attention-based reinforcement learning applied to track-assignment detailed routing.
result The attention router achieves over 100x acceleration compared to a genetic router without sacrificing solution quality.

Following the financial crisis of 2007-2008, a deep analogy between the origins of instability in financial systems and complex ecosystems has been pointed out: in both cases, topological features of network structures influence how easily distress can spread within the system. However, in financial network models, the…

2016-02-18abs ↗pdf ↗

New sampler tackles complex discrete energy landscapes efficiently.

problem Stagnation in gradient-based discrete samplers for non-convex settings.
method DREXEL sampler with Replica Exchange and Adjusted Metropolis.
result Proves samplers satisfy detailed balance and converge to target distribution.

This paper gives an overview of several key innovations in the 19th century which led to complex geometry in the 20th century. This includes the creation of the complex plane, the work of Abel on addition theorems for generalized elliptic integrals, the theory of elliptic functions, holomorphic functions, and the creat…

2015-04-16abs ↗pdf ↗

In this paper, we propose a novel technique to implement stochastic gradient methods, which are beneficial for learning from large datasets, through accelerated stochastic dynamics. A stochastic gradient method is based on mini-batch learning for reducing the computational cost when the amount of data is large. The sto…

2015-11-19abs ↗pdf ↗

In this paper, we propose the Self-Attention Generative Adversarial Network (SAGAN) which allows attention-driven, long-range dependency modeling for image generation tasks. Traditional convolutional GANs generate high-resolution details as a function of only spatially local points in lower-resolution feature maps. In …

2018-05-21abs ↗pdf ↗

Quality-designed consumer products are easy to recognize. Wouldn't it be great if the quality of financial products became just as apparent? This paper is addressed to financial practitioners. It provides an informal introduction to Quantitative Structuring -- a technology of manufacturing quality financial products (i…

2015-07-26abs ↗pdf ↗

Elie Cartan's general equivalence problem is recast in the language of Lie algebroids. The resulting formalism, being coordinate and model-free, allows for a full geometric interpretation of Cartan's method of equivalence via reduction and prolongation. We show how to construct certain normal forms (Cartan algebroids) …

2005-09-03abs ↗pdf ↗

Convolutional GANs favor low spatial frequencies, affecting fine detail generation.

problem Understanding GANs' limitations in high spatial frequency learning.
method Proposed method to manipulate GANs' bias against high spatial frequencies.
result Convolutional GANs have a bias against learning high spatial frequencies.