Advice-efficient prediction with expert advice (in analogy to label-efficient prediction) is a variant of prediction with expert advice game, where on each round of the game we are allowed to ask for advice of a limited number out of experts. This setting is especially interesting when asking for advice of ever…
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
48 results for “Prediction with Expert Advice”
Investigates fast prediction rates with limited expert advice.
problem Minimizing excess generalization error with limited expert access.
method Assumes Lipschitz and strongly convex loss, designs novel algorithms.
result Achieves fast rates of O(1/T) with optimal number of expert advices.
Improved algorithm reduces regret in corrupted expert advice setting.
problem Prediction with expert advice in the presence of adversarial corruption.
method Multiplicative Weights algorithm with decreasing step sizes.
result Achieves constant regret and optimal performance in various environments.
Improved bounds for online prediction with expert advice.
problem Online prediction with expert advice in finite-horizon games.
method Verification arguments from optimal control theory applied to PDEs to find sub- and supersolutions.
result Explicit bounds for any number of experts and horizon, improving upon previous results.
A new method for learning to defer decisions with expert advice improves over standard methods.
problem Learning to defer decisions with expert advice in systems where expert information can be modified after selection.
method An augmented surrogate that operates on the composite expert-advice action space, providing consistency guarantees and excess-risk bounds.
result The method improves over standard Learning-to-Defer and adapts its advice acquisition behavior to the cost regime.
A Generalized Online Algorithm for Translation and Scale Invariant Prediction with Expert Advicecs.LG
Generalized algorithm for translation and scale-invariant prediction.
problem Sequential prediction with expert advice, focusing on translation and scale invariance.
method Designing a generalized online algorithm using the universal prediction perspective to compete against a generic class of expert selection strategies.
result No preliminary knowledge of loss sequences is required; performance bounds are stable under arbitrary scalings and translations.
In the framework of prediction with expert advice, we consider a recently introduced kind of regret bounds: the bounds that depend on the effective instead of nominal number of experts. In contrast to the Normal- Hedge bound, which mainly depends on the effective number of experts but also weakly depends on the nominal…
Conventional learning with expert advice methods assumes a learner is always receiving the outcome (e.g., class labels) of every incoming training instance at the end of each trial. In real applications, acquiring the outcome from oracle can be costly or time consuming. In this paper, we address a new problem of active…
New algorithms improve prediction with expert advice under local differential privacy.
problem Predicting expert advice with privacy constraints.
method Design of two new algorithms: RW-AdaBatch and RW-Meta, leveraging limited-switching behavior and random walks.
result RW-Meta outperforms classical and central DP algorithms by 1.5-3x on predicting hospital COVID patient densities.
Improves reward bounds for prediction with expert advice using abstention.
problem Prediction with expert advice under bandit feedback with abstention.
method CBA algorithm exploiting abstention to improve reward bounds.
result Achieved significant improvement in reward bounds for general confidence-rated predictors.
Survey of algorithms to correct past mistakes in prediction.
problem Improving prediction accuracy by correcting past errors.
method Defensive Forecasting as a sequential game theory approach to minimize prediction metrics.
result Simple, near-optimal algorithms for various prediction tasks.
Improved prediction algorithm for 'easy' sequences with reduced regret.
problem Prediction with expert advice for 'easy' sequences.
method Variant of NormalHedge algorithm using second-order -quantile regret bound.
result Second-order -quantile regret bound of for .
Paper studies continuous prediction with experts' advice using differential equations.
problem Continuous prediction with experts' advice in online learning.
method Continuous-time stochastic calculus and differential equations.
result Improved guarantees for quantile regret with continuous-time algorithm.
New algorithm reduces expert prediction regret for two experts.
problem Efficient prediction with two experts under fixed time constraints.
method Optimal algorithm based on stochastic calculus techniques.
result Achieves optimal regret of sqrt(T/2π) + O(1) with O(1) per-turn processing time.
New algorithms reduce label collection for online prediction with expert advice.
problem Efficiently predicting binary sequences with expert advice using fewer labels.
method Adaptive selective sampling for exponentially weighted forecasters.
result Label complexity scales roughly as the square root of the number of rounds for a scenario with a strictly better expert.
Study finds optimal regret bound for multi-armed bandit problem with expert advice.
problem Optimizing decision-making in a multi-armed bandit problem with expert advice.
method Proved a tight lower bound matching the upper bound of Kale (2014) for minimax expected regret.
result The minimax optimal expected regret is Θ(√(T K log (N/K))) for the problem.
New bounds for prediction with experts using geometric stopping.
problem Online prediction with expert advice, focusing on geometric stopping.
method Potential-based framework, explicit bounds construction.
result First explicit lower and upper bounds in geometric stopping setting.
Improved regret bounds for bandits with expert advice.
problem Optimizing decision-making in environments with expert advice.
method Proved lower and upper bounds for regret in restricted and standard feedback models.
result Proved a new upper bound of order for the worst-case regret, matching a previously known lower bound.
Improved regret bounds for bandits with fixed expert advice using information theory.
problem Optimizing regret in bandit problems with fixed expert distributions.
method Information-theoretic analysis and KL-divergence measures.
result First regret bounds for EXP4 that can get arbitrarily close to zero under certain conditions.
Improved cumulative regret for sequence prediction with limited expert advice.
problem Minimizing cumulative regret in sequence prediction with limited information.
method Convex combination of experts with limited observation, achieving constant regret.
result Strategies achieve constant regret independent of the horizon T, improving over standard bounds.
The paper extends a prediction method to curved spaces.
problem Prediction with expert advice in curved spaces.
method Geometric considerations and adaptation of online to batch conversion.
result Extension of exponentially weighted average forecaster to non-positive curvature spaces.
For the prediction with experts' advice setting, we construct forecasting algorithms that suffer loss not much more than any expert in the pool. In contrast to the standard approach, we investigate the case of long-term forecasting of time series and consider two scenarios. In the first one, at each step the learne…
With the increasing volume of data in the world, the best approach for learning from this data is to exploit an online learning algorithm. Online ensemble methods are online algorithms which take advantage of an ensemble of classifiers to predict labels of data. Prediction with expert advice is a well-studied problem i…
Bayesian algorithms improve online learning with adversaries over infinite action spaces.
problem Online learning with adversaries over infinite action spaces.
method Developed a Thompson sampling algorithm for online learning with an adversary's prior over the space of actions.
result Thompson sampling over a Gaussian process prior achieves a rate of against a -bounded -Lipschitz adversary.
Online prediction improves with abstention, reducing regret to a fixed bound.
problem Sequential prediction with expert advice.
method Introducing abstention with a cost smaller than 0.5, achieving independent regret bounds.
result Achieves expected regret bounds independent of time horizon, with bounds of order log(N)/(1-2c).
We study the multiclass online learning problem where a forecaster makes a sequence of predictions using the advice of experts. Our main contribution is to analyze the regime where the best expert makes at most mistakes and to show that when , the expected number of mistakes made by the optima…
We provide the first algorithm for online bandit linear optimization whose regret after T rounds is of order sqrt{Td ln N} on any finite class X of N actions in d dimensions, and of order d*sqrt{T} (up to log factors) when X is infinite. These bounds are not improvable in general. The basic idea utilizes tools from con…
We consider a variation on the problem of prediction with expert advice, where new forecasters that were unknown until then may appear at each round. As often in prediction with expert advice, designing an algorithm that achieves near-optimal regret guarantees is straightforward, using aggregation of experts. However, …
A new framework uses deep RL to aggregate expert advice for better portfolio management.
problem Improving portfolio management through expert advice and deep reinforcement learning.
method Convolutional networks for signal aggregation and historical price data, Proximal Policy Optimization algorithm.
result Our framework can achieve 90% of the best expert's profit on average.
Sharp bounds found on expert error in binary advice aggregation.
problem Aggregating binary advice from conditionally independent experts.
method Sharp upper and lower bounds on optimal error probability in asymmetric case.
result Sharp bounds recover and sharpen known results in symmetric case.
The paper explores trade-offs between regret and variance in online learning algorithms.
problem Investigating the trade-offs between regret and variance in online learning.
method Analysis of the Exponentially Weighted Average (EWA) algorithm and its variants.
result A variant of EWA either achieves negative regret or guarantees a logarithmic bound on both variance and regret.
A simple algorithm improves model generalization in expert advice settings.
problem Improving model generalization in expert advice settings.
method A naive aggregation algorithm for point estimations of high-dimensional nonlinear functions.
result Conditions for optimal parameter estimates through sequential mixing distribution strategies.
A novel algorithm for actively trading stocks is presented. While traditional expert advice and "universal" algorithms (as well as standard technical trading heuristics) attempt to predict winners or trends, our approach relies on predictable statistical relations between all pairs of stocks in the market. Our empirica…
We prove non-asymptotic lower bounds on the expectation of the maximum of independent Gaussian variables and the expectation of the maximum of independent symmetric random walks. Both lower bounds recover the optimal leading constant in the limit. A simple application of the lower bound for random walks is an (…
This paper introduces a novel optimization method for differential neural architecture search, based on the theory of prediction with expert advice. Its optimization criterion is well fitted for an architecture-selection, i.e., it minimizes the regret incurred by a sub-optimal selection of operations. Unlike previous s…
The paper shows optimal robustness against adversarial corruption in sequential decision-making problems.
problem Optimal robustness to adversarial corruption in online decision-making problems.
method Investigates prediction with expert advice and multi-armed bandit problems, focusing on algorithms with decreasing learning rates and second-order regret bounds.
result Optimal robustness can be expressed by a square-root dependency on the amount of corruption, achieving -regret.
Optimal discovery with probabilistic expert advice: finite time analysis and macroscopic optimalitycs.LG
We consider an original problem that arises from the issue of security analysis of a power system and that we name optimal discovery with probabilistic expert advice. We address it with an algorithm based on the optimistic paradigm and on the Good-Turing missing mass estimator. We prove two different regret bounds on t…
CRPS Learningstat.ML
New method improves forecast accuracy using CRPS for probabilistic predictions.
problem Improving forecast accuracy for probabilistic predictions, especially in the tails of distributions.
method Introduces a new weighting method for pointwise CRPS learning, optimizing across quantiles.
result Proposed fully adaptive Bernstein online aggregation (BOA) method for pointwise CRPS online learning has optimal convergence properties.
Optimal algorithm reduces regret in adversarial bandit problem with multiple plays.
problem Minimizing regret in adversarial bandit problem with multiple plays.
method Introducing a new expert advice algorithm for multiple-play setting, achieving minimax optimal regret bounds.
result Minimizes regret asymptotically to the best switching strategy with optimal bounds.
A key challenge in online learning is that classical algorithms can be slow to adapt to changing environments. Recent studies have proposed "meta" algorithms that convert any online learning algorithm to one that is adaptive to changing environments, where the adaptivity is analyzed in a quantity called the strongly-ad…
Optimal algorithm found for anytime regret with two experts.
problem Minimizing regret in prediction with two experts when time horizon is unknown.
method Designing a minimax optimal algorithm using ideas from stochastic calculus.
result Proved the optimal regret is γ√t / 2 for all time steps t.
We consider prediction with expert advice under the log-loss with the goal of deriving efficient and robust algorithms. We argue that existing algorithms such as exponentiated gradient, online gradient descent and online Newton step do not adequately satisfy both requirements. Our main contribution is an analysis of th…
This thesis presents some geometric insights into three different types of two player prediction games -- namely general learning task, prediction with expert advice, and online convex optimization. These games differ in the nature of the opponent (stochastic, adversarial, or intermediate), the order of the players' mo…
We study a variant of decision-theoretic online learning in which the set of experts that are available to Learner can shrink over time. This is a restricted version of the well-studied sleeping experts problem, itself a generalization of the fundamental game of prediction with expert advice. Similar to many works in t…
Novel algorithms for online learning with uncertain feedback graphs reduce regret.
problem Uncertainty in feedback graphs hinders traditional online learning approaches.
method Developed novel online learning algorithms to handle uncertain feedback graphs.
result Proved sublinear regret under mild conditions for the proposed algorithms.
New algorithms reduce private bandit regret to nearly non-private levels.
problem Differentially private adversarial bandits and expert advice.
method Conversion of non-private algorithms to private, new algorithms for bandits and expert advice.
result Improved regret bounds for private bandits, sublinear for small ε.
New algorithm improves bandit with graph feedback by decomposing regret.
problem Improving performance in bandit problems with graph feedback.
method Partition-based algorithm framework using regret decomposition.
result Improved and optimal regret bounds on various graph families.
Toward Optimal Adversarial Policies in the Multiplicative Learning System with a Malicious Expertcs.LG
Optimal policies identified for learning systems with a malicious expert.
problem Adversarial attacks on learning systems combining expert advice.
method Analysis of offline and online settings, dynamic programming for online setting.
result Greedy policy is asymptotically optimal with approximation ratio for offline setting.