arXiv research

New algorithm solves $\ell_0$-norm constrained multilinear logistic regression for tensor data.

Extends RRR to capture nonlinear interactions in multi-response regression.

Derives a primal-dual MLSVD formulation for multilinear data.

Matrix factorizations and their extensions to tensor factorizations and decompositions have become prominent techniques for linear and multilinear blind source separation (BSS), especially multiway Independent Component Analysis (ICA), NonnegativeMatrix and Tensor Factorization (NMF/NTF), Smooth Component Analysis (Smo…

Paper finds a lower bound for estimating low-rank matrices in logistic regression.

Novel bounds for logistic regression coreset construction and feature selection.

Unified framework for sparse logistic regression with nonconvex regularization.

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

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

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

Improves logistic regression performance with nonconvex programming.

Robust TOT regression method handles outliers in tensor data.

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

Maximum likelihood estimator performance in logistic regression analyzed.

We comment on the fact that gradient ascent for logistic regression has a connection with the perceptron learning algorithm. Logistic learning is the "soft" variant of perceptron learning.

Paper introduces imprecise logistic regression for handling uncertain data.

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

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…

PIANO speeds up multinomial logistic regression solving.

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…

A new algorithm approximates logistic regression probabilities efficiently.

Study shows sample complexity for logistic regression with normal covariates.

Logistic regression gets a new, simpler uniform bound.

Proposes MLDP for modeling multilinear data.

Proposes MELODIC family for simultaneous binary logistic regression.

New method forecasts multilinear data using tensor autoregression.

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

Coresets are one of the central methods to facilitate the analysis of large data sets. We continue a recent line of research applying the theory of coresets to logistic regression. First, we show a negative result, namely, that no strongly sublinear sized coresets exist for logistic regression. To deal with intractable…

Improved classifier for PU data using logistic regression.

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

Multilabel classification is an important problem in a wide range of domains such as text categorization and music annotation. In this paper, we present a probabilistic model, Multilabel Logistic Regression with Hidden variables (MLRH), which extends the standard logistic regression by introducing hidden variables. Hid…

Geometrically, tensors of fixed rank form a minimal submanifold.

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

In this work, we study the use of logistic regression in manufacturing failures detection. As a data set for the analysis, we used the data from Kaggle competition Bosch Production Line Performance. We considered the use of machine learning, linear and Bayesian models. For machine learning approach, we analyzed XGBoost…

We introduce Graph-Sparse Logistic Regression, a new algorithm for classification for the case in which the support should be sparse but connected on a graph. We val- idate this algorithm against synthetic data and benchmark it against L1-regularized Logistic Regression. We then explore our technique in the bioinformat…

Improved multiclass logistic regression with lower computational complexity.

Paper proposes a new method for estimating conditional densities using logistic regressions.

Decision trees and logistic regression are one of the most popular and well-known machine learning algorithms, frequently used to solve a variety of real-world problems. Stability of learning algorithms is a powerful tool to analyze their performance and sensitivity and subsequently allow researchers to draw reliable c…

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

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

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…

Large stepsizes can accelerate gradient descent for logistic regression.

Paper introduces data-dependent SSP for private linear and logistic regression.

A successful approach to structured learning is to write the learning objective as a joint function of linear parameters and inference messages, and iterate between updates to each. This paper observes that if the inference problem is "smoothed" through the addition of entropy terms, for fixed messages, the learning ob…

Multi-task learning has shown to significantly enhance the performance of multiple related learning tasks in a variety of situations. We present the fused logistic regression, a sparse multi-task learning approach for binary classification. Specifically, we introduce sparsity inducing penalties over parameter differenc…

SLOE speeds up logistic regression in high dimensions with accurate signal strength estimation.

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

Efficiently selects important variables in high-dimensional logistic regression.