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

Trend · papers per month

64127191254 · Jun 202019922001200920172026
48 results for penalized logistic regression

Sparse multinomial logistic regression for multiclass classification with feature selection.

problem High-dimensional multiclass classification with a focus on sparse models.
method Penalized maximum likelihood with complexity penalty, feature selection using group Lasso and Slope classifiers.
result Achievement of minimax order in both small and large number of classes regimes.

FILTER model uses fusion penalized logistic threshold regression for high-dimensional data with unknown cut points.

problem Modeling high-dimensional data with unknown cut points and binary responses.
method Fusion penalized logistic threshold regression (FILTER) model with fused lasso penalty for variable selection.
result Established non-asymptotic error bounds for coefficient estimation and model selection consistency.

We consider first order expansions of convex penalized estimators in high-dimensional regression problems with random designs. Our setting includes linear regression and logistic regression as special cases. For a given penalty function hh and the corresponding penalized estimator β^\hatβ, we construct a quantity ηη,…

2019-10-12abs ↗pdf ↗

We propose a new algorithm called PLUTO for building logistic regression trees to binary response data. PLUTO can capture the nonlinear and interaction patterns in messy data by recursively partitioning the sample space. It fits a simple or a multiple linear logistic regression model in each partition. PLUTO employs th…

2014-11-25abs ↗pdf ↗

Paper shows noisy labels can improve PLR variable selection.

problem Variable selection in PLR is challenging due to noisy labels.
method Proposes a novel ADMM-based algorithm to fuse noisy labels.
result Fused noisy labels improve PLR performance in estimation and classification.

We consider high-dimensional binary classification by sparse logistic regression. We propose a model/feature selection procedure based on penalized maximum likelihood with a complexity penalty on the model size and derive the non-asymptotic bounds for the resulting misclassification excess risk. The bounds can be reduc…

2017-06-26abs ↗pdf ↗

New weighted Lasso estimates improve logistic regression performance with measurement error.

problem Improper Lasso estimates in sparse logistic regression with equal penalties.
method Proposed weighted Lasso estimates using McDiarmid inequality for non-asymptotic oracle inequalities.
result Finite sample behavior illustrated by non-asymptotic oracle inequalities for estimation and prediction errors.

Improved logistic regression for multi-omics data improves prediction and variable selection.

problem Predicting binary class labels from multi-omics datasets with varying characteristics.
method Two-step penalized logistic regression with separate variable selection for each data layer.
result Our approach selects more relevant predictors and achieves comparable prediction performance.

Folded concave penalization methods have been shown to enjoy the strong oracle property for high-dimensional sparse estimation. However, a folded concave penalization problem usually has multiple local solutions and the oracle property is established only for one of the unknown local solutions. A challenging fundamenta…

2012-10-22abs ↗pdf ↗

Improved Frank-Wolfe algorithm speeds up training of differentially private LASSO models.

problem Training differentially private LASSO models on sparse data.
method Adapted Frank-Wolfe algorithm for sparse inputs, reducing runtime.
result Training time reduced from O(TDS+TNs)\mathcal{O}(TDS + TNs) to O(NS+TDlogD+TS2)\mathcal{O}(N S + T \sqrt{D} \log{D} + TS^2).

The paper forecasts corporate distress using a novel MIDAS logistic regression method.

problem Forecasting corporate distress with right-censored data, high-dimensional predictors, and mixed-frequency data.
method The paper introduces a novel high-dimensional censored MIDAS logistic regression method that handles censoring through inverse probability weighting and employs a sparse-group penalty for mixed-frequency predictors.
result The method achieves accurate estimation and superior performance in predicting financial distress of Chinese-listed firms.

Uplift models provide a solution to the problem of isolating the marketing effect of a campaign. For customer churn reduction, uplift models are used to identify the customers who are likely to respond positively to a retention activity only if targeted, and to avoid wasting resources on customers that are very likely …

2019-11-28abs ↗pdf ↗

New lower bounds improve logistic log-likelihood optimization and inference.

problem Designing computationally tractable lower bounds for logistic log-likelihoods.
method Developed a piece-wise quadratic lower bound that uniformly improves tangent quadratic minorizers.
result Improves the speed of convergence and accuracy of variational Bayes approximations.

Develops a tool to identify abnormal blood smear results based on CBC tests.

problem Manual review of blood smears by technologists is time-consuming and inconsistent.
method Cost-sensitive Lasso-penalized additive logistic regression combined with stability selection.
result The tool correctly identifies true cutoff values for abnormal smear results.

We consider the problem of estimating the topology of spatial interactions in a discrete state, discrete time spatio-temporal graphical model where the interactions affect the temporal evolution of each agent in a network. Among other models, the susceptible, infected, recovered (SIRSIR) model for interaction events fal…

2010-04-14abs ↗pdf ↗

Prevalidated ridge regression simplifies logistic regression for high-dimensional data.

problem Efficient probabilistic classification in high-dimensional data with logistic regression.
method Developed a prevalidated ridge regression model that matches logistic regression's performance but is more computationally efficient.
result Prevalidated ridge regression achieves similar classification error and log-loss to logistic regression for high-dimensional data.

Improved sketching for logistic and 1\ell_1 regression with near-linear dimensions.

problem Efficiently approximate 1\ell_1 and logistic regression problems.
method New sketching techniques achieving near-linear dimensions for both problems.
result Achieved near-linear sketching dimensions for 1\ell_1 and logistic regression.

Safe screening rules reduce computation time in logistic regression with 02\ell_0-\ell_2 regularization.

problem Efficiently solving logistic regression with many features and regularization.
method Screening rules based on Fenchel dual lower bounds of strong conic relaxations.
result A high percentage of features can be safely removed before solving, leading to substantial speed-up.

A novel transfer learning framework combines multiple data sources for PU learning.

problem Challenges in PU learning due to lack of negative labels and data scarcity.
method Model averaging of heterogeneous data sources, including binary labeled, semi-supervised, and PU data.
result Method outperforms other methods in predictive accuracy and robustness, especially under limited labeled data.

Paper explores connections between loss functions and consistency in binary classification and regression.

problem Consistency in binary classification and regression applications.
method Characterization of conformable loss functions and derivation of a new Huber-type loss function.
result Margin-based loss functions are equivalent to loss functions of squared standardized logistic regression residuals.

Maximum likelihood estimator performance in logistic regression analyzed.

problem Performance of maximum likelihood estimator in logistic regression.
method Sharp non-asymptotic guarantees for existence and excess logistic risk.
result Sharp guarantees for the existence and excess risk of MLE in logistic regression.

A new data-oblivious sketch for logistic regression reduces data size while maintaining approximation accuracy.

problem Efficiently solving logistic regression in one pass over a data stream.
method Data-oblivious sketching approach that reduces data size to poly(μdlog n) weighted points.
result Sketching reduces data size significantly and provides approximation guarantees.

The l1-regularized logistic regression (or sparse logistic regression) is a widely used method for simultaneous classification and feature selection. Although many recent efforts have been devoted to its efficient implementation, its application to high dimensional data still poses significant challenges. In this paper…

2013-07-16abs ↗pdf ↗

PIANO speeds up multinomial logistic regression solving.

problem Handling large datasets and many classes in logistic regression.
method Parallel iterative algorithm based on Majorization Minimization.
result PIANO converges to a stationary point of Multinomial and Sparse Multinomial Logistic Regression.

Logistic regression is a widely used method in several fields. When applying logistic regression to imbalanced data, for which majority classes dominate over minority classes, all class labels are estimated as `majority class.' In this article, we use an F-measure optimization method to improve the performance of logis…

2019-05-07abs ↗pdf ↗

A new algorithm approximates logistic regression probabilities efficiently.

problem Efficiently approximating probabilities in logistic regression for large datasets.
method Randomized sampling-based algorithm with leverage scores.
result Accurate approximations to estimated probabilities with smaller sample sizes.