all AI news
Multi-block Min-max Bilevel Optimization with Applications in Multi-task Deep AUC Maximization. (arXiv:2206.00260v1 [math.OC])
June 2, 2022, 1:11 a.m. | Quanqi Hu, Yongjian Zhong, Tianbao Yang
stat.ML updates on arXiv.org arxiv.org
In this paper, we study multi-block min-max bilevel optimization problems,
where the upper level is non-convex strongly-concave minimax objective and the
lower level is a strongly convex objective, and there are multiple blocks of
dual variables and lower level problems. Due to the intertwined multi-block
min-max bilevel structure, the computational cost at each iteration could be
prohibitively high, especially with a large number of blocks. To tackle this
challenge, we present a single-loop randomized stochastic algorithm, which
requires updates for …
More from arxiv.org / stat.ML updates on arXiv.org
Mixture of partially linear experts
11 hours ago |
arxiv.org
Adaptive deep learning for nonlinear time series models
1 day, 11 hours ago |
arxiv.org
A Full Adagrad algorithm with O(Nd) operations
1 day, 11 hours ago |
arxiv.org
Minimax Regret Learning for Data with Heterogeneous Subgroups
1 day, 11 hours ago |
arxiv.org
Jobs in AI, ML, Big Data
Founding AI Engineer, Agents
@ Occam AI | New York
AI Engineer Intern, Agents
@ Occam AI | US
AI Research Scientist
@ Vara | Berlin, Germany and Remote
Data Architect
@ University of Texas at Austin | Austin, TX
Data ETL Engineer
@ University of Texas at Austin | Austin, TX
Lead Data Engineer
@ WorkMoney | New York City, United States - Remote