1 citations · 4 across the 12 of their papers we have counts for
4 papers · 1 filter
A Proof of Talagrand's Creating Large Sets Conjecture
Xuan Fang, Tianyu Wang
Talagrand conjectured that if a family of sets over is of large measure, then constant times of unions of sets in will cover a…
Batched Bandits with Heavy-Tailed Rewards
Yunwen Guo, Yunlun Shu, Gongyi Zhuo +1
The batched multi-armed bandit (MAB) problem, where rewards are collected in batches, is pivotal in applications like clinical trials. While prior work assumes light-tailed reward…
An Experimental Approach for Running-Time Estimation of Multi-objective Evolutionary Algorithms in Numerical Optimization
Han Huang, Tianyu Wang, Chaoda Peng +2
Multi-objective evolutionary algorithms (MOEAs) have become essential tools for solving multi-objective optimization problems (MOPs), making their running time analysis crucial for…
Revisit First-order Methods for Geodesically Convex Optimization
Yunlu Shu, Jiaxin Jiang, Lei Shi +1
In a seminal work of Zhang and Sra, gradient descent methods for geodesically convex optimization were comprehensively studied. In particular, Zhang and Sra derived a comparison in…