Image de couverture de livre

Graph Neural Network-Informed Predictive Flows for Faster Ford-Fulkerson and PAC-Learnability

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Wiesler, Eleanor, Baxley, Trace
Format:	Preprint
Publié:	2026
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

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

Private List Learnability vs. Online List Learnability
par: Hanneke, Steve, et autres
Publié: (2025)

Towards Efficient Contrastive PAC Learning
par: Shen, Jie
Publié: (2025)

Minimum-Cost Network Flow with Dual Predictions
par: Chen, Zhiyang, et autres
Publié: (2026)

Efficient PAC Learning of Halfspaces with Constant Malicious Noise Rate
par: Shen, Jie
Publié: (2024)

A Faster $k$-means++ Algorithm
par: Liang, Jiehao, et autres
Publié: (2022)

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

Attribute-Efficient PAC Learning of Low-Degree Polynomial Threshold Functions with Nasty Noise
par: Zeng, Shiwei, et autres
Publié: (2023)

Faster Algorithms for Agnostically Learning Disjunctions and their Implications
par: Diakonikolas, Ilias, et autres
Publié: (2025)

Sample-Efficient Optimization over Generative Priors via Coarse Learnability
par: Awasthi, Pranjal, et autres
Publié: (2025)

Faster Spectral Density Estimation and Sparsification in the Nuclear Norm
par: Jin, Yujia, et autres
Publié: (2024)

Faster and Space Efficient Indexing for Locality Sensitive Hashing
par: Verma, Bhisham Dev, et autres
Publié: (2025)

Not All Learnable Distribution Classes are Privately Learnable
par: Bun, Mark, et autres
Publié: (2024)

A Faster Generalized Two-Stage Approximate Top-K
par: Samaga, Yashas, et autres
Publié: (2025)

Revisiting Agnostic PAC Learning
par: Hanneke, Steve, et autres
Publié: (2024)

A Probabilistic Framework for Improving Dense Object Detection in Underwater Image Data via Annealing-Based Data Augmentation
par: Wiesler, Eleanor, et autres
Publié: (2026)

Is Transductive Learning Equivalent to PAC Learning?
par: Dughmi, Shaddin, et autres
Publié: (2024)

Faster Low-Rank Approximation and Kernel Ridge Regression via the Block-Nyström Method
par: Garg, Sachin, et autres
Publié: (2025)

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

The Sample Complexity of Replicable Realizable PAC Learning
par: Larsen, Kasper Green, et autres
Publié: (2026)

Faster Sampling from Log-Concave Densities over Polytopes via Efficient Linear Solvers
par: Mangoubi, Oren, et autres
Publié: (2024)

A Distributional-Lifting Theorem for PAC Learning
par: Blanc, Guy, et autres
Publié: (2025)

PAC Learning is just Bipartite Matching (Sort of)
par: Dughmi, Shaddin
Publié: (2025)

What is Learnable in Valiant's Theory of the Learnable?
par: Hanneke, Steve, et autres
Publié: (2026)

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

Stochastic Bandits with ReLU Neural Networks
par: Xu, Kan, et autres
Publié: (2024)

Training Overparametrized Neural Networks in Sublinear Time
par: Deng, Yichuan, et autres
Publié: (2022)

Learning Neural Networks with Distribution Shift: Efficiently Certifiable Guarantees
par: Chandrasekaran, Gautam, et autres
Publié: (2025)

Learning-augmented smooth integer programs with PAC-learnable oracles
par: He, Hao-Yuan, et autres
Publié: (2026)

Private PAC Learning May be Harder than Online Learning
par: Bun, Mark, et autres
Publié: (2024)

An Efficient Matrix Multiplication Algorithm for Accelerating Inference in Binary and Ternary Neural Networks
par: Dehghankar, Mohsen, et autres
Publié: (2024)

Mildly-Interacting Fermionic Unitaries are Efficiently Learnable
par: Iyer, Vishnu
Publié: (2025)

Positional Attention: Expressivity and Learnability of Algorithmic Computation
par: de Luca, Artur Back, et autres
Publié: (2024)

PAC Learning with Bandit Feedback: Sharp Sample Complexity in the Realizable Setting
par: Hanneke, Steve, et autres
Publié: (2026)

Faster Private Minimum Spanning Trees
par: Pagh, Rasmus, et autres
Publié: (2024)

Bellman-Ford in Almost-Linear Time for Dense Graphs
par: Li, George Z., et autres
Publié: (2026)

Faster Diffusion Sampling with Randomized Midpoints: Sequential and Parallel
par: Gupta, Shivam, et autres
Publié: (2024)

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

Learning-Based Heavy Hitters and Flow Frequency Estimation in Streams
par: Shahout, Rana, et autres
Publié: (2024)

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