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

Trend · papers per month

61122182243 · Jun 202019922001200920172026
48 results for multi-class logistic regression

New method estimates density ratio for well-separated distributions using multi-class logistic regression.

problem Challenges in estimating density ratio for well-separated distributions.
method Uses multi-class logistic regression with auxiliary densities to estimate log(p/q).
result Demonstrates superior performance on density ratio estimation, mutual information, and representation learning tasks.

Study develops a robust federated logistic regression for financial data analysis.

problem Analyzing financial data in a federated setting while protecting privacy and interpretability.
method Proposes a robust federated logistic regression framework balancing privacy, interpretability, and robustness.
result Demonstrates comparable performance to classical centralized algorithms on both IID and non-IID data, including outliers.

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 ↗

Paper proposes MMVFL for multi-class VFL with multiple participants.

problem Privacy-preserving multi-class VFL with multiple participants.
method Extends multi-view learning to enable label sharing among multiple VFL participants.
result MMVFL effectively shares label information among multiple VFL participants and matches multi-class classification performance.

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 ↗

Regulatory compliance is an organization's adherence to laws, regulations, guidelines and specifications relevant to its business. Compliance officers responsible for maintaining adherence constantly struggle to keep up with the large amount of changes in regulatory requirements. Keeping up with the changes entail two …

2019-08-20abs ↗pdf ↗

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.

We consider multi-agent stochastic optimization problems over reproducing kernel Hilbert spaces (RKHS). In this setting, a network of interconnected agents aims to learn decision functions, i.e., nonlinear statistical models, that are optimal in terms of a global convex functional that aggregates data across the networ…

2017-10-11abs ↗pdf ↗

Federated Learning with L0 constraint improves sparsity and performance.

problem Inherent sparsity in data and models leads to dense models with poor generalizability.
method L0 constraint on model density achieved through probabilistic gates and federated stochastic gradient descent.
result Achieves target sparsity (rho) in FL with minimal loss in statistical performance.

We examine gradient descent on unregularized logistic regression problems, with homogeneous linear predictors on linearly separable datasets. We show the predictor converges to the direction of the max-margin (hard margin SVM) solution. The result also generalizes to other monotone decreasing loss functions with an inf…

2017-10-27abs ↗pdf ↗

New method deconfounds deep learning feature representations using counterfactual approach.

problem Improving model stability in deep learning models under dataset shifts.
method Adopting last layer features of DNNs trained with softmax activation for logistic regression, and applying counterfactual deconfounding.
result Counterfactual deconfounding can be applied to DNN feature representations, improving model stability.

Study extends learnability equivalence to multi-class and regression, overcoming binary classification limits.

problem Equivalence of online and private learnability in multi-class and regression settings.
method Introduced a novel Littlestone dimension variant and threshold functions for multi-class classification.
result Online learnability implies private learnability in multi-class classification but not in regression.

High dimensional regression benefits from sparsity promoting regularizations. Screening rules leverage the known sparsity of the solution by ignoring some variables in the optimization, hence speeding up solvers. When the procedure is proven not to discard features wrongly the rules are said to be \emph{safe}. In this …

2015-06-11abs ↗pdf ↗

Study local geometry of mixture models via spectral theory, revealing transitions in training dynamics.

problem Understanding the local geometry of high-dimensional mixture models.
method Spectral theory of Hessian and information matrices, focusing on i.i.d. Gaussian mixtures.
result Exact formulas for limits of spectral distribution and outlier eigenvalues, connecting training dynamics to effective dynamics.

Multi-class classification methods based on both labeled and unlabeled functional data sets are discussed. We present a semi-supervised logistic model for classification in the context of functional data analysis. Unknown parameters in our proposed model are estimated by regularization with the help of EM algorithm. A …

2011-02-22abs ↗pdf ↗

A new framework for selecting base classes in multi-class classification boosts accuracy.

problem Selecting the base class in multi-class classification to improve accuracy.
method Introduces a unified framework with parameters (s,g,w)(s,g,w) to search for the base class at each boosting iteration, improving computational efficiency.
result Our framework can achieve better test accuracy than the exhaustive search strategy, providing a robust and reliable scheme.

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 common method of generalizing binary to multi-class classification is the error correcting code (ECC). ECCs may be optimized in a number of ways, for instance by making them orthogonal. Here we test two types of orthogonal ECCs on seven different datasets using three types of binary classifier and compare them with t…

2018-01-27abs ↗pdf ↗

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.

Time series are used in many domains including finance, engineering, economics and bioinformatics generally to represent the change of a measurement over time. Modeling techniques may then be used to give a synthetic representation of such data. A new approach for time series modeling is proposed in this paper. It cons…

2013-12-25abs ↗pdf ↗

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.

Analyzes SGD dynamics on multi-class problems with exact expressions.

problem Analyzing SGD dynamics on multi-class problems.
method Developed a framework for analyzing training and learning rate dynamics using exact expressions.
result Exact expressions for risk and overlap with true signal in terms of ODEs.

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.

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.

Study shows sample complexity for logistic regression with normal covariates.

problem Estimating parameters of logistic regression with normal design.
method Analyzes sample complexity in terms of dimension and inverse temperature.
result Shows two change-points in sample complexity curve based on inverse temperature.

Solving logistic regression with L1-regularization in distributed settings is an important problem. This problem arises when training dataset is very large and cannot fit the memory of a single machine. We present d-GLMNET, a new algorithm solving logistic regression with L1-regularization in the distributed settings. …

2014-11-24abs ↗pdf ↗