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

200399599798 · Jun 202019922001200920172026
48 results for cost-sensitive training

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.

Several recent works have developed methods for training classifiers that are certifiably robust against norm-bounded adversarial perturbations. These methods assume that all the adversarial transformations are equally important, which is seldom the case in real-world applications. We advocate for cost-sensitive robust…

2018-10-22abs ↗pdf ↗

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.

Combines cost-sensitive and Neyman-Pearson paradigms for better binary classification.

problem Asymmetric binary classification problems with unequal error severities.
method Develops TUBE-CS algorithm to bridge cost-sensitive and Neyman-Pearson paradigms.
result High-probability control of population type I error.

Label space expansion for multi-label classification (MLC) is a methodology that encodes the original label vectors to higher dimensional codes before training and decodes the predicted codes back to the label vectors during testing. The methodology has been demonstrated to improve the performance of MLC algorithms whe…

2016-11-29abs ↗pdf ↗

Paper proposes a cost-sensitive conformal training method with provably controllable learning bounds.

problem Uncertainty quantification and learning bounds in conformal prediction.
method Cost-sensitive conformal training algorithm that minimizes the expected size of prediction sets using rank weighting.
result Theoretical analysis shows tightness between weighted objective and expected size of conformal prediction sets.

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.

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 ↗

Motivated by safety-critical classification problems, we investigate adversarial attacks against cost-sensitive classifiers. We use current state-of-the-art adversarially-resistant neural network classifiers [1] as the underlying models. Cost-sensitive predictions are then achieved via a final processing step in the fe…

2019-10-04abs ↗pdf ↗

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…

2013-10-30abs ↗pdf ↗

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 ↗

Imbalanced data with a skewed class distribution are common in many real-world applications. Deep Belief Network (DBN) is a machine learning technique that is effective in classification tasks. However, conventional DBN does not work well for imbalanced data classification because it assumes equal costs for each class.…

2018-04-28abs ↗pdf ↗

A novel method for classification with rejection using ensemble of cost-sensitive classifiers.

problem Avoid risky misclassification in error-critical applications.
method Learning an ensemble of cost-sensitive classifiers.
result Improved classification accuracy and flexibility in loss selection.

Cost-Sensitive Online Classification has drawn extensive attention in recent years, where the main approach is to directly online optimize two well-known cost-sensitive metrics: (i) weighted sum of sensitivity and specificity; (ii) weighted misclassification cost. However, previous existing methods only considered firs…

2018-04-06abs ↗pdf ↗

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.

Regression, unlike classification, has lacked a comprehensive and effective approach to deal with cost-sensitive problems by the reuse (and not a re-training) of general regression models. In this paper, a wide variety of cost-sensitive problems in regression (such as bids, asymmetric losses and rejection rules) can be…

2012-11-05abs ↗pdf ↗

In binary classification framework, we are interested in making cost sensitive label predictions in the presence of uniform/symmetric label noise. We first observe that 00-11 Bayes classifiers are not (uniform) noise robust in cost sensitive setting. To circumvent this impossibility result, we present two schemes; un…

2019-01-08abs ↗pdf ↗

In this paper, we propose an effective THresholding method based on ORder Statistic, called THORS, to convert an arbitrary scoring-type classifier, which can induce a continuous cumulative distribution function of the score, into a cost-sensitive one. The procedure, uses order statistic to find an optimal threshold for…

2018-11-07abs ↗pdf ↗

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.

New framework improves adversarial robustness in one-stage L2D.

problem Adversarial robustness in one-stage Learning-to-Defer (L2D).
method Formalizes attacks, proposes cost-sensitive adversarial surrogate losses, establishes theoretical guarantees.
result Improves robustness against untargeted and targeted attacks while preserving clean performance.

New method certifies joint adversarial robustness of model ensembles.

problem Ensuring robustness of model ensembles against adversarial attacks.
method Proposes a novel technique to certify joint robustness, building on prior work on single-model robustness certification.
result Demonstrates the effectiveness of certifying joint robustness of ensembles, improving understanding of ensemble defenses.

Paper proposes consistent estimators for learning to defer decisions to experts.

problem Learning algorithms often ignore expert decision-making in practical scenarios.
method Reduction to cost sensitive learning, novel surrogate loss for consistent estimation.
result Effective approach demonstrated on various tasks, showing consistency.

Extends expected value framework for cost-sensitive causal decision-making.

problem Optimizing operational decision-making with cost-sensitive causal classification.
method Introduces a cost-sensitive decision boundary based on estimated individual treatment effects, positive outcome probability, and cost parameters.
result Effective in maximizing expected causal profit, outperforming cost-insensitive ranking approach.

The cost-sensitive classification problem plays a crucial role in mission-critical machine learning applications, and differs with traditional classification by taking the misclassification costs into consideration. Although being studied extensively in the literature, the fundamental limits of this problem are still n…

2018-05-20abs ↗pdf ↗

BERT improved for propaganda detection with imbalanced, dissimilar data.

problem BERT struggles with dissimilar imbalanced datasets in propaganda detection.
method Cost-sensitive BERT with dissimilarity measure for imbalanced, dissimilar datasets.
result Achieved second-highest score on sentence-level propaganda classification.

Enhances Random Forest for imbalanced functional data classification.

problem Challenges in classifying imbalanced functional data.
method Functional Random Forest with Adaptive Cost-Sensitive Splitting (FRF-ACS).
result Significantly improves minority class recall and predictive performance.

Develops algorithms for multi-class Neyman-Pearson classification with cost sensitivity.

problem Asymmetric misclassification costs in multi-class classification problems.
method Establishes connection with cost-sensitive learning, proposes two algorithms, extends NP oracle properties.
result Proposes algorithms with theoretical guarantees for multi-class Neyman-Pearson classification.

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…

2018-09-28abs ↗pdf ↗

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.

Study on top-kk classification with new loss functions and algorithms.

problem Improving multi-class classification accuracy and cardinality trade-off.
method Introducing cardinality-aware loss functions and deriving their consistency bounds.
result New cardinality-aware algorithms for top-kk classification.

A new feature selection method for cost-sensitive classification in Random Forests.

problem Feature selection in Random Forests is challenging due to the complexity of ensemble trees.
method Shallow Tree Selection method for feature selection from small tree structures, adapted for cost-sensitive learning.
result BCR criterion improves performance of feature selection methods.

Online Active Learning (OAL) aims to manage unlabeled datastream by selectively querying the label of data. OAL is applicable to many real-world problems, such as anomaly detection in health-care and finance. In these problems, there are two key challenges: the query budget is often limited; the ratio between classes i…

2019-11-18abs ↗pdf ↗

Bayesian framework improves minority class performance in class-imbalanced data.

problem Class imbalance in predictive toxicology models.
method Weighted likelihood approach modifying likelihood function weights inversely proportional to class proportions.
result Improves balanced accuracy and sensitivity for minority class (toxic compounds).

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…

2017-03-03abs ↗pdf ↗