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

187375562749 · Jun 202019922001200920172026
48 results for logistic link function

New method optimizes policies without assuming known link functions between preferences and rewards.

problem Policy alignment with unknown and unrestricted link functions.
method Formulates an ff-divergence-constrained reward maximization problem, learning policies directly.
result Induces a semiparametric single-index binary choice model for policy alignment.

We consider the problem of link prediction, based on partial observation of a large network, and on side information associated to its vertices. The generative model is formulated as a matrix logistic regression. The performance of the model is analysed in a high-dimensional regime under a structural assumption. The mi…

2018-03-19abs ↗pdf ↗

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.

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.

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.

Paper proposes fitting loss functions to data using source functions from information geometry.

problem Choosing appropriate loss functions for machine learning models.
method Introduces source functions from information geometry to fit loss functions to the domain at hand.
result Significant improvements over state-of-the-art methods in model training.

Flexible classifier using Mahalanobis distances for non-elliptical distributions.

problem Classifying non-elliptical and multimodal distributions.
method Semiparametric classifier based on Mahalanobis distances and generalized additive models.
result The proposed classifiers outperform traditional methods in high-dimensional, low-sample-size scenarios.

New method approximates M-estimator and predictions without solving fixed-point equations.

problem Characterize behavior of M-estimator and predictions in single index models.
method Develops data-driven observable adjustments to proximal operators.
result Empirical distributions of M-estimator and predictions are approximated without solving fixed-point equations.

New lower bounds improve logistic log-likelihood optimization and inference.

problem Designing computationally tractable lower bounds for logistic log-likelihoods.
method Developed a piece-wise quadratic lower bound that uniformly improves tangent quadratic minorizers.
result Improves the speed of convergence and accuracy of variational Bayes approximations.

SGD converges globally to logistic loss minima for two-layer nets.

problem Global convergence of SGD for logistic loss on two-layer neural nets.
method Demonstrates existence of Frobenius norm regularized logistic loss functions as Villani functions, proving convergence and exponential rate.
result SGD converges globally to the global minima of appropriately regularized logistic empirical risk of depth 2 nets.

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…

2014-07-03abs ↗pdf ↗

In this paper, we consider the multivariate Bernoulli distribution as a model to estimate the structure of graphs with binary nodes. This distribution is discussed in the framework of the exponential family, and its statistical properties regarding independence of the nodes are demonstrated. Importantly the model can e…

2012-06-08abs ↗pdf ↗

Identity-link IRT improves TVD-MI scores without curvature violations.

problem Preserving additivity in TVD-MI scores for efficient LLM evaluation.
method Derives clipped-linear model from Gini entropy maximization, using identity link.
result Identity-link yields lower curvature violations (median curl 0.080-0.150) compared to probit/logit.

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 ↗

We consider the problem of learning the link parameters as well as the structure of a binary-valued pairwise Markov model. Under sparsity assumption, we propose a method based on l1l_1- regularized logistic regression, which estimate globally the whole set of edges and link parameters. Unlike the more recent methods di…

2019-06-26abs ↗pdf ↗

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.

Novel oracle-type inequality for logistic loss in DNNs achieves sharp convergence rates.

problem Generalization analysis for binary classification with DNNs and logistic loss.
method Established an oracle-type inequality to handle the boundedness of the target function.
result Optimal convergence rates for fully connected ReLU DNN classifiers trained with logistic loss.

PSLR classifies functional data with scalar covariates using path signatures.

problem Classical functional logistic regression models have limitations in capturing nonlinear and cross-channel dependencies.
method PSLR uses truncated path signatures to create a basis-free representation of functional data.
result PSLR outperforms traditional functional classifiers in accuracy and robustness, especially under non-uniform sampling.

Rotation invariant algorithms fail with hard labels sampled from sparse targets.

problem Rotation invariant algorithms fail to learn from hard labels sampled from sparse targets.
method Proving the excess risk of rotation invariant algorithms and proposing a simple non-rotation invariant algorithm.
result Rotation invariant algorithms incur an excess risk of $Ω\left(\frac{d-1}{n} ight)$, while non-rotation invariant algorithms have an excess risk of $O\left(\frac{s\log d}{n} ight).

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.

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.

The article describe the model, derivation, and implementation of variational Bayesian inference for linear and logistic regression, both with and without automatic relevance determination. It has the dual function of acting as a tutorial for the derivation of variational Bayesian inference for simple models, as well a…

2013-10-21abs ↗pdf ↗

Improved variational inference for logistic regression and classification.

problem Intractability of Evidence Lower Bound in variational logistic regression.
method Introducing a new bound for the expectation of softplus function, applied to variational logistic regression and Gaussian process classification.
result The new bound results in a tighter posterior and faster computation compared to Monte-Carlo methods.

The paper proves neural networks' consistency and optimal convergence rates for various function classes.

problem Proving neural networks' consistency and optimal convergence rates for diverse function classes.
method Analyzes wide and deep ReLU neural networks trained on logistic loss and Kolmogorov-Donoho optimal function classes.
result Proves universal consistency and minimax optimal convergence rates for neural networks.

In this work we propose to fit a sparse logistic regression model by a weakly convex regularized nonconvex optimization problem. The idea is based on the finding that a weakly convex function as an approximation of the 0\ell_0 pseudo norm is able to better induce sparsity than the commonly used 1\ell_1 norm. For a cl…

2017-08-07abs ↗pdf ↗

Neural Shadow-Mapping uncovers causal links in dynamic systems.

problem Discovering causal structures in dynamic systems with mirage correlations.
method Neural network based method embedding high-dimensional data into a shadow representation for causal link estimation.
result Demonstrates performance in discovering causal links from video-representations of dynamic systems.

This work proposes the Bregman-Tweedie classification model and analyzes the domain structure of the extended exponential function, an extension of the classic generalized exponential function with additional scaling parameter, and related high-level mathematical structures, such as the Bregman-Tweedie loss function an…

2019-07-16abs ↗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.

Improved multiclass logistic regression with lower computational complexity.

problem High computational complexity in existing methods for multiclass logistic regression.
method Developed a new algorithm that achieves a lower computational complexity.
result Achieved a regret of O(log(Bn))O(\log(Bn)) with computational complexity O(n1.5)O(n^{1.5}).

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.

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

problem Poor performance of logistic regression in high-dimensional settings.
method SLOE reparameterizes the signal strength for faster and more accurate estimation.
result SLOE provides a fast and accurate method for dimensionality correction in logistic regression.