Image de couverture de livre

Contract Scheduling with Distributional and Multiple Advice

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Angelopoulos, Spyros, Bienkowski, Marcin, Dürr, Christoph, Simon, Bertrand
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Artificial Intelligence Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Decision-Theoretic Approaches for Improved Learning-Augmented Algorithms
par: Angelopoulos, Spyros, et autres
Publié: (2025)

Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms
par: Angelopoulos, Spyros, et autres
Publié: (2024)

Online Computation with Untrusted Advice
par: Angelopoulos, Spyros, et autres
Publié: (2019)

Cache Management for Mixture-of-Experts LLMs -- extended version
par: Angelopoulos, Spyros, et autres
Publié: (2025)

Scenario-Based Robust Optimization of Tree Structures
par: Angelopoulos, Spyros, et autres
Publié: (2024)

Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search
par: Benomar, Ziyad, et autres
Publié: (2025)

Non-clairvoyant Scheduling with Partial Predictions
par: Benomar, Ziyad, et autres
Publié: (2024)

Competitive Search in the Line and the Star with Predictions
par: Angelopoulos, Spyros
Publié: (2023)

The Pareto Frontier of Randomized Learning-Augmented Online Bidding
par: Degryse, Mathis, et autres
Publié: (2026)

OpenTensor: Reproducing Faster Matrix Multiplication Discovering Algorithms
par: Sun, Yiwen, et autres
Publié: (2024)

A Subquadratic Bound for Online Bisection
par: Bienkowski, Marcin, et autres
Publié: (2023)

Online Disjoint Set Covers: Randomization is not Necessary
par: Bienkowski, Marcin, et autres
Publié: (2024)

Discovering Data Structures: Nearest Neighbor Search and Beyond
par: Salemohamed, Omar, et autres
Publié: (2024)

Optimal Survival Trees: A Dynamic Programming Approach
par: Huisman, Tim, et autres
Publié: (2024)

Mini-Batch Kernel $k$-means
par: Jourdan, Ben, et autres
Publié: (2024)

Model Stealing for Any Low-Rank Language Model
par: Liu, Allen, et autres
Publié: (2024)

Block-Diagonal Guided DBSCAN Clustering
par: Zhao, Weibing
Publié: (2024)

SubGen: Token Generation in Sublinear Time and Memory
par: Zandieh, Amir, et autres
Publié: (2024)

Online bipartite matching with imperfect advice
par: Choo, Davin, et autres
Publié: (2024)

Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover
par: Harris, Blake, et autres
Publié: (2024)

Estimating Causal Effects in Partially Directed Parametric Causal Factor Graphs
par: Luttermann, Malte, et autres
Publié: (2024)

Learning-Augmented Priority Queues
par: Benomar, Ziyad, et autres
Publié: (2024)

Constructing Decision Trees from Data Streams
par: Pham, Huy, et autres
Publié: (2024)

Differentially Private Kernel Density Estimation
par: Liu, Erzhi, et autres
Publié: (2024)

Efficient Detection of Commutative Factors in Factor Graphs
par: Luttermann, Malte, et autres
Publié: (2024)

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

Mini-batch Submodular Maximization
par: Schwartzman, Gregory
Publié: (2024)

A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering
par: Bandyapadhyay, Sayan, et autres
Publié: (2024)

Learning-Based Algorithms for Graph Searching Problems
par: DePavia, Adela Frances, et autres
Publié: (2024)

A Note On Lookahead In Real Life And Computing
par: Sharma, Burle, et autres
Publié: (2024)

Simulation of Graph Algorithms with Looped Transformers
par: de Luca, Artur Back, et autres
Publié: (2024)

AlgoSelect: Universal Algorithm Selection via the Comb Operator
par: Yao, Jasper
Publié: (2025)

An Algorithm for Learning Smaller Representations of Models With Scarce Data
par: de Wynter, Adrian
Publié: (2020)

Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning
par: Li, Dongyue, et autres
Publié: (2025)

Optimizing Text Search: A Novel Pattern Matching Algorithm Based on Ukkonen's Approach
par: Guan, Xinyu, et autres
Publié: (2025)

Streaming Attention Approximation via Discrepancy Theory
par: Kochetkova, Ekaterina, et autres
Publié: (2025)

Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback
par: Pedramfar, Mohammad, et autres
Publié: (2023)

Anytime-Constrained Reinforcement Learning
par: McMahan, Jeremy, et autres
Publié: (2023)

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

The sample complexity of multi-distribution learning
par: Peng, Binghui
Publié: (2023)