Research reveals simplicity bias in random logistic map, impacting data analysis and forecasting.
problem Simplicity bias in dynamical systems and its impact on data analysis and prediction.
method Examined the logistic map and random logistic map, focusing on simplicity bias and noise effects.
result Simplicity bias is observable in the random logistic map, persisting even with small noise levels.
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.
A latent space model for a family of random graphs assigns real-valued vectors to nodes of the graph such that edge probabilities are determined by latent positions. Latent space models provide a natural statistical framework for graph visualizing and clustering. A latent space model of particular interest is the Rando…
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.
Logistic regression for brain imaging without p-values.
problem Computing the distribution of random field suprema is hard.
method Uses logistic regression for brain network classification.
result Performs classification at each edge level without preselected features.
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 α-parallel prior. result The beta-logistic distribution admits an α-parallel prior for any real number α. Improved CRT for sparse logistic regression in high dimensions.
problem Accurate inference in high-dimensional sparse logistic regression.
method Variable-distillation and decorrelation steps in CRT-logit.
result CRT-logit provides a more powerful solution with theoretical guarantees.
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.
This paper describes how to convert a machine learning problem into a series of map-reduce tasks. We study logistic regression algorithm. In logistic regression algorithm, it is assumed that samples are independent and each sample is assigned a probability. Parameters are obtained by maxmizing the product of all sample…
We consider empirical risk minimization of linear predictors with convex loss functions. Such problems can be reformulated as convex-concave saddle point problems, and thus are well suitable for primal-dual first-order algorithms. However, primal-dual algorithms often require explicit strongly convex regularization in …
Bayesian model improves classification performance with flexible uncertainty modeling.
problem Improving classification performance with flexible uncertainty modeling.
method Combines Gaussian process and Dirichlet process priors for latent function and link function, respectively.
result Outperforms standard logistic regression on simulated data.
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.
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.
City Logistics is characterized by multiple stakeholders that often have different views of such a complex system. From a public policy perspective, identifying stakeholders, issues and trends is a daunting challenge, only partially addressed by traditional observation systems. Nowadays, social media is one of the bigg…
Machine learning identifies chimera states in complex dynamical systems.
problem Chimera states are hard to identify due to their varied appearance and peculiar nature.
method Machine learning techniques, specifically random forest and oblique random forest with null space regularization.
result High accuracy in identifying chimera states across different dynamical models.
Binary classification is highly used in credit scoring in the estimation of probability of default. The validation of such predictive models is based both on rank ability, and also on calibration (i.e. how accurately the probabilities output by the model map to the observed probabilities). In this study we cover the cu…
L1 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, L1 regularization typically selects too many features and that so-called false positives are unavoidable. In this pape…
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 insights into how randomization affects greedy model selection.
problem Understanding the impact of feature subsampling on greedy model selection.
method Investigated greedy forward selection with feature subsampling, proving effects on bias and variance.
result Ensembling with feature subsampling reduces both bias and variance, unlike convex base learners.
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.
Prognostic scores improve logistic regression analysis in RCTs with binary outcomes.
problem Non-collapsibility in logistic regression analysis of RCTs with binary endpoints.
method Prognostic score adjustment using AI predictions to address non-collapsibility.
result Prognostic score adjustment increases power or reduces sample size for estimating conditional odds ratios.
Extends CRR model with q-binomial random walks for asset pricing.
problem Asset pricing with time-varying probabilities and trend parameters.
method Introduces a q-binomial extension of the CRR model with non-self-similar binomial trees.
result Convergence to Black-Scholes formula with rate O(N^(-1/2)).
Approximates large Random Forest models to save space.
problem Large model size limits deployment on small devices.
method Approximate each tree using multinomial logistic regression.
result Reduced model size without significant loss of accuracy.
ETM models improve efficiency in semi-supervised logistic regression.
problem Improving efficiency in logistic regression with limited labeled data.
method Developed exponential tilt mixture (ETM) models for semi-supervised estimation.
result ETM-based estimation demonstrates improved efficiency over supervised logistic regression.
Logistic regression is by far the most widely used classifier in real-world applications. In this paper, we benchmark the state-of-the-art active learning methods for logistic regression and discuss and illustrate their underlying characteristics. Experiments are carried out on three synthetic datasets and 44 real-worl…
Estimates binary labels from dependent data using Markov Random Fields.
problem Statistical estimation from dependent data across spatial, temporal, and social domains.
method Modeling dependencies as Markov Random Fields and providing efficient estimation algorithms.
result Statistically efficient estimation rates for Ising models from a single sample.
Logistic regression models are a popular and effective method to predict the probability of categorical response data. However inference for these models can become computationally prohibitive for large datasets. Here we adapt ideas from symbolic data analysis to summarise the collection of predictor variables into his…
Study high-dimensional logistic regression with missing data, providing exact error characterizations.
problem High-dimensional logistic regression with missing or corrupted covariates.
method Exact characterizations of prediction and estimation errors under independence and moment conditions.
result Characterizations are universal and hold for various imputation strategies.
New algorithms reduce regret in reinforcement learning with MNL approximations.
problem Efficient reinforcement learning with MNL function approximation for MDPs.
method Proposed randomized exploration algorithms with frequentist regret guarantees.
result Achieved improved regret bounds for MNL transition models.
Researchers derived formulas for joint moments of elliptical distributions.
problem Calculating joint moments of elliptical distributions.
method Used Stein's lemma and two different methods to derive expressions.
result New formulae for expectations of product of normally distributed random variables and simplified expressions for other distributions.
The paper outlines future work in random sets theory.
problem Developing a theory of statistical reasoning with random sets.
method Generalizing logistic regression, probability laws, and geometric uncertainty.
result A new geometric approach to uncertainty with general random sets.
Framework improves ML flood mapping generalization.
problem Improving machine learning models' ability to generalize to new conditions.
method Dimensionless, multi-scale features constrained by the Buckingham Π theorem.
result Model outperformed dimensional features, improving AUC in unmapped areas.
Every year, thousands of people receive consumer product related injuries. Research indicates that online customer reviews can be processed to autonomously identify product safety issues. Early identification of safety issues can lead to earlier recalls, and thus fewer injuries and deaths. A dataset of product reviews …
This manuscript studies statistical properties of linear classifiers obtained through minimization of an unregularized convex risk over a finite sample. Although the results are explicitly finite-dimensional, inputs may be passed through feature maps; in this way, in addition to treating the consistency of logistic reg…
Paper generalizes Gaussian universality and CGMT to dependent data, impacting data augmentation in high-dimensional logistic regression.
problem Limitation of Gaussian universality and CGMT in handling dependent data.
method Generalizes Gaussian universality and CGMT to dependent data (block dependence, m-dependence, mixing). Establishes a novel CGMT framework.
result Gaussian universality holds for high-dimensional logistic regression under various types of dependence.
Logistic regression can handle noisy labels effectively when labels are imperfectly assigned by multiple experts.
problem Label noise in supervised classification due to manual labelling by multiple experts.
method Using approximate posterior probabilities of class membership from multiple experts to train logistic regression models.
result Logistic regression can be robust to label noise when classification difficulty is the only source of errors.
Paper assesses error estimates of Random Forests classification.
problem Quantitative assessment of Random Forests error estimates.
method Theoretical and empirical investigation of various error estimation methods.
result Random Forests' error estimates are closer to true error rate than average prediction error.
Early stopping improves neural networks' performance on binary classification tasks.
problem Improving shallow ReLU networks' performance on binary classification tasks.
method Gradient descent with early stopping on binary classification data.
result Gradient descent with early stopping achieves population risk arbitrarily close to optimal.
The paper uses XAI to predict RFQ fulfillment accuracy.
problem Improving accuracy in predicting RFQ fulfillment for less liquid asset classes.
method Advanced algorithms like Logistic Regression, Random Forest, XGBoost, and Bayesian Neural Tree.
result Improved accuracy in RFQ fill rate predictions.
TinyML models detect RF and cyber threats in spacecraft with low latency.
problem Detecting cyber-RF threats in autonomous spacecraft with low latency.
method Analysis of classical models (RF, LR, SVM, MLP) for latency-accuracy trade-offs.
result Logistic Regression achieves microsecond-level inference with minimal accuracy loss.
Automatically differentiable estimation for BLP model reduces bias in demand estimation.
problem Estimating the BLP model with reduced bias and improved performance.
method Phrasing BLP as an automatically differentiable moment function, using CUE for estimation, and incorporating MCMC credible intervals.
result CUE estimation shows lower bias but higher MAE compared to 2S-GMM, with MCMC providing closest empirical coverage.
Learning three data points can generate all types of periodic orbits in a neural network.
problem Can learning three data points generate all types of periodic orbits in a neural network?
method Investigated a continuous one-dimensional map with period three in a random neural network in its thermodynamic limit.
result Almost all learned periods are unstable, and each network has its own characteristic attractors.
To improve accuracy and speed of regressions and classifications, we present a data-based prediction method, Random Bits Regression (RBR). This method first generates a large number of random binary intermediate/derived features based on the original input matrix, and then performs regularized linear/logistic regressio…
Develops a robust multiclass classification method for deep image classifiers.
problem Tackles data contamination and robustness to outliers in deep image classifiers.
method Uses Distributionally Robust Optimization (DRO) with Wasserstein metric ambiguity sets and regularized learning.
result Reduces test error rate by up to 83.5% and loss by up to 91.3% in image classification tasks.
Logistic Gaussian process (LGP) priors provide a flexible alternative for modelling unknown densities. The smoothness properties of the density estimates can be controlled through the prior covariance structure of the LGP, but the challenge is the analytically intractable inference. In this paper, we present approximat…
We explore a novel approach to semi-supervised learning. This approach is contrary to the common approach in that the unlabeled examples serve to "muffle," rather than enhance, the guidance provided by the labeled examples. We provide several variants of the basic algorithm and show experimentally that they can achieve…
Study uses ML to predict non-participation in ELSA COVID-19 follow-up studies.
problem Predicting non-participation in follow-up surveys due to various factors.
method Used machine learning algorithms including KNN, RF, AdaBoost, logistic regression, NN, and SVC.
result Random Forest (RF) outperforms other models in balanced accuracy.
A major challenge for building statistical models in the big data era is that the available data volume far exceeds the computational capability. A common approach for solving this problem is to employ a subsampled dataset that can be handled by available computational resources. In this paper, we propose a general sub…