4 citations · 7 across the 4 of their papers we have counts for
4 papers
Revisiting Block-Diagonal SDP Relaxations for the Clique Number of the Paley Graphs
Vladimir A. Kobzar, Krishnan Mody
This work addresses the block-diagonal semidefinite program (SDP) relaxations for the clique number of the Paley graphs. The size of the maximal clique (clique number) of a graph i…
A PDE-Based Analysis of the Symmetric Two-Armed Bernoulli Bandit
Vladimir A. Kobzar, Robert V. Kohn
This work addresses a version of the two-armed Bernoulli bandit problem where the sum of the means of the arms is one (the symmetric two-armed Bernoulli bandit). In a regime where…
New Potential-Based Bounds for the Geometric-Stopping Version of Prediction with Expert Advice
Vladimir A. Kobzar, Robert V. Kohn, Zhilei Wang
This work addresses the classic machine learning problem of online prediction with expert advice. A new potential-based framework for the fixed horizon version of this problem has…
New Potential-Based Bounds for Prediction with Expert Advice
Vladimir A. Kobzar, Robert V. Kohn, Zhilei Wang
This work addresses the classic machine learning problem of online prediction with expert advice. We consider the finite-horizon version of this zero-sum, two-person game. Using ve…