Cost-aware BO minimizes function evaluations with varying costs.
problem Optimization with varying evaluation costs in expensive functions.
method Cost Apportioned Bayesian Optimization (CArBO) combining initial and cost-cooled phases.
result CArBO finds better hyperparameter configurations with the same cost budget.
Paper optimizes broker performance by estimating execution costs.
problem Minimizing execution costs for large trades.
method Intraday modeling of execution cost components (linear and quadratic).
result Substantial improvements in estimating execution costs.
A new algorithm improves multi-label classification performance across various cost functions.
problem Multi-label classification performance varies with different cost functions.
method Proposes cost-sensitive label embedding with multidimensional scaling (CLEMS) that approximates cost information using distances of embedded vectors.
result CLEMS significantly outperforms existing algorithms across different cost functions.
Estimates cost savings from early cancer diagnosis.
problem Improving early cancer diagnosis to reduce treatment costs.
method Combining published cancer treatment cost estimates by stage with incidence rates by stage at diagnosis, and extrapolating to other cancer sites.
result Estimates U.S. national annual treatment cost-savings from early cancer diagnosis in the trillions.
Paper proposes new costs for learning multiple centers in MDNs.
problem Learning multiple centers for density approximation in MDNs.
method Combines MDNs with contrastive costs using four types of kernelized matrix costs.
result New costs improve data density approximation in MDNs.
Using a methodology similar to that used the in the worldwide research, the cost performance of Dutch large-scale transport infrastructure projects is determined. In the Netherlands, cost overruns are as common as cost underruns but because cost overruns are larger than cost underruns projects on average have a cost ov…
Cost-aware multi-objective Bayesian optimization for non-uniformly expensive functions.
problem Non-uniform cost of function evaluations in Bayesian optimization.
method Introduces cost-aware constraints and a new acquisition function to optimize multi-objective functions with varying costs.
result Demonstrates improved optimization in hyperparameter tuning of neural networks and random forests.
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.
Cost-sensitive learning improves predictive maintenance by reducing costs.
problem Predictive maintenance models often lead to higher costs than expected.
method Propose selecting models based on economic costs rather than traditional metrics.
result Cost reduction and fault-tolerant policies achieved through cost-sensitive learning.
Optimal benchmark design varies based on costs in financial manipulation.
problem Manipulation of price benchmarks in finance.
method Analyzes empirical pattern and cost structures to determine optimal benchmark design.
result The optimal benchmark depends on the relative sizes of fixed and variable costs.
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 model considers varying costs in learning, outperforming existing methods.
problem Learning with varying costs in machine learning models.
method Introduces ε-frugal learning that considers both known and unknown costs.
result ε-frugal learners outperform learners with known costs and random sampling.
Transaction costs appear in financial markets in more than one form. There are several results in the literature on small proportional transaction cost and not that many on fixed transaction cost. In the present work, we heuristically study the effect of both types of transaction cost by focusing on a portfolio optimiz…
Study develops a cost model for field canals improvement projects in Egypt.
problem Accurately predict the preliminary costs of field canals improvement projects.
method Developed a parametric cost model using machine learning methods.
result Identified key cost drivers and developed a model for FCIPs.
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.
Reduces memory costs for developing countries by replacing images with text.
problem High memory costs associated with multimodal webpages in developing countries.
method Canonical Correlation Analysis (CCA) to replace high-cost modality (images) with low-cost modality (text).
result Reduces memory costs by at least 83.35% through eye-tracking experiments.
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.
The paper improves competitive and dynamic regret bounds for smoothed online learning.
problem Smoothed online learning with hitting and switching costs.
method Optimization problems to minimize hitting cost, dynamic regret modification of existing algorithms.
result Improved competitive and dynamic regret bounds for various function classes.
The study examines portfolio optimization with quadratic transaction costs, complicating the optimization process.
problem Portfolio optimization with quadratic transaction costs is more challenging than with linear costs.
method Introduced numerical algorithms to solve the optimization problem with quadratic transaction costs.
result Quadratic transaction costs significantly impact the expected returns of optimized portfolios.
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 ( d K ) O(\frac{\sqrt{d}}{\sqrt{K}}) O ( K d ) convergence rate and O ( d ε − 2 ) 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…
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 RL algorithms reduce costs for single-agent and federated learning.
problem Minimizing costs in RL and federated RL settings.
method Q-EarlySettled-LowCost and FedQ-EarlySettled-LowCost algorithms.
result First algorithms to achieve low burn-in and logarithmic switching costs.
New method optimizes costly evaluations in Bayesian optimization.
problem Costly evaluations in BO methods, especially in hyperparameter tuning.
method Formulated as a CMDP, developed rollout approximation for optimal policy.
result Improved cost efficiency over standard BO methods.
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.
Model shows how price impact and transaction costs affect trading behavior and profits.
problem Analyzing trading behavior and profits in markets with transaction costs and price impact.
method Proves the existence of an equilibrium in a model with transaction costs and price impact.
result Existence of a strictly positive optimal transaction cost from the exchange's perspective.
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.
Estimates optimal transport maps with known cost functions.
problem Ensuring optimal transport maps correspond to real-world usefulness.
method Differentiable neural ground costs with known Monge map forms.
result General approach for incorporating prior information.
Proposes an angle-based framework for multicategory cost-sensitive classification.
problem Cost-sensitive multicategory classification challenges.
method Angle-based cost-sensitive classification framework without sum-to-zero constraint.
result Proposed boosting algorithms yield competitive classification performances.
Four conditions ensure low-rank projection costs using random matrix tricks.
problem Preserving projection costs in low-rank approximations.
method Four structural conditions using randomized matrix techniques.
result Conditions guarantee cost preservation in rank- k k k projections. 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.
We study the high-frequency limits of strategies and costs in a Nash equilibrium for two agents that are competing to minimize liquidation costs in a discrete-time market impact model with exponentially decaying price impact and quadratic transaction costs of size θ ≥ 0 θ\ge0 θ ≥ 0 . We show that, for θ = 0 θ=0 θ = 0 , equilibrium strategie…
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.
MOBA model optimizes error rates for two-class cost-sensitive problems.
problem Cost-sensitive classification with ambiguous labels and varying costs.
method Multi-objective bounded-abstention model using genetic algorithm.
result MOBA achieves lower expected costs with known costs and better trade-offs without.
Introduces a Cost function to measure Legendrian knot obstructions.
problem Measuring obstructions for Legendrian knot isotopies.
method Introduces a non-negative integer-valued Cost function.
result Cost function induces a metric on topologically isotopic Legendrian knots.
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.
Examines how transaction costs affect systematic portfolios.
problem Impact of proportional transaction costs on systematic portfolios.
method Empirical study with various portfolio types and configurations.
result Proposes a method to smooth transaction costs.
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…
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.
Paper examines costs of using wrong price impact models in trading.
problem Misspecifying price impact models in trading predictions.
method Derives formulas for misspecification costs and applies to trading data.
result Misspecification costs are asymmetric, affecting profits and losses.
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.
A deep learning algorithm designs low-cost SPP films.
problem Designing SPP films with high accuracy and low cost.
method Guided deep learning algorithm with low-cost sample replacement.
result Deep CNN learns to replace precious metals with ordinary metals, reducing cost.
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-…
A framework trades-off model deployment cost with accuracy for healthcare risk prediction.
problem Complex cost structures in healthcare limit existing predictive model deployment methods.
method Proposes a novel cost-sensitive structured regularizer using boolean circuits.
result Models are in harmony with underlying cost structure, providing excellent accuracy vs cost tradeoff.
UCRL-CMDP algorithm optimizes RL with constraints on average costs.
problem Optimizing RL in MDPs with average cost constraints.
method Model-based RL algorithms maximizing reward while keeping costs within bounds.
result UCRL-CMDP algorithm's expected regret is upper-bounded by $T^{2\slash 3}$ .
New algorithm SFHC achieves near-optimal costs with predictions for non-convex optimization.
problem Online optimization with non-convex hitting costs and movement costs.
method Synchronized Fixed Horizon Control (SFHC) algorithm with conditions on hitting and movement costs.
result Synchronized Fixed Horizon Control (SFHC) achieves a 1 + O ( 1 / w ) 1+O(1/w) 1 + O ( 1/ w ) competitive ratio for near-optimal costs.