课题基金 / 基金详情

Collaborative Research: AF: Medium: Algorithms Meet Machine Learning: Mitigating Uncertainty in Optimization

Collaborative Research: AF: Medium: Algorithms Meet Machine Learning: Mitigating Uncertainty in Optimization
协作研究:AF:媒介:算法遇见机器学习:减轻优化中的不确定性
批准号:
1955785
负责人:
Anupam Gupta
金额:
$60.0万
依托单位:
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
2020
资助国家:
美国
项目状态:
已结题
起止时间:
2020-05-01 至 2024-04-30

项目摘要

项目成果

Anupam Gupta的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
Algorithmic decision-making is ubiquitous in the modern era. Our society uses algorithms to solve problems ranging from making investment decisions in personal financial planning, to allocating resources in large-scale computing systems such as data centers. Often, these problems are difficult because of uncertainty about the future. In algorithmic theory, traditionally conservative approaches are used which provide relatively weak but highly robust guarantees that hold no matter how the future unfolds. In practice, a more promising alternative is the use of machine-learning techniques to make algorithmic choices for the future based on knowledge of past data. By implicitly assuming that the future will mirror the past, one can provide stronger guarantees and better empirical performance. However, the "worst-case" robustness of the previous approach is not available, which is important if the implicit assumption of 'past predicts the future' no longer holds true. This project seeks to combine the two approaches and get the best of both worlds by exploring the interface between algorithm design and machine learning. The end goal is a comprehensive toolbox for algorithmic decision-making under uncertainty that is both robust and has good performance. In addition to this research component, the project will train graduate and undergraduate researchers in theoretical computer science, with an emphasis on participation of underrepresented groups.The investigators' approach is to rethink each of these individual toolboxes to take advantage of the other -- namely incorporating machine-learned advice in algorithm design, and conversely, training machine learning models for algorithmic objectives. The main intellectual thrust of this project is to use machine-learned predictions to improve the quality of algorithms, and conversely, to design learning models that can be specifically trained for optimization objectives. This will be explored in two main directions: the first part considers Machine Learning as a Black Box. Here, the optimization algorithm merely consumes the predictions from the learning model. This is often the case in practice, particularly when the predictions are generated by complex systems such as deep neural networks. In this case, the focus will be on ensuring that we do not over-fit the predictions, on deciding what input parameters to predict in the first place, and on choosing between multiple alternative prediction models based on their relative accuracy, reliability, and costs. In the second part (Machine Learning as a White Box), the focus is on a more integrated design, where the optimization algorithm interacts with the learning model at runtime and ask adaptives queries. More ambitiously, the project explores a significant redesign of the end-to-end system, including the learning models and the optimization algorithms, for specific optimization tasks. This work will rely on techniques from online algorithms, stochastic and robust optimization, and learning theory, and build connections between these fields to address the central questions of algorithmic decision making under uncertainty.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.
期刊论文(20)
专著(0)
科研奖励(0)
会议论文
DOI: 10.48550/arxiv.2212.14220
发表时间: 2022-12
期刊:
影响因子: --
作者: [Sid Banerjee;Vincent Cohen-Addad;Anupam Gupta;Zhou Li]
通讯作者: Sid Banerjee;Vincent Cohen-Addad;Anupam Gupta;Zhou Li
Optimal Bounds for the k -cut Problem
k 割问题的最优界
DOI: 10.1145/3478018
发表时间: 2022
期刊: Journal of the ACM
影响因子: 2.5
作者: [Gupta, Anupam, Harris, David G., Lee, Euiwoong, Li, Jason]
通讯作者: Li, Jason
Random Order Online Set Cover is as Easy as Offline
随机订购在线套装封面与离线一样简单
DOI: 10.1109/focs52979.2021.00122
发表时间: 2022
期刊: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS
影响因子: --
作者: [Gupta, Anupam, Kehne, Gregory, Levin, Roie]
通讯作者: Levin, Roie
DOI: 10.1145/3450349
发表时间: 2021
期刊: Journal of the ACM
影响因子: 2.5
作者: [Argue, C. J., Gupta, Anupam, Tang, Ziye, Guruganesh, Guru]
通讯作者: Guruganesh, Guru
20
    Collaborative Research: AF: Medium: Algorithms Meet Machine Learning: Mitigating Uncertainty in Optimization
    • 批准号:
      2422926
    • 项目类别:
      Continuing Grant
    • 资助金额:
      $60.0万
    • 财政年份:
      2024
    • 负责人:
      Anupam Gupta
    • 依托单位:
    NSF: STOC 2024 Conference Student Travel Support
    • 批准号:
      2421504
    • 项目类别:
      Standard Grant
    • 资助金额:
      $1.5万
    • 财政年份:
      2024
    • 负责人:
      Anupam Gupta
    • 依托单位:
    AF: Small: Towards New Relaxations for Online Algorithms
    • 批准号:
      2224718
    • 项目类别:
      Standard Grant
    • 资助金额:
      $60.0万
    • 财政年份:
      2022
    • 负责人:
      Anupam Gupta
    • 依托单位:
    Collaborative Research: AF: Small: Combinatorial Optimization for Stochastic Inputs
    • 批准号:
      2006953
    • 项目类别:
      Standard Grant
    • 资助金额:
      $24.96万
    • 财政年份:
      2020
    • 负责人:
      Anupam Gupta
    • 依托单位:
    国内基金
    海外基金
    Research on Quantum Field Theory without a Lagrangian Description
    • 批准号:
      24ZR1403900
    • 项目类别:
      省市级项目
    • 资助金额:
      --
    • 批准年份:
      2024
    • 负责人:
      SATOSHI NAWATA
    • 依托单位:
    Cell Research
    Cell Research
    Cell Research (细胞研究)