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

5501,1001,6502,200 · Jun 202019922001200920172026
48 results for cost one

Proposes resilience metrics for large blackout costs with logarithmic resilience.

problem Large variations in blackout costs make estimating risk impractical.
method Uses mean of log of large blackout costs, tail slope index, and frequency.
result Solves problems of heavy tail and large variations in blackout costs.

Label embedding (LE) is an important family of multi-label classification algorithms that digest the label information jointly for better performance. Different real-world applications evaluate performance by different cost functions of interest. Current LE algorithms often aim to optimize one specific cost function, b…

2016-03-30abs ↗pdf ↗

The paper analyzes the benefit-cost ratio for feature selection in machine learning.

problem Tackling the challenge of distinguishing relevant features from noise in feature selection.
method Simulation study with different cost and data settings to analyze the benefit-cost ratio.
result The benefit-cost ratio can overemphasize cheap noise features in scenarios with large cost differences and small effect sizes.

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.

New algorithm reduces misclassification costs in neural networks.

problem Reduces costs of misclassified instances in neural networks.
method Adaptive Cost-Sensitive Learning (AdaCSL) adjusts loss function to bridge class distribution mismatches.
result Deep neural networks with AdaCSL outperform other methods on cost-sensitive binary classification tasks.

The notion of expense in Bayesian optimisation generally refers to the uniformly expensive cost of function evaluations over the whole search space. However, in some scenarios, the cost of evaluation for black-box objective functions is non-uniform since different inputs from search space may incur different costs for …

2019-09-09abs ↗pdf ↗

This paper proposes CSADA to make DNNs cost-sensitive.

problem Over-parameterization challenges cost-sensitive classification in DNNs.
method CSADA framework using adversarial data augmentation.
result CSADA effectively minimizes overall cost and reduces critical errors.

This paper tackles cost-sensitive portfolio optimization under ambiguous return distributions.

problem Tackles cost-sensitive distributionally robust log-optimal portfolio problem with ambiguous return distributions.
method Uses Wasserstein metric for distributional ambiguity, incorporates convex transaction costs, and approximates infinite-dimensional problem with finite convex program.
result Establishes conditions for robustly survivable trades and validates theoretical framework with empirical studies.

A new cost-frugal HPO method controls training cost during optimization.

problem Ignoring training cost variation in HPO leads to inefficient hyperparameter tuning.
method Developed a randomized direct-search method with convergence and approximation guarantees.
result Proved an O(dK)O(\frac{\sqrt{d}}{\sqrt{K}}) convergence rate and O(dε2)O(dε^{-2}) approximation guarantee.

We seek decision rules for prediction-time cost reduction, where complete data is available for training, but during prediction-time, each feature can only be acquired for an additional cost. We propose a novel random forest algorithm to minimize prediction error for a user-specified {\it average} feature acquisition b…

2015-02-20abs ↗pdf ↗

Investigates how trading boundaries change with transaction costs in portfolio selection.

problem Investigates how trading boundaries vary with transaction costs in portfolio selection.
method Analyzes Merton's problem with proportional transaction costs, showing monotonicity of trading boundaries.
result Cost-adjusted trading boundaries are monotone in transaction costs, with implications for the Merton line.

New method reduces total cost constraints in CBwK to sqrt(T) with fairness application.

problem Maximize rewards while adhering to total cost constraints in CBwK.
method Dual strategy based on projected-gradient-descent updates.
result Total cost constraints reduced to sqrt(T) with poly-logarithmic terms.

Study how transaction costs impact stock returns and holdings in equilibrium.

problem Impact of quadratic transaction costs on equilibrium stock returns and holdings.
method Developed a continuous-time risk-sharing model with FBSDEs to characterize equilibrium stock holdings and trading rates.
result Equilibrium stock holdings and trading rates are uniquely determined by FBSDEs, and equilibrium return by a system of coupled FBSDEs.

The multimodal web elements such as text and images are associated with inherent memory costs to store and transfer over the Internet. With the limited network connectivity in developing countries, webpage rendering gets delayed in the presence of high-memory demanding elements such as images (relative to text). To ove…

2017-11-06abs ↗pdf ↗

The paper optimizes portfolios with transaction costs in a large asset universe.

problem Optimizing portfolios with transaction costs in a large asset universe.
method Mean-variance optimization with nonconvex penalty for proportional and quadratic transaction costs.
result The proposed models show satisfactory performance and highlight the importance of transaction costs.

Study optimal investment and consumption strategies with various transaction costs.

problem Investment and consumption decisions under varying transaction costs.
method Dynamic programming and singular perturbation expansion for small cost-to-wealth ratio.
result Derive leading-order asymptotic formulas for no-trade regions and trading boundaries.

Cost-benefit analysis often assumes accurate estimates, but this study finds significant inaccuracies.

problem Inaccurate cost and benefit estimates in public investments.
method Largest dataset of public investments, statistical analysis of cost overruns and benefit shortfalls.
result Significant inaccuracies in cost and benefit estimates of public investments.

This work improves cost-aware Bayesian optimization by introducing Pareto-efficient acquisition functions.

problem Cost variability in hyperparameter evaluations affects the efficiency of Bayesian optimization.
method Reformulated cost-aware Bayesian optimization as Pareto efficiency, proposing a novel Pareto-efficient expected improvement.
result Pareto-efficient acquisition functions significantly outperform previous solutions, providing finer control over cost-accuracy trade-offs.

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 ↗

We consider a Nash equilibrium between two high-frequency traders in a simple market impact model with transient price impact and additional quadratic transaction costs. Extending a result by Schöneborn (2008), we prove existence and uniqueness of the Nash equilibrium and show that for small transaction costs the high-…

2013-05-17abs ↗pdf ↗

Low-cost sensors improve air quality prediction accuracy significantly.

problem Improving air quality monitoring networks with affordable sensors.
method Developed a high-resolution air quality prediction engine using low-cost sensors and official data.
result The use of low-cost sensors improves prediction accuracy by 25% and 15% for PM2.5 and PM10 respectively in densely monitored areas.

New method optimizes costly functions with unknown costs and budget constraints.

problem Optimizing functions with unknown and heterogeneous evaluation costs under a budget constraint.
method Budgeted multi-step expected improvement acquisition function.
result Our method outperforms existing approaches in various synthetic and real problems.

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.

Deep neural network predicts health costs better than traditional models.

problem Accurate prediction of healthcare costs for optimal cost management.
method Developed a deep neural network to predict future health care costs from health insurance claims records.
result Deep neural network outperformed ridge regression and Morbi-RSA models in cost prediction.

In this short note, we consider mean-variance optimized portfolios with transaction costs. We show that introducing quadratic transaction costs makes the optimization problem more difficult than using linear transaction costs. The reason lies in the specification of the budget constraint, which is no longer linear. We …

2020-01-06abs ↗pdf ↗

CADRO optimizes DRO by reducing conservatism through cost-aware ambiguity sets.

problem Optimizing solutions under uncertainty with reduced conservatism.
method CADRO uses a cost-aware ambiguity set to reduce DRO's conservatism.
result CADRO provides high-confidence upper bounds and consistent estimators of out-of-sample expected cost.

LaMBO optimizes modular systems with switching costs, achieving better results than existing methods.

problem Optimizing systems with costly variable updates in a sequence of modules.
method Lazy Modular Bayesian Optimization (LaMBO) that minimizes switching costs.
result LaMBO achieves vanishing regret and improves over existing cost-aware Bayesian optimization algorithms.

Adaptive Bayesian Optimization for resource-constrained experiments with switching costs.

problem Sequential experimental design with varying costs for changing design variables.
method Adapted batch algorithms to sequential problem, proposing cost-aware and cost-ignorant methods.
result Cost-aware algorithm outperforms tuned process-constrained algorithms in all settings considered.

SCaLE tackles dynamic regret in noisy bandit feedback with switching costs.

problem Unbounded metric movement costs in bandit online convex optimization.
method SCaLE algorithm for high-dimensional dynamic quadratic hitting costs and 2\ell_2-norm switching costs, with spectral regret analysis.
result First algorithm achieving sub-linear dynamic regret without hitting cost knowledge.