( en | de | ru )

 

Disambiguation of "Long, Philip M."

Author of the publication

copydeleteadd this publication to your clipboard
On the difficulty of approximately maximizing agreements.

, , and . J. Comput. Syst. Sci., 66 (3): 496-514 (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Philip M Blumenthal

Long Chen

Long Liu

Long Ling

Li Long

 

Other publications of authors with the same name

On-Line Learning with Linear Loss Constraints., and . COLT, page 412-421. ACM, (1993)Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets., , and . STOC, page 314-323. ACM, (1997)Random classification noise defeats all convex potential boosters., and . ICML, volume 307 of ACM International Conference Proceeding Series, page 608-615. ACM, (2008)Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate., and . ICML, page 703-710. Omnipress, (2010)New bounds on the price of bandit feedback for mistake-bounded online multiclass learning.. ALT, volume 76 of Proceedings of Machine Learning Research, page 3-10. PMLR, (2017)New Bounds for Learning Intervals with Implications for Semi-Supervised Learning., and . COLT, volume 23 of JMLR Proceedings, page 30.1-30.15. JMLR.org, (2012)Martingale Boosting., and . COLT, volume 3559 of Lecture Notes in Computer Science, page 79-94. Springer, (2005)A Theoretical Analysis of Query Selection for Collaborative Filtering., and . COLT/EuroCOLT, volume 2111 of Lecture Notes in Computer Science, page 517-528. Springer, (2001)The Singular Values of Convolutional Layers., , and . ICLR (Poster), OpenReview.net, (2019)Guest Editor's Introduction.. Mach. Learn., 27 (1): 5 (1997)