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

121242362483 · Jun 202019922001200920172026
48 results for Dependent Costs

We consider interactive learning and covering problems, in a setting where actions may incur different costs, depending on the response to the action. We propose a natural greedy algorithm for response-dependent costs. We bound the approximation factor of this greedy algorithm in active learning settings as well as in …

2016-02-23abs ↗pdf ↗

Optimizes black-box functions with varying costs across multiple sources.

problem Optimizing black-box functions with varying costs across multiple sources.
method Uses Augmented Gaussian Process and Gaussian Process to model fidelity and location-dependent costs, respectively. Uses Confidence Bound acquisition function to select sources and locations.
result The approach significantly outperforms existing methods on Hyperparameters Optimization tasks.

In a dual risk model, the premiums are considered as the costs and the claims are regarded as the profits. The surplus can be interpreted as the wealth of a venture capital, whose profits depend on research and development. In most of the existing literature of dual risk models, the profits follow the compound Poisson …

2015-10-13abs ↗pdf ↗

Framework evaluates privacy cost of non-private pre-processing in DP pipelines.

problem Privacy cost of non-private data-dependent pre-processing in DP machine learning pipelines.
method Establishes upper bounds on overall privacy guarantees using Smooth DP and bounded sensitivity.
result Explicit overall privacy guarantees for various pre-processing algorithms.

This article presents results from the first statistically significant study of causes of cost escalation in transport infrastructure projects. The study is based on a sample of 258 rail, bridge, tunnel and road projects worth US$90 billion. The focus is on the dependence of cost escalation on (1) length of project imp…

2013-04-16abs ↗pdf ↗

The Lax-Hopf formula simplifies the value function of an intertemporal optimization (infinite dimensional) problem associated with a convex transaction-cost function which depends only on the transactions (velocities) of a commodity evolution: it states that the value function is equal to the marginal fonction of a fin…

2014-01-08abs ↗pdf ↗

New algorithms improve causal graph discovery with adaptive interventions, even under worst-case interventional costs.

problem Discover causal relationships from data with adaptive interventions and node-dependent costs.
method Define new benchmarks and provide adaptive search algorithms for causal graph discovery.
result Logarithmic approximations achieved under various settings: atomic, bounded size interventions and generalized cost objectives.

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.

Neural nets optimize dynamic hedging strategies with transaction costs.

problem Optimal hedging strategy in presence of transaction costs and discrete time.
method Convolutional neural network trained to infer optimal hedging frequencies.
result Dynamic multiscale hedging strategy reduces risk and maximizes profit.

COF algorithm minimizes cost in multi-armed bandits with known costs and reward constraints.

problem Minimizing cost while meeting a minimum reward requirement in uncertain environments.
method COF algorithm that intelligently combines samples from all arms to gauge feasibility and minimize cost.
result COF achieves instance-dependent upper bounds on cumulative cost and quality regret.

A method to select important experts for Gaussian processes to balance computational efficiency and uncertainty quantification.

problem Balancing computational efficiency and uncertainty quantification in Gaussian processes for big data.
method Using graphical models to select important experts and aggregate their predictions while ensuring uncertainty quantification.
result Substantially reduces computational cost of aggregating dependent experts while ensuring calibrated uncertainty quantification.

Study optimal control of diffusion processes with infimum or supremum costs.

problem Optimizing control of a diffusion process with costs dependent on its infimum or supremum.
method Introduced novel integral operators to solve two-dimensional singular control problems.
result Explicit solutions for optimal dividend problem with time-dependent preferences.

This paper improves Q-learning bounds using reference-advantage decomposition.

problem Improving Q-learning bounds in MDPs with positive suboptimality gaps.
method Develops a novel error decomposition framework to prove gap-dependent regret bounds.
result Establishes logarithmic gap-dependent regret bounds for Q-learning.

Dynamic classifier chains with XGBoost reduces multi-label classification costs and improves label dependency handling.

problem Static label ordering in multi-label classification limits model performance.
method Combining dynamic classifier chains with XGBoost for efficient multi-label prediction.
result Dynamic label ordering improves model performance and reduces training costs.

Bipartite ranking is an important supervised learning problem; however, unlike regression or classification, it has a quadratic dependence on the number of samples. To circumvent the prohibitive sample cost, many recent work focus on stochastic gradient-based methods. In this paper we consider an alternative approach, …

2019-12-02abs ↗pdf ↗

In this paper, we consider the problem of recovering a graph that represents the statistical data dependency among nodes for a set of data samples generated by nodes, which provides the basic structure to perform an inference task, such as MAP (maximum a posteriori). This problem is referred to as structure learning. W…

2018-04-29abs ↗pdf ↗

Investigates how rebalancing frequency and transaction costs affect log-optimal portfolios.

problem Impact of rebalancing frequency and transaction costs on log-optimal portfolios.
method Proved equivalence to concave program, derived optimality conditions, tested using intraday and daily data.
result Transaction costs can cause bankruptcy for frequency-dependent log-optimal portfolios, approximating to quadratic concave program.

Improves classifier evaluation by aligning with Total Classification Cost.

problem Lack of consensus on evaluation metrics and class imbalance issues.
method Introduces Weighted Accuracy (WA) and a reweighting framework for cost-sensitive scenarios.
result WA aligns with Total Classification Cost (TCC) minimization under realistic conditions.

Optimizes state monitoring in Markovian systems with cost constraints.

problem Balancing state queries with prediction costs in Markovian systems.
method Greedy policy and SGD-based learning variant for optimal predict-query tradeoff.
result Greedy policy is suboptimal but performs close to optimal under certain conditions.

Paper introduces impact curves for evaluating binarized regression models with varying costs.

problem Evaluating binarized regression models with varying costs and instance-specific utility.
method Proposes impact curves to optimize binary decisions across different utilities.
result Impact curves identify conditions where one model is favored over another and quantify model improvement.

We study shortfall risk minimization for American options with path dependent payoffs under proportional transaction costs in the Black--Scholes (BS) model. We show that for this case the shortfall risk is a limit of similar terms in an appropriate sequence of binomial models. We also prove that in the continuous time …

2010-04-08abs ↗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 ↗

Study on costs of manipulating AMM-based price oracles.

problem Cost of manipulation in AMM-based on-chain price oracles.
method Analyzes the robustness of AMM-based oracles to strategic manipulation, considering different aggregation methods and market conditions.
result Manipulation costs depend on the total quote depth and can be minimized by optimal liquidity weights.

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 ↗

The grid integration of intermittent Renewable Energy Sources (RES) causes costs for grid operators due to forecast uncertainty and the resulting production schedule mismatches. These so-called profile service costs are marginal cost components and can be understood as an insurance fee against RES production schedule u…

2014-07-27abs ↗pdf ↗

The study examines pricing American options with both exogenous and endogenous transaction costs.

problem Pricing American options with transaction costs and liquidity risks.
method Modeling liquidity risks as a mean-reverting process and transaction costs as proportional to trading amount. Two nonlinear PDEs are used to characterize option values. Numerical solution via ADI method and model calibration using maximum likelihood estimation.
result The model incorporating liquidity risks significantly outperforms the Leland model.

We introduce the Randomized Dependence Coefficient (RDC), a measure of non-linear dependence between random variables of arbitrary dimension based on the Hirschfeld-Gebelein-Rényi Maximum Correlation Coefficient. RDC is defined in terms of correlation of random non-linear copula projections; it is invariant with respec…

2013-04-29abs ↗pdf ↗

Non-linear shrinkage isn't optimal for portfolio optimization, especially when asset dependence is non-stationary.

problem Optimizing portfolios with non-stationary asset dependence structures.
method Derived and compared non-linear shrinkage with an optimal target for covariance matrix estimation.
result Non-linear shrinkage can be significantly improved for portfolio optimization.

Optimal scheduling of hydrogen production in dynamic pricing power market can maximize the profit of hydrogen producer; however, it highly depends on the accurate forecast of hydrogen consumption. In this paper, we propose a deep leaning based forecasting approach for predicting hydrogen consumption of fuel cell vehicl…

2018-06-27abs ↗pdf ↗

The study extends SPT to account for real-world transaction costs, improving portfolio performance.

problem Real-world transaction costs affect portfolio performance, especially during market stress.
method Developed a continuous-time model with stochastic transaction costs and derived lower bounds for cost-adjusted wealth.
result Functionally generated portfolios can still achieve relative arbitrage after accounting for transaction costs.

We study the problem of option pricing and hedging strategies within the frame-work of risk-return arguments. An economic agent is described by a utility function that depends on profit (an expected value) and risk (a variance). In the ideal case without transaction costs the optimal strategy for any given agent is fou…

1998-03-19abs ↗pdf ↗

A new procedure for learning cost-sensitive SVM(CS-SVM) classifiers is proposed. The SVM hinge loss is extended to the cost sensitive setting, and the CS-SVM is derived as the minimizer of the associated risk. The extension of the hinge loss draws on recent connections between risk minimization and probability elicitat…

2012-12-05abs ↗pdf ↗