- Rating
- 1
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper is about the problem of continuously monitoring multiple machine learning system using one-sided sequential hypothesis testing. At each time, there are observations from each machine learning system from which betting factors (e-values) can be computed and used for evidence against the null hypothesis, which states that every system is working normally. Observations from the different machine learning systems are assumed to follow a given certified dependency graph, representing conditional independence relations. The authors combine evidence against the null in a test supermartingale by multiplying betting factors over independent sets of nodes in the dependency graph. The central research questions is regarding what can be gained from having access to such a dependency graph compared to no dependency information, and what is lost compared to having the full joint distribution over the observations from different systems.
Critical strengths
The problem of continuous monitoring of machine learning systems seem relevant, and sequential hypothesis testing with supermartingales does seem like a principled way of solving the problem, yet in itself is not a novel contribution. Attempting to solve the problem given a dependency graph could be an interesting choice that potentially could result in better monitoring. Theoretical contributions in terms of mathematical theorems I consider as a strength of the paper.
Critical weaknesses
The presentation is poor in several aspects. It lacks explanations of mathematical definitions, terminology and statements, and many central assumptions are not discussed. The abstract and introduction are written for a reader already familiar with the details of the paper, with a fairly incomprehensible list of contributions. There are also instances of statements of the form "it is X, not Y", yet with no clear motivation why one would think it was Y in the first place. As an example, in the abstract and introduction the authors state that the achievable log-growth multiplier is the independency number , and not the chromatic quantity . Neither the log-growth multiplier, the independency number, nor the chromatic quantity is defined or discussed; what does these quantities represents? log-growth multiplier of what? Statements of this sort without proper explanation or reference provide very little substance and make the paper extremely hard to read.
Regarding the content of the paper, it lacks a discussion around the assumptions and the applicability to practical settings. The assumption of having a certified dependency graph could be interesting, yet from my understanding it is difficult to obtain reliable dependency graphs and different graph structure modeling approaches may result in vastly different dependency graphs. It might therefore be important to test the robustness against errors in the dependency graph. The authors does acknowledge the issue of an incorrectly specified dependency graph in section 10 on discussion and limitations. However, the paper would benefit from investigating such dependency graph errors experimentally and/or theoretically, especially given that it may be very difficult of obtaining reliable dependency graphs in practice.
It is assumed that there are observations in such that larger values provide more evidence against the null, but it is not explained how realistic such observations are. The practical relevance of the results are not so clear from the theory and the paper would benefit from a better discussion on this. Experiments are not done against machine learning systems, which is the supposed domain of interest, but are instead applied to synthetic graphs with a given dependency graph. Even so, the result does not demonstrate that the papers approach give any advantage over other methods. It is therefore highly unclear if the theory has any practical relevance for monitoring of machine learning systems. It may be difficult to obtain such data, although the paper lists some sources of dependencies in real world settings, but the paper would benefit from a discussion regarding this regardless.
Finally, the experiments are to my understanding involving randomness. However, results are mostly reported without any uncertainty quantification, e.g., some kind of error bars to reported numbers, and it is therefore not clear how statistically significant the results are. The authors mention a Monte Carlo standard error for figure 1, but otherwise it seems largely to be omitted. For scientific rigour, this should be included.
Questions for authors
Given the difficulty for me to follow the paper, pinning down the most important questions for improving the paper becomes hard. My questions are as follows:
- In both the abstract and the introduction it is stated that "the achievable log-growth multiplier is the independence number , not the chromatic quantity " (without defining either quantity). However, stating that something is X and not Y implies that there should be a clear reason to believe it was Y apriori. Why would one believe naively that it should be ? In fact, the paper states on line 210-212 that this is not a previously stated growth rate, so it is unclear to me why it is discussed, and the subsequent discussion is not clarifying this. Can the authors clarify this point?
- It is assumed that we observe , a vector with elements in . The experiment seem to construct synthetic data for which such vectors can be observed. How can one construct or define such variables for real-world data?
- Is the assumption of having a reliable dependency graph justified in some real-world scenarios? How robust is the method to errors or noise in the dependency graph?
- Are the experimental results reported statistically significant? For example, for figures 2-4, how many simulations are the results based on? What would the error bars be in terms of, e.g., standard deviation?