Rademacher Complexity Bounds for a Penalized Multi-Class Semi-Supervised Algorithm (Extended Abstract)

Cite

Text

Maximov et al. "Rademacher Complexity Bounds for a Penalized Multi-Class Semi-Supervised Algorithm (Extended Abstract)." International Joint Conference on Artificial Intelligence, 2018. doi:10.24963/IJCAI.2018/800

Markdown

[Maximov et al. "Rademacher Complexity Bounds for a Penalized Multi-Class Semi-Supervised Algorithm (Extended Abstract)." International Joint Conference on Artificial Intelligence, 2018.](https://mlanthology.org/ijcai/2018/maximov2018ijcai-rademacher/) doi:10.24963/IJCAI.2018/800

BibTeX

@inproceedings{maximov2018ijcai-rademacher,
  title     = {{Rademacher Complexity Bounds for a Penalized Multi-Class Semi-Supervised Algorithm (Extended Abstract)}},
  author    = {Maximov, Yury and Amini, Massih-Reza and Harchaoui, Zaïd},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2018},
  pages     = {5637-5641},
  doi       = {10.24963/IJCAI.2018/800},
  url       = {https://mlanthology.org/ijcai/2018/maximov2018ijcai-rademacher/}
}