Cover Image

Competitive strategies to use "warm start" algorithms with predictions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Srinivas, Vaidehi, Blum, Avrim
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Model for Combinatorial Dictionary Learning and Inference
by: Blum, Avrim, et al.
Published: (2024)

Nearly-tight Approximation Guarantees for the Improving Multi-Armed Bandits Problem
by: Blum, Avrim, et al.
Published: (2024)

Online Conformal Prediction with Efficiency Guarantees
by: Srinivas, Vaidehi
Published: (2025)

Regularized Robustly Reliable Learners and Instance Targeted Attacks
by: Blum, Avrim, et al.
Published: (2024)

Learning Confidence Ellipsoids and Applications to Robust Subspace Recovery
by: Gao, Chao, et al.
Published: (2025)

Computing High-dimensional Confidence Sets for Arbitrary Distributions
by: Gao, Chao, et al.
Published: (2025)

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

New Tools for Smoothed Analysis: Least Singular Value Bounds for Random Matrices with Dependent Entries
by: Bhaskara, Aditya, et al.
Published: (2024)

Accelerating ERM for data-driven algorithm design using output-sensitive techniques
by: Balcan, Maria-Florina, et al.
Published: (2022)

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

Comparative algorithm performance evaluation and prediction for the maximum clique problem using instance space analysis
by: Sharman, Bharat, et al.
Published: (2025)

Algorithmic warm starts for Hamiltonian Monte Carlo
by: Zhang, Matthew S., et al.
Published: (2026)

Phase transition of the Sinkhorn-Knopp algorithm
by: He, Kun
Published: (2025)

Dynamic algorithms for k-center on graphs
by: Cruciani, Emilio, et al.
Published: (2023)

Warm-starting Push-Relabel
by: Davies, Sami, et al.
Published: (2024)

Subset verification and search algorithms for causal DAGs
by: Choo, Davin, et al.
Published: (2023)

MNL-Bandit with Knapsacks: a near-optimal algorithm
by: Aznag, Abdellah, et al.
Published: (2021)

Algorithms for Caching and MTS with reduced number of predictions
by: Sadek, Karim Abdel, et al.
Published: (2024)

An efficient, provably optimal algorithm for the 0-1 loss linear classification problem
by: He, Xi, et al.
Published: (2023)

Efficient distributional regression trees learning algorithms for calibrated non-parametric probabilistic forecasts
by: Duchemin, Quentin, et al.
Published: (2025)

Analyzing the effect of prediction accuracy on the distributionally-robust competitive ratio
by: Yoshinaga, Toru, et al.
Published: (2026)

The graph alignment problem: fundamental limits and efficient algorithms
by: Ganassali, Luca
Published: (2024)

Improved sampling algorithms and functional inequalities for non-log-concave distributions
by: He, Yuchen, et al.
Published: (2025)

Improved Approximations for Hard Graph Problems using Predictions
by: Aamand, Anders, et al.
Published: (2025)

Metric $k$-clustering using only Weak Comparison Oracles
by: Raychaudhury, Rahul, et al.
Published: (2026)

Local Fragments, Global Gains: Subgraph Counting using Graph Neural Networks
by: Roy, Shubhajit, et al.
Published: (2023)

Learning the Inverse Temperature of Ising Models under Hard Constraints using One Sample
by: Chauhan, Rohan, et al.
Published: (2025)

Achieving adaptivity and optimality for multi-armed bandits using Exponential-Kullback Leibler Maillard Sampling
by: Qin, Hao, et al.
Published: (2025)

Improved algorithms for learning quantum Hamiltonians, via flat polynomials
by: Narayanan, Shyam
Published: (2024)

A proximal gradient algorithm for composite log-concave sampling
by: Liu, Linghai, et al.
Published: (2026)

A 4-approximation algorithm for min max correlation clustering
by: Heidrich, Holger, et al.
Published: (2023)

Fast sampling from constrained spaces using the Metropolis-adjusted Mirror Langevin algorithm
by: Srinivasan, Vishwak, et al.
Published: (2023)

Provably faster randomized and quantum algorithms for $k$-means clustering via uniform sampling
by: Chen, Tyler, et al.
Published: (2025)

Rate-optimal community detection near the KS threshold via node-robust algorithms
by: Ding, Jingqiu, et al.
Published: (2025)

Data organization limits the predictability of binary classification
by: Jing, Fei, et al.
Published: (2024)

GIST: Greedy Independent Set Thresholding for Max-Min Diversification with Submodular Utility
by: Fahrbach, Matthew, et al.
Published: (2024)

Dynamic Consistent $k$-Center Clustering with Optimal Recourse
by: Forster, Sebastian, et al.
Published: (2024)

Clustering with Non-adaptive Subset Queries
by: Black, Hadley, et al.
Published: (2024)

Fast Partition-Based Cross-Validation With Centering and Scaling for $\mathbf{X}^\mathbf{T}\mathbf{X}$ and $\mathbf{X}^\mathbf{T}\mathbf{Y}$
by: Engstrøm, Ole-Christian Galbo, et al.
Published: (2024)

Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time
by: Braverman, Vladimir, et al.
Published: (2024)