Výsledky vyhľadávania - "Learning-augmented Algorithms"

  1. 1

    Learning-augmented algorithms for online subset sum Autor Xu, Chenyang, Zhang, Guochuan

    ISSN: 0925-5001, 1573-2916
    Vydavateľské údaje: New York Springer US 01.11.2023
    Vydané v Journal of global optimization (01.11.2023)
    “…As one of Karp’s 21 NP-complete problems, the subset sum problem, as well as its generalization, has been well studied. Among the rich literature, there is…”
    Získať plný text
    Journal Article
  2. 2

    Online Covering: Efficient and Learning-augmented Algorithms Autor Lin, Young-san

    ISBN: 9798379844837
    Vydavateľské údaje: ProQuest Dissertations & Theses 01.01.2022
    “…We start by slightly modifying the generic framework for solving online covering and packing linear programs (LP) proposed in the seminal work of Buchbinder…”
    Získať plný text
    Dissertation
  3. 3

    Machine Learning-Augmented Algorithms: Theory and Applications in Energy and Sustainability Autor Christianson, Nicolas Henry

    ISBN: 9798290657196
    Vydavateľské údaje: ProQuest Dissertations & Theses 01.01.2025
    “…Uncertainty poses a significant challenge for decision-makers in energy and sustainability domains. The ongoing energy transition—characterized by increasing…”
    Získať plný text
    Dissertation
  4. 4
  5. 5

    Online Conversion with Switching Costs: Robust and Learning-Augmented Algorithms Autor Lechowicz, Adam, Christianson, Nicolas, Sun, Bo, Bashir, Noman, Hajiesmaili, Mohammad, Wierman, Adam, Shenoy, Prashant

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 08.11.2024
    Vydané v arXiv.org (08.11.2024)
    “…We introduce and study online conversion with switching costs, a family of online problems that capture emerging problems at the intersection of energy and…”
    Získať plný text
    Paper
  6. 6

    New Outliers Removal and Machine Learning Augmented Algorithms Autor Montazer Qaem, Mahshid (Ashley)

    ISBN: 9798492733179
    Vydavateľské údaje: ProQuest Dissertations & Theses 01.01.2021
    “…This dissertation largely studies problems of two types. In the first part, we study ranking and clustering in the presence of outliers. The goal is to remove…”
    Získať plný text
    Dissertation
  7. 7

    Learning-Augmented Scheduling Autor Zhao, Tianming, Li, Wei, Zomaya, Albert Y.

    ISSN: 0018-9340, 1557-9956
    Vydavateľské údaje: IEEE 01.11.2024
    Vydané v IEEE transactions on computers (01.11.2024)
    “…The recent revival in learning theory has provided us with improved capabilities for accurate predictions. This work contributes to an emerging research agenda…”
    Získať plný text
    Journal Article
  8. 8

    Boosting Double Coverage for k-Server via Imperfect Predictions Autor Lindermayr, Alexander, Megow, Nicole, Simon, Bertrand

    ISSN: 0178-4617, 1432-0541
    Vydavateľské údaje: New York Springer US 01.11.2025
    Vydané v Algorithmica (01.11.2025)
    “…We study the online k -server problem in a learning-augmented setting. While in the traditional online model, an algorithm has no information about the request…”
    Získať plný text
    Journal Article
  9. 9

    LACS: Learning-Augmented Algorithms for Carbon-Aware Resource Scaling with Uncertain Demand Autor Bostandoost, Roozbeh, Lechowicz, Adam, Hanafy, Walid A, Bashir, Noman, Shenoy, Prashant, Hajiesmaili, Mohammad

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 04.06.2024
    Vydané v arXiv.org (04.06.2024)
    “…Motivated by an imperative to reduce the carbon emissions of cloud data centers, this paper studies the online carbon-aware resource scaling problem with…”
    Získať plný text
    Paper
  10. 10

    Learning-Augmented Algorithms for the Bahncard Problem Autor Zhao, Hailiang, Tang, Xueyan, Chen, Peng, Deng, Shuiguang

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 20.10.2024
    Vydané v arXiv.org (20.10.2024)
    “…In this paper, we study learning-augmented algorithms for the Bahncard problem. The Bahncard problem is a generalization of the ski-rental problem…”
    Získať plný text
    Paper
  11. 11

    Robust machine-learned algorithms for efficient grid operation Autor Christianson, Nicolas, Yeh, Christopher, Li, Tongxin, Hosseini, Mehdi, Torabi Rad, Mahdi, Golmohammadi, Azarang, Wierman, Adam

    ISSN: 2634-4602, 2634-4602
    Vydavateľské údaje: Cambridge University Press 22.04.2025
    Vydané v Environmental Data Science (22.04.2025)
    “… guarantees on their performance. In this work, we propose a learning-augmented algorithm, R obust ML, that exploits the good average-case performance of a machine-learned algorithm for minimizing dispatch and ramping costs…”
    Získať plný text
    Journal Article
  12. 12

    Learning-Augmented Algorithms with Explicit Predictors Autor Elias, Marek, Kaplan, Haim, Mansour, Yishay, Moran, Shay

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 12.03.2024
    Vydané v arXiv.org (12.03.2024)
    “…Recent advances in algorithmic design show how to utilize predictions obtained by machine learning models from past and present data. These approaches have…”
    Získať plný text
    Paper
  13. 13

    Online Dynamic Acknowledgement with Learned Predictions Autor Im, Sungjin, Moseley, Benjamin, Xu, Chenyang, Zhang, Ruilong

    ISSN: 2641-9874
    Vydavateľské údaje: IEEE 17.05.2023
    “…We revisit the online dynamic acknowledgment problem. In the problem, a sequence of requests arrive over time to be acknowledged, and all outstanding requests…”
    Získať plný text
    Konferenčný príspevok..
  14. 14

    Learning-Augmented Algorithms for Online Steiner Tree Autor Xu, Chenyang, Moseley, Benjamin

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 18.03.2023
    Vydané v arXiv.org (18.03.2023)
    “…This paper considers the recently popular beyond-worst-case algorithm analysis model which integrates machine-learned predictions with online algorithm design…”
    Získať plný text
    Paper
  15. 15

    Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms Autor Angelopoulos, Spyros, Dürr, Christoph, Elenter, Alex, Yanni Lefki

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 07.08.2024
    Vydané v arXiv.org (07.08.2024)
    “…The study of online algorithms with machine-learned predictions has gained considerable prominence in recent years. One of the common objectives in the design…”
    Získať plný text
    Paper
  16. 16

    Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems Autor Grigorescu, Elena, Young-San, Lin, Song, Maoyuan

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 13.11.2024
    Vydané v arXiv.org (13.11.2024)
    “…Learning-augmented algorithms have been extensively studied across the computer science community in the recent years, driven by advances in machine learning predictors, which can provide additional…”
    Získať plný text
    Paper
  17. 17

    Learning-Augmented Algorithms for Online Linear and Semidefinite Programming Autor Grigorescu, Elena, Young-San, Lin, Silwal, Sandeep, Song, Maoyuan, Zhou, Samson

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 21.10.2022
    Vydané v arXiv.org (21.10.2022)
    “…Semidefinite programming (SDP) is a unifying framework that generalizes both linear programming and quadratically-constrained quadratic programming, while also…”
    Získať plný text
    Paper
  18. 18

    Learning-Augmented Algorithms for Online TSP on the Line Autor Gouleakis, Themis, Lakis, Konstantinos, Shahkarami, Golnoosh

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 01.06.2022
    Vydané v arXiv.org (01.06.2022)
    “…We study the online Traveling Salesman Problem (TSP) on the line augmented with machine-learned predictions. In the classical problem, there is a stream of…”
    Získať plný text
    Paper
  19. 19

    Beyond Black-Box Advice: Learning-Augmented Algorithms for MDPs with Q-Value Predictions Autor Li, Tongxin, Lin, Yiheng, Ren, Shaolei, Wierman, Adam

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 28.10.2023
    Vydané v arXiv.org (28.10.2023)
    “…We study the tradeoff between consistency and robustness in the context of a single-trajectory time-varying Markov Decision Process (MDP) with untrusted…”
    Získať plný text
    Paper
  20. 20

    Pareto-Optimal Learning-Augmented Algorithms for Online Conversion Problems Autor Sun, Bo, Lee, Russell, Hajiesmaili, Mohammad, Wierman, Adam, Tsang, Danny H K

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 03.09.2021
    Vydané v arXiv.org (03.09.2021)
    “…This paper leverages machine-learned predictions to design competitive algorithms for online conversion problems with the goal of improving the competitive…”
    Získať plný text
    Paper