Optimal algorithm converts weak to strong learner with less data.
problem Constructing a strong learner from a weak learner with minimal data.
method New algorithm that uses less training data than AdaBoost.
result Optimal sample complexity for converting weak to strong learner.
New mechanism detects overlap density for weak-to-strong generalization.
problem Understanding what aspects of data enable weak-to-strong generalization.
method Data-centric mechanism and overlap detection algorithm.
result Overlap density is a key factor in weak-to-strong generalization.
Paper proposes an algorithm to recover full supervision from weakly labeled data.
problem Machine learning requires expensive data annotation, motivating the use of weak supervision.
method The paper introduces a disambiguation principle and an empirical disambiguation algorithm for partial labelling.
result The algorithm achieves exponential convergence rates under learnability assumptions.
Boosts weak online learners to strong ones with sublinear regret.
problem Online learning agnostic setting without strong guarantees.
method Reduction to online convex optimization, boosting via marginally-better-than-trivial regret guarantees.
result First agnostic online boosting algorithm with sublinear regret.
Boosting combines weak hypotheses to create accurate predictions under bounded VC dimension.
problem How to combine weak hypotheses to achieve accurate predictions efficiently.
method Designing a novel boosting algorithm with complex aggregation rules for bounded VC dimension classes.
result The new boosting algorithm requires fewer weak hypotheses than classical lower bounds, provided they belong to a bounded VC class.
Paper presents a new policy gradient theorem using weak derivatives for reinforcement learning.
problem Continuous state-action reinforcement learning problems.
method Introduced an alternative policy gradient theorem using weak derivatives.
result The new approach yields algorithms that converge almost surely to stationary points of the value function.
Boosting improves accuracy with fewer calls to weak learners for certain concept classes.
problem Improving accuracy of learning algorithms with limited weak learner calls.
method Combines boosting and list-decodable codes to achieve better performance for specific concept classes.
result A new boosting algorithm that achieves strong learning with fewer calls to weak learners and additional samples.
Weak supervision challenges black-box models, suggesting fusion of modeling cultures.
problem Challenges of strong supervision in achieving accurate predictions.
method Integrating data modeling into algorithmic modeling for weak supervision.
result Integration of data modeling culture improves model stability and accuracy.
The Efficient Market Hypothesis has been a staple of economics research for decades. In particular, weak-form market efficiency -- the notion that past prices cannot predict future performance -- is strongly supported by econometric evidence. In contrast, machine learning algorithms implemented to predict stock price h…
A new method for weakly supervised learning that improves model accuracy.
problem Training machine learning models with precise labels is expensive; weak supervision provides a low-cost alternative.
method Data consistent weak supervision algorithm that searches over classifiers to find plausible labelings, considering features of the training data and estimating labels for low/no coverage data.
result Empirically, the method significantly outperforms state-of-the-art weak supervision methods on text and image classification tasks.
The paper provides a framework for weakly supervised disentanglement guarantees.
problem Learning disentangled representations in real-world data.
method Theoretical framework for analyzing disentanglement guarantees with weak supervision.
result Empirical verification of weak supervision methods' predictive power and usefulness.
Paper proposes autonomous detection and learning from minimal data.
problem Autonomous detection and learning from extremely weak supervision.
method xClass method and algorithm for fully unsupervised detection and learning.
result Successfully discovers new classes and learns from data autonomously.
There is increasing interest in learning algorithms that involve interaction between human and machine. Comparison-based queries are among the most natural ways to get feedback from humans. A challenge in designing comparison-based interactive learning algorithms is coping with noisy answers. The most common fix is to …
Boosting weak learners to strong ones from aggregate labels is possible for LLP but not for MIL.
problem Boosting weak learners to strong ones from aggregate labels in learning from label proportions (LLP).
method Using a weak learner on large enough bags to obtain a strong learner for small bags in polynomial time.
result Boosting is possible for LLP but not for MIL.
Weak correlations explain linear dynamics in deep learning models.
problem Understanding the linear structure in gradient-based learning algorithms.
method Characterization of weak correlations between derivatives and parameters.
result Weak correlations are the underlying principle for linearization in deep learning models.
Paper proves large deviation principle for stochastic approximations.
problem Asymptotic estimates of learning algorithm deviations.
method Weak convergence approach to large deviations.
result Identifies appropriate scaling sequence and new representation for rate function.
New method separates sounds with weak labels in noisy environments.
problem Training audio source separation systems with limited labeled data.
method Proposes objective functions and network architectures for weakly labeled training.
result Achieves significant SI-SDR improvement in noisy scenarios.
An algorithm learns from multiple models to match an oracle's risk.
problem Learning from multiple noisy models to estimate a target parameter.
method Elimination rounds algorithm for adaptive learning.
result Risk of weak-oracle learner matches that of an oracle in multiple source case.
Boosting improves accuracy by combining weak learners into a voting classifier.
problem Boosting's theoretical performance is sub-optimal, especially for voting classifiers.
method Proposes a randomized boosting algorithm that outputs voting classifiers with a single logarithmic dependency on sample size.
result Randomized boosting achieves a generalization error with a single logarithmic dependency on the sample size.
An active learner is given a hypothesis class, a large set of unlabeled examples and the ability to interactively query labels to an oracle of a subset of these examples; the goal of the learner is to learn a hypothesis in the class that fits the data well by making as few label queries as possible. This work addresses…
Studied SGD convergence under weak conditions.
problem Convergence of SGD in nonconvex optimization.
method Analyzed biased nonconvex SGD under mild conditions.
result Provided convergence rates and complexities.
Boosting is a popular way to derive powerful learners from simpler hypothesis classes. Following previous work (Mason et al., 1999; Friedman, 2000) on general boosting frameworks, we analyze gradient-based descent algorithms for boosting with respect to any convex objective and introduce a new measure of weak learner p…
Improves label propagation for weakly supervised learning.
problem Reducing the need for labeled data in machine learning.
method Label Propagation with Weak Supervision (LPA) analysis.
result Demonstrated improvements over existing methods on weakly supervised classification tasks.
Unified approach for learning with weak labels across various tasks.
problem Learning with noisy or incomplete labels in diverse machine learning settings.
method Implicit posterior models for joint label inference.
result Unified training objective for various machine learning tasks.
Cancer analysis and prediction is the utmost important research field for well-being of humankind. The Cancer data are analyzed and predicted using machine learning algorithms. Most of the researcher claims the accuracy of the predicted results within 99%. However, we show that machine learning algorithms can easily pr…
Boosting for off-policy learning reduces empirical risk.
problem Learning from logged bandit feedback without labeled data.
method A boosting algorithm optimizing policy's expected reward.
result Excess empirical risk decreases with each round of boosting.
Unified approach for multicalibration in weakly supervised learning.
problem Existing multicalibration methods require clean input-label pairs, which are unavailable in weakly supervised learning.
method Developed estimators and post-hoc correction methods for multicalibration under weak supervision.
result Unified framework for estimating and correcting multicalibration under weak supervision with finite-sample guarantees.
New deep learning architecture learns martingales efficiently.
problem Efficiently learning martingales in financial derivatives pricing.
method High-order weak approximation algorithms of Runge-Kutta type.
result Deep neural networks based on this architecture learn martingales effectively.
Recent work has extended the theoretical analysis of boosting algorithms to multiclass problems and to online settings. However, the multiclass extension is in the batch setting and the online extensions only consider binary classification. We fill this gap in the literature by defining, and justifying, a weak learning…
This paper reconciles different views on AdaBoost to better understand its dynamics.
problem Understanding the dynamics of AdaBoost and its various interpretations.
method Analyzing and unifying different perspectives on AdaBoost.
result Unified understanding of AdaBoost's dynamics and its various interpretations.
Labeling training data is a key bottleneck in the modern machine learning pipeline. Recent weak supervision approaches combine labels from multiple noisy sources by estimating their accuracies without access to ground truth labels; however, estimating the dependencies among these sources is a critical challenge. We foc…
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.
The paper offers a simple proof of Condorcet's jury theorem.
problem The relationship between majority voting and Condorcet's jury theorem.
method A simple derivation of Condorcet's jury theorem.
result Condorcet's jury theorem is more likely to choose correctly when individual votes are often correct and independent.
Weak labels can significantly speed up learning for strong tasks.
problem Learning with limited strong labels.
method Using weak labels to accelerate learning of strong tasks.
result Weak labels can accelerate learning to O(icefrac1n) rate. Improved multi-class AdaBoost algorithm with stronger weak learnability condition.
problem Multi-class classification problem with at least two labels.
method Recursive ensemble algorithm inspired by SAMME, strengthening weak learnability condition.
result Final hypothesis converges to correct label with probability 1 and generalization error bounds exponentially.
NOT learns optimal transport plans, kernel costs improve performance.
problem NOT algorithm learns non-optimal plans with weak quadratic costs.
method Introduced kernel weak quadratic costs to improve NOT's performance.
result Kernel costs provide improved theoretical and practical guarantees.
WSINDy for PDEs robustly identifies models from noisy data.
problem Identifying nonlinear dynamics from noisy partial differential equations data.
method Weak formulation of PDEs, Fourier-based model identification, sequential-thresholding least-squares.
result WSINDy enables robust identification of PDEs in noisy conditions.
Formalizes weak and strong verification for LLMs, controlling errors without assumptions.
problem Balancing cost and reliability in reasoning with LLMs.
method Formalizes weak-strong verification policies, introduces metrics, develops online algorithm.
result Optimal policies admit a two-threshold structure, and calibration and sharpness govern value of weak verifiers.
We consider the multi-label ranking approach to multi-label learning. Boosting is a natural method for multi-label ranking as it aggregates weak predictions through majority votes, which can be directly used as scores to produce a ranking of the labels. We design online boosting algorithms with provable loss bounds for…
Deep neural nets learn from weakly dependent processes.
problem Learning from ψ-weakly dependent processes. method Deep neural networks for ψ-weakly dependent processes. result Established consistency of empirical risk minimization algorithm and generalization bound.
Extends boosting to multiclass online agnostic classification.
problem Online multiclass classification with weak learners.
method Reduces multiclass online agnostic boosting to online convex optimization.
result First boosting algorithm for online agnostic multiclass classification.
Study shows offline RL with partial coverage and weak function classes is possible.
problem Learning optimal policies from logged data with function approximation.
method Marginalized Importance Sampling (MIS) with additional covering distribution.
result Finite-sample guarantees for sample-efficient offline RL for general MDPs.
New algorithms solve weak optimal transport problems for nonlinear costs.
problem Computing weak optimal transport with nonlinear costs.
method Mirror descent algorithms for primal and dual versions of WOT.
result Solutions for WOT and WOTUK compared with classical OT.
Boosting Nyström improves accuracy of matrix approximations.
problem Generating low-rank approximations of large matrices efficiently.
method Iteratively generate multiple weak Nyström approximations, combine them to form a strong approximation.
result Boosting Nyström yields more efficient and accurate low-rank approximations.
We show that the existence of a computationally efficient calibration algorithm, with a low weak calibration rate, would imply the existence of an efficient algorithm for computing approximate Nash equilibria - thus implying the unlikely conclusion that every problem in PPAD is solvable in polynomial time.
Boosting combines weak classifiers to form highly accurate predictors. Although the case of binary classification is well understood, in the multiclass setting, the "correct" requirements on the weak classifier, or the notion of the most efficient boosting algorithms are missing. In this paper, we create a broad and ge…
Study on tradeoffs between mistakes and ERM oracle calls in online and transductive learning.
problem Analyzing online and transductive learning with limited ERM and weak consistency oracle access.
method Proves lower bounds and upper bounds on mistakes and oracle calls, considering realizable and agnostic cases.
result Achieves optimal mistake bounds with weak consistency queries for certain concept classes.
The purpose of this paper is to introduce a concept of equivalence between machine learning algorithms. We define two notions of algorithmic equivalence, namely, weak and strong equivalence. These notions are of paramount importance for identifying when learning prop erties from one learning algorithm can be transferre…