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

Trend · papers per month

3547081,0621,416 · Jun 202019922001200920172026
48 results for logistic model

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.

Proposes logistic-beta process for modeling dependent probabilities with beta marginals.

problem Limited work on flexible and computationally convenient stochastic process extensions for dependent random probabilities.
method Introduces logistic-beta process with logistic transformation and beta marginals, capable of modeling dependence in discrete and continuous domains.
result Logistic-beta processes enable effective posterior inference and design of computationally tractable dependent Bayesian nonparametric models.

Improved confidence bounds for linear logistic model with applications to bandits.

problem Improving confidence bounds for linear logistic model.
method Self-concordant analysis of the logistic loss to avoid dependence on worst-case variance.
result Significant improvement in confidence bounds, avoiding dependence on 1/κ1/κ.

Improved regret bounds for logistic bandits via novel confidence set construction.

problem Dependencies in parameter space for logistic bandits, especially when SdS \geq d.
method Regret-to-confidence-set conversion (R2CS) to construct convex confidence sets.
result Strict improvement in regret bound w.r.t. SS in logistic bandits.

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.

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.

PbP strategy improves logistic model prediction with missing values.

problem Predicting with missing inputs in logistic models.
method Pattern-by-Pattern (PbP) strategy for logistic models with missing values.
result PbP accurately approximates Bayes probabilities under GPMM across various missing data scenarios.

The thesis examines stochastic calculus in option pricing with logistic models and numerical methods.

problem Exploring the application of stochastic calculus in option pricing.
method Monte-Carlo Simulation and machine learning algorithms.
result Insights from Peter Carr and Lorenzo Torricelli's convex duality in continuous models.

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…

2019-12-03abs ↗pdf ↗

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…

2014-11-25abs ↗pdf ↗

New framework optimizes classification trees with logistic loss and 1\ell_1 regularization.

problem Improving interpretability and generalization of classification trees.
method Developed a generalized framework for CTs, incorporating logistic loss and 1\ell_1 regularization.
result Optimal Logistic Tree model outperforms state-of-the-art MIP-based approaches in terms of interpretability and generalization.

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.

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.

Sparse multinomial logistic regression for multiclass classification with feature selection.

problem High-dimensional multiclass classification with a focus on sparse models.
method Penalized maximum likelihood with complexity penalty, feature selection using group Lasso and Slope classifiers.
result Achievement of minimax order in both small and large number of classes regimes.

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

problem Capturing non-linear dependencies among covariates for accurate joint default assessment.
method Application of machine learning techniques to credit card dataset, comparing with logistic regression.
result Machine learning outperforms logistic regression in assessing portfolio riskiness.

L1L_1 regularized logistic regression has now become a workhorse of data mining and bioinformatics: it is widely used for many classification problems, particularly ones with many features. However, L1L_1 regularization typically selects too many features and that so-called false positives are unavoidable. In this pape…

2014-10-25abs ↗pdf ↗

The paper proves asymptotic normality for multinomial logistic regression on null covariates.

problem Classical asymptotic normality results fail in high-dimensional multinomial logistic models.
method Developed asymptotic normality and chi-square results for multinomial logistic MLE on null covariates.
result Validated new methodology to test feature significance in high-dimensional classification problems.

Efficient RL algorithm for multinomial logistic MDPs with provable guarantees.

problem Model-based RL for episodic MDPs with unknown transition probabilities.
method Upper confidence bound-based algorithm for exploration-exploitation balance.
result Achieves ildeO(dH3T) ilde{O}(d \sqrt{H^3 T}) regret bound for multinomial logistic models.

The paper proposes a new method for comparing logistic regression models across different populations.

problem Comparing logistic regression models across sub-populations can lead to misleading results.
method Develops a cascading set of equivalence tests for logistic regression models, addressing coding, predictions, and overall accuracy.
result Equivalence testing incentivizes accurate inference and avoids perverse incentives from significance tests.

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.

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 ↗

Fast classification for sparse models, even with correlated features.

problem Sparse classification with many correlated features.
method Linear and quadratic surrogate cuts, priority queue, and analytical solution for exponential loss.
result 2 to 5 times faster than previous approaches, interpretable models with comparable accuracy.

Adversarial training makes logistic regression weight loss landscapes sharper.

problem Understanding why adversarial training sharpens the weight loss landscape in logistic regression.
method Theoretical analysis of linear logistic regression model with L2 norm constraints, and experiments on ResNet18.
result Adversarial training sharpens the weight loss landscape in linear logistic regression models.

The paper reveals the hidden costs of digitizing commodity money and proposes a new stable-coin system.

problem Depreciation of banknotes due to high logistics costs after digitization.
method Analyzing the functions of money from a logistics perspective and comparing commodity money to digital currency.
result There is no honest money that is both a store of value and has negligible logistics costs.

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

problem Estimating conditional densities for complex distributions.
method Parametric conditional density estimation via weighted logistic regressions.
result Maximum likelihood estimates can be obtained efficiently via a block-wise alternating maximization scheme and local case-control sampling.

Study explores geometric structure and prior for beta-logistic distribution.

problem Understanding the geometric structure and prior distributions of the beta-logistic distribution.
method Exploring dual geometric structure and uncovering α\alpha-parallel prior.
result The beta-logistic distribution admits an α\alpha-parallel prior for any real number α\alpha.

FILTER model uses fusion penalized logistic threshold regression for high-dimensional data with unknown cut points.

problem Modeling high-dimensional data with unknown cut points and binary responses.
method Fusion penalized logistic threshold regression (FILTER) model with fused lasso penalty for variable selection.
result Established non-asymptotic error bounds for coefficient estimation and model selection consistency.

Flexible Bayesian approach for generalized linear models, especially for sparse logistic regression.

problem Sparse logistic regression challenges in machine learning.
method Empirical Bayes approach with mean-field variational inference, tuning-free and scalable.
result Superior predictive performance in sparse logistic regression compared to existing methods.

Annotation errors can significantly hurt classifier performance, yet datasets are only growing noisier with the increased use of Amazon Mechanical Turk and techniques like distant supervision that automatically generate labels. In this paper, we present a robust extension of logistic regression that incorporates the po…

2013-05-21abs ↗pdf ↗

Bayesian logistic regression improves clinical risk prediction models over time.

problem Improving clinical risk prediction models after deployment to adapt to temporal shifts.
method Bayesian logistic regression (BLR) and Markov variant (MarBLR) for online recalibration and revision of prediction models.
result BLR and MarBLR consistently outperform static models and other online revision methods, improving average AUC and calibration index.