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

67134200267 · Jun 202019922001200920172026
48 results for hidden costs

Sunshine trading theory predicts lower execution costs and liquidity provision through explicit preannouncements, but evidence is scarce in traditional markets.

problem Adverse selection on liquidity provision
method Reconstructing metaorders and comparing them with visible TWAP executions
result Visible TWAPs face lower execution costs and leave a smaller permanent price impact compared to hidden metaorders.

Recurrent neural networks (RNNs) provide state-of-the-art performance in processing sequential data but are memory intensive to train, limiting the flexibility of RNN models which can be trained. Reversible RNNs---RNNs for which the hidden-to-hidden transition can be reversed---offer a path to reduce the memory require…

2018-10-25abs ↗pdf ↗

The paper constructs minimizers for deep learning networks and analyzes their geometric structure.

problem Underparametrized deep learning networks and their minimizers.
method Direct construction of minimizers without gradient descent, considering specific settings.
result Explicit family of minimizers for the global minimum and a set of degenerate local minima.

This work concerns testing the number of parameters in one hidden layer multilayer perceptron (MLP). For this purpose we assume that we have identifiable models, up to a finite group of transformations on the weights, this is for example the case when the number of hidden units is know. In this framework, we show that …

2008-02-21abs ↗pdf ↗

The paper reveals the hidden costs of digitizing commodity money and proposes a new stable-coin system.

problem Depreciation of banknotes due to high logistics costs after digitization.
method Analyzing the functions of money from a logistics perspective and comparing commodity money to digital currency.
result There is no honest money that is both a store of value and has negligible logistics costs.

New method estimates hidden binary mixture model centers efficiently.

problem Estimating centers in high-dimensional binary mixture models with hidden Markov structure.
method Proposes a minimax optimal procedure and an adaptive variant.
result Achieves optimal rate of order δd/n+d/n\sqrt{δd/n} + d/n.

Learning nonlinear dynamics from diffusion data is a challenging problem since the individuals observed may be different at different time points, generally following an aggregate behaviour. Existing work cannot handle the tasks well since they model such dynamics either directly on observations or enforce the availabi…

2018-07-22abs ↗pdf ↗

When encountering novel objects, humans are able to infer a wide range of physical properties such as mass, friction and deformability by interacting with them in a goal driven way. This process of active interaction is in the same spirit as a scientist performing experiments to discover hidden facts. Recent advances i…

2016-11-06abs ↗pdf ↗

As a new neural machine translation approach, Non-Autoregressive machine Translation (NAT) has attracted attention recently due to its high efficiency in inference. However, the high efficiency has come at the cost of not capturing the sequential dependency on the target side of translation, which causes NAT to suffer …

2019-02-22abs ↗pdf ↗

Stochastic Volatility in Mean models with heavy-tailed distributions using Hidden Markov Models

problem Accurate inference for Stochastic Volatility in Mean models with heavy-tailed distributions
method Numerically stable estimation procedure and parallel computing
result Significant reduction in computational times

A new optimizer for deep learning improves accuracy and reduces training time.

problem Training deep neural networks for classification tasks.
method Hybrid Newton/Gradient Descent (NGD) method exploiting convexity of cross-entropy loss.
result Improves validation error and provides qualitative differences in hidden layer basis functions.

Automatic methods for generating state-of-the-art neural network architectures without human experts have generated significant attention recently. This is because of the potential to remove human experts from the design loop which can reduce costs and decrease time to model deployment. Neural architecture search (NAS)…

2019-03-31abs ↗pdf ↗

We study the problem of the execution of a moderate size order in an illiquid market within the framework of a solvable Markovian model. We suppose that in order to avoid impact costs, a trader decides to execute her order through a unique trade, waiting for enough liquidity to accumulate at the best quote. We find tha…

2014-09-30abs ↗pdf ↗

Efficient adjustment sets found for cost-minimized causal estimations.

problem Estimating interventional means with minimum cost in causal graphical models.
method Defined cost-adjustment sets, constructed flow networks, and used maximum flow algorithms.
result Minimum cost optimal adjustment sets exist and can be found efficiently.

Hidden Markov model predicts profitable statistical arbitrage in Shanghai crude oil futures.

problem Statistical arbitrage opportunities in international crude oil futures markets.
method Hidden Markov model for cointegration spread, mean-reverting regime-switching process.
result Statistical arbitrage strategies involving Shanghai crude oil futures are profitable.

We introduce a new family of deep neural network models. Instead of specifying a discrete sequence of hidden layers, we parameterize the derivative of the hidden state using a neural network. The output of the network is computed using a black-box differential equation solver. These continuous-depth models have constan…

2018-06-19abs ↗pdf ↗

We present a novel neural network algorithm, the Tensor Switching (TS) network, which generalizes the Rectified Linear Unit (ReLU) nonlinearity to tensor-valued hidden units. The TS network copies its entire input vector to different locations in an expanded representation, with the location determined by its hidden un…

2016-10-31abs ↗pdf ↗

New method improves parameter estimation in complex stochastic models.

problem Parameter calibration in stochastic models with unavailable analytical likelihood.
method Gradient-based simulated parameter estimation with multi-time scale stochastic approximation.
result Enhanced estimation accuracy and reduced computational costs.

Transferability of learned features between tasks can massively reduce the cost of training a neural network on a novel task. We investigate the effect of network width on learned features using activation atlases --- a visualization technique that captures features the entire hidden state responds to, as opposed to in…

2019-09-25abs ↗pdf ↗

In this paper we focus on the problem of assigning uncertainties to single-point predictions. We introduce a cost function that encodes the trade-off between accuracy and reliability in probabilistic forecast. We derive analytic formula for the case of forecasts of continuous scalar variables expressed in terms of Gaus…

2018-03-12abs ↗pdf ↗

This paper proposes CF-NADE, a neural autoregressive architecture for collaborative filtering (CF) tasks, which is inspired by the Restricted Boltzmann Machine (RBM) based CF model and the Neural Autoregressive Distribution Estimator (NADE). We first describe the basic CF-NADE model for CF tasks. Then we propose to imp…

2016-05-31abs ↗pdf ↗

Respiratory infections and chronic respiratory diseases impose a heavy health burden worldwide. Coughing is one of the most common symptoms of many such infections, and can be indicative of flare-ups of chronic respiratory diseases. Whether at a clinical or public health level, the capacity to identify bouts of coughin…

2019-04-28abs ↗pdf ↗

We propose a general, theoretically justified mechanism for processing missing data by neural networks. Our idea is to replace typical neuron's response in the first hidden layer by its expected value. This approach can be applied for various types of networks at minimal cost in their modification. Moreover, in contras…

2018-05-18abs ↗pdf ↗

A scalable Bayesian additive model for stellar flare detection using Gaussian process inference and hidden Markov models.

problem Bayesian time-series modeling for astronomical datasets
method Generative surrogate framework with Variational Autoencoder and neural network forward pass
result Significant reduction in computational time for stellar flare detection

We propose algorithms for approximate filtering and smoothing in high-dimensional Factorial hidden Markov models. The approximation involves discarding, in a principled way, likelihood factors according to a notion of locality in a factor graph associated with the emission distribution. This allows the exponential-in-d…

2019-02-05abs ↗pdf ↗

Study reveals a hidden cost in derivatives markets through option-implied discount factors.

problem The hidden cost in derivatives markets, not visible in price space.
method Minute-level NBBO data on options, reduced-form specification linking carry gap to implementation risk, trading frictions, and financial conditions.
result An annualized carry gap exists, linked to implementation risk and financial conditions.

Auto-Encoders are unsupervised models that aim to learn patterns from observed data by minimizing a reconstruction cost. The useful representations learned are often found to be sparse and distributed. On the other hand, compressed sensing and sparse coding assume a data generating process, where the observed data is g…

2016-05-23abs ↗pdf ↗

Agent learns to trade currency pairs with improved risk management.

problem Improving systematic FX trading performance with online transfer learning.
method Online inductive transfer learning using feature representation from Gaussian mixture model to a reinforcement learning agent.
result Annualized portfolio information ratio of 0.52, compound return of 9.3%.

Robo-advisors use MPC to create dynamic investment strategies.

problem Static allocation methods limit robo-advisors' effectiveness.
method Combines MPC with Hidden Markov Model and Black-Litterman for dynamic asset allocation.
result MPC-based strategies outperform static approaches in dynamic and risk-budgeting criteria.

This paper introduces a new approach to finding knots and links with hidden symmetries using "hidden extensions", a class of hidden symmetries defined here. We exhibit a family of tangle complements in the ball whose boundaries have symmetries with hidden extensions, then we further extend these to hidden symmetries of…

2015-01-04abs ↗pdf ↗

ROAD-EnKFs use learned low-dimensional models to improve state reconstruction and forecasting.

problem Reconstructing and forecasting states of unknown or expensive systems.
method Learned low-dimensional surrogate models and ensemble Kalman filter integration.
result ROAD-EnKFs achieve higher accuracy at lower computational cost than existing methods.