Imagen de Portada

Lower Bounds for the Algorithmic Complexity of Learned Indexes

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Croquevielle, Luis Alberto, Sokolovskii, Roman, Heinis, Thomas
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Querying in Constant Expected Time with Learned Indexes
por: Croquevielle, Luis, et al.
Publicado: (2024)

Learning Intersections of Halfspaces with Distribution Shift: Improved Algorithms and SQ Lower Bounds
por: Klivans, Adam R., et al.
Publicado: (2024)

Algorithms and SQ Lower Bounds for Robustly Learning Real-valued Multi-index Models
por: Diakonikolas, Ilias, et al.
Publicado: (2025)

Statistical Query Lower Bounds for Smoothed Agnostic Learning
por: Diakonikolas, Ilias, et al.
Publicado: (2026)

A Residual-Shell-Based Lower Bound for Ollivier-Ricci Curvature
por: Gu, Xiang, et al.
Publicado: (2026)

Lower Bounds for Greedy Teaching Set Constructions
por: Compton, Spencer, et al.
Publicado: (2025)

A Tight Lower Bound for the Approximation Guarantee of Higher-Order Singular Value Decomposition
por: Fahrbach, Matthew, et al.
Publicado: (2025)

Statistical Query Lower Bounds for Learning Truncated Gaussians
por: Diakonikolas, Ilias, et al.
Publicado: (2024)

Smooth Lower Bounds for Differentially Private Algorithms via Padding-and-Permuting Fingerprinting Codes
por: Peter, Naty, et al.
Publicado: (2023)

Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
por: Amanatidis, Georgios, et al.
Publicado: (2021)

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

The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits
por: Assadi, Sepehr, et al.
Publicado: (2023)

Quantum Algorithms and Lower Bounds for Finite-Sum Optimization
por: Zhang, Yexin, et al.
Publicado: (2024)

Finite Sample Bounds for Learning with Score Matching
por: Smedira, Devin, et al.
Publicado: (2026)

Tight Bounds for Learning Polyhedra with a Margin
por: Patel, Shyamal, et al.
Publicado: (2026)

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

Better Learning-Augmented Spanning Tree Algorithms via Metric Forest Completion
por: Veldt, Nate, et al.
Publicado: (2026)

Testing Noise Assumptions of Learning Algorithms
por: Goel, Surbhi, et al.
Publicado: (2025)

Learning-Augmented Algorithms with Explicit Predictors
por: Elias, Marek, et al.
Publicado: (2024)

Algorithms with Calibrated Machine Learning Predictions
por: Shen, Judy Hanwen, et al.
Publicado: (2025)

Learning-Augmented Algorithms for $k$-median via Online Learning
por: Hebbar, Anish, et al.
Publicado: (2026)

SQ Lower Bounds for Non-Gaussian Component Analysis with Weaker Assumptions
por: Diakonikolas, Ilias, et al.
Publicado: (2024)

Learning-Augmented Streaming Algorithms for Correlation Clustering
por: Dong, Yinhao, et al.
Publicado: (2025)

A Competitive Algorithm for Agnostic Active Learning
por: Price, Eric, et al.
Publicado: (2023)

Faster Algorithms for Agnostically Learning Disjunctions and their Implications
por: Diakonikolas, Ilias, et al.
Publicado: (2025)

Prediction-Specific Design of Learning-Augmented Algorithms
por: Li, Sizhe, et al.
Publicado: (2025)

Tolerant Algorithms for Learning with Arbitrary Covariate Shift
por: Goel, Surbhi, et al.
Publicado: (2024)

Decision-Theoretic Approaches for Improved Learning-Augmented Algorithms
por: Angelopoulos, Spyros, et al.
Publicado: (2025)

Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms
por: Angelopoulos, Spyros, et al.
Publicado: (2024)

On the Complexity of Learning Sparse Functions with Statistical and Gradient Queries
por: Joshi, Nirmit, et al.
Publicado: (2024)

Online Conversion with Switching Costs: Robust and Learning-Augmented Algorithms
por: Lechowicz, Adam, et al.
Publicado: (2023)

Better Models and Algorithms for Learning Ising Models from Dynamics
por: Gaitonde, Jason, et al.
Publicado: (2025)

PriorBoost: An Adaptive Algorithm for Learning from Aggregate Responses
por: Javanmard, Adel, et al.
Publicado: (2024)

An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum $s$-Bundle Problem
por: Xue, Jinghui, et al.
Publicado: (2024)

New Algorithms and Lower Bounds for Streaming Tournaments
por: Ghosh, Prantar, et al.
Publicado: (2024)

Dynamic PageRank: Algorithms and Lower Bounds
por: Jayaram, Rajesh, et al.
Publicado: (2024)

Mistake-Bounded Language Generation
por: Kleinberg, Jon, et al.
Publicado: (2026)

Asymptotically Robust Learning-Augmented Algorithms for Preemptive FIFO Buffer Management
por: Hsieh, Wen-Han, et al.
Publicado: (2026)

Learning-augmented Online Algorithm for Two-level Ski-rental Problem
por: Zhang, Keyuan, et al.
Publicado: (2024)

Better Bounds for the Distributed Experts Problem
por: Woodruff, David P., et al.
Publicado: (2026)