Data subsampling for Poisson regression with pth-root-link

We develop and analyze data subsampling techniques for Poisson regression, the standard model for count data $y\in\mathbb{N}$. In particular, we consider the Poisson generalized linear model with ID- and square root-link functions. We consider the method of coresets, which are small weighted subsets that approximate the loss function of Poisson regression up to a factor of $1\pm\varepsilon$. We show $Ω(n)$ lower bounds against coresets for Poisson regression that continue to hold against arbitrary data reduction techniques up to logarithmic factors. By introducing a novel complexity parameter and a domain shifting approach, we show that sublinear coresets with $1\pm\varepsilon$ approximation guarantee exist when the complexity parameter is small. In particular, the dependence on the number of input points can be reduced to polylogarithmic. We show that the dependence on other input parameters can also be bounded sublinearly, though not always logarithmically. In particular, we show that the square root-link admits an $O(\log(y_{\max}))$ dependence, where $y_{\max}$ denotes the largest count presented in the data, while the ID-link requires a $Θ(\sqrt{y_{\max}/\log(y_{\max})})$ dependence. As an auxiliary result for proving the tightness of the bound with respect to $y_{\max}$ in the case of the ID-link, we show an improved bound on the principal branch of the Lambert $W_0$ function, which may be of independent interest. We further show the limitations of our analysis when $p$th degree root-link functions for $p\geq 3$ are considered, which indicate that other analytical or computational methods would be required if such a generalization is even possible.

Paper

References (47)

Scroll for more · 35 remaining

Similar papers

Peer review

Reviewer L5wz6/10 · confidence 1/52024-06-12

Summary

the paper considers sampling for Poisson regression, making explicit the dependence of the size of coreset on various parameters, in particular the effect of different link functions. The paper has a theoretical flavor

Strengths

the results seems to be new

Weaknesses

Frankly I am not familiar with this particular approach. One possible weakness may be that it is not clear how sharp this result is. It is also not clear what characteristics of Poisson regression make the study entirely different from many other regression models. I submit this particular review early so the chair may decide whether to look for additional reviewers.

Questions

none

Rating

6

Confidence

1

Soundness

3

Presentation

2

Contribution

3

Limitations

seems there is little discussion on limitation

Reviewer HZmN7/10 · confidence 4/52024-07-01

Summary

Coresets are a technique in efficient algorithms for data analysis in which a dataset is compressed into a weighted subset of its examples. Typically, coresets are constructed such that a loss function for a given optimization problem (e.g. linear regression, logistic regression, or Poisson regression for this work) is preserved up to a $(1\pm\epsilon)$ factor error. This work extends this line of work to handle the Poisson regression case. While the most popular choice of the log-link does not admit small coresets, the authors study the case of the ID and square root link functions and show that for these log-link functions, Poisson regression admits small coresets, assuming the smallness of a complexity parameter $\rho$ which they introduce building on prior work on logistic regression.

Strengths

This work shows that under certain natural (and necessary) modifications, Poisson regression admits small coresets. Coresets are a popular topic of study in the recent machine learning literature, and this work makes progress on understanding coresets for Poisson regression.

Weaknesses

The first main weakness of this work is that there are many modifications and assumptions that must be made to the Poisson regression in order to obtain small coresets. As the authors mention, the canonical log-link for Poisson regression does not admit small coresets, and this is a standard fact in the literature (e.g. formalized in [23], as the authors cite). Thus, the authors instead consider a polynomial link function, but the authors do not provide sufficient arguments as to why this is still an interesting problem to study, either from a theory or practice perspective. Indeed, once the growth rate of the function is polynomial and one assumes a balancedness condition, then small coresets can be constructed using known techniques in theory [24]. While this type of result may still be interesting if the regression problem is widely studied, Poisson regression with noncanonical links seems too artificial of a setting to be interesting for a wide audience. The second main weakness is that the techniques largely are a straightforward generalization of techniques from [23, 24, 25] and the conclusions do not seem surprising given the prior work.

Questions

How are Lemmas 6.1 and 6.2 different from the lower bound argument of Theorem 6 in [23]?

Rating

7

Confidence

4

Soundness

3

Presentation

2

Contribution

3

Limitations

See weaknesses.

Reviewer HZmN2024-08-08

Another comment: perhaps the authors could consider reflecting the fact that only $p$-th root links are considered in the title, since this paper does not give a solution to the canonical Poisson regression problem. Possibly dumb question: In the proof of Lemma 4.1, why is $\beta'\in D(\eta)$? it seems like if $X\beta \geq 0$ (pointwise), then it does not follow that $X\beta' = X\beta + \eta Xe_1\geq \eta$ depending on the value of $X$ on the first column.

Authorsrebuttal2024-08-09

We agree to changing the title to: "Data subsampling for Poisson regression with $p$th-root-link". Please let us know if you have other suggestions in mind. We have already chosen $X$ to be the design matrix that includes an intercept. This means that the first column of $X$ consists of only ones. We stated this explicitly in line 119: $x=(1,x^{(1)},x^{(2)},\ldots,x^{(d-1)})$ (notation slightly changed in response to other reviewers). We will add a reminder of that fact in the proof of Lemma 4.1, where the reviewer pointed us.

Reviewer 73Rm6/10 · confidence 3/52024-07-09

Summary

This paper demonstrates the theoretical bound analysis on data subsampling for Poisson regression with ID-link and root-link functions based on coreset method and the leverage of $\ell_r$ norms to the loss function. The $\text { ‘ } \rho \text {-complex’ }$ is a novel meaningful parameter for data compressibility under the context of subsampling and is a good starting point of theoretical construction.

Strengths

This paper provides a way of subdividing the set of input functions into groups to obtain an improved $O(d)$ bound for VC-dimension. The overall bounds by combining VC dimension and total sensitivity is convincing and the proof is detailed for cases where $p \in\{(1,2)\}$.

Weaknesses

This paper lacks a well-constructed structure, as it does not clearly introduce important concepts, provide a detailed discussion of related work, or include a summary or conclusion. To improve clarity, the proposed data subsampling techniques for Poisson regression might be presented in a pseudo-code format. While numerical simulation is not necessary, it would be a beneficial addition.

Questions

The notation is a bit confusing for the Poisson regression models: is the discussion restricted to $p \in\{(1,2)\}$ cases so the notation in e.g., 119 line, are in scalar format? The notation should be more generalized as in Theorem 3.8.

Rating

6

Confidence

3

Soundness

2

Presentation

2

Contribution

2

Limitations

The authors should consider restructuring the entire paper to clearly state the introduction, the proposed method along with its bound analysis, and the limitations and conclusion. Although the problem statement, proof, and results are meaningful, they lack clarity for the readers. Additionally, a major concern is the limited cases to which the analysis can be applied, specifically only for $p \in\{(1,2)\}$. This limitation significantly undermines the generalizability of the proposed method.

Reviewer SQxM7/10 · confidence 3/52024-07-12

Summary

For Poisson regression, where the outcome variable is a positive integer, the paper provides sublinear coresets under certain assumption on the data characterized by parameter $\rho$. The link function is the $p^{th}$ root link function with $p = 1 , p=2$. Without any assumptions the authors show that no sublinear size coresets are possible, in fact, they show lower bound results for any other data reduction techniques also. For $p = 1 , p=2$ and the parameter $\rho$, the coresets are constructed using the standard sensitivity framework which involves calculating sensitivity upper bounds and bounding the VC-dimension. For other values of $p$, the authors show that their technique and analysis is not sufficient to get an $\epsilon$-coreset.

Strengths

1) Though the paper is very similar in structure and high-level ideas to the paper "On Coresets for Logistic Regression", extending those ideas to the setting of Poisson regression is non-trivial. The paper appears solid in terms of theoretical contributions. 2) The writing of the paper is generally very good. Though the proofs are in the appendices, high level ideas and intuitions are provided in the paper for most of the results in the main part. The trick to shift the domain to get sensitivity upper bounds is neat and may find interest in the community working on coresets.

Weaknesses

The only main weakness I think is the lack of any experimental results in the paper. Some small set of proof-of-concept experiments would have further strengthened the paper. There are some small issues with writing. $x$ in $R^d$ is described in terms of its coordinates $1, x_1, x_2 \dots x_{d-1}$. However later $x_j$ is used to denote the $j^{th}$ vector in the dataset. The writing in the final part of the paper appears rushed, may be due to space constraints. The authors talk about Lambert functions however there is no introduction as to what they are. It is difficult for readers not familiar with the concept.

Questions

This may be basic question, maybe I am mission something, the feasible $\beta$ is such that $x_i\beta > 0$ is for the pth-root link or it will also hold in case of ID-link Poisson regression?

Rating

7

Confidence

3

Soundness

3

Presentation

3

Contribution

3

Limitations

see weaknesses

Reviewer HZmN2024-08-08

Thank you for the rebuttal. The additional references on the fact that the identity and root link functions are actually used in practice are extremely valuable to me, please consider including it in the draft. I have raised my score based on that. I still don't quite see your point about the balancedness parameter $\rho$ not being the driving force behind the coreset bound. In the logistic regression setting, having a small $\mu$ parameter allows the coreset to be small, while the circle lower bound instance that is always used does not have a small $\mu$ parameter and thus has a $\Omega(n)$ lower bound on the coreset size [25]. Are you saying that the circle lower bound gives an $\Omega(n)$ lower bound despite a small $\rho$ parameter? The domain shift idea seems to a technique of avoiding a pathological $\epsilon$-neighborhood of 0 in the loss function to facilitate the analysis, which still contains a $(1+\epsilon)$-approximate minimizer. Indeed, this has not been needed in prior works on sensitivity sampling for GLMs since the loss functions have no asymptotes in prior work. I did not realize this on my first read. Some follow-up questions on feasibility issues: When using the canonical log link, we never have to worry about anything like this since the log link ensures that the expectation of the GLM will be positive. How is this handled for the identity and square root link? And can't the domain restriction turn a feasible instance into an infeasible one? If so, can small coresets still exist and this work's solution avoids them, or are small coresets just not possible for such instances? This should be considered and discussed more carefully. **These are very interesting questions, and I will consider increasing my score to a weak accept depending on how the authors answer these questions. Note that I don't expect all of these questions to be fully answered, as long as a thoughtful discussion is provided.** Tangential point: I found the discussion of the $\lambda$ parameter to be confusing/not well-explained. I now understand it to be a parameter which parameterizes a lower bound on the loss function. Re: Lemmas 6.1 and 6.2, I now realize I missed that these lower bounds were for the p-th root versions rather than for the log link version as in [23]. I agree that these lower bounds need to be slightly modified for each coreset problem being studied. The question was not to suggest that including this lower bound is a weakness (although it wouldn't be a stand-alone contribution either), I just wanted to clarify that it couldn't have just been cited from [23].

Authorsrebuttal2024-08-09

Thank you again for your thoughtful comments and questions, and for appreciating our work more than before. Of course we will add the additional references to motivate the model. Regarding $\rho$ and $\lambda$: The short answer is yes, the circle lower bound gives $\Omega(n)$ even in the case where $\rho$ is small. We try to give a more detailed explanation of the role of $\rho$ (and $\lambda$): Recall in logistic regression [25] the (individual) loss function satisfies $z \leq g(z) \leq 2z$ for sufficiently large $z$. I.e. the upper and lower bounds are balanced up to a factor $2$ independent of $\mu$ (but $\mu$ is used to introduce balance between large (positive) and small (negative) contributions to avoid the circle lower bound). Now let us take a look at Poisson with ID link (arguments are similar for $p=2$). We would like to bound $z/\lambda \leq g_y(z) \leq z$ for sufficiently large $z$ for some value of $\lambda$. Now $\lambda$ would need to be roughly $y$ (ignoring logarithmic factors) because with growing $y$, the loss function widens, and its minimum moves mainly to the 'right', so we would need a very flat lower bound, so large $\lambda\approx y$. This would unfortunately give $\sum_{i \in[n]} y_i =\Omega(n)$ dependence in coreset size (not reflected in the circle lower bound). So instead, we additionally shift the lower bound: $(z-y)/\lambda \leq g_y(z) \leq z$ for sufficiently large $z$. This allows sublinear $\lambda$ and thus avoids $\Omega(n)$ (restricted to the large $z$). At the same time we need to relate the lower $(z-y)$ and upper bound $z$, which is the role of $\rho$. This shift and balancing assumption is not artificial or just used to make the calculations go through, but it is naturally consistent with the statistical model (see discussion below Equation (2)). Please note that the steps we described in the previous two paragraphs **only** help us to achieve the analogue in the Poisson regression setting of the bounds $z \leq g(z) \leq 2z$ that hold in the logistic regression setting, which is **just** for relating to the $\ell_1$-norm. This is consistent with the fact that the Poisson regression setting is more difficult than the logistic regression setting and indicates that the additional steps we have taken in our paper are nontrivial. All the above does **not** handle the asymptote near zero, which is the main source of hardness leveraged in the circle $\Omega(n)$ lower bound. The latter difficulty is later tackled by the domain shift idea. [To be continued in an additional comment.]

Authorsrebuttal2024-08-09

Regarding feasibility: for the ID and square root link (in fact for any $p$th-root-link), recall that the loss function includes a $\log(x\beta)$ term, which restricts the feasible region to $\beta$ such that for all $x_i, i\in[n]$ it holds that $x_i \beta > 0$. So $\beta\in D(0)$ is the natural domain, induced by the model. This restriction is not our choice. The domain shift idea restricts the domain even further to $\beta\in D(\eta)\subset D(0)$, for $\eta > 0$. Clearly, some solutions that are feasible in the problem formulated over $D(0)$ are no longer feasible in the problem formulated over $D(\eta)$. But as we prove, we can construct a coreset that holds for all $\beta \in D(\eta)$, and $D(\eta)$ contains at least one $\beta$ that is a $(1+\varepsilon)$-approximation for the optimal solution $\beta^*$ of the problem on the original domain $D(0)$, and evaluated on the full dataset. These two parts are combined to prove that the final minimizer $\tilde\beta\in D(\eta)$ evaluated on the coreset is a $(1+O(\varepsilon))$-approximation for $\beta^*$. In the other direction, no infeasible solution can become feasible because of the proper subset relation $D(\eta)\subset D(0)$. Note that for any data and any fixed $\eta<\infty$, both $D(\eta)$ and $D(0)$ are non-empty, since they consist of all $\beta$ that parameterize hyperplanes that put the convex hull of input points (respectively, the additive $\eta$-inflation of the convex hull of input points) in the positive open halfspace. So there always exist feasible solutions, which means that no instance can become completely infeasible by our methods. Regarding the question of whether "small coresets [can] still exist ... just not possible for such instances?": We think that small coresets can `still exist' only under assumptions that make the problem of finding a coreset trivial. This is our reasoning: if an instance consists of the extreme points on the convex hull, and all but a small (sublinear) number of points are separated by an $\varepsilon$ distance to the boundary, then indeed the domain shift would not be necessary since the resulting domain structure is already in the data. But if the non-extremal points are allowed to get arbitrarily close to the boundary, and if we do **not** shift the domain, then we will not avoid high sensitivity points that are strictly inside the convex hull. Then the coreset size would necessarily depend on the distance of the non-extremal points to the boundary, and crucially on the number of points that are very close to the boundary of the convex hull, which again can be constructed to be $\Omega(n)$.

Reviewer HZmN2024-08-09

Thank you for the additional clarifications, these are very helpful, and the use of the intercept indeed makes everything make sense. I will raise my score to accept.

Reviewer L5wz2024-08-09

I have read the response and have no comment

Reviewer SQxM2024-08-09

I have read the rebuttal. I will keep my score

Reviewer 73Rm2024-08-12

I have read the authors' response and have no further comments.

Program Chairsdecision2024-09-25

Decision

Accept (poster)

© 2026 NYSGPT2525 LLC