Using and combining predictors that specialize

No abstract is available for this paper.

• Publication year

  1997

• Venue

  Symposium on the Theory of Computing

• Publication date

  1997-05-04

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/258533.258616
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Context-sensitive learning methods for text categorization

  1999influential reference
• Context-sensitive learning methods for text categorization

  1996cited by this paper
• Universal Portfolios

  1996cited by this paper
• Additive versus exponentiated gradient updates for linear prediction

  1995influential reference
• A game of prediction with expert advice

  1995influential reference
• Predicting Nearly As Well As the Best Pruning of a Decision Tree

  1995cited by this paper
• The context-tree weighting method: basic properties

  1995influential reference
• Empirical Support for Winnow and Weighted-Majority Based Algorithms: Results on a Calendar Scheduling Domain

  1995influential reference
• Learning probabilistic automata with variable memory length

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

  1994cited by this paper
• Some properties of sequential predictors for binary Markov sources

  1993cited by this paper
• How to use expert advice

  1993influential reference
• A sequential algorithm for the universal coding of finite memory sources

  1992cited by this paper
• Aggregating strategies

  1990influential reference
• The weighted majority algorithm

  1989influential reference
• Learning probabilistic prediction functions

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

  1987cited by this paper
• Universal modeling and coding

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

  1977cited by this paper
• Information Theory and Reliable Communication

  1969cited by this paper

• Online Min-Max Optimization: From Individual Regrets to Cumulative Saddle Points

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

  2025cites this paper
• Contribution of expert aggregation to temperature prediction part I

  2025cites this paper
• Stable autonomous visual navigation: an expert prediction approach

  2025influential citation
• Advancing Large-Scale Facial Recognition: Leveraging Common Strategies from Public Target Recognition

  2025cites this paper
• Contribution of expert aggregation to temperature prediction part II: Second order bounds with sleeping experts

  2025cites this paper
• Achieving Skilled and Reliable Daily Probabilistic Forecasts of Wind Power at Subseasonal-to-Seasonal Timescales over France

  2025cites this paper
• Bandits with Abstention under Expert Advice

  2024cites this paper
• Minimax-optimal and Locally-adaptive Online Nonparametric Regression

  2024cites this paper
• No Internal Regret with Non-convex Loss Functions

  2024cites this paper
• Near-optimal Per-Action Regret Bounds for Sleeping Bandits

  2024cites this paper
• SAOFTRL: A Novel Adaptive Algorithmic Framework for Enhancing Online Portfolio Selection

  2024cites this paper
• Group-wise oracle-efficient algorithms for online multi-group learning

  2024cites this paper
• Online Non-convex Learning in Dynamic Environments

  2024cites this paper
• MetaCURL: Non-stationary Concave Utility Reinforcement Learning

  2024cites this paper
• Building an Ensemble of Time Series Models Using Empirical Risk Space

  2024cites this paper
• Nearest Neighbour with Bandit Feedback

  2023cites this paper
• Health monitoring of ultra high fiber performance reinforced concrete communication tower using machine learning algorithms

  2023cites this paper
• A Hierarchical Nearest Neighbour Approach to Contextual Bandits

  2023cites this paper
• Policy Optimization via Adv2: Adversarial Learning on Advantage Functions

  2023cites this paper
• Calibrated Stackelberg Games: Learning Optimal Commitments Against Calibrated Agents

  2023cites this paper
• Oracle Efficient Online Multicalibration and Omniprediction

  2023cites this paper
• Competing against Adaptive Strategies in Online Learning via Hints

  2023cites this paper
• Efficient algorithms for online decision problems. (English)

  2023cites this paper
• Multi-Agent Learning in Contextual Games under Unknown Constraints

  2023influential citation
• Dynamic Knowledge Injection for AIXI Agents

  2023cites this paper
• Adapting to Continuous Covariate Shift via Online Density Ratio Estimation

  2023cites this paper
• Near Optimal Memory-Regret Tradeoff for Online Learning

  2023cites this paper
• Non-stationary Projection-free Online Learning with Dynamic and Adaptive Regret Guarantees

  2023cites this paper
• Strongly adaptive online learning over partial intervals

  2022cites this paper
• Sequential vs. Fixed Design Regrets in Online Learning

  2022influential citation
• Sequential Asset Ranking within Nonstationary Time Series

  2022cites this paper
• Sequential asset ranking in nonstationary time series

  2022cites this paper
• Parameter-free Online Linear Optimization with Side Information via Universal Coin Betting

  2022cites this paper
• Prediction with expert advice for a finite number of experts: A practical introduction

  2022cites this paper
• Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor

  2022cites this paper
• Scale-free Unconstrained Online Learning for Curved Losses

  2022cites this paper
• In Silico Prediction of the Toxicity of Nitroaromatic Compounds: Application of Ensemble Learning QSAR Approach

  2022cites this paper
• Robust Online Convex Optimization in the Presence of Outliers

  2021cites this paper
• A theory of consciousness from a theoretical computer science perspective: Insights from the Conscious Turing Machine

  2021cites this paper
• MetaGrad: Adaptation using Multiple Learning Rates in Online Learning

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

  2021cites this paper
• ON THE TRUTH-CONVERGENCE OF OPEN-MINDED BAYESIANISM

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

  2021cites this paper
• A Gang of Adversarial Bandits

  2021influential citation
• Improved Regret Bounds for Tracking Experts with Memory

  2021cites this paper
• Simple and near-optimal algorithms for hidden stratification and multi-group learning

  2021cites this paper
• Online Multiobjective Minimax Optimization and Applications

  2021cites this paper
• Expedition: A System for the Unsupervised Learning of a Hierarchy of Concepts

  2021cites this paper
• Grade estimation by a machine learning model using coordinate rotations

  2021cites this paper
• Evaluating remote sensing approaches for mapping the bathymetry of Lake Manzala, Egypt

  2021cites this paper
• Projection-free Distributed Online Learning with Sublinear Communication Complexity

  2021cites this paper
• Online Minimax Multiobjective Optimization: Multicalibeating and Other Applications

  2021cites this paper
• Exponentiated Gradient Reweighting for Robust Training Under Label Noise and Beyond

  2021cites this paper
• Expert Aggregation for Financial Forecasting

  2021cites this paper
• Online aggregation of probability forecasts with confidence

  2021cites this paper
• Projection-free Online Learning over Strongly Convex Sets

  2020cites this paper
• Online Learning in Changing Environments

  2020cites this paper
• Recursive Experts: An Efficient Optimal Mixture of Learning Systems in Dynamic Environments

  2020cites this paper
• Adaptation to the Range in K-Armed Bandits

  2020cites this paper
• Adversarial Online Learning with Changing Action Sets: Efficient Algorithms with Approximate Regret Bounds

  2020cites this paper
• Bitcoin Transaction Forecasting With Deep Network Representation Learning

  2020cites this paper
• Taking a hint: How to leverage loss predictors in contextual bandits?

  2020cites this paper
• Projection-free Distributed Online Convex Optimization with $O(\sqrt{T})$ Communication Complexity

  2020cites this paper
• Occlusion Boundary: A Formal Definition & Its Detection via Deep Exploration of Context

  2020cites this paper
• Online Learning with Primary and Secondary Losses

  2020cites this paper
• Online Multitask Learning with Long-Term Memory

  2020cites this paper
• Contributions à l'apprentissage statistique : estimation de densité, agrégation d'experts et forêts aléatoires. (Contributions to statistical learning : density estimation, expert aggregation and random forests)

  2020cites this paper
• A Theoretical Computer Science Perspective on Consciousness

  2020cites this paper
• Locally-Adaptive Nonparametric Online Learning

  2020influential citation
• Effective online decision-making in complex multi-agent systems

  2019cites this paper
• Cooperative Online Learning: Keeping your Neighbors Updated

  2019cites this paper
• Improving multilabel classification via heterogeneous ensemble methods

  2019cites this paper
• The Metainductive Justification of Induction: The Pool of Strategies

  2019cites this paper
• Introduction to Multi-Armed Bandits

  2019cites this paper
• Mathematics of Statistical Sequential Decision Making. (Mathématique de la prise de décision séquentielle statistique)

  2019cites this paper
• A Review of Dynamic Analysis in Frequency Domain for Structural Health Monitoring

  2019cites this paper
• Online Learning with Continuous Ranked Probability Score

  2019cites this paper
• Mathematics of Statistiscal Sequential Decision Making

  2019cites this paper
• Online Learning with Sleeping Experts and Feedback Graphs

  2019cites this paper
• Equipping Experts/Bandits with Long-term Memory

  2019cites this paper
• Adaptive Hedging under Delayed Feedback

  2019cites this paper
• Advancing subgroup fairness via sleeping experts

  2019cites this paper
• Dual Adaptivity: A Universal Algorithm for Minimizing the Adaptive Regret of Convex Functions

  2019cites this paper
• Dying Experts: Efficient Algorithms with Optimal Regret Bounds

  2019influential citation
• A Survey of Prediction and Classification Techniques in Multicore Processor Systems

  2019cites this paper
• Competing with Automata-based Expert Sequences

  2018influential citation
• Predicting Switching Graph Labelings with Cluster Specialists

  2018influential citation
• Online Learning for Non-Stationary A/B Tests

  2018cites this paper
• Energy efficient distributed analytics at the edge of the network for IoT environments

  2018cites this paper
• No-Regret Learning on Possibly Infinite Sets of Experts CIS 625 Project Report

  2018cites this paper
• Online Prediction of Switching Graph Labelings with Cluster Specialists

  2018cites this paper
• Learning From Sleeping Experts

  2018influential citation
• Big Data Analytics for Network Traffic Monitoring and Analysis

  2018cites this paper
• Online aggregation of unbounded losses using shifting experts with confidence

  2018cites this paper
• Using Hybrid and Diversity-Based Adaptive Ensemble Method for Binary Classification

  2018cites this paper
• Adversarial Machine Learning: The Case of Recommendation Systems

  2018influential citation
• Uncovering Biologically Coherent Peripheral Signatures of Health and Risk for Alzheimer’s Disease in the Aging Brain

  2018cites this paper
• Linear regression and learning : contributions to regularization and aggregation methods

  2018cites this paper
• Super learning for anomaly detection in cellular networks

  2017cites this paper