The robustness of the p -norm algorithms
- 6 July 1999
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- On Bayes Methods for On-Line Boolean PredictionAlgorithmica, 1998
- Tracking the best regressorPublished by Association for Computing Machinery (ACM) ,1998
- A decision-theoretic extension of stochastic complexity and its applications to learningIEEE Transactions on Information Theory, 1998
- How to use expert adviceJournal of the ACM, 1997
- General convergence results for linear discriminant updatesPublished by Association for Computing Machinery (ACM) ,1997
- The binary exponentiated gradient algorithm for learning linear functionsPublished by Association for Computing Machinery (ACM) ,1997
- Worst-case quadratic loss bounds for prediction using linear functions and gradient descentIEEE Transactions on Neural Networks, 1996
- The Weighted Majority AlgorithmInformation and Computation, 1994
- An iterative row-action method for interval convex programmingJournal of Optimization Theory and Applications, 1981
- The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programmingUSSR Computational Mathematics and Mathematical Physics, 1967