Image de couverture de livre

GEFL: Extended Filtration Learning for Graph Classification

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Zhang, Simon, Mukherjee, Soham, Dey, Tamal K.
Format:	Preprint
Publié:	2024
Sujets:	Machine Learning Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Learning-Augmented Moment Estimation on Time-Decay Models
par: Nagawanshi, Soham, et autres
Publié: (2026)

Optimal Dimension-Free Sampling for Regularized Classification
par: Alishahi, Meysam, et autres
Publié: (2026)

An Approximation Algorithm for Graph Label Selection
par: John, Josia, et autres
Publié: (2026)

Learning on the Edge: Online Learning with Stochastic Feedback Graphs
par: Esposito, Emmanuel, et autres
Publié: (2022)

Learning Augmented Graph $k$-Clustering
par: Fan, Chenglin, et autres
Publié: (2025)

Distribution Learning Meets Graph Structure Sampling
par: Bhattacharyya, Arnab, et autres
Publié: (2024)

Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel
par: Chen, Yixin, et autres
Publié: (2021)

Exact Learning of Weighted Graphs Using Composite Queries
par: Goodrich, Michael T., et autres
Publié: (2025)

Online Classification with Predictions
par: Raman, Vinod, et autres
Publié: (2024)

Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification
par: Zhang, Guangyi, et autres
Publié: (2026)

Graph-based Nearest Neighbors with Dynamic Updates via Random Walks
par: Mishra, Nina, et autres
Publié: (2025)

Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach
par: Yang, Yichun, et autres
Publié: (2024)

Hardness of High-Dimensional Linear Classification
par: Munteanu, Alexander, et autres
Publié: (2026)

Expander Hierarchies for Normalized Cuts on Graphs
par: Hanauer, Kathrin, et autres
Publié: (2024)

Incremental (k, z)-Clustering on Graphs
par: Cruciani, Emilio, et autres
Publié: (2026)

Faster Graph Embeddings via Coarsening
par: Fahrbach, Matthew, et autres
Publié: (2020)

Optimal bounds for $\ell_p$ sensitivity sampling via $\ell_2$ augmentation
par: Munteanu, Alexander, et autres
Publié: (2024)

Turnstile $\ell_p$ leverage score sampling with applications
par: Munteanu, Alexander, et autres
Publié: (2024)

Online Sparsification of Bipartite-Like Clusters in Graphs
par: Das, Joyentanuj, et autres
Publié: (2025)

Space of Data through the Lens of Multilevel Graph
par: Caputo, Marco, et autres
Publié: (2025)

Learning-Augmented Online Bipartite Matching in the Random Arrival Order Model
par: Burathep, Kunanon, et autres
Publié: (2025)

Dynamic Similarity Graph Construction with Kernel Density Estimation
par: Laenen, Steinar, et autres
Publié: (2025)

Improved Approximations for Hard Graph Problems using Predictions
par: Aamand, Anders, et autres
Publié: (2025)

DRESS: A Continuous Framework for Structural Graph Refinement
par: Velilla, Eduar Castrillo
Publié: (2026)

Learning Mixture Models via Efficient High-dimensional Sparse Fourier Transforms
par: Kalavasis, Alkis, et autres
Publié: (2026)

Fast and Accurate Triangle Counting in Graph Streams Using Predictions
par: Boldrin, Cristian, et autres
Publié: (2024)

Beyond Spectral Clustering: Probabilistic Cuts for Differentiable Graph Partitioning
par: Ghriss, Ayoub
Publié: (2025)

Graph neural networks extrapolate out-of-distribution for shortest paths
par: Nerem, Robert R., et autres
Publié: (2025)

Differentially Private Synthetic Graphs Preserving Triangle-Motif Cuts
par: Peng, Pan, et autres
Publié: (2025)

Private Edge Density Estimation for Random Graphs: Optimal, Efficient and Robust
par: Chen, Hongjie, et autres
Publié: (2024)

Query-Efficient Locally Private Hypothesis Selection via the Scheffe Graph
par: Kamath, Gautam, et autres
Publié: (2025)

Correlation Clustering Algorithm for Dynamic Complete Signed Graphs: An Index-based Approach
par: Shakiba, Ali
Publié: (2023)

Local Fragments, Global Gains: Subgraph Counting using Graph Neural Networks
par: Roy, Shubhajit, et autres
Publié: (2023)

Learning-augmented Online Algorithm for Two-level Ski-rental Problem
par: Zhang, Keyuan, et autres
Publié: (2024)

Improved Robust Estimation for Erdős-Rényi Graphs: The Sparse Regime and Optimal Breakdown Point
par: Chen, Hongjie, et autres
Publié: (2025)

Graph Neural Network-Informed Predictive Flows for Faster Ford-Fulkerson and PAC-Learnability
par: Wiesler, Eleanor, et autres
Publié: (2026)

Learning CNF formulas from uniform random solutions in the local lemma regime
par: Feng, Weiming, et autres
Publié: (2025)

Cache Management for Mixture-of-Experts LLMs -- extended version
par: Angelopoulos, Spyros, et autres
Publié: (2025)

Robustifying Learning-Augmented Caching Efficiently without Compromising 1-Consistency
par: Chen, Peng, et autres
Publié: (2025)

Learning-Augmented Algorithms for $k$-median via Online Learning
par: Hebbar, Anish, et autres
Publié: (2026)