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

Trend · papers per month

80160240320 · Jun 202019922001200920172026
48 results for logistic failure rates

Novel oracle-type inequality for logistic loss in DNNs achieves sharp convergence rates.

problem Generalization analysis for binary classification with DNNs and logistic loss.
method Established an oracle-type inequality to handle the boundedness of the target function.
result Optimal convergence rates for fully connected ReLU DNN classifiers trained with logistic loss.

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.

BAMS uses Bayesian sampling to discover AV failures more efficiently and accurately.

problem Discovering potential failure cases in autonomous vehicles efficiently and accurately.
method Bayesian adaptive multifidelity sampling (BAMS) prioritizes exploration of low performance regions.
result BAMS discovers 10 times more issues than traditional methods with narrower rate estimates.

Study extreme-case Value-at-Risk under IFR distributions, providing guidance for risk management.

problem Understanding extreme-case risk measures under distributional ambiguity and increasing failure rate.
method Characterized extreme-case range Value-at-Risk under mean and variance constraints with increasing failure rate.
result Characterized specific characteristics of extreme-case distributions under IFR constraints.

The paper proves neural networks' consistency and optimal convergence rates for various function classes.

problem Proving neural networks' consistency and optimal convergence rates for diverse function classes.
method Analyzes wide and deep ReLU neural networks trained on logistic loss and Kolmogorov-Donoho optimal function classes.
result Proves universal consistency and minimax optimal convergence rates for neural networks.

The paper establishes convergence rates for MoE models in classification problems.

problem Understanding the behavior of MoE models in classification settings.
method Established convergence rates for density and parameter estimation in softmax gating multinomial logistic MoE models.
result Parameter estimation rates are significantly improved with a novel modified softmax gating function.

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.

Study shows deep linear networks can converge to flatter minima at large learning rates.

problem Understanding the implicit bias of deep linear networks at large learning rates.
method Characterization of deep linear networks for binary classification using logistic loss in the large learning rate regime.
result Gradient descent iterates converge to a flatter minimum in the catapult phase for certain data separation conditions.

Gradient descent with logistic loss can interpolate deep networks with smoothed ReLU activations under certain conditions.

problem Conditions for gradient descent to drive logistic loss to zero in deep networks with smoothed ReLU activations.
method Gradient descent applied to fixed-width deep networks with smoothed ReLU approximations (e.g., Swish, Huberized ReLU).
result Gradient descent can drive logistic loss to zero under specific conditions, providing bounds on convergence rate.

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.

This paper proposes a cascading failure mitigation strategy based on Reinforcement Learning (RL) method. Firstly, the principles of RL are introduced. Then, the Multi-Stage Cascading Failure (MSCF) problem is presented and its challenges are investigated. The problem is then tackled by the RL based on DC-OPF (Optimal P…

2019-08-19abs ↗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.

FOLKLORE algorithm speeds up online multiclass logistic regression.

problem Efficiently solving online multiclass logistic regression without high computational cost.
method Developed FOLKLORE algorithm with improved runtime and regret bound.
result First practical algorithm for online multiclass logistic regression.

Study predicts P2P lending platform failures using machine learning.

problem Predicting failures of P2P lending platforms in China.
method Used machine learning models with filter and wrapper methods, forward selection, and backward elimination.
result Identified robust variables for predicting platform failures with high AUC and F1 scores.

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 ↗

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 ↗

Improved VB algorithm for high-dimensional logistic regression with theoretical guarantees.

problem Sparse high-dimensional logistic regression model selection.
method Spike and slab variational Bayes approximation.
result Optimal convergence rates in 2\ell_2 and prediction loss for sparse truths.

Gradient descent converges to a small neighborhood of the true parameter in logistic regression with Gaussian design.

problem Estimating the parameter in logistic regression with Gaussian design.
method Gradient descent with small stepsize and large stepsize, using approximate invertibility condition and eigenvalue analysis.
result Gradient descent achieves an 2\ell_2 error of order O(θ25d/n)O(\sqrt{\|θ^*\|_2^5d/n}).

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.

Learning linear predictors with the logistic loss---both in stochastic and online settings---is a fundamental task in machine learning and statistics, with direct connections to classification and boosting. Existing "fast rates" for this setting exhibit exponential dependence on the predictor norm, and Hazan et al. (20…

2018-03-25abs ↗pdf ↗

We improve MoE models for classification with rigorous guarantees and practical methods.

problem Limited guarantees for stable maximum-likelihood training and model selection in softmax-gated MoE models.
method Derived a batch MM algorithm with closed-form updates, proved finite-sample rates, and developed a dendrogram selector.
result Achieved near-parametric optimal rates for parameter recovery and improved accuracy over baselines.

Prior-weighted logistic regression has become a standard tool for calibration in speaker recognition. Logistic regression is the optimization of the expected value of the logarithmic scoring rule. We generalize this via a parametric family of proper scoring rules. Our theoretical analysis shows how different members of…

2013-07-30abs ↗pdf ↗

New research shows Byzantine failures hurt generalization more than data poisoning in robust distributed learning.

problem Generalization in robust distributed learning algorithms under Byzantine failures vs. data poisoning.
method Algorithmic stability analysis of robust distributed learning algorithms.
result Byzantine failures yield strictly worse generalization rates than data poisoning.

In this paper, we propose a general framework to learn a robust large-margin binary classifier when corrupt measurements, called anomalies, caused by sensor failure might be present in the training set. The goal is to minimize the generalization error of the classifier on non-corrupted measurements while controlling th…

2015-07-16abs ↗pdf ↗

For the problem of multi-class linear classification and feature selection, we propose approximate message passing approaches to sparse multinomial logistic regression (MLR). First, we propose two algorithms based on the Hybrid Generalized Approximate Message Passing (HyGAMP) framework: one finds the maximum a posterio…

2015-09-15abs ↗pdf ↗

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

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.

Study improves covariance estimation for SGD under Markovian data, matching best rates.

problem Improving covariance estimation for SGD in Markovian data settings.
method Online overlapping batch-means covariance estimator for SGD under Markovian sampling.
result Established convergence rates for covariance estimation under Markovian sampling.

Logistic regression models are a popular and effective method to predict the probability of categorical response data. However inference for these models can become computationally prohibitive for large datasets. Here we adapt ideas from symbolic data analysis to summarise the collection of predictor variables into his…

2019-12-09abs ↗pdf ↗

New bounds on trajectory safety in training models with Langevin Dynamics.

problem Bounding the probability of a model's trajectory staying away from a designated failure region.
method Analyzes Langevin dynamics on smooth, strongly convex loss landscapes, introducing shape-free and local relaxation bounds.
result The in-set probability relaxes to the static value after a burn-in time of order d, using only the global spectral gap of the loss.

The paper explores how benign overfitting occurs in heavy-tailed input distributions.

problem Understanding overfitting in heavy-tailed input distributions.
method Analysis of maximum margin classifiers on unregularized logistic loss with gradient descent.
result Linear classifiers trained under certain conditions can asymptotically achieve the noise level as misclassification error.

The problem of stock hedging is reconsidered in this paper, where a put option is chosen from a set of available put options to hedge the market risk of a stock. A formula is proposed to determine the probability that the potential loss exceeds a predetermined level of Value-at-Risk, which is used to find the optimal s…

2011-10-02abs ↗pdf ↗