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

5099149198 · May 202619922001200920172026
48 results for logistic risk

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.

New research shows logistic regression can achieve optimal error rate for agnostic learning of halfspaces.

problem Agnostic learning of homogeneous halfspaces with logistic loss.
method Constructing a well-behaved distribution and using logistic regression with additional convex optimization steps.
result Logistic regression can achieve Ω(extrmOPT)Ω(\sqrt{ extrm{OPT}}) misclassification risk, matching the upper bound.

SMP estimator improves density and logistic regression under misspecification.

problem Improper estimator for optimal excess risk in misspecified models.
method SMP minimizes a new excess risk bound for statistical learning.
result SMP achieves optimal excess risk of O((d+B2R2)/n)O((d + B^2R^2)/n) for logistic regression.

Early stopping improves logistic regression's calibration and consistency in high dimensions.

problem Improving the statistical performance of gradient descent in overparameterized logistic regression.
method Investigates the effects of early stopping on gradient descent in logistic regression.
result Early-stopped gradient descent is well-calibrated and statistically consistent, while asymptotic gradient descent is not.

We apply the network Lasso to solve binary classification and clustering problems for network-structured data. To this end, we generalize ordinary logistic regression to non-Euclidean data with an intrinsic network structure. The resulting "logistic network Lasso" amounts to solving a non-smooth convex regularized empi…

2018-05-07abs ↗pdf ↗

Selective neural network improves credit risk prediction while maintaining interpretability.

problem Improving credit risk prediction accuracy while maintaining interpretability for financial regulators.
method Introducing a neural network with a selective option to distinguish between linear and non-linear datasets.
result For most datasets, logistic regression is sufficient and interpretable, while for specific data portions, a shallow neural network model provides better accuracy.

Machine learning improves joint default assessment by capturing non-linear dependencies.

problem Capturing non-linear dependencies among covariates for accurate joint default assessment.
method Application of machine learning techniques to credit card dataset, comparing with logistic regression.
result Machine learning outperforms logistic regression in assessing portfolio riskiness.

Paper generalizes Gaussian universality and CGMT to dependent data, impacting data augmentation in high-dimensional logistic regression.

problem Limitation of Gaussian universality and CGMT in handling dependent data.
method Generalizes Gaussian universality and CGMT to dependent data (block dependence, m-dependence, mixing). Establishes a novel CGMT framework.
result Gaussian universality holds for high-dimensional logistic regression under various types of dependence.

Bayesian logistic regression improves clinical risk prediction models over time.

problem Improving clinical risk prediction models after deployment to adapt to temporal shifts.
method Bayesian logistic regression (BLR) and Markov variant (MarBLR) for online recalibration and revision of prediction models.
result BLR and MarBLR consistently outperform static models and other online revision methods, improving average AUC and calibration index.

Paper derives convergence rates for NPMLE in Hellinger distance using deep neural networks.

problem Difficulty in proving convergence of excess risk in nonparametric logistic regression.
method Unified approach for analyzing NPMLE, deriving convergence rates in Hellinger distance.
result Derives nearly optimal convergence rates for NPMLE with deep neural networks.

New algorithm reduces online logistic regression regret without exponential constant.

problem Improper learning in online logistic regression with logarithmic regret.
method Regularized empirical risk minimization with surrogate losses.
result Regret scaling as O(B log(Bn)) with low computational complexity.

The study examines how class imbalance impacts logistic regression models in low-default credit portfolios.

problem The impact of class imbalance on logistic regression models in low-default credit portfolios.
method Simulation study with controlled data-generating mechanisms to vary class imbalance and predictor-response association strength.
result Classification accuracy decreases significantly as event rate decreases, and optimal cut-off shifts with imbalance.

We present αα-loss, α[1,]α\in [1,\infty], a tunable loss function for binary classification that bridges log-loss (α=1α=1) and 00-11 loss (α=α= \infty). We prove that αα-loss has an equivalent margin-based form and is classification-calibrated, two desirable properties for a good surrogate loss function for the ideal y…

2019-02-12abs ↗pdf ↗

SGD converges globally to logistic loss minima for two-layer nets.

problem Global convergence of SGD for logistic loss on two-layer neural nets.
method Demonstrates existence of Frobenius norm regularized logistic loss functions as Villani functions, proving convergence and exponential rate.
result SGD converges globally to the global minima of appropriately regularized logistic empirical risk of depth 2 nets.

Modeling bank leverage dynamics to understand systemic risk in financial markets.

problem Understanding systemic risk in financial markets triggered by bank leverage dynamics.
method Developed a dynamical model of bank leverage, analyzing coupled dynamics in isolated and interconnected bank models.
result Identified a procyclical feedback loop between asset prices and leverage, leading to chaotic dynamics.

The paper calculates moments and conditional risks for skewed elliptical distributions.

problem Estimating moments and tail conditional risks for skewed elliptical distributions.
method Derives explicit expressions for multivariate doubly truncated moments and conditional risks for generalized skew-elliptical distributions.
result Explicit formulas for multivariate doubly truncated moments and conditional risks are derived for various skewed elliptical distributions.

Revises logistic-softmax likelihood for Bayesian meta-learning in few-shot classification.

problem Inherent uncertainty in logistic-softmax leads to suboptimal performance in meta-learning.
method Redesigns logistic-softmax likelihood with a temperature parameter for better control of prior confidence.
result Achieves well-calibrated uncertainty estimates and comparable/superior performance on benchmark datasets.

Gradient descent, when applied to the task of logistic regression, outputs iterates which are biased to follow a unique ray defined by the data. The direction of this ray is the maximum margin predictor of a maximal linearly separable subset of the data; the gradient descent iterates converge to this ray in direction a…

2018-03-20abs ↗pdf ↗

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.

Rotation invariant algorithms fail with hard labels sampled from sparse targets.

problem Rotation invariant algorithms fail to learn from hard labels sampled from sparse targets.
method Proving the excess risk of rotation invariant algorithms and proposing a simple non-rotation invariant algorithm.
result Rotation invariant algorithms incur an excess risk of $Ω\left(\frac{d-1}{n} ight)$, while non-rotation invariant algorithms have an excess risk of $O\left(\frac{s\log d}{n} ight).

Large stepsizes can accelerate gradient descent for logistic regression.

problem Optimizing logistic regression with large stepsizes.
method Gradient descent with large stepsize for 2\ell_2-regularized logistic regression.
result Large stepsizes can achieve O~(κ)\widetilde{\mathcal{O}}(\sqrtκ) convergence, improving over O~(κ)\widetilde{\mathcal{O}}(\sqrtκ) from classical theory.

This paper compares ML algorithms for PD prediction, finding XGBoost to be the most effective.

problem Predicting the probability of default in loan portfolios.
method Comparison of five ML algorithms (Random Forests, Decision Trees, XGBoost, Gradient Boosting, AdaBoost) with logistic regression.
result XGBoost outperforms other ML algorithms for PD prediction.

The paper analyzes the maximum margin algorithm's performance on noisy data.

problem Analyzing the performance of maximum margin algorithm on noisy data.
method Finite-sample analysis of maximum margin algorithm applied to noisy data.
result The maximum margin algorithm can achieve nearly optimal population risk with sufficient over-parameterization.

Model predicts higher education dropout risk with interpretable parameters.

problem Predicting and understanding student dropout risk in higher education.
method Sparse interpretable post-clustering logistic regression.
result Model identifies distinct dropout risk subgroups within the student population.

Prognostic scores improve logistic regression analysis in RCTs with binary outcomes.

problem Non-collapsibility in logistic regression analysis of RCTs with binary endpoints.
method Prognostic score adjustment using AI predictions to address non-collapsibility.
result Prognostic score adjustment increases power or reduces sample size for estimating conditional odds ratios.

Cyanure offers efficient solvers for linear model learning in Python, C++, and more.

problem Efficiently solving empirical risk minimization problems for linear models.
method Stochastic variance-reduced optimization with acceleration mechanisms.
result Handles a wide range of loss and regularization functions.

This work proves L2L_2-regularized ERM controls smCE without post-hoc correction.

problem Calibration of predicted probabilities in machine learning models.
method Canonical L2L_2-regularized empirical risk minimization.
result Theoretical proof that smCE is controlled by ERM without post-hoc correction.

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 ↗

A method for safe online classification reduces test costs while maintaining low error rates.

problem Sequential testing for binary disease outcomes with unknown logistic model parameters.
method Joint estimation of logistic parameter and feature distribution with a conservative threshold.
result Achieves target error with high probability and requires minimal excess tests.

A new hybrid Newton algorithm improves convergence in logistic regression.

problem Solving large-scale binary classification problems efficiently.
method Proposes a hybrid stochastic Newton algorithm with two weighted components in the Hessian matrix estimation.
result Proves almost sure convergence to the true parameter of logistic regression.

Survival analysis models predict loan write-off risk under IFRS 9.

problem Estimating loan write-off probabilities in credit risk modeling.
method Discrete-time hazard model and conditional inference survival tree compared to cross-sectional logistic regression.
result Discrete-time hazard model outperforms other two-stage LGD-models.

We consider the problem of link prediction, based on partial observation of a large network, and on side information associated to its vertices. The generative model is formulated as a matrix logistic regression. The performance of the model is analysed in a high-dimensional regime under a structural assumption. The mi…

2018-03-19abs ↗pdf ↗

Large GD stepsizes improve margins and speed up training for non-homogeneous networks.

problem Training efficiency and margin improvement in non-homogeneous two-layer networks.
method Investigation of two distinct phases in GD training, showing margin growth and empirical risk decrease.
result Large GD stepsizes lead to faster convergence and improved margins in non-homogeneous networks.

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 ↗