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

Trend · papers per month

5.6%11.2%16.9%22.5% · May 202619922001200920172026
48 results for Parameter Cost

ACE improves GBI for simulators by approximating cost functions, making inference more efficient.

problem Inference for misspecified simulators is overly restrictive.
method Amortized cost estimation (ACE) for Generalized Bayesian Inference (GBI).
result ACE provides accurate cost predictions and more efficient inference.

Efficiently estimates material parameter space with multifidelity Gaussian process modeling.

problem Estimating a region of material parameter space with similar precipitate shapes.
method Multifidelity Gaussian process modeling to reduce computational cost.
result Significant reduction in sampling cost for accurate LER estimation.

Agents collaborate to minimize regret while keeping costs under a threshold.

problem Collaborative multi-agent stochastic linear bandits with cost constraints.
method Safe distributed upper confidence bound algorithm (MA-OPLB) with accelerated consensus.
result Regret bound of order $ \mathcal{O}\left(\frac{d}{τ-c_0}\frac{\log(NT)^2}{\sqrt{N}}\sqrt{\frac{T}{\log(1/|λ_2|)}} ight)$.

Estimates returns for dollar cost averaging using geometric Brownian motion.

problem Estimating returns for dollar cost averaging investing strategy.
method Uses geometric Brownian motion and log-Normal distribution to construct a lower bound for returns. Computes parameters recursively and in closed form for dollar cost averaging. Compares to lump sum investing for matching wealth distributions.
result Probability of negative returns is less than 2.5% for 40 years of annual dollar cost averaging.

Bayesian optimization reduces hyperparameter tuning cost for stochastic models.

problem Hyperparameter tuning under uncertainty in noisy function evaluations.
method Bayesian optimization framework for scale parameter in stochastic models, using statistical surrogate and closed-form optimizer.
result Significant reduction in computational cost (40 times fewer data points, 40-fold reduction in cost).

Control charts have traditionally been used in industrial statistics, but are constantly seeing new areas of application, especially in the age of Industry 4.0. This paper introduces a new method, which is suitable for applications in the healthcare sector, especially for monitoring a health-characteristic of a patient…

2019-02-14abs ↗pdf ↗

This paper introduces a family of local feature aggregation functions and a novel method to estimate their parameters, such that they generate optimal representations for classification (or any task that can be expressed as a cost function minimization problem). To achieve that, we compose the local feature aggregation…

2017-06-26abs ↗pdf ↗

In this article we consider the Merton problem in a market with a single risky asset and transaction costs. We give a complete solution of the problem up to the solution of a free-boundary problem for a first-order differential equation, and find that the form of the solution (whether the problem is well-posed, whether…

2016-12-02abs ↗pdf ↗

Study calculates liquidity costs for delta hedging of European options.

problem Determining expected liquidity costs in delta hedging.
method Derives an integration formula for liquidity costs, including option prices and delta process.
result Expected liquidity costs can be calculated faster than Monte Carlo simulations.

A new method for decision-focused learning reduces computational cost.

problem Efficiently solving combinatorial problems with uncertain parameters.
method Reframed as cost-sensitive multi-output regression, with novel loss components.
result Comparable downstream task quality with reduced computational cost.

Hedging in the presence of transaction costs leads to complex optimization problems. These problems typically lack closed-form solutions, and their implementation relies on numerical methods that provide hedging strategies for specific parameter values. In this paper we use a genetic programming algorithm to derive exp…

2013-05-29abs ↗pdf ↗

Recurrent neural networks are a powerful tool, but they are very sensitive to their hyper-parameter configuration. Moreover, training properly a recurrent neural network is a tough task, therefore selecting an appropriate configuration is critical. Varied strategies have been proposed to tackle this issue. However, mos…

2018-05-18abs ↗pdf ↗

We prove the existence of a Radner equilibrium in a model with proportional transaction costs on an infinite time horizon and analyze the effect of transaction costs on the endogenously determined interest rate. Two agents receive exogenous, unspanned income and choose between consumption and investing into an annuity.…

2017-02-06abs ↗pdf ↗

New GPnn method achieves scalable regression with low computational cost.

problem Inefficient Gaussian Process (GP) regression for large datasets.
method GP nearest-neighbour (GPnn) prediction with robustness and limiting behaviour exploration.
result GPnn achieves high MSE accuracy with minimal parameter estimation effort, even in gross misspecification.

We consider rate swaps which pay a fixed rate against a floating rate in presence of bid-ask spread costs. Even for simple models of bid-ask spread costs, there is no explicit strategy optimizing an expected function of the hedging error. We here propose an efficient algorithm based on the stochastic gradient method to…

2015-01-29abs ↗pdf ↗

An investor trades a safe and several risky assets with linear price impact to maximize expected utility from terminal wealth. In the limit for small impact costs, we explicitly determine the optimal policy and welfare, in a general Markovian setting allowing for stochastic market, cost, and preference parameters. Thes…

2014-02-21abs ↗pdf ↗

Cost-efficient feature selection for multi-label classification in medicine.

problem Feature selection in multi-label classification with cost constraints.
method Sequential feature selection maximizing conditional mutual information, followed by cost-free feature selection using shadow features.
result The method effectively reduces prediction costs in medical applications.

Traders are often faced with large block orders in markets with limited liquidity and varying volatility. Executing the entire order at once usually incurs a large trading cost because of this limited liquidity. In order to minimize this cost traders split up large orders over time. Varying volatility however implies t…

2013-12-20abs ↗pdf ↗

Two major financial market complexities are transaction costs and uncertain volatility, and we analyze their joint impact on the problem of portfolio optimization. When volatility is constant, the transaction costs optimal investment problem has a long history, especially in the use of asymptotic approximations when th…

2014-01-02abs ↗pdf ↗

This work proposes a way to align statistical modeling with decision making. We provide a method that propagates the uncertainty in predictive modeling to the uncertainty in operational cost, where operational cost is the amount spent by the practitioner in solving the problem. The method allows us to explore the range…

2011-12-03abs ↗pdf ↗

The parameters of temporal models, such as dynamic Bayesian networks, may be modelled in a Bayesian context as static or atemporal variables that influence transition probabilities at every time step. Particle filters fail for models that include such variables, while methods that use Gibbs sampling of parameter variab…

2013-05-08abs ↗pdf ↗

A new energy-efficient pruning method for federated learning.

problem Energy inefficiency in gradient sparsification for federated learning.
method Formalized energy-constrained projection problem and proposed Cost-Weighted Magnitude Pruning (CWMP).
result CWMP optimally balances performance and energy efficiency in federated learning.

Optimal multi-asset trading with Markovian predictors is well understood in the case of quadratic transaction costs, but remains intractable when these costs are L1L_1. We present a mean-field approach that reduces the multi-asset problem to a single-asset problem, with an effective predictor that includes a risk avers…

2019-05-13abs ↗pdf ↗

The paper provides bounds on estimation error in a distributed online learning setting.

problem Estimating an unknown parameter in a distributed and online manner with finite sample guarantees.
method Proposes a distributed online estimation algorithm that improves accuracy through communication, providing non-asymptotic bounds on estimation error.
result Demonstrates a trade-off between estimation error and communication costs, and determines a stopping time for communication based on desired accuracy.

We consider a financial market with liquidity cost as in Çetin, Jarrow and Protter [2004], where the supply function Sε(s,ν)S^ε(s,ν) depends on a parameter ε0ε\geq 0 with S0(s,ν)=sS^0(s,ν)=s corresponding to the perfect liquid situation. Using the PDE characterization of Çetin, Soner and Touzi [2010] of the super-hedging cost of a…

2012-08-18abs ↗pdf ↗

A l1-norm penalized orthogonal forward regression (l1-POFR) algorithm is proposed based on the concept of leaveone- out mean square error (LOOMSE). Firstly, a new l1-norm penalized cost function is defined in the constructed orthogonal space, and each orthogonal basis is associated with an individually tunable regulari…

2015-09-04abs ↗pdf ↗