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

56113169225 · Jun 202019922001200920172026
48 results for grain size

Pipelined Backpropagation trains large models without batches efficiently.

problem Training large models efficiently on hardware with limited batch sizes.
method Fine-grained Pipelined Backpropagation with Spike Compensation and Linear Weight Prediction.
result Fine-grained Pipelined Backpropagation with a batch size of one matches the accuracy of SGD for multiple networks.

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.

Study examines spillovers between BRICS and U.S. staple grain futures markets.

problem Contemporaneous and lagged spillover effects in BRICS staple grain futures markets and their linkages with U.S. markets.
method Examines contemporaneous and lagged spillover effects using econometric models.
result Contemporaneous spillovers dominate, and net spillovers are driven by lagged connectedness. Systemic risk is lower in intra-BRICS markets compared to those including the U.S.

Study examines grain futures connectedness during Russia-Ukraine conflict.

problem Quantile return connectedness of grain futures markets during geopolitical instability.
method Dynamic quantile VAR combined with frequency-domain decomposition.
result Heterogeneous spillovers across quantiles, with strong transmitters and persistent receivers.

The paper studies scaling laws for associative memory mechanisms.

problem Understanding and optimizing learning and memorization processes.
method High-dimensional matrices of outer products of embeddings, relating to transformer models. Derived scaling laws with sample and parameter sizes. Extensive numerical experiments.
result Precise scaling laws and statistical efficiency of estimators.

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.

We examine the correlation of the limit price with the order book, when a limit order comes. We analyzed the Rebuild Order Book of Stock Exchange Electronic Trading Service, which is the centralized order book market of London Stock Exchange. As a result, the limit price is broadly distributed around the best price acc…

2007-02-04abs ↗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 ↗

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 ↗

As entity type systems become richer and more fine-grained, we expect the number of types assigned to a given entity to increase. However, most fine-grained typing work has focused on datasets that exhibit a low degree of type multiplicity. In this paper, we consider the high-multiplicity regime inherent in data source…

2017-04-25abs ↗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 ↗

Modeling financial markets with sandpile model to understand price volatility and arbitrage constraints.

problem Understanding price volatility and arbitrage constraints in financial markets.
method Uses a sandpile model to represent information and price changes, linking size of price volatility to the scaling law of avalanches.
result Identifies a structural tension between non-arbitrage condition and price adjustments consistent with a constant Sharpe ratio.

Study finds intrinsic multifractality in maize and barley spot markets, but not in wheat and rice.

problem Understanding the complex price behavior of global grain spot markets.
method Utilized multifractal fluctuation analysis (MF-DFA) to investigate intrinsic multifractality.
result Intrinsic multifractality found in maize and barley sub-indices, but not in wheat and rice.

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 ↗

PSimGNN partitions graphs into subgraphs for efficient graph similarity computation.

problem Efficiently compute graph similarity scores for large graphs.
method Graph partitioning followed by subgraph-level and node-level comparisons using a graph neural network.
result PSimGNN outperforms state-of-the-art methods in graph similarity computation tasks.

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.

Large twist-angle grain boundaries in layered structures are often described by Scherk's first surface whereas small twist-angle grain boundaries are usually described in terms of an array of screw dislocations. We show that there is no essential distinction between these two descriptions and that, in particular, their…

1998-08-27abs ↗pdf ↗

Fine-grained gap-dependent regret bounds for reinforcement learning.

problem Achieving optimal regret bounds for reinforcement learning with suboptimality gaps.
method Developed novel analytical frameworks and refined algorithms for UCB-based and non-UCB-based reinforcement learning.
result Established the first fine-grained gap-dependent regret bounds for both UCB-based and non-UCB-based algorithms.

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 ↗

This research examines how the error rate of nearest neighbor classifiers varies with dataset size.

problem The scaling of classification error rates with dataset size is not uniform.
method Theoretical analysis of nearest neighbor classifiers, focusing on early and late phases of dataset size.
result The error rate of nearest neighbor classifiers can have fine-grained rates depending on the dataset size and data distribution.

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.

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.

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.

Inspired by coarse-graining approaches used in physics, we show how similar algorithms can be adapted for data. The resulting algorithms are based on layered tree tensor networks and scale linearly with both the dimension of the input and the training set size. Computing most of the layers with an unsupervised algorith…

2017-12-31abs ↗pdf ↗

DistPre predicts traffic speeds efficiently for large networks.

problem Fine-grained, accurate speed prediction for large-scale transportation networks.
method Customizes LSTM models on a cluster, sharing trained models between detectors.
result Efficient and accurate fine-grained traffic-speed prediction.

Existing methods for retrieving k-nearest neighbours suffer from the curse of dimensionality. We argue this is caused in part by inherent deficiencies of space partitioning, which is the underlying strategy used by most existing methods. We devise a new strategy that avoids partitioning the vector space and present a n…

2015-12-01abs ↗pdf ↗

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.