Smoothed Analysis with Adaptive Adversaries
Abstract
References
Index Terms
- Smoothed Analysis with Adaptive Adversaries
Recommendations
Robust Near-Optimal Arm Identification With Strongly-Adaptive Adversaries
In this work, we study the best arm identification problem in the adversarial multi-armed bandits framework. We define a strongly-adaptive adversarial model in this framework, based on strongly-adaptive adversaries in security and distributed systems. On ...
Smoothed Analysis of the Successive Shortest Path Algorithm
The minimum-cost flow problem is a classic problem in combinatorial optimization with various applications. Several pseudopolynomial, polynomial, and strongly polynomial algorithms have been developed in the past decades, and it seems that both the problem ...
Worst-Case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-Means Method
We show a worst-case lower bound and a smoothed upper bound on the number of iterations performed by the Iterative Closest Point (ICP) algorithm. First proposed by Besl and McKay, the algorithm is widely used in computational geometry, where it is known ...
Comments
Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- NSF
- NSF
- ONR
- C3.AI Digital Transformation Institute grant, a Berkeley AI Research and Microsoft Research Commons award, a JP Morgan Chase Faculty Fellowship, a Google research scholar faculty award, a Schmidt Sciences AI2050 award, and an Apple AI Ph.D. fellowship
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 216Total Downloads
- Downloads (Last 12 months)216
- Downloads (Last 6 weeks)67
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in