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

Trend · papers per month

242485727969 · Jun 202019922001200920172026
48 results for logistic networks

Gradient descent with logistic loss can make two-layer networks interpolate binary classification data.

problem Training two-layer networks for binary classification.
method Gradient descent with logistic loss applied to two-layer networks.
result Gradient descent can drive training loss to zero under certain conditions.

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 ↗

A neural network solves logistic regression with 1\ell_1 regularization efficiently.

problem Efficiently solving logistic regression with 1\ell_1 regularization due to non-differentiability of 1\ell_1 norm.
method A simple projection neural network that avoids auxiliary variables and smooth approximations.
result The neural network converges to a solution of the problem with any initial value and outperforms existing methods.

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.

Paper finds dropout noise approximation invalid for logistic regression and neural networks.

problem Invalidity of dropout noise approximation for logistic regression and neural networks.
method Derived equivalence between dropout noise injection and L2L_2 regularisation using divergent Taylor expansion.
result Approximation approach is invalid for robust constraints and general neural network topologies.

Flat solutions don't guarantee generalization for logistic loss in neural networks.

problem Proving flat solutions imply generalization for logistic loss in neural networks.
method Analyzing overparameterized two-layer ReLU networks with univariate input under logistic loss.
result Flat solutions enjoy near-optimal generalization bounds within uncertain sets but can still overfit at infinity.

The paper examines logistic regression in sparse network settings, improving inference under varying degrees of dyadic dependence.

problem Improving inference in logistic regression with sparse network data.
method Sparse network asymptotics, martingale central limit theorem, variance decomposition.
result Sparse network asymptotics lead to better variance estimators for logistic regression.

This paper compares neural networks with traditional methods for churn prediction using financial data.

problem Churn prediction with sequential data and deep neural networks.
method Assesses LSTM neural networks combined with RFM variables against logistic regression models.
result LSTM neural networks outperform traditional methods in churn prediction.

Paper explains learning property of logistic and softmax losses for balanced and imbalanced class data.

problem Understanding and optimizing loss functions for deep neural networks with class imbalances.
method Analyzing necessary conditions for convergence of logistic and softmax losses in CNNs.
result Proposes a novel reweighted logistic loss function that improves performance over softmax loss.

A combined model integrates latent factor and logistic regression for citation network analysis.

problem Insufficient representation by either latent factor or logistic regression alone.
method Proposes a combined model integrating latent factor and logistic regression, with parameter estimation through joint-likelihood and penalty terms.
result The proposed method captures both main technological trends and ad-hoc dependencies in citation networks.

A new method for Bayesian neural networks using probabilistic backpropagation.

problem Approximating posterior distributions in Bayesian neural networks.
method Variational Expectation Propagation (VEP) with probabilistic backpropagation.
result Efficient algorithm for approximate integration over posterior distributions.

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 article compares neural networks and logistic regression for credit scoring and introduces a new probability calibration technique.

problem Improving credit scoring accuracy using machine learning techniques.
method Comparison of logistic regression and neural networks, feature importance assessment, temporal feature inclusion, and SURE probability calibration.
result Neural networks can slightly improve credit scoring performance, and SURE calibration technique enhances probability calibration.

This paper uses robust optimization to analyze supply chain resilience.

problem Supply chain resilience analysis of multi-modal logistics networks.
method Robust optimization with budget-of-uncertainty.
result Interactive effects of network size, disruption scale, and degree on resilience.

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.

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.

The paper models reverse logistics network design considering product uncertainty and risk.

problem Maximizing profits from returned products of uncertain quality and quantity.
method Mixed Integer Non-linear Programming (MINLP) model with CVaR risk measure.
result Considering risk improves profits by more conservatively pricing and sorting products.

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.

Estimates non-parametric logistic model using case-control data and external summary info.

problem Imbalanced binary data in case-control studies.
method Two-step estimation procedure with deep neural network for functional approximation.
result Proposed estimator achieves optimal convergence rate in non-parametric regression.

Analysis of gradient descent on wide neural networks reveals strong generalization.

problem Understanding why wide neural networks trained with logistic loss perform well.
method Characterization of gradient flow limits and comparison to max-margin classifier.
result Margin is independent of ambient dimension, leading to strong generalization.

New mechanism protects neural network weights from privacy attacks during self-supervised learning.

problem Privacy risks during fine-tuning stage of self-supervised learning.
method Proposes a novel differential privacy mechanism using additive logistic noise.
result Reduces membership inference attack accuracy to 50% while maintaining below 5% performance loss.

This paper models how features influence event triggers in high-dimensional networks.

problem Estimating context-dependent networks in high-dimensional marked point processes.
method Leveraging compositional time series and regularization methods, the paper considers autoregressive multinomial and logistic-normal models for network estimation.
result The logistic-normal model leads to a convex negative log-likelihood objective and captures dependence across categories.

The standard linear and logistic regression models assume that the response variables are independent, but share the same linear relationship to their corresponding vectors of covariates. The assumption that the response variables are independent is, however, too strong. In many applications, these responses are collec…

2019-05-08abs ↗pdf ↗

Study analyzes factors influencing healthcare providers' engagement with SMS campaigns.

problem Understanding what drives healthcare providers to engage with SMS campaigns.
method Used logistic regression, random forest, and neural network models to analyze data.
result Identified key factors influencing engagement with SMS campaigns.

Anomaly detection model for large networks identifies attacks with reduced false positives.

problem Detecting anomalies in large, sparse, directed networks.
method Dynamic logistic model with latent factors, variational Bayesian estimation, case-control approximation.
result Model reduces false positives by identifying red team attack with half the detection rate.

This paper revisits the special type of a neural network known under two names. In the statistics and machine learning community it is known as a multi-class logistic regression neural network. In the neural network community, it is simply the soft-max layer. The importance is underscored by its role in deep learning: …

2019-03-29abs ↗pdf ↗