Cover Image

Non-Convex Robust Hypothesis Testing using Sinkhorn Uncertainty Sets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wang, Jie, Gao, Rui, Xie, Yao
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Sinkhorn Distributionally Robust Optimization
by: Wang, Jie, et al.
Published: (2021)

Regularization for Adversarial Robust Learning
by: Wang, Jie, et al.
Published: (2024)

On Sinkhorn's Algorithm and Choice Modeling
by: Qu, Zhaonan, et al.
Published: (2023)

Nested Stochastic Algorithm for Generalized Sinkhorn distance-Regularized Distributionally Robust Optimization
by: Yang, Yufeng, et al.
Published: (2025)

Optimal Rates for Robust Stochastic Convex Optimization
by: Gao, Changyu, et al.
Published: (2024)

Accelerating Sinkhorn Algorithm with Sparse Newton Iterations
by: Tang, Xun, et al.
Published: (2024)

LyAm: Robust Non-Convex Optimization for Stable Learning in Noisy Environments
by: Mirzabeigi, Elmira, et al.
Published: (2025)

A Sinkhorn-type Algorithm for Constrained Optimal Transport
by: Tang, Xun, et al.
Published: (2024)

A Theoretical and Empirical Study on the Convergence of Adam with an "Exact" Constant Step Size in Non-Convex Settings
by: Mazumder, Alokendu, et al.
Published: (2023)

Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets
by: Lu, Yiyang, et al.
Published: (2026)

Convex Hulls of Reachable Sets
by: Lew, Thomas, et al.
Published: (2023)

Robust Information Selection for Hypothesis Testing with Misclassification Penalties
by: Bhargav, Jayanth, et al.
Published: (2025)

Annealed Sinkhorn for Optimal Transport: convergence, regularization path and debiasing
by: Chizat, Lénaïc
Published: (2024)

PINS: Proximal Iterations with Sparse Newton and Sinkhorn for Optimal Transport
by: Wu, Di, et al.
Published: (2025)

Unconstrained Robust Online Convex Optimization
by: Zhang, Jiujia, et al.
Published: (2025)

Sinkhorn algorithms and linear programming solvers for optimal partial transport problems
by: Bai, Yikun
Published: (2024)

Projection-free Online Learning over Strongly Convex Sets
by: Wan, Yuanyu, et al.
Published: (2020)

Distributionally Robust Optimization via Iterative Algorithms in Continuous Probability Spaces
by: Zhu, Linglingzhi, et al.
Published: (2024)

Wasserstein Distributionally Robust Shallow Convex Neural Networks
by: Pallage, Julien, et al.
Published: (2024)

Achieving Better Local Regret Bound for Online Non-Convex Bilevel Optimization
by: Jia, Tingkai, et al.
Published: (2026)

Bridging the Gap Between General and Down-Closed Convex Sets in Submodular Maximization
by: Mualem, Loay, et al.
Published: (2024)

Online Non-Stationary Stochastic Quasar-Convex Optimization
by: Pun, Yuen-Man, et al.
Published: (2024)

On Convergence of Incremental Gradient for Non-Convex Smooth Functions
by: Koloskova, Anastasia, et al.
Published: (2023)

Stochastic Non-Smooth Convex Optimization with Unbounded Gradients
by: Kovalev, Dmitry
Published: (2026)

Online (Non-)Convex Learning via Tempered Optimism
by: Haddouche, Maxime, et al.
Published: (2023)

Federated Distributionally Robust Optimization with Non-Convex Objectives: Algorithm and Analysis
by: Jiao, Yang, et al.
Published: (2023)

Enforcing Fair Predicted Scores on Intervals of Percentiles by Difference-of-Convex Constraints
by: He, Yutian, et al.
Published: (2025)

Importance Sparsification for Sinkhorn Algorithm
by: Li, Mengyu, et al.
Published: (2023)

Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization
by: Hihat, Massil, et al.
Published: (2023)

Learning the Uncertainty Sets for Control Dynamics via Set Membership: A Non-Asymptotic Analysis
by: Li, Yingying, et al.
Published: (2023)

Stochastic Weakly Convex Optimization Beyond Lipschitz Continuity
by: Gao, Wenzhi, et al.
Published: (2024)

Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness
by: Smith, Chandler, et al.
Published: (2025)

Optimal Regularization Under Uncertainty: Distributional Robustness and Convexity Constraints
by: Leong, Oscar, et al.
Published: (2025)

Robust Regression over Averaged Uncertainty
by: Bertsimas, Dimitris, et al.
Published: (2023)

From Data to Uncertainty Sets: a Machine Learning Approach
by: Bertsimas, Dimitris, et al.
Published: (2025)

Are Convex Optimization Curves Convex?
by: Barzilai, Guy, et al.
Published: (2025)

Bayesian Optimization for Non-Convex Two-Stage Stochastic Optimization Problems
by: Buckingham, Jack M., et al.
Published: (2024)

Provable Reduction in Communication Rounds for Non-Smooth Convex Federated Learning
by: Palenzuela, Karlo, et al.
Published: (2025)

A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization
by: Meng, Qing-xin, et al.
Published: (2025)

Non-Convex Federated Optimization under Cost-Aware Client Selection
by: Jiang, Xiaowen, et al.
Published: (2025)