Copertina

Learning-Based Algorithms for Graph Searching Problems

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	DePavia, Adela Frances, Tani, Erasmo, Vakilian, Ali
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms Artificial Intelligence Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Scalable Algorithms for Individual Preference Stable Clustering
di: Mosenzon, Ron, et al.
Pubblicazione: (2024)

A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering
di: Bandyapadhyay, Sayan, et al.
Pubblicazione: (2024)

Graph-Based Nearest-Neighbor Search without the Spread
di: Giliberti, Jeff, et al.
Pubblicazione: (2026)

Optimizing Text Search: A Novel Pattern Matching Algorithm Based on Ukkonen's Approach
di: Guan, Xinyu, et al.
Pubblicazione: (2025)

Simulation of Graph Algorithms with Looped Transformers
di: de Luca, Artur Back, et al.
Pubblicazione: (2024)

On Tradeoffs in Learning-Augmented Algorithms
di: Benomar, Ziyad, et al.
Pubblicazione: (2025)

Self-Supervised Graph Learning via Spectral Bootstrapping and Laplacian-Based Augmentations
di: Bini, Lorenzo, et al.
Pubblicazione: (2025)

An Algorithm for Learning Smaller Representations of Models With Scarce Data
di: de Wynter, Adrian
Pubblicazione: (2020)

Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning
di: Li, Dongyue, et al.
Pubblicazione: (2025)

Learning the Positions in CountSketch
di: Li, Yi, et al.
Pubblicazione: (2023)

Learning to Prune Instances of Steiner Tree Problem in Graphs
di: Zhang, Jiwei, et al.
Pubblicazione: (2022)

Linear-Time Algorithms for Front-Door Adjustment in Causal Graphs
di: Wienöbst, Marcel, et al.
Pubblicazione: (2022)

On Socially Fair Low-Rank Approximation and Column Subset Selection
di: Song, Zhao, et al.
Pubblicazione: (2024)

Fast EXP3 Algorithms
di: Sato, Ryoma, et al.
Pubblicazione: (2025)

Discovering Data Structures: Nearest Neighbor Search and Beyond
di: Salemohamed, Omar, et al.
Pubblicazione: (2024)

Positional Attention: Expressivity and Learnability of Algorithmic Computation
di: de Luca, Artur Back, et al.
Pubblicazione: (2024)

Pareto Optimal Algorithmic Recourse in Multi-cost Function
di: Chen, Wen-Ling, et al.
Pubblicazione: (2025)

OpenTensor: Reproducing Faster Matrix Multiplication Discovering Algorithms
di: Sun, Yiwen, et al.
Pubblicazione: (2024)

AlgoSelect: Universal Algorithm Selection via the Comb Operator
di: Yao, Jasper
Pubblicazione: (2025)

Non-adaptive Learning of Random Hypergraphs with Queries
di: Austhof, Bethany, et al.
Pubblicazione: (2025)

Are Graph Neural Networks Optimal Approximation Algorithms?
di: Yau, Morris, et al.
Pubblicazione: (2023)

A Survey on Algorithmic Developments in Optimal Transport Problem with Applications
di: Moradi, Sina
Pubblicazione: (2025)

Efficient Detection of Commutative Factors in Factor Graphs
di: Luttermann, Malte, et al.
Pubblicazione: (2024)

Learning-Augmented Streaming Algorithms for Approximating MAX-CUT
di: Dong, Yinhao, et al.
Pubblicazione: (2024)

Which Algorithms Can Graph Neural Networks Learn?
di: Wittig, Solveig, et al.
Pubblicazione: (2026)

A Fixed-Parameter Tractable Algorithm for Counting Markov Equivalence Classes with the same Skeleton
di: Sharma, Vidya Sagar
Pubblicazione: (2023)

On the Detection of Commutative Factors in Factor Graphs: Necessary and Sufficient Conditions
di: Luttermann, Malte, et al.
Pubblicazione: (2026)

Estimating Causal Effects in Partially Directed Parametric Causal Factor Graphs
di: Luttermann, Malte, et al.
Pubblicazione: (2024)

Rethinking Flexible Graph Similarity Computation: One-step Alignment with Global Guidance
di: Liu, Zhouyang, et al.
Pubblicazione: (2025)

Guessing Efficiently for Constrained Subspace Approximation
di: Bhaskara, Aditya, et al.
Pubblicazione: (2025)

Learning-Augmented Priority Queues
di: Benomar, Ziyad, et al.
Pubblicazione: (2024)

Anytime-Constrained Reinforcement Learning
di: McMahan, Jeremy, et al.
Pubblicazione: (2023)

Approximation Algorithms for $\ell_p$-Shortest Path and $\ell_p$-Group Steiner Tree
di: Makarychev, Yury, et al.
Pubblicazione: (2024)

Learning-Augmented Online Bipartite Fractional Matching
di: Choo, Davin, et al.
Pubblicazione: (2025)

Polynomial-Time Approximability of Constrained Reinforcement Learning
di: McMahan, Jeremy
Pubblicazione: (2025)

Prior Knowledge Makes It Possible: From Sublinear Graph Algorithms to LLM Test-Time Methods
di: Blum, Avrim, et al.
Pubblicazione: (2025)

Online Learning with Probing for Sequential User-Centric Selection
di: Xu, Tianyi, et al.
Pubblicazione: (2025)

Learning-augmented smooth integer programs with PAC-learnable oracles
di: He, Hao-Yuan, et al.
Pubblicazione: (2026)

Changing Base Without Losing Pace: A GPU-Efficient Alternative to MatMul in DNNs
di: Ailon, Nir, et al.
Pubblicazione: (2025)

Provably Learning from Modern Language Models via Low Logit Rank
di: Golowich, Noah, et al.
Pubblicazione: (2025)