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

199398596795 · Jun 202019922001200920172026
48 results for class predictability

Proposes a method to improve class-conditional conformal prediction for many classes.

problem Weak guarantees for specific classes in classification problems.
method Clusters classes with similar conformal scores and performs conformal prediction at the cluster level.
result Clustered conformal typically outperforms existing methods in class-conditional coverage and set size metrics.

New conformal prediction methods for long-tailed classification problems.

problem Rare classes are systematically omitted in existing conformal prediction methods.
method Introduced a new conformal score function and a new interpolation procedure.
result Smoothly trade off set size and class-conditional coverage.

In cases of uncertainty, a multi-class classifier preferably returns a set of candidate classes instead of predicting a single class label with little guarantee. More precisely, the classifier should strive for an optimal balance between the correctness (the true class is among the candidates) and the precision (the ca…

2019-06-19abs ↗pdf ↗

Paper relaxes set-valued prediction in hierarchical classification by considering representation complexity.

problem Uncertainty in class labels in hierarchical multi-class classification problems.
method Introduces representation complexity for predicted sets, proposes three methods for inference.
result Recursive tree search method is computationally more efficient.

PEC improves class-incremental learning by measuring prediction error.

problem Challenges in class-incremental learning, particularly forgetting and class imbalance.
method Prediction Error-based Classification (PEC) measures prediction error of a model trained on data from a class.
result PEC outperforms other methods in class-incremental learning across multiple benchmarks.

Conformal prediction fails to cover minority classes in imbalanced datasets, but a class-conditional fix improves coverage.

problem Conformal prediction fails to cover minority classes in imbalanced datasets, leading to poor performance on rare labels.
method Class-conditional conformal prediction to improve coverage of minority classes.
result Class-conditional conformal prediction restores minority coverage to target with a modest increase in prediction-set size.

New method uses label-weighted conformal prediction for macro-coverage guarantees in classification.

problem Finding a balance between class-conditional and marginal coverage in long-tailed datasets.
method Label-weighted conformal prediction for macro-coverage guarantees.
result Validated prediction sets with macro-coverage guarantees on large-scale image datasets.

Generalizes conformal prediction to multiple learnable parameters for efficient prediction sets.

problem Learning valid and efficient prediction sets with low-capacity function classes.
method Constrained empirical risk minimization (ERM) with gradient-based optimization of differentiable surrogate losses and Lagrangians.
result Achieves approximate valid population coverage and near-optimal efficiency within class.

The paper develops distribution-free methods for ordinal classification.

problem Constructing valid prediction sets for ordinal classification problems.
method Leveraging conformal prediction and multiple testing with FWER control.
result The proposed methods achieve satisfactory levels of marginal and class-specific conditional coverages.

HCC extends conformal prediction to handle class hierarchies, improving prediction reliability.

problem Uncertainty quantification in classification models with class hierarchy considerations.
method Formulates HCC as a constrained optimization problem, ensuring coverage guarantees with a smaller subset of candidate solutions.
result HCC produces more reliable prediction sets by leveraging class hierarchy information.

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).

A new method flips class values to address class and treatment imbalance in uplift modeling and HTE.

problem Class and treatment imbalance in imbalanced RCT data.
method Class flipping approach to address imbalance without distorting predictions.
result The method does not distort predicted effects and does not require calibration.

Proposes class-agnostic object detection to handle all objects without class labels.

problem Difficulty and cost in creating annotated datasets limit conventional object detection models to specific object types.
method Proposes class-agnostic object detection as a new problem and proposes training and evaluation protocols. Uses adversarial learning to exclude class-specific information.
result Adversarial learning improves class-agnostic detection efficacy.

A new method identifies class-specific covariates in multi-class prediction tasks.

problem Identifying covariates specifically associated with one or more outcome classes in multi-class prediction tasks.
method Introducing multi forests (MuFs) with multi-way and binary splits to measure class-associated discriminatory ability.
result The multi-class VIM specifically ranks class-associated covariates highly, unlike conventional VIMs.

New method calibrates multi-class predictions efficiently without sacrificing accuracy.

problem Efficiently calibrating multi-class predictions without sacrificing accuracy.
method Formulated robust projected smooth calibration and new recalibration algorithms.
result Achieves strong guarantees for binary classification tasks with polynomial complexity.

The Minimum Description Length (MDL) principle selects the model that has the shortest code for data plus model. We show that for a countable class of models, MDL predictions are close to the true distribution in a strong sense. The result is completely general. No independence, ergodicity, stationarity, identifiabilit…

2009-09-25abs ↗pdf ↗

A new PLL method uses class activation values to improve robustness.

problem Weakly supervised learning with noisy data and adversarial perturbations.
method Subjective logic with class activation values for uncertainty representation and label weight re-distribution.
result More robust predictions under high noise levels, out-of-distribution examples, and adversarial perturbations.

The paper proposes a method to assess when automated predictions are reliable.

problem Ensuring reliability and safety of automated decision-making in machine learning.
method Clustering to measure distances between outputs and class centroids, defining a safety threshold based on these distances.
result The proposed metric can efficiently determine when automated predictions are acceptable and when they should be deferred.

ProHOC detects OOD samples in class hierarchies, predicting them to correct internal nodes.

problem Binary OOD detection ignores semantic relationships between OOD and ID classes.
method Probabilistic hierarchical model using multi-depth networks trained for ID classification.
result ProHOC effectively classifies OOD samples to their correct internal nodes in class hierarchies.

Improves conformal prediction by combining multiple score functions and optimizing weights.

problem Limitations of single-score conformal predictors in multi-class classification.
method Combines multiple score functions and optimizes weights to minimize prediction set size.
result Consistently outperforms single-score conformal predictors while maintaining valid coverage.

SCRIB assigns multiple labels to each example to control class-specific prediction risks.

problem Lack of a sound mechanism to decide when to refrain from predicting in DL classifiers.
method Set-classifier with Class-specific Risk Bounds (SCRIB) that assigns multiple labels to each example and controls class-specific prediction risks.
result SCRIB obtained class-specific risks 35%-88% closer to the target risks than baseline methods.

Understanding why a model makes a certain prediction can be as crucial as the prediction's accuracy in many applications. However, the highest accuracy for large modern datasets is often achieved by complex models that even experts struggle to interpret, such as ensemble or deep learning models, creating a tension betw…

2017-05-22abs ↗pdf ↗

KCal calibrates deep networks by embedding logits in a metric space.

problem Overconfident predictions from DNNs, especially in high-risk applications.
method KCal learns a metric space on the penultimate-layer latent embedding and generates predictions using kernel density estimates.
result KCal provides a provable full calibration guarantee and consistently outperforms baselines.

Paper tackles fault classification in time series data with deep neural networks.

problem Fault classification over a future horizon in multidimensional time series data with class imbalances.
method Proposes a multi-label recurrent neural network with a new cost function to address class imbalances.
result The proposed algorithm outperforms state-of-the-art techniques in F1-score, precision, and recall.

We consider the multi-class classification problem when the training data and the out-of-sample test data may have different distributions and propose a method called BCOPS (balanced and conformal optimized prediction sets). BCOPS constructs a prediction set C(x)C(x) as a subset of class labels, possibly empty. It tries …

2019-05-10abs ↗pdf ↗

A new classifier improves one-class predictions on unevenly sampled data.

problem Non-uniformly sampled data affects one-class classifier performance.
method Dynamic decision boundary based on minimum spanning tree.
result Proves effectiveness and robustness compared to state-of-the-art classifiers.

New methods improve neural directed link prediction across all sub-tasks.

problem Directed link prediction requires handling edge directionality and bidirectionality, not just edge existence.
method Proposes three strategies: Multi-Class Framework, Multi-Objective, and Scalarized approaches.
result Improved performance across all three sub-tasks of directed link prediction.

MMDCP improves outlier detection and classification with adaptive prediction sets.

problem Label shift and distribution differences in multi-class settings.
method Combines distance measures with full conformal prediction for adaptive prediction sets.
result Valid coverage and effective control of class-wise false discovery rate (CW-FDR).

PULSE estimator improves prediction in causal inference with bounded interventions.

problem Optimizing causal models for bounded interventions.
method Relates K-class estimators to anchor regression, introduces PULSE estimator for minimization of mean squared prediction error with bounded constraints.
result PULSE estimator outperforms other estimators in real data and simulation experiments, especially in weak instrument settings.

Proposes a new method for multi-class classification with well-calibrated predictions.

problem Improving the accuracy and reliability of multi-class classification models.
method Trains data in a latent space induced by an (n1)(n-1)-dimensional simplex, then extends and fits a regression model.
result Demonstrates a well-calibrated classifier with improved prediction and calibration properties.

Tomal et al. (2015) introduced the notion of "phalanxes" in the context of rare-class detection in two-class classification problems. A phalanx is a subset of features that work well for classification tasks. In this paper, we propose a different class of phalanxes for application in regression settings. We define a "R…

2017-07-03abs ↗pdf ↗