Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3087801.3087852acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
abstract
Public Access

Brief Announcement: Certified Multiplicative Weights Update: Verified Learning Without Regret

Published: 25 July 2017 Publication History

Abstract

The Multiplicative Weights Update method (MWU) is a simple yet powerful algorithm for learning linear classifiers, for ensemble learning a la boosting, for approximately solving linear and semidefinite systems, for computing approximate solutions to multicommodity flow problems, and for online convex optimization, among other applications. In this brief announcement, we apply techniques from interactive theorem proving to define and prove correct the first formally verified implementation of MWU (specifically, we show that our MWU is no regret). Our primary application -- and one justification of the relevance of our work to the PODC community -- is to verified multi-agent systems, such as distributed multi-agent network flow and load balancing games, for which verified MWU provides a convenient method for distributed computation of approximate Coarse Correlated Equilibria.

References

[1]
Sanjeev Arora, Elad Hazan, and Satyen Kale. 2012. The Multiplicative Weights Update Method: a Meta-Algorithm and Applications. Theory of Computing 8, 1 (2012), 121--164.
[2]
Yves Bertot and Pierre Castéran. 2013. Interactive theorem proving and program development: Coq'Art: the calculus of inductive constructions. Springer Science & Business Media.
[3]
George Christodoulou and Elias Koutsoupias. 2005. The price of anarchy of finite congestion games. In Proceedings of the 37th annual ACM Symposium on Theory of Computing. ACM, 67--73.
[4]
Yoav Freund and Robert E Schapire. 1995. A decision-theoretic generalization of on-line learning and an application to boosting. In European conference on computational learning theory. Springer, 23--37.
[5]
Georges Gonthier, Assia Mahboubi, and Enrico Tassi. 2015. A small scale reflection extension for the Coq system. Technical Report. INRIA.
[6]
Nick Littlestone and Manfred K Warmuth. 1989. The weighted majority algorithm. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science. IEEE, 256--261.
[7]
Noam Nisan, Tim Roughgarden, Eva Tardos, and Vijay V Vazirani. 2007. Algorithmic Game Theory. Vol. 1. Cambridge University Press.
[8]
Tim Roughgarden. 2009. Intrinsic robustness of the price of anarchy. In Proceedings of the 41st annual ACM Symposium on Theory of Computing. ACM, 513--522.

Cited By

View all
  • (2021)Trimming Data Sets: a Verified Algorithm for Robust Mean EstimationProceedings of the 23rd International Symposium on Principles and Practice of Declarative Programming10.1145/3479394.3479412(1-9)Online publication date: 6-Sep-2021
  • (2018)Verified Learning Without RegretProgramming Languages and Systems10.1007/978-3-319-89884-1_20(561-588)Online publication date: 14-Apr-2018

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
PODC '17: Proceedings of the ACM Symposium on Principles of Distributed Computing
July 2017
480 pages
ISBN:9781450349925
DOI:10.1145/3087801
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 July 2017

Check for updates

Author Tags

  1. COQ
  2. interactive theorem proving
  3. the multiplicative weights update method

Qualifiers

  • Abstract

Funding Sources

Conference

PODC '17
Sponsor:

Acceptance Rates

PODC '17 Paper Acceptance Rate 38 of 154 submissions, 25%;
Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)30
  • Downloads (Last 6 weeks)9
Reflects downloads up to 12 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2021)Trimming Data Sets: a Verified Algorithm for Robust Mean EstimationProceedings of the 23rd International Symposium on Principles and Practice of Declarative Programming10.1145/3479394.3479412(1-9)Online publication date: 6-Sep-2021
  • (2018)Verified Learning Without RegretProgramming Languages and Systems10.1007/978-3-319-89884-1_20(561-588)Online publication date: 14-Apr-2018

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media