On-line prediction and conversion strategies

No abstract is available for this paper.

• Publication year

  2004

• Venue

  Machine-mediated learning

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/BF00115301
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Influence of cultivation temperature on the ligninolytic activity of selected fungal strains

  2006cited by this paper
• Simulated annealing and Boltzmann machines

  2003cited by this paper
• Structural Results About On-line Learning Models With and Without Queries

  1999influential reference
• The Probabilistic Method

  1998cited by this paper
• Simulating access to hidden information while learning

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

  1994cited by this paper
• Worst-case quadratic loss bounds for a generalization of the Widrow-Hoff rule

  1993cited by this paper
• How to use expert advice

  1993cited by this paper
• Ulam's Searching Game with a Fixed Number of Lies

  1992influential reference
• Searching in the presence of linearly bounded errors

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

  1991cited by this paper
• Aggregating strategies

  1990influential reference
• Mistake bounds and logarithmic linear-threshold learning algorithms

  1990influential reference
• The weighted majority algorithm

  1989influential reference
• Queries and concept learning

  1988cited by this paper
• Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm

  1987influential reference
• Version Spaces: A Candidate Elimination Approach to Rule Learning

  1977cited by this paper
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

  1952cited by this paper

• Online Realizable Regression and Applications for ReLU Networks

  2026cites this paper
• Deterministic Apple Tasting

  2024cites this paper
• Bandit-Feedback Online Multiclass Classification: Variants and Tradeoffs

  2024cites this paper
• Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension

  2023influential citation
• A New Approach to Drifting Games, Based on Asymptotically Optimal Potentials

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

  2021cites this paper
• Optimal Online Learning using Potential Functions

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

  2021cites this paper
• A Potential-based Framework for Online Learning with Mistakes and Abstentions

  2016cites this paper
• The Extended Littlestone's Dimension for Learning with Mistakes and Abstentions

  2016cites this paper
• Variations on a Theme of Ulam and Rényi: More Types of Questions and Lies

  2013cites this paper
• A Model for Learning

  2013cites this paper
• Weighted Errors over a General Channel

  2013cites this paper
• Adaptive vs. Non-adaptive Search

  2013cites this paper
• Fault-Tolerant Search à la Ulam-Rényi

  2013cites this paper
• Prologue: What This Book Is About

  2013cites this paper
• Delays and Time Outs

  2013cites this paper
• Automated Android Scheduler

  2012cites this paper
• Combining strategies efficiently: high-quality decisions from conflicting advice

  2011cites this paper
• Sequential Decision Making in Non-stochastic Environments

  2011cites this paper
• Game theory and optimization in boosting

  2011influential citation
• Repeated Games against Budgeted Adversaries

  2010cites this paper
• Decision Making in Uncertain and Changing Environments

  2009cites this paper
• A Parameter-free Hedging Algorithm

  2009cites this paper
• When Random Play is Optimal Against an Adversary.

  2008influential citation
• How to Use Expert AdviceNicol

  2008cites this paper
• When Random Play is Optimal Against an Adversary

  2008cites this paper
• Sequential Procedures for Aggregating Arbitrary Estimators of a Conditional Mean

  2008cites this paper
• Learning with continuous experts using drifting games

  2008cites this paper
• A new Hedging algorithm and its application to inferring latent random variables

  2008cites this paper
• An Overview of NeuroCOLT ' s Achievements 21 An Overview of NeuroCOLT ' s AchievementsAdaptive

  2007cites this paper
• Automatic Categorization of Patent Applications Using Classifier Combinations

  2006cites this paper
• Continuous Experts and the Binning Algorithm

  2006cites this paper
• Three Research Challenges at the Intersection of Machine Learning, Statistical Induction, and Systems

  2005cites this paper
• Some stochastic properties of memoryless individual sequences

  2004cites this paper
• The best expert versus the smartest algorithm

  2004cites this paper
• Learning and the Art of Fault-tolerant Guesswork

  2003cites this paper
• The Statistical Physics of Learning: Phase Transitions and Dynamical Symmetry Breaking

  2003cites this paper
• Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests

  2003cites this paper
• On optimal sequential prediction for general processes

  2003cites this paper
• Communication Network Problems

  2002cites this paper
• Drifting Games and Brownian Motion

  2002cites this paper
• Research Proposal: Foundation of Multiple Classifier Systems and Active Learning

  2002cites this paper
• Structural Results About On-line Learning Models With and Without Queries

  1999cites this paper
• On-line learning with malicious noise and the closure algorithm

  1994cites this paper
• The Binning Algorithm

  year unknowncites this paper