How to use expert advice

No abstract is available for this paper.

• Publication year

  1993

• Venue

  Symposium on the Theory of Computing

• Publication date

  1993-06-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/167088.167198
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On Weak Learning

  1995cited by this paper
• A Loss Bound Model for On-Line Stochastic Prediction Algorithms

  1995cited by this paper
• Sharper Bounds for Gaussian and Empirical Processes

  1994cited by this paper
• Tight worst-case loss bounds for predicting with expert advice

  1994cited by this paper
• Using experts for predicting continuous outcomes

  1994cited by this paper
• Approximate methods for sequential decision making using expert advice

  1994cited by this paper
• Rates of convergence for minimum contrast estimators

  1993cited by this paper
• Universal Schemes for Sequential Decision from Individual Data Sequences

  1993cited by this paper
• A logic of probability, with application to the foundations of statistics

  1993cited by this paper
• Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension

  1992cited by this paper
• Toward Eecient Agnostic Learning

  1992cited by this paper
• Universal sequential learning and decision from individual data sequences

  1992cited by this paper
• Universal Forecasting Algorithms

  1992cited by this paper
• Statistical mechanics of learning from examples.

  1992cited by this paper
• HOW WELL DO BAYES METHODS WORK FOR ON-LINE PREDICTION OF {+- 1} VALUES?

  1992cited by this paper
• Some weak learning results

  1992cited by this paper
• Prequential data analysis

  1992cited by this paper
• Competitive Paging Algorithms

  1991cited by this paper
• Universal prediction of individual sequences

  1991cited by this paper
• Competitive algorithms for layered graph traversal

  1991cited by this paper
• On-line learning of linear functions

  1991cited by this paper
• Principles of Risk Minimization for Learning Theory

  1991cited by this paper
• A loss bound model for on-line stochastic prediction strategies

  1991cited by this paper
• The Asymptotic Theory of Extreme Order Statistics

  1990cited by this paper
• Learning from examples in large neural networks.

  1990cited by this paper
• Distribution-free Learning of Probabilistic Concepts

  1990cited by this paper
• Efficient distribution-free learning of probabilistic concepts

  1990cited by this paper
• Competitive k-server algorithms

  1990cited by this paper
• Aggregating strategies

  1990cited by this paper
• Efficient Distribution-free Learning of Probabilistic Concepts (Extended Abstract)

  1990cited by this paper
• From on-line to batch learning

  1989cited by this paper
• The weighted majority algorithm

  1989cited by this paper
• Learnability and the Vapnik-Chervonenkis dimension

  1989cited by this paper
• Learning probabilistic prediction functions

  1988cited by this paper
• Equivalence of models for polynomial learnability

  1988cited by this paper
• Predicting (0, 1)-functions on randomly drawn points

  1988cited by this paper
• Stochastic Complexity and Modeling

  1986cited by this paper
• A theory of the learnable

  1984cited by this paper
• Universal modeling and coding

  1981cited by this paper
• Modeling By Shortest Data Description*

  1978cited by this paper
• Compound Bayes Predictors for Sequences with Apparent Markov Structure

  1977cited by this paper
• Behavior of sequential predictors of binary sequences

  1965cited by this paper
• 4. APPROXIMATION TO RAYES RISK IN REPEATED PLAY

  1958cited by this paper
• Contributions to the theory of games

  1953cited by this paper

• Online Realizable Regression and Applications for ReLU Networks

  2026cites this paper
• Computable universal online learning

  2025cites this paper
• Online Learning of Neural Networks

  2025cites this paper
• Revisiting Projection-Free Online Learning with Time-Varying Constraints

  2025cites this paper
• Bayesian Decision Making around Experts

  2025cites this paper
• When Lower-Order Terms Dominate: Adaptive Expert Algorithms for Heavy-Tailed Losses

  2025cites this paper
• Non-stationary Bandit Convex Optimization: A Comprehensive Study

  2025cites this paper
• A Regression-Based Prediction-Correction Method for Stochastic Time-Varying Optimization Problems

  2025cites this paper
• Multi-model Online Conformal Prediction with Graph-Structured Feedback

  2025cites this paper
• Instance-Dependent Regret Bounds for Nonstochastic Linear Partial Monitoring

  2025influential citation
• Performance-bounded Online Ensemble Learning Method Based on Multi-armed bandits and Its Applications in Real-time Safety Assessment

  2025cites this paper
• On the Universal Near Optimality of Hedge in Combinatorial Settings

  2025cites this paper
• Last-iterate Convergence for Symmetric, General-sum, $2 \times 2$ Games Under The Exponential Weights Dynamic

  2025cites this paper
• Budgeted Online Active Learning with Expert Advice and Episodic Priors

  2025cites this paper
• Stochastic Shortest Path with Sparse Adversarial Costs

  2025cites this paper
• Revisiting Multi-Agent Asynchronous Online Optimization with Delays: the Strongly Convex Case

  2025cites this paper
• Label Shift Meets Online Learning: Ensuring Consistent Adaptation with Universal Dynamic Regret

  2025cites this paper
• Sparsity-Based Interpolation of External, Internal and Swap Regret

  2025cites this paper
• An Elementary Proof of the Near Optimality of LogSumExp Smoothing

  2025influential citation
• Online Omniprediction with Long-Term Constraints

  2025cites this paper
• A Minimalist Bayesian Framework for Stochastic Optimization

  2025cites this paper
• SEAD: Unsupervised Ensemble of Streaming Anomaly Detectors

  2025influential citation
• Online Nonsubmodular Optimization with Delayed Feedback in the Bandit Setting

  2025cites this paper
• Non-Stationary Bandit Convex Optimization: An Optimal Algorithm with Two-Point Feedback

  2025cites this paper
• Optimal Online Bookmaking for Binary Games

  2025cites this paper
• Instance-Optimal Matrix Multiplicative Weight Update and Its Quantum Applications

  2025influential citation
• AEGIS: Online Adaptive AI Content Safety Moderation with Ensemble of LLM Experts

  2024cites this paper
• Non-stochastic Bandits With Evolving Observations

  2024cites this paper
• Periodicity in Hedge-Myopic System and an Asymmetric NE-Solving Paradigm for Two-Player Zero-Sum Games

  2024cites this paper
• The Dimension of Self-Directed Learning

  2024cites this paper
• Games played by Exponential Weights Algorithms

  2024cites this paper
• Monotone Individual Fairness

  2024cites this paper
• Information Capacity Regret Bounds for Bandits with Mediator Feedback

  2024influential citation
• Deterministic Apple Tasting

  2024cites this paper
• Convergence for Natural Policy Gradient on Infinite-State Average-Reward Markov Decision Processes

  2024cites this paper
• Non-stationary Online Convex Optimization with Arbitrary Delays

  2024influential citation
• Bandit-Feedback Online Multiclass Classification: Variants and Tradeoffs

  2024cites this paper
• Taking a Moment for Distributional Robustness

  2024cites this paper
• ReLExS: Reinforcement Learning Explanations for Stackelberg No-Regret Learners

  2024cites this paper
• Convergence of Natural Policy Gradient for a family of infinite-state queueing MDPs

  2024cites this paper
• Multi-model Ensemble Conformal Prediction in Dynamic Environments

  2024cites this paper
• Forgetting-Factor Regrets for Online Convex Optimization

  2024cites this paper
• Ensembling Portfolio Strategies for Long-Term Investments: A Distribution-Free Preference Framework for Decision-Making and Algorithms

  2024cites this paper
• Efficient Algorithms for Learning Monophonic Halfspaces in Graphs

  2024cites this paper
• Improved Performances and Motivation in Intelligent Tutoring Systems: Combining Machine Learning and Learner Choice

  2024cites this paper
• The SMART approach to instance-optimal online learning

  2024cites this paper
• Mean-Variance Portfolio Selection in Long-Term Investments with Unknown Distribution: Online Estimation, Risk Aversion under Ambiguity, and Universality of Algorithms

  2024cites this paper
• Improved Regret for Bandit Convex Optimization with Delayed Feedback

  2024cites this paper
• Maximizing utility in multi-agent environments by anticipating the behavior of other learners

  2024cites this paper
• On the Minimax Regret for Online Learning with Feedback Graphs

  2023cites this paper
• No-Regret Online Prediction with Strategic Experts

  2023cites this paper
• Non-stationary Delayed Online Convex Optimization: From Full-information to Bandit Setting

  2023influential citation
• Convex optimization over a probability simplex

  2023cites this paper
• Hardness of Independent Learning and Sparse Equilibrium Computation in Markov Games

  2023cites this paper
• Uniswap Liquidity Provision: An Online Learning Approach

  2023cites this paper
• DoWG Unleashed: An Efficient Universal Parameter-Free Gradient Descent Method

  2023cites this paper
• Data Dependent Regret Guarantees Against General Comparators for Full or Bandit Feedback

  2023cites this paper
• Getting the Best Out of Both Worlds: Algorithms for Hierarchical Inference at the Edge

  2023cites this paper
• An Improved Relaxation for Oracle-Efficient Adversarial Contextual Bandits

  2023cites this paper
• Space-dependent turbulence model aggregation using machine learning

  2023cites this paper
• Adversarial Bandits With Multi-User Delayed Feedback: Theory and Application

  2023cites this paper
• Autonomous Exploration for Navigating in MDPs Using Blackbox RL Algorithms

  2023cites this paper
• Online Learning with Feedback Graphs: The True Shape of Regret

  2023influential citation
• Doubly Adversarial Federated Bandits

  2023influential citation
• Towards the Fundamental Limits of Knowledge Transfer over Finite Domains

  2023cites this paper
• Adversarial Bandits Robust to S-Switch Regret

  2022cites this paper
• Continuous Prediction with Experts' Advice

  2022influential citation
• Dynamic Structure Estimation from Bandit Feedback using Nonvanishing Exponential Sums

  2022cites this paper
• Strategizing against Learners in Bayesian Games

  2022cites this paper
• Universally Consistent Online Learning with Arbitrarily Dependent Responses

  2022cites this paper
• Second Order Regret Bounds Against Generalized Expert Sequences under Partial Bandit Feedback

  2022cites this paper
• Improving Sequential Query Recommendation with Immediate User Feedback

  2022cites this paper
• Towards Group Learning: Distributed Weighting of Experts

  2022cites this paper
• Modeling Human-AI Team Decision Making

  2022cites this paper
• Optimal potentials for hedging algorithms

  2022influential citation
• Online Learning and Bandits with Queried Hints

  2022cites this paper
• Efficient and Optimal Fixed-Time Regret with Two Experts

  2022cites this paper
• Rethinking Log Odds: Linear Probability Modelling and Expert Advice in Interpretable Machine Learning

  2022cites this paper
• Contextual Active Model Selection

  2022cites this paper
• Dynamic Regret of Online Markov Decision Processes

  2022cites this paper
• Adapting to Online Label Shift with Provable Guarantees

  2022cites this paper
• Causal Structure Learning with Recommendation System

  2022cites this paper
• Individually Fair Learning with One-Sided Feedback

  2022cites this paper
• Universal Regression with Adversarial Responses

  2022cites this paper
• Online convex optimization in wireless networks and beyond: The feedback-performance trade-off

  2022cites this paper
• Adversarial Bandits Against Arbitrary Strategies

  2022cites this paper
• Optimal and Efficient Algorithms for General Mixable Losses against Switching Oracles

  2021cites this paper
• Generalized Translation and Scale Invariant Online Algorithm for Adversarial Multi-Armed Bandits

  2021cites this paper
• Strategies for convex potential games and an application to decision-theoretic online learning

  2021cites this paper
• Near-Linear Time Algorithm with Near-Logarithmic Regret Per Switch for Mixable/Exp-Concave Losses

  2021cites this paper
• A Theory of PAC Learnability of Partial Concept Classes

  2021cites this paper
• User-friendly introduction to PAC-Bayes bounds

  2021cites this paper
• No Weighted-Regret Learning in Adversarial Bandits with Delays

  2021influential citation
• No Discounted-Regret Learning in Adversarial Bandits with Delays

  2021influential citation
• Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization

  2021cites this paper
• An Optimal potential-based hedging algorithm

  2021cites this paper
• MLDemon: Deployment Monitoring for Machine Learning Systems

  2021influential citation
• Online Learning with Simple Predictors and a Combinatorial Characterization of Minimax in 0/1 Games

  2021cites this paper
• Non-stationary Online Learning with Memory and Non-stochastic Control

  2021cites this paper
• Boosting for Online Convex Optimization

  2021cites this paper