2 citations · 4 across the 5 of their papers we have counts for
7 papers
The Universal Classifier for Graph Learning
Ben Finkelshtein, André Linhares, Petar Veličković +2
While foundation models have revolutionized natural language processing and computer vision by leveraging universal vocabularies, Graph Machine Learning (GML) remains fractured due…
Large-Scale Graph Building in Dynamic Environments: Low Latency and High Quality
Filipe Miguel Gonçalves de Almeida, CJ Carey, Hendrik Fichtenberger +8
Learning and constructing large-scale graphs has attracted attention in recent decades, resulting in a rich literature that introduced various systems, tools, and algorithms. Grale…
Streaming Belief Propagation for Community Detection
Yuchen Wu, MohammadHossein Bateni, Andre Linhares +4
The community detection problem requires to cluster the nodes of a network into a small number of well-connected "communities". There has been substantial recent progress in charac…
Approximation Algorithms for Distributionally Robust Stochastic Optimization with Black-Box Distributions
Andre Linhares, Chaitanya Swamy
Two-stage stochastic optimization is a framework for modeling uncertainty, where we have a probability distribution over possible realizations of the data, called scenarios, and de…
Approximate Multi-Matroid Intersection via Iterative Refinement
André Linhares, Neil Olver, Chaitanya Swamy +1
We introduce a new iterative rounding technique to round a point in a matroid polytope subject to further matroid constraints. This technique returns an independent set in one matr…
Improved Algorithms for MST and Metric-TSP Interdiction
André Linhares, Chaitanya Swamy
We consider the {\em MST-interdiction} problem: given a multigraph , edge weights , interdiction costs , and an interd…