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

3517021,0531,404 · Jun 202019922001200920172026
48 results for process-based models

Study compares machine learning and process-based models for predicting rice blast disease.

problem Predicting rice blast disease to support rice growers in controlling the disease.
method Compared four models: two process-based (Yoshino and WARM) and two machine learning (M5Rules and RNN).
result Machine learning models outperformed process-based models in predicting rice blast disease.

PoPPy is a Point Process toolbox based on PyTorch, which achieves flexible designing and efficient learning of point process models. It can be used for interpretable sequential data modeling and analysis, e.g., Granger causality analysis of multi-variate point processes, point process-based simulation and prediction of…

2018-10-23abs ↗pdf ↗

Equation discovery methods enable modelers to combine domain-specific knowledge and system identification to construct models most suitable for a selected modeling task. The method described and evaluated in this paper can be used as a nonlinear system identification method for gray-box modeling. It consists of two int…

2019-07-01abs ↗pdf ↗

We characterize the combinatorial structure of conditionally-i.i.d. sequences of negative binomial processes with a common beta process base measure. In Bayesian nonparametric applications, such processes have served as models for latent multisets of features underlying data. Analogously, random subsets arise from cond…

2013-12-31abs ↗pdf ↗

This paper reviews Gaussian process-based multi-fidelity techniques for different fidelity relationships.

problem Combining accurate and cheap models for complex system design.
method Gaussian process-based multi-fidelity modeling techniques for varying fidelity relationships.
result Comparison of techniques on analytical and aerospace engineering problems.

We consider the problem of aggregating models learned from sequestered, possibly heterogeneous datasets. Exploiting tools from Bayesian nonparametrics, we develop a general meta-modeling framework that learns shared global latent structures by identifying correspondences among local model parameterizations. Our propose…

2019-11-01abs ↗pdf ↗

Many probabilistic models introduce strong dependencies between variables using a latent multivariate Gaussian distribution or a Gaussian process. We present a new Markov chain Monte Carlo algorithm for performing inference in models with multivariate Gaussian priors. Its key properties are: 1) it has simple, generic c…

2009-12-31abs ↗pdf ↗

Optimization of very expensive black-box functions requires utilization of maximum information gathered by the process of optimization. Model Guided Sampling Optimization (MGSO) forms a more robust alternative to Jones' Gaussian-process-based EGO algorithm. Instead of EGO's maximizing expected improvement, the MGSO use…

2015-08-31abs ↗pdf ↗

We apply basic statistical reasoning to signal reconstruction by machine learning -- learning to map corrupted observations to clean signals -- with a simple and powerful conclusion: it is possible to learn to restore images by only looking at corrupted examples, at performance at and sometimes exceeding training using…

2018-03-12abs ↗pdf ↗

pmsims R package uses Gaussian process for flexible sample size estimation in clinical models.

problem Determining adequate sample size for clinical prediction models.
method Simulation-based Gaussian process search for flexible sample size estimation.
result Gaussian process-based method produces more stable sample size estimates, especially in challenging settings.

New sparse Gaussian process method tackles unconstrained regression problems.

problem Dealing with physical systems that satisfy inequality constraints.
method Extends constrained Gaussian process by redefining hat basis functions.
result Reduces computational complexity from O(n3)O(n^{3}) to O(nm2)O(nm^{2}).

Training Gaussian process-based models typically involves an O(N3) O(N^3) computational bottleneck due to inverting the covariance matrix. Popular methods for overcoming this matrix inversion problem cannot adequately model all types of latent functions, and are often not parallelizable. However, judicious choice of model…

2017-02-27abs ↗pdf ↗

This paper improves parameter estimation in cardiac models using Gaussian process-based MH sampling.

problem Uncertainty in estimating patient-specific model parameters from sparse and noisy clinical data.
method Integrates surrogate modeling into Metropolis-Hastings sampling to improve computational efficiency and accuracy.
result Significant gain in computational efficiency without compromising accuracy, and insights into tissue heterogeneity.

We describe a set of Gaussian Process based approaches that can be used to solve non-linear Ordinary Differential Equations. We suggest an explicit probabilistic solver and two implicit methods, one analogous to Picard iteration and the other to gradient matching. All methods have greater accuracy than previously sugge…

2014-08-17abs ↗pdf ↗

In this paper, we introduce a new model for the risk process based on general compound Hawkes process (GCHP) for the arrival of claims. We call it risk model based on general compound Hawkes process (RMGCHP). The Law of Large Numbers (LLN) and the Functional Central Limit Theorem (FCLT) are proved. We also study the ma…

2017-06-27abs ↗pdf ↗

We develop algorithms with low regret for learning episodic Markov decision processes based on kernel approximation techniques. The algorithms are based on both the Upper Confidence Bound (UCB) as well as Posterior or Thompson Sampling (PSRL) philosophies, and work in the general setting of continuous state and action …

2019-11-04abs ↗pdf ↗

We introduce Parameterized Exploration (PE), a simple family of methods for model-based tuning of the exploration schedule in sequential decision problems. Unlike common heuristics for exploration, our method accounts for the time horizon of the decision problem as well as the agent's current state of knowledge of the …

2019-07-13abs ↗pdf ↗

We describe a simple and efficient procedure for approximating the Lévy measure of a Gamma(α,1)\text{Gamma}(α,1) random variable. We use this approximation to derive a finite sum-representation that converges almost surely to Ferguson's representation of the Dirichlet process based on arrivals of a homogeneous Poisson process.…

2011-07-04abs ↗pdf ↗

When hyperparameter optimization of a machine learning algorithm is repeated for multiple datasets it is possible to transfer knowledge to an optimization run on a new dataset. We develop a new hyperparameter-free ensemble model for Bayesian optimization that is a generalization of two existing transfer learning extens…

2018-02-06abs ↗pdf ↗

We provide a general and flexible approach to LIBOR modeling based on the class of affine factor processes. Our approach respects the basic economic requirement that LIBOR rates are non-negative, and the basic requirement from mathematical finance that LIBOR rates are analytically tractable martingales with respect to …

2009-04-03abs ↗pdf ↗

We introduce a Gaussian process-based model for handling of non-stationarity. The warping is achieved non-parametrically, through imposing a prior on the relative change of distance between subsequent observation inputs. The model allows the use of general gradient optimization algorithms for training and incurs only a…

2019-12-05abs ↗pdf ↗

Bayesian nonparametric models, such as Gaussian processes, provide a compelling framework for automatic statistical modelling: these models have a high degree of flexibility, and automatically calibrated complexity. However, automating human expertise remains elusive; for example, Gaussian processes with standard kerne…

2015-10-26abs ↗pdf ↗

Paper relaxes optimal transport using convex functions for data science.

problem Optimal transport problem on finite spaces.
method Relaxation via strictly convex functions (Kullback-Leibler divergence, Bregman divergences). Gradient descent iterative process.
result Mathematical foundations and iterative process for the relaxed optimal transport problem.

In this article, we improve extreme learning machines for regression tasks using a graph signal processing based regularization. We assume that the target signal for prediction or regression is a graph signal. With this assumption, we use the regularization to enforce that the output of an extreme learning machine is s…

2018-03-12abs ↗pdf ↗

Framework generates realistic crop images for growth modeling.

problem Modeling crop growth over time with precision and detail.
method Two-stage framework: image prediction and growth estimation models.
result Framework accurately predicts crop images with varying conditions.

Currently, engineers at substation service providers match customer data with the corresponding internally used signal names manually. This paper proposes a machine learning method to automate this process based on substation signal mapping data from a repository of executed projects. To this end, a bagged token classi…

2018-02-13abs ↗pdf ↗

In this note we discuss - in what is intended to be a pedagogical fashion - FX option pricing in target zones with attainable boundaries. The boundaries must be reflecting. The no-arbitrage requirement implies that the differential (foreign minus domestic) short-rate is not deterministic. When the band is narrow, we ca…

2015-12-04abs ↗pdf ↗

We propose a method for pricing American options whose pay-off depends on the moving average of the underlying asset price. The method uses a finite dimensional approximation of the infinite-dimensional dynamics of the moving average process based on a truncated Laguerre series expansion. The resulting problem is a fin…

2010-11-16abs ↗pdf ↗

We propose a data-efficient Gaussian process-based Bayesian approach to the semi-supervised learning problem on graphs. The proposed model shows extremely competitive performance when compared to the state-of-the-art graph neural networks on semi-supervised learning benchmark experiments, and outperforms the neural net…

2018-09-12abs ↗pdf ↗

Asynchronous method for hyperparameter and neural architecture search.

problem Efficiently searching for optimal hyperparameters and neural architectures.
method Model-based, asynchronous multi-fidelity method combining Hyperband and Gaussian process-based Bayesian optimization.
result Substantial speed-ups over current state-of-the-art methods on various benchmarks.

In this manuscript, we analytically and numerically study statistical properties of an heteroskedastic process based on the celebrated ARCH generator of random variables whose variance is defined by a memory of qmq_{m}-exponencial, form (eqm=1x=exe_{q_{m}=1}^{x}=e^{x}). Specifically, we inspect the self-correlation function o…

2008-06-16abs ↗pdf ↗

In this paper we analyse financial implications of exchangeability and similar properties of finite dimensional random vectors. We show how these properties are reflected in prices of some basket options in view of the well-known put-call symmetry property and the duality principle in option pricing. A particular atten…

2009-01-30abs ↗pdf ↗

Volume weighted average price (VWAP) options are a popular security type in many countries, but despite their popularity very few pricing models have been developed so far for VWAP options. This can be explained by the fact that the VWAP pricing problem is set in an incomplete market since there is no underlying with w…

2014-07-28abs ↗pdf ↗

MO-PaDGAN generates diverse, high-performance designs with multiple metrics.

problem Challenges in generating diverse, high-performance designs with multiple metrics.
method MO-PaDGAN uses a new Determinantal Point Processes based loss function for probabilistic modeling of diversity and performances.
result MO-PaDGAN expands the design space towards high-performance regions and generates new designs with high diversity and performances.

A hybrid machine learning and process-based-modeling (PBM) approach is proposed and evaluated at a handful of AmeriFlux sites to simulate the top-layer soil moisture state. The Hybrid-PBM (HPBM) employed here uses the Noah land-surface model integrated with Gaussian Processes. It is designed to correct the model only i…

2020-02-14abs ↗pdf ↗