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

60121181241 · Jun 202019922001200920172026
48 results for Logit Statistics

AdaDetectGPT improves text authorship detection with statistical guarantees.

problem Determining if text is authored by a human or an LLM.
method Adaptive learning of a witness function from training data to enhance logits-based detectors.
result AdaDetectGPT nearly uniformly improves text authorship detection, with up to 37% improvement.

Optimal design for multinomial logit models improves assortment selection efficiency.

problem Optimal experimental design for multinomial logit models with feedback.
method Two complementary approaches: MILP reformulation and lifted design.
result Achieves statistical efficiency and scalability for MNL bandits.

Paper tackles long-tailed labels in classification problems.

problem Imbalanced or long-tailed label distribution in real-world classification problems.
method Logit adjustment applied post-hoc or during training to encourage a large relative margin between rare and dominant labels.
result Unified and generalised techniques for coping with long-tailed labels, improving generalisation and performance.

Logit regularization induces logit clustering, affecting classifier performance.

problem Understanding the mechanism of logit regularization in classification.
method Analysis of logit regularization in linear classification, proving logit clustering leads to Fisher's Linear Discriminant alignment.
result Logit regularization can halve critical sample complexity and induce robust generalization.

The paper proposes a method to test properties of the optimal assortment in multinomial logit models.

problem Uncertainty quantification for the optimal assortment in multinomial logit models.
method The paper proposes a novel inferential framework to test properties of the optimal assortment in multinomial logit models, reducing the problem to detecting the sign change point of marginal revenue gaps.
result The asymptotic normality of the marginal revenue gap estimator and the construction of a maximum statistic to detect the sign change point.

Proposes SOVR loss to improve adversarial robustness by increasing logit margins.

problem Adversarial training's difficulty in robustness against sophisticated attacks.
method Introduces SOVR loss function that switches from cross-entropy to one-vs-the-rest loss for important samples.
result SOVR loss increases logit margins of important samples, improving robustness against Auto-Attack.

In this paper, we develop improved techniques for defending against adversarial examples at scale. First, we implement the state of the art version of adversarial training at unprecedented scale on ImageNet and investigate whether it remains effective in this setting - an important open scientific question (Athalye et …

2018-03-16abs ↗pdf ↗

Proposes a convex model for mixed logit to handle individual heterogeneity.

problem Non-convex optimization in mixed logit models for individual heterogeneity.
method Sparse and low-rank decomposition for convex formulation.
result Convex formulation avoids simulation-based approximation and unstable model interpretation.

Recently, Kannan et al. [2018] proposed several logit regularization methods to improve the adversarial robustness of classifiers. We show that the computationally fast methods they propose - Clean Logit Pairing (CLP) and Logit Squeezing (LSQ) - just make the gradient-based optimization problem of crafting adversarial …

2018-10-29abs ↗pdf ↗

Develops a power-calibrated framework for LLM watermarking, optimizing tradeoffs between detectability and distortion.

problem The trade-off between detectability and semantic distortion in logit-based watermarking.
method Power-calibrated statistical framework for watermark hyperparameters, establishing explicit relationships.
result Derives practical parameter selection procedures achieving optimal tradeoffs under constraints.

The recent success of generative adversarial networks and variational learning suggests training a classifier network may work well in addressing the classical two-sample problem. Network-based tests have the computational advantage that the algorithm scales to large samples. This paper proposes a two-sample statistic …

2019-09-25abs ↗pdf ↗

The paper provides guarantees for a tangent transform algorithm in logistic regression models.

problem Finding theoretical guarantees for statistical optimality and algorithmic convergence in non-conjugate models.
method Exploiting convex duality and minorizing the marginal likelihood, the paper derives non-asymptotic upper bounds and convergence guarantees for a tangent transform algorithm in logistic regression models.
result The tangent transform algorithm is shown to be locally asymptotically stable without assumptions on the data-generating process.

DMNL bandits optimize assortment choices balancing relevance and diversity.

problem Balancing relevance-driven choice with within-assortment diversity.
method Augments MNL choice probabilities with a submodular diversity function, proposing a white-box UCB-based algorithm.
result Achieves at least a (11e+1)(1-\frac{1}{e+1})-approximate regret bound of $ ilde{O}\left(d \sqrt{T/K} ight)$.

We consider neural network training, in applications in which there are many possible classes, but at test-time, the task is a binary classification task of determining whether the given example belongs to a specific class, where the class of interest can be different each time the classifier is applied. For instance, …

2017-05-29abs ↗pdf ↗

The paper develops a statistical theory explaining overfitting in imbalanced classification.

problem Overfitting in high-dimensional imbalanced classification.
method Developed a statistical theory for support vector machines and logistic regression.
result Overfitting is more severe for the minority class due to truncation or skewing effects in high-dimensional data.

BoC probe assesses neural network confidence coherence, revealing architecture-specific uncertainty.

problem Poor calibration and OOD detection in neural networks.
method Bag-of-Coins (BoC) probe compares softmax confidence to pairwise dominance probabilities.
result BoC reveals clear ID/OOD separation for some architectures but not others.

Annealing Double-Head calibrates deep neural networks during training.

problem Overestimation or underestimation of predictive confidence in deep neural networks.
method An additional calibration head and Annealing technique to dynamically scale logits.
result State-of-the-art model calibration performance achieved without post-processing.

New algorithm tackles non-linear utility in MNL bandits with ildeO(T) ilde{O}(\sqrt{T}) regret.

problem Sequential assortment selection with intricate user-item interactions.
method Upper Confidence Bound principle for non-linear parametric utility functions, including neural networks.
result Achieves ildeO(T) ilde{O}(\sqrt{T}) regret bound for neural network-based utilities.

The paper proposes an efficient method to scale Bayesian inference for mixed multinomial logit models to very large datasets.

problem Efficiency in Bayesian inference for mixed multinomial logit models on large datasets.
method Amortized Variational Inference with stochastic backpropagation, automatic differentiation, and GPU acceleration.
result The proposed method achieves significant computational speedups over traditional methods for large datasets.

This article presents a proof of the existence of Bertrand-Nash equilibrium prices with multi-product firms and under the Logit model of demand that does not rely on restrictive assumptions on product characteristics, firm homogeneity or symmetry, product costs, or linearity of the utility function. The proof is based …

2010-12-28abs ↗pdf ↗

The paper characterizes the efficiency of transferring knowledge from a teacher to a student classifier over finite domains.

problem Characterizing the statistical efficiency of knowledge transfer over finite domains.
method Three progressive levels of privileged information: hard labels, teacher probabilities, and soft labels. Novel empirical loss functions used to achieve the fundamental limits.
result Achieving the fundamental limits of knowledge transfer through specific levels of privileged information and novel loss functions.

In discrete choice modeling (DCM), model misspecifications may lead to limited predictability and biased parameter estimates. In this paper, we propose a new approach for estimating choice models in which we divide the systematic part of the utility specification into (i) a knowledge-driven part, and (ii) a data-driven…

2018-12-23abs ↗pdf ↗

Analyzes how inclusion/exclusion from STOXX Europe 600 Index affects company prices.

problem Understanding price dynamics of companies in STOXX Europe 600 Index.
method Used logit models and neural networks to analyze data.
result Identified independent variables affecting price changes.

WEINCE improves contrastive learning by correcting softmax biases.

problem Softmax in InfoNCE can lead to misaligned statistical assumptions in contrastive learning.
method WEINCE uses anchor-wise online batch statistics to blend softmax logits with an endpoint shortfall correction.
result WEINCE yields consistent improvements in frozen-feature evaluation across five vision benchmarks.

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.