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

Trend · papers per month

2468 · Oct 202519922001200920172026
48 results for rock fragmentation

Automated rock fragmentation assessment using deep learning and spatial statistics.

problem Assessing post-blast rock fragmentation in real-time.
method Fine-tuned YOLO12l-seg model for instance segmentation, followed by spatial statistics.
result Framework accurately assesses rock fragmentation patterns in real-time.

Deep learning model improves seismic rock property estimation.

problem Estimating reservoir rock properties from seismic reflection data.
method Proposes a deep learning-based seismic inversion workflow that models seismic traces spatiotemporally.
result Achieves best performance on SEAM dataset with r2r^{2} coefficient of 79.77\%

A machine learning method predicts rock permeability from 3D images.

problem Efficiently predict permeability of heterogeneous rocks for planetary and robotic applications.
method Machine learning guided 3D properties recognition of rock morphology from 3D micro CT and MRI images.
result The morphology decoder method accurately predicts permeability from 3D images.

Paper introduces impact curves for evaluating binarized regression models with varying costs.

problem Evaluating binarized regression models with varying costs and instance-specific utility.
method Proposes impact curves to optimize binary decisions across different utilities.
result Impact curves identify conditions where one model is favored over another and quantify model improvement.

We present a lower bound for a fragmentation norm and construct a bi-Lipschitz embedding I ⁣:RnHam(M)I\colon \mathbb{R}^n\to\mathrm{Ham}(M) with respect to the fragmentation norm on the group Ham(M)\mathrm{Ham}(M) of Hamiltonian diffeomorphisms of a symplectic manifold (M,ω)(M,ω). As an application, we provide an answer to Brandenbursk…

2019-01-07abs ↗pdf ↗

FluxLayer solves cross-chain liquidity fragmentation for better MEV capture.

problem Cross-chain fragmented liquidity and MEV optimization.
method Three-layer framework integrating settlement, intent, and leverage mechanisms.
result FluxLayer enhances cross-chain MEV by capturing more arbitrage opportunities.

FIRE method improves model performance in federated learning by penalizing fragmentation-induced covariate shifts.

problem Performance degradation in federated learning due to data fragmentation and covariate shift.
method FIRE method accumulates fragmentation-induced covariate shift divergences via approximate Fisher information and uses it as a per-fragment loss penalty.
result FIRE outperforms importance weighting and federated learning benchmarks by up to 5.3% on shifted validation sets.

The paper shows how Hamiltonian diffeomorphisms and homeomorphisms can be broken down into smaller, manageable pieces.

problem Fragmenting Hamiltonian diffeomorphisms and homeomorphisms on surfaces.
method Develops a C0C^0-fragmentation property for Hamiltonian diffeomorphisms and homeomorphisms on surfaces, proving it with a Lipschitz estimate.
result Hamiltonian diffeomorphisms and homeomorphisms can be decomposed into smaller, compactly supported pieces with a Lipschitz estimate on the C0C^0-norm.

Tree structures are ubiquitous in data across many domains, and many datasets are naturally modelled by unobserved tree structures. In this paper, first we review the theory of random fragmentation processes [Bertoin, 2006], and a number of existing methods for modelling trees, including the popular nested Chinese rest…

2015-09-16abs ↗pdf ↗

Generating music medleys is about finding an optimal permutation of a given set of music clips. Toward this goal, we propose a self-supervised learning task, called the music puzzle game, to train neural network models to learn the sequential patterns in music. In essence, such a game requires machines to correctly sor…

2017-09-13abs ↗pdf ↗

Improved Bayesian computation for imaging problems using a new MCMC method.

problem Challenges in Bayesian computation for imaging inverse problems due to high dimensionality and non-smoothness.
method Introduces a new accelerated proximal MCMC method (ls SK-ROCK) that combines data augmentation and relaxation with proximal MCMC.
result The method converges faster and achieves better accuracy than state-of-the-art approaches.

Model shows how multiple markets can coexist or fragment based on trader behavior.

problem Understanding market competition and coexistence among multiple trading venues.
method Stylized model of traders making repeated decisions at three markets, analyzed numerically and analytically.
result Parameters like memory length and choice intensity determine whether markets coexist or fragment.

New model integrates community and link clustering for network data.

problem Lack of embedded prior information and community evolution description in MMSB.
method Fragmentation coagulation process for community and link clustering, with Gibbs sampling for inference.
result Model infers community structure and evolution, improving MMSB.

High-fee pools attract more liquidity but execute less volume; low-fee pools have more stable LPs.

problem Optimal liquidity supply and execution on decentralized exchanges with fixed gas costs.
method Analysis of Uniswap data to compare high- and low-fee pools.
result Fragmented liquidity leads to more LPs and competition, improving overall market efficiency.

Study replicates market model, finds replication hindered by missing details.

problem Replicating a market model with missing details and limited quantitative reporting.
method Increased simulation runs, bootstrap confidence intervals, and code analysis.
result Achieved relational equivalence for most metrics but rejected quantitative alignment.

The calibration of a reservoir model with observed transient data of fluid pressures and rates is a key task in obtaining a predictive model of the flow and transport behaviour of the earth's subsurface. The model calibration task, commonly referred to as "history matching", can be formalised as an ill-posed inverse pr…

2019-05-14abs ↗pdf ↗

The paper analyzes security issues in blockchain ecosystems with multiple SSPs and proposes two models for better stake management.

problem Security issues in blockchain ecosystems with multiple SSPs and stake fragmentation.
method Formalized the Multiple SSP Problem and analyzed two architectures: Model M\mathbb{M} and Model S\mathbb{S} through convex optimization and game-theoretic lens.
result Model S\mathbb{S} achieves tighter security guarantees through single validator sets and aggregated slashing logic.

This paper extends quasimorphism results to nonorientable surfaces.

problem Understanding quasimorphisms on nonorientable surface diffeomorphism groups.
method Constructing infinitely many quasimorphisms on the identity component of nonorientable surface diffeomorphism groups.
result The space of nontrivial quasimorphisms on the identity component of the diffeomorphism group of a closed nonorientable surface is infinite-dimensional.

Paper introduces a method to predict molecule properties from diverse data sources.

problem Limited ability to accommodate scarce or fragmented training data.
method Adaptive Invariance using invariant risk minimization to generalize beyond heterogeneous data.
result Predictor outperforms state-of-the-art transfer learning methods by significant margin.

In this work, we explore how probabilistic programs can be used to represent policies in sequential decision problems. In this formulation, a probabilistic program is a black-box stochastic simulator for both the problem domain and the agent. We relate classic policy gradient techniques to recently introduced black-box…

2015-07-16abs ↗pdf ↗

We relate generalized Lebesgue decompositions of measures in terms of curve fragments (Alberti representations) and Weaver derivations. This correspondence leads to a geometric characterization of the local norm on the Weaver cotangent bundle of a metric measure space (X,μ)(X,μ): the local norm of a form dfdf sees how fas…

2013-11-11abs ↗pdf ↗

Study examines Bitcoin market fragmentation and price formation, revealing market leader-lagger dynamics and trading strategies.

problem Understanding price formation in fragmented Bitcoin markets at sub-second time scales.
method Utilized granular orderbook and trades data, constructed features, and trained linear models to explain market returns.
result Fee regime determines market leadership and profitability of taker strategies, maker strategies tested in real-world trading.

We suggest an analytical approach for Pareto-Zipf law, where we assume random multiplicative noise and fragmentation processes for the growth of the number of citizens of each city and the number of the cities, respectively.

2008-02-27abs ↗pdf ↗

A big challenge in algorithmic composition is to devise a model that is both easily trainable and able to reproduce the long-range temporal dependencies typical of music. Here we investigate how artificial neural networks can be trained on a large corpus of melodies and turned into automated music composers able to gen…

2016-06-23abs ↗pdf ↗

It is shown that the compactly supported identity component of the diffeomorphism group of the 2-dimensional punctured torus Tp2\mathbb T^2_p is an unbounded group. It follows that the fragmentation norm of Tp2\mathbb T^2_p is unbounded.

2011-03-18abs ↗pdf ↗

The paper extends Thurston's method to new variants of Mather-Thurston theorem.

problem Proving new variants of Mather-Thurston theorem for PL homeomorphisms and contactomorphisms.
method Generalizing Thurston's technique to prove new variants of Mather-Thurston theorem for PL homeomorphisms and contactomorphisms.
result The paper answers questions posed by Gelfand-Fuks and Greenberg on PL foliations and Rybicki on contactomorphisms.