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

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for label smoothing

Label smoothing improves model performance even with noisy labels.

problem Mitigating label noise in deep learning models.
method Examined label smoothing as a technique to cope with label noise and compared it to loss-correction methods.
result Label smoothing is competitive with loss-correction techniques under label noise and beneficial for distillation from noisy data.

Label smoothing improves generalization by controlling generalization loss.

problem Lack of mathematical understanding of label smoothing's effectiveness.
method Proposed a theoretical framework to show how label smoothing controls generalization loss in the label noise setting.
result Predicted an optimal label smoothing point that minimizes generalization loss.

The generalization and learning speed of a multi-class neural network can often be significantly improved by using soft targets that are a weighted average of the hard targets and the uniform distribution over labels. Smoothing the labels in this way prevents the network from becoming over-confident and label smoothing…

2019-06-06abs ↗pdf ↗

Improves confidence calibration in neural networks by smoothing labels based on class similarity.

problem Improving confidence calibration in deep neural networks for safety-critical applications.
method Proposes a novel label smoothing technique where label values are based on similarities with the reference class, using different similarity measurements.
result Consistently outperforms state-of-the-art calibration techniques on various datasets and network architectures.

We study Label-Smoothing as a means for improving adversarial robustness of supervised deep-learning models. After establishing a thorough and unified framework, we propose several variations to this general method: adversarial, Boltzmann and second-best Label-Smoothing methods, and we explain how to construct your own…

2019-06-27abs ↗pdf ↗

The study examines label smoothing to improve confidence calibration in fine-tuned LLMs.

problem Improving confidence calibration in fine-tuned large language models (LLMs) after instruction tuning.
method Examine various open-sourced LLMs, label smoothing, and custom kernel design.
result Label smoothing is effective in maintaining confidence calibration but faces challenges in large vocabulary LLMs.

Self-distillation improves model performance by increasing teacher diversity and smoothing predictions.

problem Improving model generalization and performance through self-distillation.
method Interpreting self-distillation as MAP estimation and proposing instance-specific label smoothing.
result Self-distillation enhances model performance by increasing teacher diversity and smoothing predictions.

GS-B3^3SE improves label shift estimation by smoothing priors on a graph.

problem Label shift adaptation when source and target distributions share conditional but not marginal probabilities.
method Graph-Smoothed Bayesian Black-Box Shift Estimator (GS-B3^3SE) places Laplacian-Gaussian priors on log-priors and confusion-matrix columns tied by a label-similarity graph.
result GS-B3^3SE produces a tractable posterior with HMC or Newton-CG schemes, proving identifiability, contraction, and robustness.

Label smoothing improves model robustness against misspecification.

problem Improving model robustness against model misspecification.
method Introducing modified label smoothing (MLSLR) that maintains consistent probability estimation while modifying the loss function.
result MLSLR exhibits higher robustness against model misspecification than conventional label smoothing.

Proposes a data augmentation method to improve multi-label learning performance.

problem Improving multi-label learning by exploiting label correlations and data augmentation.
method Proposes a novel data augmentation approach that performs clustering on real examples and treats cluster centers as virtual examples, promoting local smoothness through a regularization term.
result Extensive experiments show that the proposed method outperforms state-of-the-art multi-label learning approaches.

Method reweights instances and classes to improve robustness in noisy data.

problem Improving deep learning performance in the presence of label noise.
method Formulates constrained optimization problems to assign importance weights to instances and class labels.
result Significant performance gains observed in benchmark datasets with label noise.

Practically, we are often in the dilemma that the labeled data at hand are inadequate to train a reliable classifier, and more seriously, some of these labeled data may be mistakenly labeled due to the various human factors. Therefore, this paper proposes a novel semi-supervised learning paradigm that can handle both l…

2019-02-20abs ↗pdf ↗

New method makes machine learning models robust to label flipping attacks.

problem Machine learning models are vulnerable to label flipping attacks.
method Randomized smoothing over arbitrary functions to build certifiably robust classifiers.
result Linear classifiers are robust to label flipping attacks with deterministic bounds.

The recently proposed self-ensembling methods have achieved promising results in deep semi-supervised learning, which penalize inconsistent predictions of unlabeled data under different perturbations. However, they only consider adding perturbations to each single data point, while ignoring the connections between data…

2017-11-01abs ↗pdf ↗

Proposes sigmoidF1 loss for multilabel classification, improving performance metrics.

problem Lack of smooth, tractable loss functions for multilabel classification.
method Introduces sigmoidF1, a smooth F1 score surrogate loss function.
result sigmoidF1 outperforms other loss functions on various datasets and metrics.

This work proposes a novel method for semi-supervised learning from partially labeled massive network-structured datasets, i.e., big data over networks. We model the underlying hypothesis, which relates data points to labels, as a graph signal, defined over some graph (network) structure intrinsic to the dataset. Follo…

2016-12-05abs ↗pdf ↗

Learning with Label Proportions (LLP) is the problem of recovering the underlying true labels given a dataset when the data is presented in the form of bags. This paradigm is particularly suitable in contexts where providing individual labels is expensive and label aggregates are more easily obtained. In the healthcare…

2018-10-24abs ↗pdf ↗

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.

A new unsupervised contrastive learning framework improves time series representation learning.

problem Lack of labeled data in time series data.
method Proposes an unsupervised contrastive learning framework using a novel contrastive loss and data augmentation.
result Framework outperforms other approaches on univariate and multivariate time series, and benefits transfer learning.

New method calibrates multi-class predictions efficiently without sacrificing accuracy.

problem Efficiently calibrating multi-class predictions without sacrificing accuracy.
method Formulated robust projected smooth calibration and new recalibration algorithms.
result Achieves strong guarantees for binary classification tasks with polynomial complexity.

Recently, a variety of regularization techniques have been widely applied in deep neural networks, such as dropout, batch normalization, data augmentation, and so on. These methods mainly focus on the regularization of weight parameters to prevent overfitting effectively. In addition, label regularization techniques su…

2019-08-15abs ↗pdf ↗

CCVAE captures label characteristics in VAEs for better representation learning.

problem Capturing rich label characteristics in VAEs without conflating them with label values.
method Developed CCVAE, a novel VAE model that explicitly captures label characteristics in latent space.
result CCVAE allows for effective and general interventions like smooth traversals and diverse conditional generation.

PML-LFC improves PML by estimating label confidence from both feature and label spaces.

problem PML challenges in real-world scenarios where only some labels are relevant.
method PML-LFC estimates label confidence using feature and label space similarities, training a predictor with these values.
result PML-LFC achieves superior performance on synthetic and real-world datasets.

Let MM be a smooth closed orientable surface, and let FF be the space of Morse functions on MM such that at least χ(M)+1χ(M)+1 critical points of each function of FF are labeled by different labels (enumerated). Endow the space FF with CC^\infty-topology. We prove the homotopy equivalence $F\sim R\times{\widetilde{\c…

2011-04-25abs ↗pdf ↗

We propose a supervised anomaly detection method for data with inexact anomaly labels, where each label, which is assigned to a set of instances, indicates that at least one instance in the set is anomalous. Although many anomaly detection methods have been proposed, they cannot handle inexact anomaly labels. To measur…

2019-09-11abs ↗pdf ↗

CutMix training technique improves spatial locality in Vision Transformers.

problem Improving spatial locality in Vision Transformers trained from scratch.
method Comparison of Baseline and Modern training protocols on CIFAR-10, CIFAR-100, and Tiny-ImageNet.
result CutMix training component significantly reduces Mean Attention Distance (MAD) in early layers of Vision Transformers.

SGD handles label noise with bounds improving over SGLD.

problem Label noise in non-convex optimization.
method Stochastic gradient descent with uniform dissipativity and smoothness conditions, using Wasserstein distance and algorithmic stability.
result Generalization error bounds with a rate of n2/3n^{-2/3}, better than SGLD's n1/2n^{-1/2}.

Noisy labels often occur in vision datasets, especially when they are obtained from crowdsourcing or Web scraping. We propose a new regularization method, which enables learning robust classifiers in presence of noisy data. To achieve this goal, we propose a new adversarial regularization scheme based on the Wasserstei…

2019-04-08abs ↗pdf ↗

AUC-spec optimizes graph-based SSL for complex label distributions.

problem Training accurate models with scarce labeled data and abundant unlabeled data.
method Computes a low-dimensional representation that maximizes class separation via AUC optimization.
result AUC-spec achieves competitive results on synthetic and real-world datasets.

Unified surrogate loss framework for multi-label learning with strong consistency guarantees.

problem Improving consistency and accounting for label correlations in multi-label learning.
method Introducing multi-label logistic loss and extending it to comprehensive multi-label comp-sum losses, proving strong consistency guarantees for any multi-label loss.
result Unified surrogate loss framework benefiting from strong consistency guarantees for any multi-label loss.

Private algorithms adapt from public to private domains with minimal labeled data.

problem Adapting from a public source domain to a private target domain with few labeled data.
method Differentially private discrepancy minimization algorithms based on Frank-Wolfe and Mirror-Descent methods.
result Effective adaptation with strong generalization and privacy guarantees.