ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1406.4203
  4. Cited By
Construction of non-convex polynomial loss functions for training a
  binary classifier with quantum annealing

Construction of non-convex polynomial loss functions for training a binary classifier with quantum annealing

17 June 2014
Ryan Babbush
Vasil S. Denchev
Nan Ding
Sergei Isakov
Hartmut Neven
ArXiv (abs)PDFHTML

Papers citing "Construction of non-convex polynomial loss functions for training a binary classifier with quantum annealing"

3 / 3 papers shown
Title
On Quadratization of Pseudo-Boolean Functions
On Quadratization of Pseudo-Boolean Functions
E. Boros
Aritanan Gruber
67
57
0
25 Apr 2014
Noise Tolerance under Risk Minimization
Noise Tolerance under Risk Minimization
Naresh Manwani
S. M. I. P. S. Sastry
NoLa
180
276
0
24 Sep 2011
Agnostic Learning of Monomials by Halfspaces is Hard
Agnostic Learning of Monomials by Halfspaces is Hard
Vitaly Feldman
V. Guruswami
P. Raghavendra
Yi Wu
98
157
0
03 Dec 2010
1