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,657 papers · 148 categories

Trend · papers per month

52105157209 · Jun 202019922001200920172026
48 results for screening classifiers

The paper addresses fairness issues in screening classifiers, proposing within-group monotonicity to avoid unfair treatment of qualified candidates.

problem Within-group unfairness in screening classifiers using calibrated models.
method Introducing within-group monotonicity as a property to avoid unfair treatment and developing an efficient post-processing algorithm based on dynamic programming.
result Within-group monotonicity can be achieved efficiently and often at a small cost, improving fairness without significantly compromising prediction accuracy.

Sparse classifiers such as the support vector machines (SVM) are efficient in test-phases because the classifier is characterized only by a subset of the samples called support vectors (SVs), and the rest of the samples (non SVs) have no influence on the classification result. However, the advantage of the sparsity has…

2014-01-27abs ↗pdf ↗

Study assesses deep neural networks' robustness in mammogram images.

problem Understanding deep neural networks' robustness in mammogram images for breast cancer screening.
method Measuring sensitivity to four perturbations and analyzing low-pass filtering effects.
result Mammogram image classifiers are sensitive to perturbations similar to natural images, but low-pass filtering degrades clinically meaningful features.

A modification of the confidence screening mechanism based on adaptive weighing of every training instance at each cascade level of the Deep Forest is proposed. The idea underlying the modification is very simple and stems from the confidence screening mechanism idea proposed by Pang et al. to simplify the Deep Forest …

2019-01-04abs ↗pdf ↗

The sparse representation classifier (SRC) is shown to work well for image recognition problems that satisfy a subspace assumption. In this paper we propose a new implementation of SRC via screening, establish its equivalence to the original SRC under regularity conditions, and prove its classification consistency for …

2019-06-04abs ↗pdf ↗

Develops a continuous compliance index for Islamic equity screening.

problem Binary rulebooks lead to inconsistent compliance assessment of firms.
method Integrates six leading financial and business activity standards into a single continuous index.
result Firms with the same pass/fail label can differ significantly in compliance strength.

Breast density classification is an essential part of breast cancer screening. Although a lot of prior work considered this problem as a task for learning algorithms, to our knowledge, all of them used small and not clinically realistic data both for training and evaluation of their models. In this work, we explore the…

2017-11-10abs ↗pdf ↗

There are various algorithms and methodologies used for automated screening of cervical cancer by segmenting and classifying cervical cancer cells into different categories. This study presents a critical review of different research papers published that integrated AI methods in screening cervical cancer via different…

2018-11-02abs ↗pdf ↗

The support vector machine (SVM) is a widely used method for classification. Although many efforts have been devoted to develop efficient solvers, it remains challenging to apply SVM to large-scale problems. A nice property of SVM is that the non-support vectors have no effect on the resulting classifier. Motivated by …

2013-10-25abs ↗pdf ↗

Bayesian neural networks improve SHD classification and uncertainty quantification.

problem Improving screening for structural heart disease using noninvasive ECG and echocardiography.
method Comparing frequentist and Bayesian neural network classifiers on the EchoNext dataset.
result Bayesian classifiers provide more robust uncertainty quantification.

This paper treats the problem of screening for variables with high correlations in high dimensional data in which there can be many fewer samples than variables. We focus on threshold-based correlation screening methods for three related applications: screening for variables with large correlations within a single trea…

2011-02-06abs ↗pdf ↗

The paper tackles imbalanced classification under operational constraints, proposing a framework to maximize sensitivity.

problem Detecting minority class observations under severe class imbalance and operational constraints.
method Formal classification framework under capacity constraints, maximizing sensitivity while respecting a user-defined label limit.
result The optimal classifier under capacity constraints is equivalent to the Bayes classifier with reweighted prior probabilities.

New AI platform screens portfolios for desirable firms and news.

problem Optimizing portfolio selection with AI.
method Two LLM agents screen for firm fundamentals and news sentiment. Agents deliberate to generate buy/sell signals. High-dimensional estimation determines optimal weights.
result Screened portfolio's Sharpe ratio consistently estimates target, superior to baseline and conventional approaches.

A new screening method for high-dimensional data reduces computational cost.

problem Challenges in variable selection for ultrahigh-dimensional linear regression.
method Ordering absolute sample ridge partial correlations to screen variables.
result The method provides sure screening property without strong assumptions.

We study safe screening for metric learning. Distance metric learning can optimize a metric over a set of triplets, each one of which is defined by a pair of same class instances and an instance in a different class. However, the number of possible triplets is quite huge even for a small dataset. Our safe triplet scree…

2018-02-12abs ↗pdf ↗

In this paper we develop the notion of screen isoparametric hypersurface for null hypersurfaces of Robertson-Walker spacetimes. Using this formalism we derive Cartan identities for the screen principal curvatures of null screen hypersurfaces in Lorentzian space forms and provide a local characterization of such hypersu…

2017-11-21abs ↗pdf ↗

Recently, to solve large-scale lasso and group lasso problems, screening rules have been developed, the goal of which is to reduce the problem size by efficiently discarding zero coefficients using simple rules independently of the others. However, screening for overlapping group lasso remains an open challenge because…

2014-10-25abs ↗pdf ↗

Efficiently allocate budgets for LLM-assisted virtual screening to reduce costs.

problem Reducing the cost of evaluating alternatives in large-scale screening tasks.
method Propose a top-mm greedy evaluation mechanism and the EFG-mm algorithm for efficient budget allocation.
result Prove that EFG-mm is both sample-optimal and consistent in large-scale virtual screening.

A new method reduces feature screening cost from O(np)O(np) to O(np)O(\sqrt{n}p).

problem Eliminating non-informative features in ultrahigh-dimensional datasets.
method Adaptive subsampling method based on multi-armed bandit problem.
result The proposed method retains sure screening property and comparable performance to SIS.

To find efficient screening methods for high dimensional linear regression models, this paper studies the relationship between model fitting and screening performance. Under a sparsity assumption, we show that a subset that includes the true submodel always yields smaller residual sum of squares (i.e., has better model…

2012-12-04abs ↗pdf ↗

Variable screening is a fast dimension reduction technique for assisting high dimensional feature selection. As a preselection method, it selects a moderate size subset of candidate variables for further refining via feature selection to produce the final model. The performance of variable screening depends on both com…

2015-02-24abs ↗pdf ↗

This paper introduces LR-FFS for robust feature screening in federated learning under label shift.

problem Label shift challenges in federated learning for high-dimensional classification.
method Unified feature screening framework, label-shift robust federated feature screening (LR-FFS), federated estimation procedure.
result LR-FFS outperforms existing methods in diverse client environments with varying class distributions, sample sizes, and missing data.

Robust support vector machine (RSVM) has been shown to perform remarkably well to improve the generalization performance of support vector machine under the noisy environment. Unfortunately, in order to handle the non-convexity induced by ramp loss in RSVM, existing RSVM solvers often adopt the DC programming framework…

2019-12-24abs ↗pdf ↗