arXiv Machine Learning
Jul 22
Weak-to-Strong Learning in Decision Making
arXiv:2607. 18467v1 Announce Type: new Abstract: Many operational decisions rely on predictive models that estimate uncertain outcomes conditional on observable contexts.
A Unified and Stable Risk Minimization Framework for Weakly Supervised Learning with Theoretical Guarantees
arXiv:2511. 22823v2 Announce Type: replace-cross Abstract: Weakly supervised learning has emerged as a practical alternative to fully supervised learning when complete and accurate labels are costly or infeasible to acquire.
Related stories
arXiv Machine Learning
Jul 15
Calibratable Disambiguation Loss for Multi-Instance Partial-Label Learning
arXiv:2512. 17788v2 Announce Type: replace Abstract: Multi-instance partial-label learning (MIPL) is a weakly supervised framework that extends the principles of multi-instance learning (MIL) and partial-label learning (PLL) to address the challenges of inexact supervision in both instance and label spaces.
arXiv Machine Learning
Aug 10
Recent advances in weakly supervised learning: New supervision paradigms, assumption relaxations, and practical solutions
arXiv:2608. 06896v1 Announce Type: new Abstract: Deep learning has achieved great success in recent years thanks to the availability of high-quality, well-annotated training data.
arXiv AI
Jun 11
CoVar: Confidence-Variance-Guided Pseudo-Label Selection for Semi-Supervised Learning
arXiv:2601. 11670v3 Announce Type: replace-cross Abstract: Pseudo-label selection in semi-supervised learning is commonly driven by maximum-confidence thresholds, yet confidence alone can be unreliable under model overconfidence and class imbalance.
arXiv AI
Jul 28
Directional Influence Function: Estimating Training Data Influence in Constrained Learning
arXiv:2607. 23388v1 Announce Type: cross Abstract: As constrained learning becomes increasingly common, models are trained under explicit feasibility requirements to enforce fairness, safety, robustness, regulariza- tion, and physics or logic constraints.
Hugging Face Trending Papers
Aug 7
Recent advances in weakly supervised learning: New supervision paradigms, assumption relaxations, and practical solutions
Deep learning has achieved great success in recent years thanks to the availability of high-quality, well-annotated training data. However, this requirement is often not met in real-world applications.
arXiv Machine Learning
Jul 1
When few labeled target data suffice: a theory of semi-supervised domain adaptation via fine-tuning from multiple adaptive starts
arXiv:2507. 14661v2 Announce Type: replace-cross Abstract: Semi-supervised domain adaptation (SSDA) seeks to achieve accurate predictions in a target domain with limited labeled target data by exploiting abundant source and unlabeled target data.
arXiv Machine Learning
Jul 21
The Label Complexity of Class-Conditional Coverage under Distribution Shift
arXiv:2607. 18088v1 Announce Type: new Abstract: Standard evaluation of many recognition systems contains distribution shift by construction, since benchmarks place disjoint conditions in the training and test splits.
arXiv Machine Learning
Jul 2
Invariance Pair Guidance: Robustness to Spurious Correlations via Corrective Gradients
arXiv:2502. 18975v2 Announce Type: replace Abstract: Machine learning models are inherently bound to the distribution of the training data, often exploiting non-causal shortcuts.
arXiv AI
Jun 2
Rethinking Weak Supervision in Anomaly Detection: A Comprehensive Benchmark
arXiv:2605. 26068v3 Announce Type: replace-cross Abstract: Weakly supervised anomaly detection (WSAD) has developed in three primary directions: incomplete, inexact, and inaccurate supervision.
arXiv Machine Learning
6d ago
Linear-Core Surrogates: Smooth Loss Functions with Linear Rates for Classification and Structured Prediction
arXiv:2604. 27742v2 Announce Type: replace Abstract: A fundamental dichotomy in the theory of classification sets smoothness against statistical efficiency: smooth surrogate losses such as the logistic loss enable fast $O(1/T)$ optimization but yield slow square-root $H$-consistency bounds, while piecewise-linear losses like the Hinge loss achieve optimal linear $H$-consistency rates but are non-differentiable.
arXiv Machine Learning
Jul 7
Distribution-free Deviation Bounds and The Role of Domain Knowledge in Learning via Model Selection with Cross-validation Risk Estimation
arXiv:2303. 08777v3 Announce Type: replace-cross Abstract: Cross-validation is one of the most widely used tools for risk estimation and model selection in statistics and machine learning, yet its theoretical properties when embedded in a learning procedure remain insufficiently understood.