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

Trend · papers per month

0.3%0.5%0.8%0.1% · Nov 201719922001200920172026
11 results for label-scarce

Paper proposes MDAT to stabilize domain alignment in label-scarce settings.

problem Stable and comprehensive domain alignment in label-scarce settings.
method Max-margin Domain-Adversarial Training (MDAT) with Adversarial Reconstruction Network (ARN).
result MDAT stabilizes gradient reversing and achieves strong robustness to hyper-parameters.

Method generates intermediate domains to align source and target domains.

problem Challenges of domain adaptation with significant domain divergence.
method Progressive domain augmentation via domain interpolation and multiple subspace alignment.
result Achieves state-of-the-art performance on multiple domain adaptation tasks.

New insights into how data transformations affect self-supervised clustering.

problem Impact of data transformations on self-supervised clustering convergence.
method Theoretical and empirical analysis of various data transformations.
result Certain transformations help in faster convergence of self-supervised clustering.

Transfer learning aims to faciliate learning tasks in a label-scarce target domain by leveraging knowledge from a related source domain with plenty of labeled data. Often times we may have multiple domains with little or no labeled data as targets waiting to be solved. Most existing efforts tackle target domains separa…

2017-11-09abs ↗pdf ↗

Optimizes risk assessment tools using mixed-integer programming.

problem Challenges in healthcare risk assessment due to label scarcity and asymmetric misclassification costs.
method Jointly optimizes scoring weights and category thresholds via mixed-integer programming (MIP).
result Prevents label-scarce category collapse and achieves more accurate risk categorization.

New method predicts RUL and failure modes from partial data.

problem Predicting RUL and failure modes from incomplete data.
method Formulated as vector General Value Function (GVF) prediction on an absorbing degradation process, using TD(n,λn,λ) for estimation.
result TD improves RUL and failure-mode prediction compared to Monte Carlo methods, especially under scarce complete labels.

DUPLE tackles cross-deployment recognition in fiber-optic perimeter security with meta-learning.

problem Cross-deployment recognition challenges in fiber-optic perimeter security due to label scarcity and distribution shifts.
method DUPLE employs statistically guided meta-learning to enhance recognition robustness across unseen deployments.
result DUPLE consistently outperforms traditional and meta-learning baselines in cross-deployment DFOS benchmarks.

VB-Score evaluates AI systems without ground truth, revealing robustness.

problem Evaluating AI systems without ground truth labels, especially for entity-centric tasks.
method VB-Score uses variance-bounded evaluation, constraint relaxation, and Monte Carlo sampling.
result VB-Score reveals robustness differences not seen by conventional frameworks.