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.
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.
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.
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.
Study cyber-attacks on RL algorithms, focusing on cost signal manipulation.
problem Adversarial manipulation of cost signals in reinforcement learning.
method Quantitative analysis of TD( λ λ λ ) and Q Q Q -learning algorithms under manipulation. result Bound on approximation error for TD( λ λ λ ) and convergence properties for Q Q Q -learning under stealthy attacks. Improved distributed learning with reduced communication costs.
problem Efficient communication in resource-constrained environments for distributed learning.
method Proposed a cost-effective partial communication protocol.
result Communication cost is reduced to O ( log T ) O(\log T) O ( log T ) , improving significantly on full communication. Unified framework for cost-sensitive ensemble learning.
problem Different misclassification costs in data.
method A unifying framework for cost-sensitive ensemble methods.
result Unified understanding and natural extensions of existing methods.
A deep reinforcement learning method for cost-sensitive portfolio selection.
problem Non-stationary price series and complex asset correlations make feature learning hard, and practical cost constraints are not considered.
method A two-stream portfolio policy network and a cost-sensitive reward function are developed using deep reinforcement learning.
result The method achieves superior performance in profitability, cost-sensitivity, and representation abilities.
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 design of surface plasmon polaritons (SPP) films is an ill-posed inverse problem. There are many-to-one correspondence between the structures and user needs. We present a novel guided deep learning algorithm to find optimal solutions (with both high accuracy and low cost). To achieve this goal, we use low cost samp…
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.
We design an active learning algorithm for cost-sensitive multiclass classification: problems where different errors have different costs. Our algorithm, COAL, makes predictions by regressing to each label's cost and predicting the smallest. On a new example, it uses a set of regressors that perform well on past data t…
NOT learns optimal transport plans, kernel costs improve performance.
problem NOT algorithm learns non-optimal plans with weak quadratic costs.
method Introduced kernel weak quadratic costs to improve NOT's performance.
result Kernel costs provide improved theoretical and practical guarantees.
Boosting theory extended to handle cost-sensitive and multi-objective losses.
problem Real-world prediction problems with different error costs.
method Developed a comprehensive theory of cost-sensitive and multi-objective boosting.
result Established a dichotomy for binary classification and a more intricate landscape for multiclass settings.
FR-LUX optimizes portfolio management by learning cost-aware policies robust to market conditions.
problem Transaction costs and regime shifts cause failure in live trading portfolios.
method Integrates three ingredients: microstructure-consistent execution model, trade-space trust region, and explicit regime conditioning.
result Achieves top average Sharpe ratio, maintains flat cost-performance slope, and superior risk-return efficiency.
Study cost-driven state representation learning for control from partial observations.
problem Learning state representation for control from partial and high-dimensional observations.
method Cost-driven state representation learning via predicting cumulative costs.
result Established finite-sample guarantees for near-optimal representation and controller.
Paper proposes using pairwise feature comparisons to infer modification costs for user recourse.
problem Learning and inferring user preferences for modifying features in black-box models.
method Bradley-Terry model for inferring feature-wise costs from non-exhaustive human comparison surveys.
result Non-exhaustive human surveys can efficiently learn feature costs, enabling recourse finding.
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.
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}$ .
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. 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…
Q-learning for average cost MDPs gets a concentration bound.
problem Finding bounds for Q-learning in average cost MDPs.
method Derives a concentration bound using shortest path problem equivalence.
result Numerical comparison with relative value iteration shows the bound's effectiveness.
New method reduces regret and communication costs in federated Q-learning.
problem Worst-case regret and communication cost bounds in federated Q-learning.
method Gap-dependent analysis leveraging MDP structures.
result Achieves log T \log T log T -type regret and communication cost bounds. 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.
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 …
In predictive maintenance, model performance is usually assessed by means of precision, recall, and F1-score. However, employing the model with best performance, e.g. highest F1-score, does not necessarily result in minimum maintenance cost, but can instead lead to additional expenses. Thus, we propose to perform model…
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 ℓ 2 -norm switching costs, with spectral regret analysis. result First algorithm achieving sub-linear dynamic regret without hitting cost knowledge.
While both cost-sensitive learning and online learning have been studied extensively, the effort in simultaneously dealing with these two issues is limited. Aiming at this challenge task, a novel learning framework is proposed in this paper. The key idea is based on the fusion of online ensemble algorithms and the stat…
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 teaches robots to navigate by learning costs from expert demonstrations.
problem Teaching robots to navigate autonomously using only expert observations.
method Developed a map encoder and cost encoder to infer semantic class probabilities and a cost function from expert observations.
result Robots can learn to follow traffic rules in a simulator using only semantic observations.
Investigates portfolio selection with transaction costs and stochastic volatility, using deep learning for computation.
problem Optimal portfolio selection with transaction costs and stochastic volatility.
method Two-factor stochastic volatility model, option-implied utility function, deep learning policy iteration.
result Deep learning method effectively computes optimal investment decisions under transaction costs and stochastic volatility.
Study learns state representations from observations for control, proving guarantees.
problem Learning state representations from high-dimensional observations for control.
method Cost-driven approach, learning latent state model to predict costs.
result Proves finite-sample guarantees for near-optimal state representation and controller.
LC-FL uses generative models to reduce communication costs in federated learning.
problem High communication costs and strict model homogeneity in federated learning.
method LC-FL employs generative models to transmit data and aggregate models.
result LC-FL reduces communication costs and supports heterogeneous models.
Study schedules jobs with unknown holding costs to minimize expected cumulative cost.
problem Minimizing expected cumulative holding costs of jobs with unknown parameters.
method Learning-based c μ cμ c μ rule scheduling with a preemption phase. result Achieves near-optimal performance guarantees with nearly matching regret bounds.
OSIL learns safe policies from unsafe demonstrations.
problem Offline safe imitation learning with implicit safety.
method Formulates CMDP, infers safety from non-preferred trajectories, learns cost model.
result OSIL learns safer policies without degrading reward performance.
ARL uses queries to learn rewards, focusing on cost vs. reward value.
problem How to efficiently use queries to learn rewards in reinforcement learning.
method Proposed and evaluated heuristic approaches for ARL in multi-armed bandits and MDPs.
result Challenging aspects of ARL highlighted, including intractability of value computation.
Interactive IL beats BC by state-wise annotation cost.
problem Behavior Cloning struggles with annotation cost in sequential decision making.
method Proved Stagger and Warm Stagger algorithms to outperform BC.
result Interactive and hybrid IL methods outperform BC with state-wise annotation.
The paper discusses the limitations of efficiency metrics in machine learning models.
problem Inadequate reporting of efficiency metrics leads to incomplete conclusions.
method Thoroughly discusses common cost indicators, their advantages and disadvantages, and how they contradict each other.
result Incomplete reporting of efficiency metrics can lead to partial conclusions and a blurred picture of model practical considerations.
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…
New ACE cost function encourages diversity in neural networks.
problem Training multiple classifiers with controlled diversity.
method Mathematical derivation and gradient control.
result ACE yields better ensemble results than vanilla.
The paper develops a method to learn navigation costs from expert demonstrations in partially observable environments.
problem Learning navigation costs from expert demonstrations in partially observable environments.
method Develops a cost function representation composed of a probabilistic occupancy encoder and a cost encoder, optimized by differentiating the error between demonstrated controls and a control policy computed from the cost encoder.
result The method outperforms baseline IRL algorithms in robot navigation tasks, improving both training and test-time efficiency.
Traditionally, machine learning algorithms rely on the assumption that all features of a given dataset are available for free. However, there are many concerns such as monetary data collection costs, patient discomfort in medical procedures, and privacy impacts of data collection that require careful consideration in a…
The paper develops a method to learn cost-optimal sequential testing policies from retrospective data.
problem Learning cost-optimal sequential decision policies from retrospective data with missing test results.
method Doubly robust Q-learning framework with path-specific inverse probability weights.
result The method reduces testing cost without compromising predictive accuracy.
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.
A new active learning method considers both uncertainty and diversity to minimize labeling and decision costs.
problem Classical AL approaches fail to capture data distribution in unlabeled data, leading to mislabeling of outliers.
method CBAL considers classification uncertainty and instance diversity, using a min-max approach to minimize labeling and decision costs.
result Extensive experiments show CBAL outperforms state-of-the-art AL approaches.
Study portfolio selection with exogenous and endogenous transaction costs using deep learning.
problem Portfolio selection with both exogenous and endogenous transaction costs.
method Deep learning-driven policy iteration scheme for high-dimensional HJB equations.
result Proposes a scheme to address the curse of dimensionality and adapt to high-dimensional control spaces.
Machine learning has automated much of financial fraud detection, notifying firms of, or even blocking, questionable transactions instantly. However, data imbalance starves traditionally trained models of the content necessary to detect fraud. This study examines three separate factors of credit card fraud detection vi…
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.