Search Results for author:
Found 3 papers, 0 papers with code
A Local Graph Limits Perspective on Sampling-Based GNNs
We propose a theoretical framework for training Graph Neural Networks (GNNs) on large input graphs via training on small, fixed-size sampled subgraphs.
Incentive Compatibility in the Auto-bidding World
Through the analysis of this model, we uncover a surprising result: in auto-bidding with two advertisers, FPA and SPA are auction equivalent.
Fractionally Log-Concave and Sector-Stable Polynomials: Counting Planar Matchings and More
While perfect matchings on planar graphs can be counted exactly in polynomial time, counting non-perfect matchings was shown by [Jer87] to be #P-hard, who also raised the question of whether efficient approximate counting is possible.
Point Processes
Data Structures and Algorithms
Combinatorics
Probability
