:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Huisman, Tim, van der Linden, Jacobus G. M., Demirović, Emir
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Artificial Intelligence Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2401.04489
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound
by: Brita, Catalin E., et al.
Published: (2025)

Necessary and Sufficient Conditions for Optimal Decision Trees using Dynamic Programming
by: van der Linden, Jacobus G. M., et al.
Published: (2023)

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

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

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

Constructing Decision Trees from Data Streams
by: Pham, Huy, et al.
Published: (2024)

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

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

Memory-Efficient Sequential Pattern Mining with Hybrid Tries
by: Hosseininasab, Amin, et al.
Published: (2022)

A Note On Lookahead In Real Life And Computing
by: Sharma, Burle, et al.
Published: (2024)

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

DiscQuant: A Quantization Method for Neural Networks Inspired by Discrepancy Theory
by: Chee, Jerry, et al.
Published: (2025)

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

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

New Algorithmic Directions in Optimal Transport and Applications for Product Spaces
by: Beigi, Salman, et al.
Published: (2025)

Instance-Optimal Matrix Multiplicative Weight Update and Its Quantum Applications
by: Gong, Weiyuan, et al.
Published: (2025)

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

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

Mini-Batch Kernel $k$-means
by: Jourdan, Ben, et al.
Published: (2024)

Model Stealing for Any Low-Rank Language Model
by: Liu, Allen, et al.
Published: (2024)

Block-Diagonal Guided DBSCAN Clustering
by: Zhao, Weibing
Published: (2024)

Contract Scheduling with Distributional and Multiple Advice
by: Angelopoulos, Spyros, et al.
Published: (2024)

SubGen: Token Generation in Sublinear Time and Memory
by: Zandieh, Amir, et al.
Published: (2024)

Online bipartite matching with imperfect advice
by: Choo, Davin, et al.
Published: (2024)

Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover
by: Harris, Blake, et al.
Published: (2024)

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

Learning-Augmented Priority Queues
by: Benomar, Ziyad, et al.
Published: (2024)

Differentially Private Kernel Density Estimation
by: Liu, Erzhi, et al.
Published: (2024)

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

Non-clairvoyant Scheduling with Partial Predictions
by: Benomar, Ziyad, et al.
Published: (2024)

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

Mini-batch Submodular Maximization
by: Schwartzman, Gregory
Published: (2024)

Learning-Based Algorithms for Graph Searching Problems
by: DePavia, Adela Frances, et al.
Published: (2024)

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

AlgoSelect: Universal Algorithm Selection via the Comb Operator
by: Yao, Jasper
Published: (2025)

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

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

Streaming Attention Approximation via Discrepancy Theory
by: Kochetkova, Ekaterina, et al.
Published: (2025)

Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback
by: Pedramfar, Mohammad, et al.
Published: (2023)

Anytime-Constrained Reinforcement Learning
by: McMahan, Jeremy, et al.
Published: (2023)