An ensemble approach learns vector-weighted formulae for RLR.
problem Learning Relational Logistic Regression (RLR) with vector-weighted features.
method Functional-gradient boosting methods for probabilistic logic models.
result Our approach outperforms other methods for learning RLR.
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.
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…
Proposes MELODIC family for simultaneous binary logistic regression.
problem Simultaneous analysis of multiple binary response variables.
method Defines models in a reduced Euclidean space using a distance rule.
result Improves predictive accuracy through model interdependence.
Improved learning of relational models from partial network data.
problem Inaccurate parameter estimates for relational models from network samples.
method Stochastic gradient descent for relational logistic regression from partial network crawls.
result Accurate parameter estimates and confidence intervals achieved.
Relational logistic regression (RLR) is a representation of conditional probability in terms of weighted formulae for modelling multi-relational data. In this paper, we develop a learning algorithm for RLR models. Learning an RLR model from data consists of two steps: 1- learning the set of formulae to be used in the m…
New weighted Lasso estimates improve logistic regression performance with measurement error.
problem Improper Lasso estimates in sparse logistic regression with equal penalties.
method Proposed weighted Lasso estimates using McDiarmid inequality for non-asymptotic oracle inequalities.
result Finite sample behavior illustrated by non-asymptotic oracle inequalities for estimation and prediction errors.
Logistic regression connects to perceptron learning via gradient ascent.
problem No specific problem stated; focuses on connection between algorithms.
method Gradient ascent for logistic regression compared to perceptron learning.
result Gradient ascent for logistic regression is a soft variant of perceptron learning.
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…
In this article supervised learning problems are solved using soft rule ensembles. We first review the importance sampling learning ensembles (ISLE) approach that is useful for generating hard rules. The soft rules are then obtained with logistic regression from the corresponding hard rules. In order to deal with the p…
Proposes a method to identify relevant genes in autism-related diseases using auxiliary information.
problem Identifying relevant genes in autism-related diseases from diverse data sources.
method Uses logistic regression to filter irrelevant genes and clusters relevant genes into cohesive groups using adjacency matrix.
result Superior performance and robustness in finite samples observed in simulation studies.
Paper finds a lower bound for estimating low-rank matrices in logistic regression.
problem Estimating low-rank coefficient matrices in logistic regression.
method Derives a minimax lower bound on the risk.
result The bound depends on matrix dimensions, rank, and sample size.
Deep learning model explains breast cancer subtypes using logistic regression.
problem Clarifying the mechanisms of breast cancer subtypes for better treatment.
method Developed a PWL model that generates custom-made logistic regression for each patient.
result The PWL model reveals genes relevant to cell cycle-related pathways.
A method for logistic regression inference using both internal and external data.
problem Inability to estimate intercept and marginal case proportion in case-control logistic regression.
method Empirical likelihood approach integrating internal and external data.
result Intercept parameter becomes identifiable with external information, and all parameters are estimable consistently.
Novel bounds for logistic regression coreset construction and feature selection.
problem Efficiently summarize and reduce logistic regression inputs.
method Feature space sketching for logistic regression.
result Tight bounds for coreset construction and feature selection.
Unified framework for sparse logistic regression with nonconvex regularization.
problem Sparse logistic regression with nonconvex regularization.
method Unified framework, line search criteria for nonconvex terms.
result Effective classification and feature selection at lower computational cost.
Improves logistic regression performance on imbalanced data.
problem Imbalanced data leads to all labels being estimated as majority class.
method Uses F-measure optimization to estimate relative density ratio and approximate relative F-measure.
result Proposed method improves logistic regression performance on imbalanced data.
Graph-Sparse Logistic Regression for sparse and connected support classification.
problem Sparse and connected support classification problems.
method Introduces Graph-Sparse Logistic Regression algorithm.
result Validated and benchmarked against L1-regularized Logistic Regression.
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.
RelNN models object properties alongside relations for relational learning.
problem Combining deep learning with first-order logic for noisy domains.
method Developed RelNNs by adding hidden layers to relational logistic regression, learning latent properties for objects.
result Initial experiments show RelNNs are promising models for relational learning.
Improved sketching for logistic and ℓ1 regression with near-linear dimensions.
problem Efficiently approximate ℓ1 and logistic regression problems. method New sketching techniques achieving near-linear dimensions for both problems.
result Achieved near-linear sketching dimensions for ℓ1 and logistic regression. Naive Bayes can be used as a discriminative classifier, matching the definition of logistic regression.
problem The definition of generative and discriminative classifiers.
method Comparing Naive Bayes and logistic regression, showing they can be used in either generative or discriminative ways.
result Naive Bayes can be used as a discriminative classifier.
New method creates coresets for logistic regression, even for hard data.
problem Creating efficient coresets for logistic regression analysis.
method Introduce a complexity measure μ(X) and a sensitivity sampling scheme for bounded μ(X) complexity.
result First provably sublinear (1±ε)-coreset for logistic regression.
Paper introduces MLRH, a probabilistic model for multilabel classification.
problem Multilabel classification challenges in various domains.
method Introduces hidden variables to relax one-hot-encoding in logistic regression.
result Probabilistic model achieves competitive performance compared to other algorithms.
Safe screening rules reduce computation time in logistic regression with ℓ0−ℓ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.
Improves logistic regression performance with nonconvex programming.
problem Stochastic generalized linear regression with chance constraints.
method Nonconvex programming techniques, clustering, quantile estimation.
result Over 1 to 2 percent improvement in model performance.
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.
Paper introduces imprecise logistic regression for handling uncertain data.
problem Uncertainties in data prevent traditional logistic regression from being applied effectively.
method Develops imprecise logistic regression model using intervals of possible values.
result Clearly expresses epistemic uncertainty in predictions.
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.
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…
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.
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.
This paper analyzes stability of decision trees and logistic regression.
problem Stability of decision trees and logistic regression is analyzed to understand their performance and sensitivity.
method Two stability notions (hypothesis and pointwise hypothesis stability) are derived for decision trees and logistic regression. The stability of decision trees depends on the number of leaves, while for logistic regression, it depends on the smallest eigenvalue of the Hessian matrix. Upper bounds on generalization error are constructed.
result Logistic regression is not a stable learning algorithm.
Paper compares SVM and Bayesian Logistic Regression for breast cancer diagnosis.
problem Improving breast cancer diagnosis accuracy using machine learning.
method Used SVM, Bayesian Logistic Regression, and K-Nearest-Neighbors for classification.
result SVM outperformed other classifiers, closely matched by Bayesian Logistic Regression.
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.
Logistic regression gets a new, simpler uniform bound.
problem Finding a uniform bound for logistic regression's empirical risk.
method PAC-Bayes approach with second-order expansion and Rademacher-complexity bounds.
result Provides a dimension-free uniform concentration bound.
Logistic regression complexity depends on input distribution and correlations.
problem Understanding the complexity of logistic regression models with binary inputs.
method Analyzing the number of indistinguishable distributions and correlations among inputs.
result Logistic models with binary inputs have complexity that depends on input distribution and correlations.
Study uses logistic regression and association rules to identify early symptoms of malignant mesothelioma.
problem Difficult diagnosis of malignant mesothelioma leading to late-stage detection and poor patient survival.
method Implemented logistic regression and developed association rules to identify early symptoms.
result Categorical logistic regression improved training accuracy from 72.30% to 81.40%.
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. …
The paper shows how variable discretization and cost-sensitive logistic regression improve credit scoring models on imbalanced data.
problem Bias in classification models on imbalanced datasets.
method Variable discretization and cost-sensitive logistic regression.
result Improves model performance on imbalanced credit scoring data and other domains.
Improved classifier for PU data using logistic regression.
problem Analysis of Positive Unlabeled data under SCAR assumption.
method Fitting misspecified logistic regression model to PU data.
result The classifier performs on par or better than competitors on real data sets.
Regularization improves logistic regression performance in high-dimensional settings.
problem Improving logistic regression in scenarios with many parameters and observations.
method Introducing a convex regularizer to the negative log-likelihood function to encourage desired structures.
result Explicit expressions for various performance metrics of regularized logistic regression are derived.
Proposes a nonconvex optimization method for sparse logistic regression.
problem Sparse logistic regression with weakly convex regularization.
method Proximal gradient descent for solving nonconvex optimization problem.
result Proves local optimality conditions and convergence of the method.
A neural network solves logistic regression with ℓ1 regularization efficiently.
problem Efficiently solving logistic regression with ℓ1 regularization due to non-differentiability of ℓ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.
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 L2 regularisation using divergent Taylor expansion. result Approximation approach is invalid for robust constraints and general neural network topologies.
Improved logistic regression for multi-omics data improves prediction and variable selection.
problem Predicting binary class labels from multi-omics datasets with varying characteristics.
method Two-step penalized logistic regression with separate variable selection for each data layer.
result Our approach selects more relevant predictors and achieves comparable prediction performance.
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…
Paper proposes a faster federated learning method for logistic regression.
problem Federated learning for logistic regression with disjoint feature sets.
method Quasi-Newton method under additively homomorphic encryption.
result Significant reduction in communication rounds with minimal additional cost.