:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Huisman, Tim, van der Linden, Jacobus G. M., Demirović, Emir
Formato:	Preprint
Publicado:	2024
Materias:	Machine Learning Artificial Intelligence Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/2401.04489
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Block-Diagonal Guided DBSCAN Clustering
por: Zhao, Weibing
Publicado: (2024)

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

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

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

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

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

Learning-Augmented Priority Queues
por: Benomar, Ziyad, et al.
Publicado: (2024)

Differentially Private Kernel Density Estimation
por: Liu, Erzhi, et al.
Publicado: (2024)

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

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

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

Mini-batch Submodular Maximization
por: Schwartzman, Gregory
Publicado: (2024)

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

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

AlgoSelect: Universal Algorithm Selection via the Comb Operator
por: Yao, Jasper
Publicado: (2025)

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

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

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

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

Anytime-Constrained Reinforcement Learning
por: McMahan, Jeremy, et al.
Publicado: (2023)