0cbc5671ae26f67871cb914d81ef8fc1-AuthorFeedback.pdf
–Neural Information Processing Systems
We thank all reviewers for their encouraging and helpful comments. We will fix all typos. Results are presented in Table A. Following convex relaxation theory[32], our bound has This makes the concretization problem (in Sec. We plan to study high-order bounds on general graphs as our future work. We will also discuss these extensions.
Neural Information Processing Systems
Dec-27-2025, 22:22:13 GMT
- Technology: