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

7152229 · Jun 202019922001200920172026
48 results for coarse graining

Machine learning generates coarse-grained force fields for molecular dynamics.

problem Creating thermodynamically consistent coarse-grained models for larger systems.
method Hybrid architecture using graph neural networks to learn molecular features.
result Framework reproduces thermodynamics for small biomolecular systems.

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 ↗

Data coarse graining improves model performance by filtering out less relevant features.

problem Lossy data transformations lose information but can improve model generalization.
method Data coarse graining schemes that systematically discard features based on relevance to the learning task.
result A 'high-pass' scheme helps models generalize better by filtering out less relevant features.

New framework embeds physics in coarse-grained models without big data.

problem Lack of big data and computational demand in data-driven coarse-graining.
method Proposes a novel objective based on reverse Kullback-Leibler divergence that incorporates physics in the form of force fields.
result Generative coarse-grained model predicts atomistic configurations and reveals physicochemical CVs.

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 ↗

Temporal coarse-graining of latent default paths explains effective correlation in corporate defaults.

problem Understanding effective default correlation in corporate defaults.
method Temporal coarse-graining of latent default-probability paths, applied to corporate default-count data.
result Temporal coarse-graining provides a scale-consistent baseline that improves identifiability and reduces over-allocation of long-horizon fluctuations.

CG-BGs combine flow-based models with PMFs to sample large systems efficiently.

problem Sampling equilibrium molecular configurations from the Boltzmann distribution is challenging.
method Coarse-grained Boltzmann Generators (CG-BGs) use flow-based models and learned PMFs for efficient sampling.
result CG-BGs provide a practical route for sampling larger molecular systems efficiently.

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.

Framework preserves emergent physics in non-equilibrium systems from particle trajectories.

problem Linking short spatiotemporal scales to emergent bulk physics in multiscale systems.
method Metriplectic bracket formalism for structure-preserving coarse-graining.
result Preservation of thermodynamic laws and conservation in machine-learned dynamics.

Temporal aggregation reveals latent default correlation from monthly data.

problem Understanding effective default correlation from monthly default data.
method Temporal coarse-graining of latent default-probability paths.
result Temporal coarse-graining improves identifiability and reduces over-allocation of long-horizon fluctuations.

New method uses normalizing flows to improve force fields for coarse-grained molecular dynamics.

problem Lack of reference atomistic forces makes force matching infeasible for MLCG force fields.
method Introduces noise-based kernels adapted to low-data regimes using normalizing flows.
result Flow-based kernels reduce local distortions while preserving global accuracy.

We introduce a hierarchical architecture for video understanding that exploits the structure of real world actions by capturing targets at different levels of granularity. We design the model such that it first learns simpler coarse-grained tasks, and then moves on to learn more fine-grained targets. The model is train…

2018-09-04abs ↗pdf ↗

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 ↗

The ubiquitous deployment of monitoring devices in urban flow monitoring systems induces a significant cost for maintenance and operation. A technique is required to reduce the number of deployed devices, while preventing the degeneration of data accuracy and granularity. In this paper, we present an approach for infer…

2020-02-05abs ↗pdf ↗

The combination of high-dimensionality and disparity of time scales encountered in many problems in computational physics has motivated the development of coarse-grained (CG) models. In this paper, we advocate the paradigm of data-driven discovery for extract- ing governing equations by employing fine-scale simulation …

2018-02-11abs ↗pdf ↗

Paper tackles cross-granularity few-shot learning with meta-embedder.

problem Few-shot learning with coarse labels and fine-grained testing.
method Meta-embedder that optimizes visual and semantic discrimination across coarse and fine classes.
result Meta-embedder achieves effective cross-granularity few-shot classification.

We propose a new approach for analyzing price fluctuations in their strongly correlated regime ranging from minutes to months. This is done by employing a self-similarity assumption for the magnitude of coarse-grained price fluctuation or volatility. The existence of a Cramer function, the characteristic function for s…

2001-01-12abs ↗pdf ↗

Survey of weak form's role in equation learning, parameter estimation, and coarse graining.

problem Noise robustness, accuracy, and computational efficiency in weak form applications.
method Survey and recent developments in weak form versions of equation learning, parameter estimation, and coarse graining.
result Surprising noise robustness, accuracy, and computational efficiency in weak form 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.

New framework learns labels at both bag and graph levels.

problem Learning multi-label classifiers from multi-graph bags.
method Designing scoring functions and rank-loss objective for graph and bag levels; developing sub-gradient descent algorithm.
result Superior performance over state-of-the-art algorithms.

Although there has been a rapid development of practical applications, theoretical explanations of deep learning are in their infancy. Deep learning performs a sophisticated coarse graining. Since coarse graining is a key ingredient of the renormalization group (RG), RG may provide a useful theoretical framework direct…

2019-06-12abs ↗pdf ↗

Temporal coarse-graining of multi-sector default count data generates effective correlation matrices and rank copulas.

problem Explaining the difference in default dependence between monthly and annual aggregation.
method Dynamic low-rank state-space model with AR(1) latent credit-state factors.
result Effective correlation matrices and rank copulas are generated from monthly default count data.

Improved investment performance with fine-grained LLM tasks.

problem Abstract financial trading systems often overlook real-world workflow intricacies, leading to degraded performance.
method Proposes a multi-agent LLM trading framework that decomposes investment analysis into fine-grained tasks.
result Fine-grained task decomposition significantly improves risk-adjusted returns compared to coarse-grained designs.

MLP residual networks implement a selective coarse-graining procedure governed by the spectral structure of the input distribution.

problem Understanding the coarse-graining procedure in MLP residual networks
method Analyzing a pure MLP residual stack on synthetic Markov chain sequences
result MLP residual networks implement a selective coarse-graining procedure governed by the spectral structure of the input distribution

The paper reduces the complexity of financial market correlation matrices to a 2x2 matrix.

problem Reducing the complexity of financial market correlation matrices for easier analysis.
method Sectorial coarse graining followed by averaging over blocks of stocks.
result Averaging over blocks of stocks results in a reduced matrix with specific properties.

The paper develops a physics-aware method for modeling multiscale dynamics with reduced data.

problem Discovering effective, lower-dimensional models for high-dimensional dynamical systems.
method Probabilistic deep neural networks incorporating physical constraints.
result The method reduces the need for extensive multiscale simulations (Small Data regime).

LDA improves image classification accuracy with fewer features.

problem Fine-grained image classification with pretrained features.
method Supervised dimensionality reduction with LDA before linear probing.
result LDA improves accuracy over full features in 11 out of 12 configurations.

This study uses persistent homology to analyze complex transitional networks from time series data.

problem Lack of effective tools to summarize complex topology in transitional networks.
method Persistent homology from topological data analysis applied to coarse-grained state-space networks (CGSSN).
result CGSSN improves dynamic state detection and noise robustness compared to other methods.

The paper develops a framework for abstracting causal models using category theory.

problem Difficulties in changing the variables used to describe a system, especially from fine-grained to coarse-grained.
method Introduces a category of interventional causal models and uses enriched category theory to prove compositionality properties.
result Compositionality of model transformations is established, with bounded errors for each step.

Considering event structure information has proven helpful in text-based stock movement prediction. However, existing works mainly adopt the coarse-grained events, which loses the specific semantic information of diverse event types. In this work, we propose to incorporate the fine-grained events in stock movement pred…

2019-10-11abs ↗pdf ↗