The following pages link to Robert E. Schapire (Q207981):
Displaying 50 items.
- Learning sparse multivariate polynomials over a field with queries and counterexamples. (Q960464) (← links)
- Learning with continuous experts using drifting games (Q982637) (← links)
- On reoptimizing multi-class classifiers (Q1009262) (← links)
- Learning probabilistic read-once formulas on product distributions (Q1314505) (← links)
- Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension (Q1314506) (← links)
- Efficient distribution-free learning of probabilistic concepts (Q1329154) (← links)
- Toward efficient agnostic learning (Q1342730) (← links)
- A decision-theoretic generalization of on-line learning and an application to boosting (Q1370863) (← links)
- Efficient learning of typical finite automata from random walks (Q1373138) (← links)
- BoosTexter: A boosting-based system for text categorization (Q1568474) (← links)
- Boosting the margin: a new explanation for the effectiveness of voting methods (Q1807156) (← links)
- Adaptive game playing using multiplicative weights (Q1818286) (← links)
- Generalization bounds for averaged classifiers (Q1879971) (← links)
- On the sample complexity of weak learning (Q1892883) (← links)
- On the worst-case analysis of temporal-difference learning algorithms (Q1911342) (← links)
- Large margin classification using the perceptron algorithm (Q1969320) (← links)
- Improved boosting algorithms using confidence-rated predictions (Q1969321) (← links)
- Inference of finite automata using homing sequences (Q2365762) (← links)
- Analysis of boosting algorithms using the smooth margin function (Q2473080) (← links)
- 10.1162/15324430152733133 (Q2782273) (← links)
- On the learnability of discrete distributions (Q2817618) (← links)
- (Q2880970) (← links)
- (Q2893108) (← links)
- The Rate of Convergence of AdaBoost (Q2933884) (← links)
- (Q3093236) (← links)
- Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions (Q3137706) (← links)
- Learning Binary Relations and Total Orders (Q3142590) (← links)
- (Q3174115) (← links)
- Learning with Continuous Experts Using Drifting Games (Q3529925) (← links)
- (Q4013554) (← links)
- (Q4013558) (← links)
- (Q4243442) (← links)
- (Q4252717) (← links)
- Diversity-based inference of finite automata (Q4305673) (← links)
- How to use expert advice (Q4376978) (← links)
- (Q4526998) (← links)
- (Q4617612) (← links)
- Learning Theory (Q4680900) (← links)
- Learning Theory (Q4680902) (← links)
- The Nonstochastic Multiarmed Bandit Problem (Q4785631) (← links)
- On‐Line Portfolio Selection Using Multiplicative Updates (Q4791738) (← links)
- 10.1162/1532443041827916 (Q4825996) (← links)
- Error Adaptive Classifier Boosting (EACB): Leveraging Data-Driven Training Towards Hardware Resilience for Signal Inference (Q5007781) (← links)
- Efficient learning of typical finite automata from random walks (Q5248500) (← links)
- How to use expert advice (Q5248507) (← links)
- Explaining AdaBoost (Q5264087) (← links)
- Maximum Entropy Distribution Estimation with Generalized Regularization (Q5307564) (← links)
- Convergence and Consistency of Regularized Boosting With Weakly Dependent Observations (Q5346183) (← links)
- (Q5386442) (← links)
- (Q5405255) (← links)
