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

149298447596 · Jun 202019922001200920172026
48 results for compute futures

This paper studies the problem of trading futures with transaction costs when the underlying spot price is mean-reverting. Specifically, we model the spot dynamics by the Ornstein-Uhlenbeck (OU), Cox-Ingersoll-Ross (CIR), or exponential Ornstein-Uhlenbeck (XOU) model. The futures term structure is derived and its conne…

2016-01-16abs ↗pdf ↗

Future video prediction is an ill-posed Computer Vision problem that recently received much attention. Its main challenges are the high variability in video content, the propagation of errors through time, and the non-specificity of the future frames: given a sequence of past frames there is a continuous distribution o…

2017-12-01abs ↗pdf ↗

In this paper, the author considers the numerical computation of CVA for large systems by Mote Carlo methods. He introduces two types of stochastic mesh methods for the computations of CVA. In the first method, stochastic mesh method is used to obtain the future value of the derivative contracts. In the second method, …

2015-10-15abs ↗pdf ↗

Future grid scenario analysis requires a major departure from conventional power system planning, where only a handful of most critical conditions is typically analyzed. To capture the inter-seasonal variations in renewable generation of a future grid scenario necessitates the use of computationally intensive time-seri…

2016-12-14abs ↗pdf ↗

The paper proposes modern computational methods for optimizing reinsurance contracts.

problem Optimizing catastrophe excess-of-loss reinsurance contracts with realistic constraints and risk measures.
method Two approaches: simulated annealing for local search and quantum branch & bound for future potential.
result Quantum branch & bound approach shows potential for future optimization with quantum computers.

Autonomous Vehicles(AV) are one of the brightest promises of the future which would help cut down fatalities and improve travel time while working in harmony. Autonomous vehicles will face with challenging situations and experiences not seen before. These experiences should be converted to knowledge and help the vehicl…

2018-08-16abs ↗pdf ↗

Temporal prediction is critical for making intelligent and robust decisions in complex dynamic environments. Motion prediction needs to model the inherently uncertain future which often contains multiple potential outcomes, due to multi-agent interactions and the latent goals of others. Towards these goals, we introduc…

2019-11-04abs ↗pdf ↗

We study a large economy in which firms cannot compute exact solutions to the non-linear equations that characterize the equilibrium price at which they can sell future output. Instead, firms use polynomial expansions to approximate prices. The precision with which they can compute prices is endogenous and depends on t…

2016-11-06abs ↗pdf ↗

Deep learning approximates Bermudan option exposures and future values.

problem Computing accurate expected and future exposures for high-dimensional Bermudan options.
method Neural network-based approach combining Deep Optimal Stopping and regression.
result Neural network approximations of pathwise option values are more accurate.

Previous literature has identified an effect, dubbed the Zumbach effect, that is nonzero empirically but conjectured to be zero in any conventional stochastic volatility model. Essentially this effect corresponds to the property that past squared returns forecast future volatilities better than past volatilities foreca…

2018-09-06abs ↗pdf ↗

We present GLASSES: Global optimisation with Look-Ahead through Stochastic Simulation and Expected-loss Search. The majority of global optimisation approaches in use are myopic, in only considering the impact of the next function value; the non-myopic approaches that do exist are able to consider only a handful of futu…

2015-10-21abs ↗pdf ↗

Develops a new method for quantizing rough volatility for volatility derivatives pricing.

problem Pricing volatility derivatives in rough volatility models.
method Functional quantization of rough volatility using offline computable quantizers.
result Pricing VIX Futures in the rough Bergomi model shows competitive results.

The paper tackles fVaR prediction methods in finance.

problem Predicting future values at risk (fVaR) in finance.
method Various methods including Nested MC-empirical quantile, percentiles from distributions, quantile regressions, and limited inner simulations.
result Improved methods for predicting fVaRs, including those that are computationally efficient.

A surprising image of the stock market arises if the price time series of all Dow Jones Industrial Average stock components are represented in one chart at once. The chart evolves into a braid representation of the stock market by taking into account only the crossing of stocks and fixing a convention defining overcros…

2014-06-13abs ↗pdf ↗

We investigate the integration of a planning mechanism into sequence-to-sequence models using attention. We develop a model which can plan ahead in the future when it computes its alignments between input and output sequences, constructing a matrix of proposed future alignments and a commitment vector that governs whet…

2017-11-28abs ↗pdf ↗

Enhanced trend-following strategy using network momentum for commodity futures.

problem Improving systematic trend-following in commodity futures markets.
method Combines univariate and cross-sectional trend indicators, including network momentum.
result Statistically significant improvements in portfolio performance metrics.

New RL approach uses future state and action visitation measures for better exploration.

problem Improving exploration in reinforcement learning.
method Intrinsic reward based on future state and action visitation measures, using contraction operators.
result Policies achieve good state-action space coverage and high performance.

Self-Predictive Representations improves data-efficient reinforcement learning from limited interaction.

problem Efficient reinforcement learning from limited data.
method Train agents to predict future latent state representations using self-supervised objectives.
result Achieves a median human-normalized score of 0.415 on Atari with 100k steps of interaction, 55% improvement over previous state-of-the-art.

A simple approach improves performance on both past and future tasks in lifelong learning.

problem Forgetting in lifelong learning, where performance on past tasks degrades when learning new tasks.
method Representation ensembling to improve performance on both future and past tasks.
result Representation ensembling demonstrates both forward and backward transfer across various datasets.

A deep learning model predicts future cache accesses with high accuracy.

problem Improving cache management and performance through better prediction of future data accesses.
method Proposed a LSTM-based recurrent neural network model to predict future cache accesses using only a cache trace as input.
result The proposed model achieves high prediction accuracy and outperforms state-of-the-art practical policies.

CODA simulates future data to generalize models across different datasets.

problem Concept drift in real-world machine learning models.
method CODA framework using a predicted feature correlation matrix to simulate future data.
result CODA effectively achieves temporal domain generalization across different model architectures.

We consider the wave equation on a product cone and find a joint asymptotic expansion for solutions near null and future infinities. The rates of decay seen in the expansion at future infinity are the resonances of a hyperbolic cone and were computed by the authors in a previous paper. The expansion treats an asymptoti…

2019-06-11abs ↗pdf ↗

The study compares VaR and ES models for tail risk of electricity futures, finding AR(1)-GARCH(1,1) with Student-t distribution best.

problem Modeling tail risk of electricity futures contracts in various markets.
method Comparison of VaR and ES models using AR(1)-GARCH(1,1) with Student-t distribution, historical simulation, and quantile regression.
result AR(1)-GARCH(1,1) with Student-t distribution is the best-performing model for tail risk estimation.

A new framework assesses liquidity risk in perpetual futures exchanges.

problem Measuring and predicting liquidation execution risk in perpetual futures markets.
method Slippage-at-Risk (SaR) framework, comprising three metrics: cross-sectional slippage quantile, expected slippage, and aggregate dollar-denominated tail slippage.
result SaR provides a forward-looking assessment of liquidation execution risk, predictive of systemic stress.

CVPR 2020 challenge evaluates continual learning in computer vision.

problem Making AI systems more adaptive and efficient.
method Evaluated different continual learning approaches on a common hardware with shared metrics.
result Reported main results, finalists, and prize winners.

We propose RUDDER, a novel reinforcement learning approach for delayed rewards in finite Markov decision processes (MDPs). In MDPs the Q-values are equal to the expected immediate reward plus the expected future rewards. The latter are related to bias problems in temporal difference (TD) learning and to high variance p…

2018-06-20abs ↗pdf ↗

This paper computes fixed point Floer cohomology for Dehn twists on surfaces.

problem Computing fixed point Floer cohomology for Dehn twists.
method Developed tools for computing fixed point Floer cohomology and product for Dehn twists in all dimensions.
result Splitting of the product and differential into local and Morse-theoretic contributions.

Since Giles introduced the multilevel Monte Carlo path simulation method [18], there has been rapid development of the technique for a variety of applications in computational finance. This paper surveys the progress so far, highlights the key features in achieving a high rate of multilevel variance convergence, and su…

2012-12-06abs ↗pdf ↗

Learning to predict future images from a video sequence involves the construction of an internal representation that models the image evolution accurately, and therefore, to some degree, its content and dynamics. This is why pixel-space video prediction may be viewed as a promising avenue for unsupervised feature learn…

2015-11-17abs ↗pdf ↗