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

10.0%20.0%30.0%40.0% · May 201919922001200920172026
48 results for Discrete Fracture Network

This paper analyzes uncertainty in DFN simulations using sensitivity analysis.

problem Uncertainty in estimating QoI due to epistemic and aleatoric uncertainties in DFN simulations.
method Sensitivity analysis to attribute uncertainty to input parameters and aleatoric uncertainty.
result Characterizes uncertainty in DFN flow simulations with heteroskedastic aleatoric uncertainty.

Generalized meshes for non-regular geometries, including fractures.

problem Discretization of partial differential equations in non-regular geometries.
method Introduces generalized meshes with overlapping elements and flexible adjacency relations.
result Discrete differential forms on virtually inflated meshes characterize the trace space of forms in surrounding volumes.

In this work, we analyze the flow filtration process of slightly compressible fluids in porous media containing man made fractures with complex geometries. We model the coupled fracture-porous media system where the linear Darcy flow is considered in porous media and the nonlinear Forchheimer equation is used inside th…

2019-05-18abs ↗pdf ↗

In this paper, we present a data-driven model for forecasting the production increase after hydraulic fracturing (HF). We use data from fracturing jobs performed at one of the Siberian oilfields. The data includes features, characterizing the jobs, and geological information. To predict an oil rate after the fracturing…

2019-02-05abs ↗pdf ↗

Optimizes structure topology for ductile and brittle fracture resistance.

problem Minimizing mass while ensuring structural damage and fracture resistance.
method Phase-field approach for modeling fracture, level-set topology optimization.
result Enhanced fracture resistance through two formulations.

Fractured Sampling improves LLM reasoning efficiency by truncating CoT trajectories.

problem Efficiently scaling reasoning in large language models with limited tokens.
method Integrating truncated Chain-of-Thought (CoT) with Fractured Sampling across multiple dimensions.
result Fractured Sampling achieves superior accuracy-cost trade-offs compared to full CoT.

We use topological methods to prove a semicontinuity property of the Hodge spectra for analytic germs defined on an isolated surface singularity. For this we introduce an analogue of the Seifert matrix (the fractured Seifert matrix), and of the Levine--Tristram signatures associated with it, defined for null-homologous…

2013-08-23abs ↗pdf ↗

Method learns Dirichlet-to-Neumann maps on graphs using Gaussian processes.

problem Coupling multiphysics simulations on graphs with conservation constraints.
method Gaussian processes combined with discrete exterior calculus and maximum likelihood estimation.
result Data-driven predictions with uncertainty quantification on entire graph.

Optimal design portfolios improve energy efficiency and reduce risk in uncertain reservoirs.

problem Uncertain reservoir conditions lead to unstable gas recovery and low resource efficiency.
method Developed optimal portfolios of well designs based on reservoir conditions and probabilities.
result Remarkable reduction in variation and substantial increase in energy efficiency achieved.

We introduce the speculate-correct method to derive error bounds for local classifiers. Using it, we show that k nearest neighbor classifiers, in spite of their famously fractured decision boundaries, have exponential error bounds with O(sqrt((k + ln n) / n)) error bound range for n in-sample examples.

2014-10-09abs ↗pdf ↗

Universal model for soft tissue mechanics under shock waves.

problem Modeling shock wave mechanics in soft biological tissues.
method Continuum mixture theory with phase-field mechanics.
result Universal thermodynamically consistent formulation for soft porous tissues.

Matrix-variate distributions can intuitively model the dependence structure of matrix-valued observations that arise in applications with multivariate time series, spatio-temporal or repeated measures. This paper develops an Expectation-Maximization algorithm for discriminant analysis and classification with matrix-var…

2019-07-22abs ↗pdf ↗

DCGANs generate drainage networks quickly from samples.

problem High computational costs in generating large numbers of drainage networks.
method DCGANs trained with connectivity-informed directional information.
result Connectivity-informed DCGANs outperform other methods in reproducing accurate drainage networks.

DAFNO learns surrogates for complex systems on irregular geometries.

problem Learning accurate surrogates for complex physical systems on irregular geometries.
method DAFNO incorporates a smoothed characteristic function in the integral layer architecture of FNOs, leveraging FFT for rapid computations.
result DAFNO achieves state-of-the-art accuracy on material modeling and airfoil simulation datasets.

We propose a Markov jump process with the three-state herding interaction. We see our approach as an agent-based model for the financial markets. Under certain assumptions this agent-based model can be related to the stochastic description exhibiting sophisticated statistical features. Along with power-law probability …

2012-10-05abs ↗pdf ↗

In this work, we propose an order book model with herd behavior. The proposed model is built upon two distinct approaches: a recent empirical study of the detailed order book records by Kanazawa et al. [Phys. Rev. Lett. 120, 138301] and financial herd behavior model. Combining these approaches allows us to propose a mo…

2018-09-08abs ↗pdf ↗

Neural networks learn discrete tasks on continuous data via emergent geometry.

problem Understanding how neural networks perform discrete computations on continuous data.
method Analysis of Riemannian pullback metric across neural network layers.
result Neural networks learn to discretize continuous inputs and perform logical operations on these discretized variables.

Paper proposes an efficient algorithm for learning sparse Bayesian networks from discrete high-dimensional data.

problem Learning sparse structure Bayesian networks from high-dimensional discrete data.
method Score function for sparse DAG, block-wise stochastic coordinate descent with variance reduction.
result The proposed algorithm outperforms existing methods in synthetic data benchmarks.

Paper optimizes clustering for multi-layer networks and discrete mixtures.

problem Optimizing clustering in multi-layer networks and discrete mixtures.
method Two-stage method: tensor-based initialization and likelihood-based refinement.
result Achieves minimax optimal error rate for multi-layer networks and discrete mixtures.

Derives EoM for DNNs to describe GD dynamics precisely.

problem Gaps between differential equations and actual DNN learning dynamics due to discretization error.
method Starts from GF, derives counter term to cancel discretization error, obtains EoM.
result EoM precisely describes GD dynamics of DNNs, highlights differences between continuous and discrete GD.

Rewiring networks using discrete geometry improves GNN training accuracy and reduces runtime.

problem Inefficient information propagation between distant nodes in graph neural networks.
method Discrete analogues of classical geometric curvature to model and rewire networks.
result Classical geometric notions achieve state-of-the-art GNN training accuracy and significantly reduce runtime.

Neural networks' feature geometry evolves like discrete Ricci flow.

problem Understanding neural feature representations and their geometric transformations.
method Approximating input manifold with geometric graphs and analyzing their evolution during training.
result Neural feature geometry evolves like discrete Ricci flow, with nonlinear activations playing a crucial role.

Proposes OC4Seq for detecting anomalies in discrete event sequences.

problem Challenges in detecting anomalies in discrete event sequences, including data imbalance, discrete events, and sequential nature.
method Integrates anomaly detection with recurrent neural networks (RNNs) to embed sequences into latent spaces and designs a multi-scale RNN framework to capture multi-scale sequential patterns.
result OC4Seq consistently outperforms various baselines on three benchmark datasets.

New methods for inferring, predicting, and estimating continuous-time, discrete-event processes.

problem Inferring, predicting, and estimating entropy rate of continuous-time, discrete-event processes.
method Bayesian structural inference extended with neural networks.
result Methods are competitive for prediction and entropy-rate estimation with state-of-the-art.

Library learns Bayesian networks from mixed data without discretization.

problem Learning Bayesian networks from mixed data (discrete and continuous variables).
method Proposes an algorithm for structural and parameter learning of Bayesian networks from mixed data using a mixed MI score function and Gaussian approximation. Offers two graph structure enumeration algorithms.
result Advantages in solving approximation and gap recovery problems on synthetic and real datasets.

Multilayer switch networks are proposed as artificial generators of high-dimensional discrete data (e.g., binary vectors, categorical data, natural language, network log files, and discrete-valued time series). Unlike deconvolution networks which generate continuous-valued data and which consist of upsampling filters a…

2019-03-14abs ↗pdf ↗

A method for predicting survival using neural networks for both continuous and discrete time.

problem Survival prediction for both continuous and discrete time data.
method Proposes a scheme for discretizing continuous-time data and two interpolation schemes for continuous-time survival estimates.
result The hazard rate parametrization of neural networks yields better performance than the parametrization of the probability mass function.

This text explores strategies for learning discrete latent structures in neural networks.

problem Learning discrete latent structures in neural networks is challenging.
method Continuous relaxation, surrogate gradients, and probabilistic estimation.
result Many latent structure learning strategies use the same fundamental building blocks but apply them differently.

Study approximates BSDEs with constraints using machine learning.

problem Approximating BSDEs with a constraint on the gains process.
method Discretization followed by machine learning approximation of the discretely constrained BSDE.
result The discretely constrained BSDE converges to the continuously constrained one as the mesh grid approaches zero.