中文
相关论文

相关论文: When AUC meets DRO: Optimizing Partial AUC for Dee…

200 篇论文

Single-level reformulations of (non-convex) distributionally robust optimization (DRO) problems are often intractable, as they contain semiinfinite dual constraints. Based on such a semiinfinite reformulation, we present a safe…

最优化与控制 · 数学 2025-06-09 J. Dienstbier , F. Liers , J. Rolfes

Distributionally robust optimization (DRO) has been introduced for solving stochastic programs where the distribution of the random parameters is unknown and must be estimated by samples from that distribution. A key element of DRO is the…

最优化与控制 · 数学 2019-01-09 Xi Chen , Qihang Lin , Guanglin Xu

In this paper, we study the problem of (finite sum) minimax optimization in the Differential Privacy (DP) model. Unlike most of the previous studies on the (strongly) convex-concave settings or loss functions satisfying the…

机器学习 · 计算机科学 2025-03-25 Ruijia Zhang , Mingxi Lei , Meng Ding , Zihang Xiang , Jinhui Xu , Di Wang

Reliable downlink communication in satellite-to-underground networks remains challenging due to severe signal attenuation caused by underground soil and refraction in the air-soil interface. To address this, we propose a novel cooperative…

网络与互联网体系结构 · 计算机科学 2026-03-27 Kaiqiang Lin , Kangchun Zhao , Yijie Mao

In this paper, we aim to develop stochastic hard thresholding algorithms for the important problem of AUC maximization in imbalanced classification. The main challenge is the pairwise loss involved in AUC maximization. We overcome this…

机器学习 · 计算机科学 2020-11-05 Zhenhuan Yang , Baojian Zhou , Yunwen Lei , Yiming Ying

Since acquiring perfect supervision is usually difficult, real-world machine learning tasks often confront inaccurate, incomplete, or inexact supervision, collectively referred to as weak supervision. In this work, we present WSAUC, a…

机器学习 · 计算机科学 2024-03-28 Zheng Xie , Yu Liu , Hao-Yuan He , Ming Li , Zhi-Hua Zhou

The Area Under the ROC Curve (AUC) is a widely used performance measure for imbalanced classification arising from many application domains where high-dimensional sparse data is abundant. In such cases, each $d$ dimensional sample has only…

机器学习 · 计算机科学 2020-09-24 Baojian Zhou , Yiming Ying , Steven Skiena

Group Relative Policy Optimization (GRPO) enhances LLM reasoning but often induces overconfidence, where incorrect responses yield lower perplexity than correct ones, degrading relative calibration as described by the Area Under the Curve…

机器学习 · 计算机科学 2026-04-15 Ziqi Wang , Xingzhou Lou , Meiqi Wu , Zhengqi Wen , Junge Zhang

This paper studies Distributionally Robust Optimization (DRO), a fundamental framework for enhancing the robustness and generalization of statistical learning and optimization. An effective ambiguity set for DRO must involve distributions…

机器学习 · 计算机科学 2026-02-10 Jiaqi Wen , Jianyi Yang

This work studies reinforcement learning (RL) in the context of multi-period supply chains subject to constraints, e.g., on production and inventory. We introduce Distributional Constrained Policy Optimization (DCPO), a novel approach for…

机器学习 · 计算机科学 2023-02-06 Jaime Sabal Bermúdez , Antonio del Rio Chanona , Calvin Tsay

This monograph develops a comprehensive statistical learning framework that is robust to (distributional) perturbations in the data using Distributionally Robust Optimization (DRO) under the Wasserstein metric. Beginning with fundamental…

机器学习 · 统计学 2021-08-23 Ruidi Chen , Ioannis Ch. Paschalidis

Optimal-Transport Distributionally Robust Optimization (OT-DRO) robustifies data-driven decision-making under uncertainty by capturing the sampling-induced statistical error via optimal transport ambiguity sets. The standard OT-DRO pipeline…

最优化与控制 · 数学 2025-09-17 Jonas Ohnemus , Marta Fochesato , Riccardo Zuliani , John Lygeros

Federated AUC maximization is a powerful approach for learning from imbalanced data in federated learning (FL). However, existing methods typically assume full client availability, which is rarely practical. In real-world FL systems,…

机器学习 · 计算机科学 2026-01-06 Umesh Vangapally , Wenhan Wu , Chen Chen , Zhishuai Guo

Asynchronous distributed algorithms are a popular way to reduce synchronization costs in large-scale optimization, and in particular for neural network training. However, for nonsmooth and nonconvex objectives, few convergence guarantees…

最优化与控制 · 数学 2020-07-14 Vyacheslav Kungurtsev , Malcolm Egan , Bapi Chatterjee , Dan Alistarh

Many state-of-the-art adversarial training methods for deep learning leverage upper bounds of the adversarial loss to provide security guarantees against adversarial attacks. Yet, these methods rely on convex relaxations to propagate lower…

机器学习 · 计算机科学 2023-04-07 Dimitris Bertsimas , Xavier Boix , Kimberly Villalobos Carballo , Dick den Hertog

Offline reinforcement learning aims to learn from pre-collected datasets without active exploration. This problem faces significant challenges, including limited data availability and distributional shifts. Existing approaches adopt a…

机器学习 · 计算机科学 2024-10-01 Yue Wang , Jinjun Xiong , Shaofeng Zou

The area under the ROC curve (AUROC) has been vigorously applied for imbalanced classification and moreover combined with deep learning techniques. However, there is no existing work that provides sound information for peers to choose…

机器学习 · 计算机科学 2022-07-06 Dixian Zhu , Xiaodong Wu , Tianbao Yang

We present a distributionally robust optimization (DRO) approach for the transmission expansion planning problem, considering both long- and short-term uncertainties on the system demand and non-dispatchable renewable generation. On the…

最优化与控制 · 数学 2020-03-17 Alexandre Velloso , David Pozo , Alexandre Street

Hyperparameter tuning is a bothersome step in the training of deep learning models. One of the most sensitive hyperparameters is the learning rate of the gradient descent. We present the 'All Learning Rates At Once' (Alrao) optimization…

机器学习 · 计算机科学 2019-01-30 Léonard Blier , Pierre Wolinski , Yann Ollivier

We study differentially private (DP) algorithms for stochastic non-convex optimization. In this problem, the goal is to minimize the population loss over a $p$-dimensional space given $n$ i.i.d. samples drawn from a distribution. We improve…

机器学习 · 计算机科学 2020-08-12 Yingxue Zhou , Xiangyi Chen , Mingyi Hong , Zhiwei Steven Wu , Arindam Banerjee