Rounding methods for discrete linear classification

30th International Conference on Machine Learning, ICML 2013

Volumn , Issue PART 1, 2013, Pages 651-659

  Chevaleyre, Yann ^a   Koriche, Frédéric ^b   Zucker, Jean Daniel ^c  

^a Laboratoire d'Informatique de Paris Nord Villetaneuse   (France)

^b UNIVERSITÉ D'ARTOIS   (France)

^c CENTRE DE RECHERCHE DES CORDELIERS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING SYSTEMS;

APPROXIMATION BOUNDS; COMBINATORIAL OPTIMIZATION PROBLEMS; FRACTIONAL SOLUTIONS; GENERALIZATION BOUND; LINEAR CLASSIFICATION; LINEAR CLASSIFIERS; RADEMACHER COMPLEXITY; ROUNDING ALGORITHM;

ALGORITHMS;

EID: 84883129367     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. P. L. Bartlett and S. Mendelson. Rademacher and Gaussian complexities: Risk bounds and structural results. Journal of Machine Learning Research, 3:463-482, 2002.
2. P. Berman and M. Karpinski. On some tighter inapproximability results (extended abstract). In Automata, Languages and Programming, 26th International Colloquium (ICALP), pages 200-209. Springer, 1999.
3. Y. Chevaleyre, F. Koriche, and J. D. Zucker. Rounding methods for discrete linear classification (extended version). Technical Report hal-00771012, hal, 2013.
4. U. Feige, M. Karpinski, and M. Langberg. A note on approximating Max-Bisection on regular graphs. Information Processing Letters, 79(4):181-188, 2001. (Pubitemid 32639105)
5. M. Golea and M. Marchand. Average case analysis of the clipped Hebb rule for nonoverlapping Perception networks. In Proceedings of the 6th annual conference on computational learning theory (COLT'93). ACM, 1993a.
6. M. Golea and M. Marchand. On learning perceptrons with binary weights. Neural Computation, 5(5):767-782, 1993b.
7. S. M. Kakade, K. Sridharan, and A. Tewari. On the complexity of linear prediction: Risk bounds, margin bounds, and regularization. In Proceedings of the 22nd Annual Conference on Neural Information Processing Systems (NIPS), pages 793-800, 2008.
8. H. Köhler, S. Diederich, W. Kinzel, and M. Opper. Learning algorithm for a neural network with binary synapses. Zeitschrift fr Physik B Condensed Matter, 78:333-342, 1990.
9. M. Opper, W. Kinzel, J. Kleinz, and R Nehl. On the ability of the optimal perceptron to generalise. Journal of Physics A: Mathematical and General, 23(11):L581-L586, 1990.
10. L. Pitt and L. G. Valiant. Computational limitations on learning from examples. J. ACM, 35(4):965-984, 1988.
11. P. Raghavan and C. D. Thompson. Randomized rounding: A technique for probably good algorithms and algorithmic proofs. Combinatorica, 7(4):365-374, 1987.
12. J. Shawe-Taylor and N. Cristianini. An Introduction to Support Vector Machines. Cambridge, 2000.
13. G. G. Towell and J. W. Shavlik. Extracting refined rules from knowledge-based neural networks. Machine Learning, 13:71-101, 1993.
14. S. Venkatesh. On learning binary weights for majority functions. In Proceedings of the 4th Annual Workshop on Computational Learning Theory (COLT), pages 257-266. Morgan Kaufmann, 1991.
15. D. P. Williamson and D. B. Shmoys. The Design of Approximation Algorithms. Cambridge, 2011.