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.
A novel method for classification with rejection using ensemble of cost-sensitive classifiers.
We consider the problem of selective prediction (also known as reject option) in deep neural networks, and introduce SelectiveNet, a deep neural architecture with an integrated reject option. Existing rejection mechanisms are based mostly on a threshold over the prediction confidence of a pre-trained network. In contra…
Paper tackles regression with cost-based rejection, balancing prediction and rejection costs.
A method for making predictions with a reject option using conformal prediction.
We provide a method for approximating Bayesian inference using rejection sampling. We not only make the process efficient, but also dramatically reduce the memory required relative to conventional methods by combining rejection sampling with particle filtering. We also provide an approximate form of rejection sampling …
A new approach to model rejection using density ratios.
RMT-Net tackles biased credit scoring data by learning from both default/non-default and rejection/approval tasks.
Learning with rejection (LWR) allows development of machine learning systems with the ability to discard low confidence decisions generated by a prediction model. That is, just like human experts, LWR allows machine models to abstain from generating a prediction when reliability of the prediction is expected to be low.…
The wide and rapid adoption of deep learning by practitioners brought unintended consequences in many situations such as in the infamous case of Google Photos' racist image recognition algorithm; thus, necessitated the utilization of the quantified uncertainty for each prediction. There have been recent efforts towards…
Optimal regression with reject option using conditional variance thresholding.
Algorithmic trading systems on DEXs reject most candidate tokens, but the counterfactual outcome of rejected candidates is rarely measured.
Framework to mitigate adversarial attacks by allowing classifiers to abstain.
Credit scoring models based on accepted applications may be biased and their consequences can have a statistical and economic impact. Reject inference is the process of attempting to infer the creditworthiness status of the rejected applications. In this research, we use deep generative models to develop two new semi-s…
This paper characterizes and designs loss functions for robust classification with abstention.
We propose Generative Well-intentioned Networks (GWINs), a novel framework for increasing the accuracy of certainty-based, closed-world classifiers. A conditional generative network recovers the distribution of observations that the classifier labels correctly with high certainty. We introduce a reject option to the cl…
Active learning is an important technique to reduce the number of labeled examples in supervised learning. Active learning for binary classification has been well addressed in machine learning. However, active learning of the reject option classifier remains unaddressed. In this paper, we propose novel algorithms for a…
Proposes a new undersampling method for imbalanced data classification.
In many real applications of statistical learning, a decision made from misclassification can be too costly to afford; in this case, a reject option, which defers the decision until further investigation is conducted, is often preferred. In recent years, there has been much development for binary classification with a …
We investigate the problem of multiclass classification with rejection, where a classifier can choose not to make a prediction to avoid critical misclassification. First, we consider an approach based on simultaneous training of a classifier and a rejector, which achieves the state-of-the-art performance in the binary …
SCRIB assigns multiple labels to each example to control class-specific prediction risks.
EERO optimizes resource usage for efficient classification.
RED-2400 is a public benchmark of trading events from a Solana exchange, labeled by algorithmic rejection.
Generative classifiers have been shown promising to detect illegal inputs including adversarial examples and out-of-distribution samples. Supervised Deep Infomax~(SDIM) is a scalable end-to-end framework to learn generative classifiers. In this paper, we propose a modification of SDIM termed SDIM-\emph{logit}. Instead …
We consider the problem of -class classification (), where the classifier can choose to abstain from making predictions at a given cost, say, a factor of the cost of misclassification. Designing consistent algorithms for such -class classification problems with a `reject option' is the main goal of t…
PRS improves rejection sampling by learning better proposals.
New MC simulation methods use classifiers to estimate pdf ratios without explicit pdfs.
The study proposes a framework to accept OOD data based on competence scores.
We consider the problem of binary classification where one can, for a particular cost, choose not to classify an observation. We present a simple proof for the oracle inequality for the excess risk of structural risk minimizers using a lasso type penalty.
Comment on entropy learning for dynamic treatment regimes.
This work addresses two classification problems that fall under the heading of domain adaptation, wherein the distributions of training and testing examples differ. The first problem studied is that of class proportion estimation, which is the problem of estimating the class proportions in an unlabeled testing data set…
A reject option improves partial-label learning's accuracy.
The paper audits trading filters, finding a high save-to-miss ratio.
We consider the -ary classification problem via crowdsourcing, where crowd workers respond to simple binary questions and the answers are aggregated via decision fusion. The workers have a reject option to skip answering a question when they do not have the expertise, or when the confidence of answering that questio…
A dealer manages quotes and rejection rules to control slippage risk in FX markets.
Delayed rejection HMC improves sampling efficiency for multiscale distributions.
Credit scoring models support loan approval decisions in the financial services industry. Lenders train these models on data from previously granted credit applications, where the borrowers' repayment behavior has been observed. This approach creates sample bias. The scoring model (i.e., classifier) is trained on accep…
Paper connects rejection learning to Bhattacharyya divergence.
New method selects data points for better model performance.
COMRECGC finds common recourse for global counterfactual explanations in GNNs.
We study the problem of policy evaluation and learning from batched contextual bandit data when treatments are continuous, going beyond previous work on discrete treatments. Previous work for discrete treatment/action spaces focuses on inverse probability weighting (IPW) and doubly robust (DR) methods that use a reject…
We consider the classical problem of learning rates for classes with finite VC dimension. It is well known that fast learning rates up to are achievable by the empirical risk minimization algorithm (ERM) if low noise or margin assumptions are satisfied. These usually require the optimal Baye…
One of the main drawbacks of deep neural networks, like many other classifiers, is their vulnerability to adversarial attacks. An important reason for their vulnerability is assigning high confidence to regions with few or even no feature points. By feature points, we mean a nonlinear transformation of the input space …
In many classification systems, sensing modalities have different acquisition costs. It is often {\it unnecessary} to use every modality to classify a majority of examples. We study a multi-stage system in a prediction time cost reduction setting, where the full data is available for training, but for a test example, m…
Rejection Sampling is a fundamental Monte-Carlo method. It is used to sample from distributions admitting a probability density function which can be evaluated exactly at any given point, albeit at a high computational cost. However, without proper tuning, this technique implies a high rejection rate. Several methods h…
Benchmarking 18 deep neural network selective classification models on various datasets.
Background-Foreground classification is a well-studied problem in computer vision. Due to the pixel-wise nature of modeling and processing in the algorithm, it is usually difficult to satisfy real-time constraints. There is a trade-off between the speed (because of model complexity) and accuracy. Inspired by the reject…
New algorithms reduce rejection sampling complexity for shape-constrained distributions.
Proposes a method combining CNFs and rejection-resampling for sampling from unnormalized densities.