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

63127190253 · Jun 202019922001200920172026
48 results for label refinement

New research shows label refinement and weak training have limitations for aligning LLMs.

problem Limitations of refinement methods for aligning large language models.
method Analyzed probabilistic assumptions and alternative approaches to label refinement and weak training.
result Label refinement and weak training suffer from irreducible error, leaving a performance gap.

Process mining is a research field focused on the analysis of event data with the aim of extracting insights in processes. Applying process mining techniques on data from smart home environments has the potential to provide valuable insights in (un)healthy habits and to contribute to ambient assisted living solutions. …

2016-09-12abs ↗pdf ↗

LARA forecasts financial asset trends by refining noisy labels and extracting profitable samples.

problem Low signal-to-noise ratio and stochastic nature of financial data lead to poor predictions.
method LARA combines LA-Attention and RA-Labeling to refine and extract profitable samples.
result LARA significantly outperforms existing methods on Qlib platform.

Automated labeling of intracranial arteries improves accuracy and efficiency.

problem Challenges in accurately labeling intracranial arteries due to variations and limited datasets.
method Graph Neural Network (GNN) combined with hierarchical refinement for improved accuracy.
result Achieved 97.5% node labeling accuracy on a testing set of 105 scans.

Solves biased pseudo-labels in imbalanced SSL by refining them.

problem Imbalanced class distributions in semi-supervised learning lead to biased pseudo-labels.
method Formulates a convex optimization problem to refine pseudo-labels and develops an efficient algorithm, DARP.
result Demonstrates the effectiveness of DARP in various imbalanced semi-supervised scenarios.

A new criterion for deep active learning selects minimal labeled data points.

problem Efficiently select minimal labeled data points for deep neural networks.
method Diffuses label information over a graph of data representations to switch between exploration and refinement.
result The diffusion-based criterion outperforms existing methods in deep active learning.

Refines neural network predictions using background knowledge for improved accuracy.

problem Compensate for lack of labeled data in neural networks.
method Introduces differentiable refinement functions and Iterative Local Refinement (ILR) algorithm to refine predictions efficiently and accurately.
result ILR finds competitive results in MNIST addition task and refines predictions on complex SAT formulas.

Applying machine learning in the health care domain has shown promising results in recent years. Interpretable outputs from learning algorithms are desirable for decision making by health care personnel. In this work, we explore the possibility of utilizing causal relationships to refine diagnostic prediction. We focus…

2017-11-29abs ↗pdf ↗

CAGNN learns graph embeddings without labels by clustering and refining graph topology.

problem Learning graph embeddings without labeled data.
method Cluster-aware graph neural network (CAGNN) with self-supervised learning and topology refinement.
result CAGNN achieves significant improvements in node clustering accuracy.

Self-training improves model accuracy by refining pseudo-labels.

problem Improving semi-supervised learning with self-training.
method Theoretical insights into self-training algorithm with a focus on linear classifiers.
result Self-training iterations can improve model accuracy even if stuck in sub-optimal fixed points.

Proposes a progressive label correction method for feature-dependent label noise.

problem Real-world large-scale datasets often suffer from heterogeneous, feature-dependent label noise.
method A progressive label correction algorithm that iteratively refines the model.
result A classifier trained with this strategy converges to be consistent with the Bayes classifier for various noise patterns.

Proposes a robust VIB approach using soft labels and mutual info estimation.

problem Improving robustness of VIB to adversarial perturbations.
method Refines categorical class information with soft labels from a reference network, relaxes Gaussian posterior assumption.
result Significantly outperforms benchmarked models on MNIST and CIFAR-10.

PG-EVIKAL refines molecular property predictions using neighbor fusion and evidential neural networks.

problem Improving molecular property predictions using test-time neighbor fusion.
method Adapting evidential neural networks to refine predictions by re-ranking structurally similar neighbors.
result PG-EVIKAL reduces RMSE on 14 out of 16 molecular datasets, improving calibration and sequential refinement.

Automated machine learning (AutoML) has received increasing attention in the recent past. While the main tools for AutoML, such as Auto-WEKA, TPOT, and auto-sklearn, mainly deal with single-label classification and regression, there is very little work on other types of machine learning tasks. In particular, there is a…

2018-11-09abs ↗pdf ↗

Efficiently learns from partial labels using variational inference.

problem Learning from noisy and ambiguous partial labels in crowdsourcing.
method Amortized variational inference for probabilistic posterior approximation.
result Achieves state-of-the-art performance in accuracy and efficiency.

New algorithms improve community detection in network data with strong consistency.

problem Challenges in effectively adapting spectral clustering techniques and achieving strong consistency in label recovery.
method Proposed Thresholded Cosine Spectral Clustering (TCSC) and one-step Refined TCSC algorithms, with strong consistency proofs.
result One-step Refined TCSC achieves strong consistency in community detection under PABM, correctly recovering all labels with high probability.

This paper examines error bounds for deep learning classifiers with noisy labels.

problem Understanding the performance of classifiers trained on noisy data.
method Derives error bounds for excess risk, decomposing it into statistical and approximation errors. Uses independent block construction for statistical dependencies and vector-valued setting for approximation error.
result Established theoretical results for error bounds in deep learning with noisy labels, mitigating the impact of high-dimensional input spaces.

This paper refines human labeling as a measurement process, revealing four sources of variation.

problem Systematic variation in human labeling obscures model learning.
method Introduces a statistical framework to decompose labeling outcomes.
result Empirical evidence for four components of labeling variation.

Deep generative models trained with large amounts of unlabelled data have proven to be powerful within the domain of unsupervised learning. Many real life data sets contain a small amount of labelled data points, that are typically disregarded when training generative models. We propose the Cluster-aware Generative Mod…

2017-04-03abs ↗pdf ↗

While semi-supervised learning (SSL) algorithms provide an efficient way to make use of both labelled and unlabelled data, they generally struggle when the number of annotated samples is very small. In this work, we consider the problem of SSL multi-class classification with very few labelled instances. We introduce tw…

2019-05-21abs ↗pdf ↗

Paper tackles causal inference with partially labeled data, introducing robust methods.

problem Challenges in causal inference due to partially labeled datasets and potential bias.
method Decaying missing-at-random framework and BRSS estimator for doubly robust causal inference.
result Established asymptotic normality of BRSS estimator under decaying labeling propensity scores.

Scarcity of labeled data is one of the most frequent problems faced in machine learning. This is particularly true in relation extraction in text mining, where large corpora of texts exists in many application domains, while labeling of text data requires an expert to invest much time to read the documents. Overall, st…

2018-07-12abs ↗pdf ↗

WeLa-VAE learns interpretable disentangled representations with weak supervision.

problem Learning disentangled representations without strong supervision.
method Variational inference framework with shared latent variables and modified variational lower bound.
result WeLa-VAE learns alternative disentangled representations (polar) from weak labels (distance and angle) without refined supervision.

This article studies the achievable guarantees on the error rates of certain learning algorithms, with particular focus on refining logarithmic factors. Many of the results are based on a general technique for obtaining bounds on the error rates of sample-consistent classifiers with monotonic error regions, in the real…

2015-12-22abs ↗pdf ↗

Paper shows noisy labels can improve PLR variable selection.

problem Variable selection in PLR is challenging due to noisy labels.
method Proposes a novel ADMM-based algorithm to fuse noisy labels.
result Fused noisy labels improve PLR performance in estimation and classification.

Proposes a novel graph self-training method with EM regularization for semi-supervised node classification.

problem Handles noisy graph structures and feature spaces in semi-supervised node classification.
method Introduces an Expectation-Maximization (EM) regularization scheme for uncertainty-aware pseudo-label generation and model retraining.
result Significantly outperforms strong baselines by up to 2.5% in accuracy.

Big models pretrain and fine-tune for semi-supervised learning on ImageNet.

problem Learning from few labeled examples with a large amount of unlabeled data.
method Unsupervised pretraining of a big ResNet model followed by supervised fine-tuning and distillation.
result 73.9% ImageNet top-1 accuracy with just 1% of labels (\le13 labeled images per class).

Framework controls uncertainty in LLMs without labels or probabilities.

problem Managing uncertainty in black-box LLMs without token-level probability or true labels.
method Integrates generative models, UCP, and conformal alignment to control uncertainty.
result Achieves close-to-nominal coverage and tighter thresholds than split UCP.

Recent advances in Graph Convolutional Networks (GCNs) have led to state-of-the-art performance on various graph-related tasks. However, most existing GCN models do not explicitly identify whether all the aggregated neighbors are valuable to the learning tasks, which may harm the learning performance. In this paper, we…

2019-07-10abs ↗pdf ↗

New method estimates hidden binary mixture model centers efficiently.

problem Estimating centers in high-dimensional binary mixture models with hidden Markov structure.
method Proposes a minimax optimal procedure and an adaptive variant.
result Achieves optimal rate of order δd/n+d/n\sqrt{δd/n} + d/n.

New method tackles label noise on imbalanced datasets by considering class-specific uncertainty.

problem Label noise and class imbalance in imbalanced datasets.
method Epistemic and aleatoric uncertainty-aware class-specific noise modeling.
result Proposed ULC framework improves performance on imbalanced datasets.

Study on online regression with noise, achieving near-optimal regret bounds.

problem Online generalized linear regression with stochastic noise.
method Sharp analysis of FTRL algorithm for stochastic label noise.
result Achieved near-optimal regret bounds for O(σ2dlogT)+o(logT)O(σ^2 d \log T) + o(\log T).

BOSS learns from one labeled sample per class to match fully supervised performance.

problem Achieving fully supervised performance with minimal labeled data.
method Combines class prototype refining, class balancing, and self-training.
result BOSS achieves comparable test accuracies to fully supervised learning.

AutoElicit uses LLMs to quickly create expert priors for predictive models.

problem Creating accurate priors for predictive models is time-consuming and costly.
method AutoElicit extracts knowledge from LLMs to construct priors for predictive models.
result AutoElicit yields priors that reduce error and save labelling effort.

In many real applications of statistical learning, a decision made from misclassification can be too costly to afford; in this case, a reject option, which defers the decision until further investigation is conducted, is often preferred. In recent years, there has been much development for binary classification with a …

2017-01-09abs ↗pdf ↗