arXiv Machine Learning
Jun 2
Towards Optimal Robustness in Learning-Augmented Paging
arXiv:2606. 01342v1 Announce Type: cross Abstract: Learning-augmented paging has been extensively studied in recent years.
Learning-Augmented Online Minimization with Dual Predictions
arXiv:2606. 05380v1 Announce Type: cross Abstract: We present learning-augmented algorithms for two general classes of online minimization problems: metrical task systems and laminar set cover.
Related stories
arXiv Machine Learning
Aug 4
Learning-Based Stochastic Optimal Control with Infinite-Horizon Probabilistic Constraints
arXiv:2608. 01151v1 Announce Type: cross Abstract: In this paper, we consider stochastic optimal control problems with infinite-horizon joint chance constraints.
arXiv Machine Learning
Jul 31
Learning-Augmented Algorithms for Online Vertex Cover
arXiv:2606. 22831v2 Announce Type: replace-cross Abstract: This paper studies learning-augmented online weighted vertex cover with local advice and a tradeoff parameter $\lambda \in (0,1)$.
Hugging Face Trending Papers
Jun 11
Learning-Augmented Approximation for Unrelated-Machines Makespan Scheduling
Recently, Antoniadis et al. (ICLR 2025) proposed a framework for incorporating predictions to approximate NP-hard selection problems.
arXiv Machine Learning
Jun 2
Learning-Augmented Scalable Linear Assignment Problem Optimization via Neural Dual Warm-Starts
arXiv:2605. 09382v2 Announce Type: replace Abstract: The Linear Assignment Problem is a fundamental combinatorial optimization task where classical exact solvers ensure optimality but suffer from an $\mathcal{O}(N^{3})$ bottleneck, while recent neural approximations struggle with scalability and exactness.
arXiv Machine Learning
Jun 4
Offline-to-Online Learning in Linear Bandits
arXiv:2606. 04305v1 Announce Type: new Abstract: We study online learning with an additional offline dataset in the stochastic linear bandit setting.
arXiv Machine Learning
Jul 27
Fast State-Augmented Learning for Wireless Resource Allocation with Dual Variable Regression
arXiv:2506. 18748v2 Announce Type: replace-cross Abstract: We consider resource allocation problems in multi-user wireless networks, where the goal is to optimize a network-wide utility function subject to constraints on the ergodic average performance of users.
arXiv Machine Learning
Jun 2
Distributed GNEP Algorithms without Multiplier Sharing and Applications to Multi-Robot Coordination and Contextual Bandit-Based Active Learning
arXiv:2606. 00759v1 Announce Type: new Abstract: Recent advances in artificial intelligence have expanded the focus from classical optimization to include equilibrium analysis in noncooperative games.
arXiv Machine Learning
1d ago
Online Convex Optimization with Dueling Feedback
arXiv:2608. 15050v1 Announce Type: new Abstract: We study online convex optimization with dueling (pairwise comparison) feedback, where the learner observes only a binary preference between two queried points.
arXiv Machine Learning
Jun 30
A Linear Matching Bandit Approach to Online Multi-Human Multi-Robot Teaming
arXiv:2606. 29221v1 Announce Type: new Abstract: We address the problem of online multi-human multi-robot teaming through the lens of a linear matching bandit framework, where a learner assigns robots with unknown features from a fixed pool to distinct sets of human agents over multiple rounds.
arXiv Machine Learning
Jun 30
Learning to Bid in Discriminatory Auctions with Budget Constraints
arXiv:2606. 29252v1 Announce Type: new Abstract: We study repeated bidding in multi-unit discriminatory (pay-as-bid) auctions for a single bidder with per-round utility equal to value minus $\alpha$ times payment, where $\alpha\in[0,1]$ is a cost-of-capital parameter.
arXiv Machine Learning
Jun 18
Fair Online Resource Allocation
arXiv:2606. 18679v1 Announce Type: cross Abstract: We study the problem of fair online resource allocation, motivated by applications such as refugee resettlement and airline scheduling, where agents arrive sequentially and must be assigned to facilities with limited capacities.