Listwise explanations for ranking models using multiple explainers

L Lyu, A Anand - European Conference on Information Retrieval, 2023 - Springer
This paper proposes a novel approach towards better interpretability of a trained text-based
ranking model in a post-hoc manner. A popular approach for post-hoc interpretability text …

[PDF][PDF] Machine learning, linear algebra, and more: Is SQL all you need?

M Blacher, J Giesen, S Laue, J Klaus, V Leis - CIDR, 2022 - cidrdb.org
ABSTRACT SQL is the standard language for retrieving and manipulating relational data.
Although SQL is ubiquitous for simple analytical queries, it is rarely used for more complex …

A simple and efficient tensor calculus

S Laue, M Mitterreiter, J Giesen - … of the AAAI Conference on Artificial …, 2020 - ojs.aaai.org
Computing derivatives of tensor expressions, also known as tensor calculus, is a
fundamental task in machine learning. A key concern is the efficiency of evaluating the …

[PDF][PDF] NCVX: A general-purpose optimization solver for constrained machine and deep learning

B Liang, T Mitchell, J Sun - arXiv preprint arXiv:2210.00973, 2022 - buyunliang.org
Buyun Liang Plan B MS final defense Page 1 NCVX: A General-Purpose Optimization
Solver for Constrained Machine and Deep Learning Buyun Liang Apr 7, 2023 Page 2 …

Optimization and optimizers for adversarial robustness

H Liang, B Liang, L Peng, Y Cui, T Mitchell… - arXiv preprint arXiv …, 2023 - arxiv.org
Empirical robustness evaluation (RE) of deep learning models against adversarial
perturbations entails solving nontrivial constrained optimization problems. Existing …

Optimization for classical machine learning problems on the gpu

S Laue, M Blacher, J Giesen - Proceedings of the AAAI conference on …, 2022 - ojs.aaai.org
Constrained optimization problems arise frequently in classical machine learning. There
exist frameworks addressing constrained optimization, for instance, CVXPY and GENO …

Ncvx: A user-friendly and scalable package for nonconvex optimization in machine learning

B Liang, T Mitchell, J Sun - arXiv preprint arXiv:2111.13984, 2021 - arxiv.org
Optimizing nonconvex (NCVX) problems, especially nonsmooth and constrained ones, is an
essential part of machine learning. However, it can be hard to reliably solve such problems …

Addressing Machine Learning Problems in the Non-Negative Orthant

I Tsingalis, C Kotropoulos - IEEE Transactions on Emerging …, 2024 - ieeexplore.ieee.org
Frequently, equality constraints are imposed on the objective function of machine learning
algorithms aiming at increasing their robustness and generalization. In addition, non …

Optimization for Robustness Evaluation beyond Metrics

H Liang, B Liang, Y Cui, T Mitchell, J Sun - arXiv preprint arXiv …, 2022 - arxiv.org
Empirical evaluation of deep learning models against adversarial attacks entails solving
nontrivial constrained optimization problems. Popular algorithms for solving these …

Optimization for Robustness Evaluation Beyond ℓp Metrics

H Liang, B Liang, Y Cui, T Mitchell… - ICASSP 2023-2023 …, 2023 - ieeexplore.ieee.org
Empirical evaluation of the adversarial robustness of deep learning models involves solving
non-trivial constrained optimization problems. Popular numerical algorithms to solve these …