Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 15
Number of items: 15
  • Open Access
    Fokkema, H. (2026). Mathematical foundations of explainable AI and advances in bandit optimisation. [Thesis, fully internal, Universiteit van Amsterdam].
  • Open Access
    Sachs, S., Hadiji, H., van Erven, T., & Staudigl, M. (2025). An Online Feasible Point Method for Benign Generalized Nash Equilibrium Problems. Proceedings of Machine Learning Research, 272, 1008-1040. https://proceedings.mlr.press/v272/sachs25a.html
  • Open Access
    Sachs, S. (2024). Optimization, games and generalization bounds. [Thesis, fully internal, Universiteit van Amsterdam].
  • Open Access
    Hadiji, H., Sachs, S., van Even, T., & Koolen, W. (2023). Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games. In A. Oh, T. Naumann, A. Globerson, K. Saenko, M. Hardt, & S. Levine (Eds.), 37th Conference on Neural Information Processing Systems (NeurIPS 2023): 10-16 December 2023, New Orleans, Louisana, USA (pp. 13356-13373). (Advances in Neural Information Processing Systems; Vol. 36). Neural Information Processing Systems Foundation. https://papers.nips.cc/paper_files/paper/2023/hash/2af57f909a99113db071672da236a5f2-Abstract-Conference.html
  • Open Access
    Castro, R. M., Hellström, F., & van Erven, T. (2023). Adaptive Selective Sampling for Online Prediction with Experts. In A. Oh, T. Naumann, A. Globerson, K. Saenko, M. Hardt, & S. Levine (Eds.), 37th Conference on Neural Information Processing Systems (NeurIPS 2023): 10-16 December 2023, New Orleans, Louisana, USA (pp. 134-154). (Advances in Neural Information Processing Systems; Vol. 36). Neural Information Processing Systems Foundation. https://papers.nips.cc/paper_files/paper/2023/hash/00b67df24009747e8bbed4c2c6f9c825-Abstract-Conference.html
  • Open Access
    Guzmán, C., Hadiji, H., Sachs, S., & Van Erven, T. (2023). Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness. In S. Koyejo, S. Mohamed, A. Agarwal, D. Belgrave, K. Cho, & A. Oh (Eds.), 36th Conference on Neural Information Processing Systems (NeurIPS 2022): New Orleans, Louisiana, USA, 28 November-9 December 2022 (Vol. 2, pp. 691-702). (Advances in Neural Information Processing Systems; Vol. 35). Neural Information Processing Systems Foundation. https://papers.nips.cc/paper_files/paper/2022/hash/047aa59e51e3ac7a2422a55468feefd5-Abstract-Conference.html
  • Open Access
    Fokkema, H., de Heide, R., & van Erven, T. (2023). Attribution-based Explanations that Provide Recourse cannot be Robust. Journal of Machine Learning Research, 24, Article 23-0042.
  • Open Access
    Olkhovskaya, J., Mayo, J., van Erven, T., Neu, G., & Wei, C.-Y. (2023). First- and Second-Order Bounds for Adversarial Linear Contextual Bandits. In A. Oh, T. Naumann, A. Globerson, K. Saenko, M. Hardt, & S. Levine (Eds.), 37th Conference on Neural Information Processing Systems (NeurIPS 2023): 10-16 December 2023, New Orleans, Louisana, USA (pp. 61625-61644). (Advances in Neural Information Processing Systems; Vol. 36). Neural Information Processing Systems Foundation. https://papers.nips.cc/paper_files/paper/2023/hash/c2201e444d2b22a10ca50116a522b9a9-Abstract-Conference.html
  • Open Access
    van der Hoeven, D., Hadiji, H., & van Erven, T. (2022). Distributed Online Learning for Joint Regret with Communication Constraints. Proceedings of Machine Learning Research, 167, 1003-1042. https://proceedings.mlr.press/v167/hoeven22a.html
  • Open Access
    Mayo, J. J., Hadiji, H., & van Erven, T. (2022). Scale-free Unconstrained Online Learning for Curved Losses. Proceedings of Machine Learning Research, 178, 4464-4497. https://proceedings.mlr.press/v178/mayo22a.html
Page 1 of 2