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

2.3%4.7%7.0%9.3% · Jun 202019922001200920172026
48 results for label inconsistency

TIMELY improves consistency in labeling blood cell images.

problem Inconsistent labeling of blood cells in microscopy images leads to unreliable diagnoses.
method TIMELY combines pseudotime inference and hidden Markov trees to correct labeling mistakes.
result TIMELY outperforms baseline methods in identifying and correcting inconsistent labels.

This paper improves multi-label ranking by reweighting univariate losses, enhancing consistency and performance.

problem Improving multi-label ranking performance while maintaining consistency.
method Systematic study of consistency and generalization error bounds for learning algorithms, proposing a reweighted univariate loss.
result Inconsistent pairwise losses can lead to better performance than consistent univariate losses in practice.

Paper tackles representation learning with limited labels from crowdsourced data.

problem Limited labeled data and inconsistent crowdsourced labels.
method Grouping-based deep neural network and Bayesian confidence estimator.
result Framework learns effective representations from limited data with crowdsourced labels.

Paper addresses inconsistency between offline and online LTR performance.

problem Inconsistency between offline and online LTR performance in E-commerce.
method Proposes an evaluator-generator framework to maximize evaluator score using reinforcement learning.
result Significant improvement in Conversion Rate (CR) over existing models.

One-hot encoding is a labelling system that embeds classes as standard basis vectors in a label space. Despite seeing near-universal use in supervised categorical classification tasks, the scheme is problematic in its geometric implication that, as all classes are equally distant, all classes are equally different. Thi…

2018-10-22abs ↗pdf ↗

PINNs struggle with data-to-PDE inconsistencies, limiting their accuracy.

problem Data inconsistency in PINNs affects their accuracy and convergence.
method Systematic analysis of PINNs with varying data fidelity and residual errors.
result PINNs saturate at an error level dictated by data inconsistency.

Is it possible to perform linear regression on datasets whose labels are shuffled with respect to the inputs? We explore this question by proposing several estimators that recover the weights of a noisy linear model from labels that are shuffled by an unknown permutation. We show that the analog of the classical least-…

2017-05-03abs ↗pdf ↗

We study the effect of imperfect training data labels on the performance of classification methods. In a general setting, where the probability that an observation in the training dataset is mislabelled may depend on both the feature vector and the true label, we bound the excess risk of an arbitrary classifier trained…

2018-05-29abs ↗pdf ↗

This work compares regularization and constrained inference for label constraints in machine learning.

problem Improving model performance with label constraints in machine learning.
method Comparison of regularization and constrained inference strategies.
result Constrained inference reduces population risk by correcting model violations, while regularization narrows the generalization gap but introduces bias.

Structured credal learning separates covariate shift and label disagreement.

problem Uncertainty in real-world learning tasks due to covariate shift and noisy labels.
method Introduces a structured credal learning framework that explicitly separates these sources.
result Geometric bounds and decomposition reveal how covariate shifts affect label disagreement contributions.

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 ↗

We consider the problem of rank loss minimization in the setting of multilabel classification, which is usually tackled by means of convex surrogate losses defined on pairs of labels. Very recently, this approach was put into question by a negative result showing that commonly used pairwise surrogate losses, such as ex…

2012-06-27abs ↗pdf ↗

RLSbench benchmarks domain adaptation under label proportion shifts, revealing widespread failures and proposing a two-step meta-algorithm.

problem Domain adaptation under label proportion shifts is poorly understood and inconsistent across methods.
method RLSbench introduces a large-scale benchmark with 500 distribution shift pairs. It proposes a two-step meta-algorithm to improve domain adaptation methods under label proportion shifts.
result The two-step meta-algorithm improves domain adaptation methods by 2-10% accuracy points under large label proportion shifts.

We study consistency properties of machine learning methods based on minimizing convex surrogates. We extend the recent framework of Osokin et al. (2017) for the quantitative analysis of consistency properties to the case of inconsistent surrogates. Our key technical contribution consists in a new lower bound on the ca…

2018-10-26abs ↗pdf ↗

Study solves HJB equations for time-inconsistent control problems.

problem Time-inconsistent deterministic linear quadratic control problems.
method Characterized solutions using Riccati equations with integral terms, proving uniqueness.
result Uniqueness of solutions to equilibrium HJB equations proved.

Study time-inconsistent consumption-investment in incomplete markets with general discount functions.

problem Time-inconsistent consumption-investment problems in incomplete markets.
method Coupled forward-backward stochastic differential equation approach.
result Uniqueness of open-loop equilibrium pair proved.

This paper tackles objective inconsistency in federated optimization with heterogeneous clients.

problem Objective inconsistency due to heterogeneity in clients' datasets and computation speeds.
method General framework for analyzing federated heterogeneous optimization algorithms, including FedAvg and FedProx, and proposing FedNova.
result FedNova eliminates objective inconsistency while preserving fast error convergence.

FLDCRF improves sequence labeling performance with latent dynamics interactions.

problem Sequence labeling with improved performance and latent dynamics interactions.
method Factored Latent-Dynamic Conditional Random Fields (FLDCRF) with multiple latent dynamics interactions.
result FLDCRF outperforms state-of-the-art models across multiple datasets.

Study time-inconsistent portfolio optimization for competitive agents with relative performance criteria.

problem Time-inconsistent mean field and n-agent games under relative performance criteria.
method Construct open-loop equilibrium strategies for n-agent games and mean field games.
result Explicit solutions for n-agent games and mean field games, unique in a special class of equilibria.

Develops a reinforcement learning algorithm for learning deterministic equilibrium policies in time-inconsistent control problems.

problem Learning equilibrium policies in time-inconsistent control problems.
method Continuous-time model-free reinforcement learning algorithm using deterministic policy gradient approach.
result Learned equilibrium policies in general time-inconsistent control problems.

NeuCrowd creates high-quality samples from crowdsourced labels to improve representation learning.

problem Limited and inconsistent crowdsourced labels for representation learning.
method Unified framework that generates high-quality n-tuplet samples and learns a neural sampling network.
result NeuCrowd outperforms state-of-the-art baselines in prediction accuracy and AUC.

Recurrent models can produce infinite sequences, causing bias; new methods prevent this.

problem Inconsistency in decoding infinite-length sequences from recurrent language models.
method Defined and proved inconsistency of common decoding algorithms; proposed remedies.
result Proposed methods prevent inconsistency in practice.

Paper solves a complex portfolio selection problem with time-inconsistent preferences.

problem Time-inconsistent preferences in portfolio selection.
method Unified framework with minimal assumptions, proving existence and uniqueness of solution.
result Existence and uniqueness of square-integrable solution for the integral equation.

Study time-inconsistent control problems with model uncertainty, solving portfolio selection.

problem Time-inconsistent Markovian control problems under model uncertainty.
method Combining sub-game perfect strategies with adaptive robust stochastic methods.
result Solved numerically the mean-variance portfolio selection problem.

A new method improves graph-based learning for high-dimensional data.

problem Inconsistent high-dimensional learning efficiency of semi-supervised graph regularization.
method Introducing a novel regularization approach involving centering operation.
result Empirical results show improved performance over spectral clustering.

Aux-Net model handles dynamic systems with inconsistent inputs.

problem Inconsistent or unreliable input data in real-world scenarios.
method Aux-Net uses a weighted ensemble of classifiers and online gradient descent.
result Aux-Net provides scalable and agile online learning for dynamic systems.

This work evaluates PDA methods without target labels, revealing significant accuracy drops.

problem Evaluating PDA methods without target labels and inconsistent experimental settings.
method Realistic evaluation of 7 PDA methods with 7 model selection strategies on 2 datasets.
result Accuracy drops up to 30 percentage points without target labels, only one method performs well.

TopoGeoScore selects robust checkpoints using only source-domain representations.

problem Selecting robust checkpoints without target-domain labels or samples.
method Constructs class-conditional mutual k-nearest-neighbour graphs and extracts three interpretable signals.
result Source representations contain measurable global-local-topological evidence of robustness.

To train good supervised and semi-supervised object classifiers, it is critical that we not waste the time of the human experts who are providing the training labels. Existing active learning strategies can have uneven performance, being efficient on some datasets but wasteful on others, or inconsistent just between ru…

2015-04-30abs ↗pdf ↗

Bayesian method improves segmentation accuracy with noisy labels.

problem Annotation errors in semantic segmentation due to mislabeling and spatial correlations.
method Approximate Bayesian estimation with spatially correlated discrete distributions and variational inference.
result The method achieves performance comparable to clean labels under moderate noise levels.