Papers
1,396 papers found
Risk-Sensitive Online Algorithms (Extended Abstract)
Nicolas Christianson, Bo Sun, Steven Low et al.
Robust Distribution Learning with Local and Global Adversarial Corruptions (extended abstract)
Sloan Nietert, Ziv Goldfeld, Soroosh Shafiee
Safe Linear Bandits over Unknown Polytopes
Aditya Gangrade, Tianrui Chen, Venkatesh Saligrama
Sample-Optimal Locally Private Hypothesis Selection and the Provable Benefits of Interactivity
Alireza F. Pour, Hassan Ashtiani, Shahab Asoodeh
Sampling from the Mean-Field Stationary Distribution
Yunbum Kook, Matthew S. Zhang, Sinho Chewi et al.
Sampling Polytopes with Riemannian HMC: Faster Mixing via the Lewis Weights Barrier
Khashayar Gatmiry, Jonathan Kelner, Santosh S. Vempala
Scale-free Adversarial Reinforcement Learning
Mingyu Chen, Xuezhou Zhang
Second Order Methods for Bandit Optimization and Control
Arun Suggala, Y Jennifer Sun, Praneeth Netrapalli et al.
Settling the sample complexity of online reinforcement learning
Zihan Zhang, Yuxin Chen, Jason D Lee et al.
Simple online learning with consistent oracle
Alexander Kozachinskiy, Tomasz Steifer
Smaller Confidence Intervals From IPW Estimators via Data-Dependent Coarsening (Extended Abstract)
Alkis Kalavasis, Anay Mehrotra, Manolis Zampetakis
Smoothed Analysis for Learning Concepts with Low Intrinsic Dimension
Gautam Chandrasekaran, Adam Klivans, Vasilis Kontonis et al.
Smooth Lower Bounds for Differentially Private Algorithms via Padding-and-Permuting Fingerprinting Codes
Naty Peter, Eliad Tsfadia, Jonathan Ullman
Some Constructions of Private, Efficient, and Optimal $K$-Norm and Elliptic Gaussian Noise
Matthew Joseph, Alexander Yu
Spatial properties of Bayesian unsupervised trees
Linxi Liu, Li Ma
Spectral Estimators for Structured Generalized Linear Models via Approximate Message Passing (Extended Abstract)
Yihan Zhang, Hong Chang Ji, Ramji Venkataramanan et al.
Statistical curriculum learning: An elimination algorithm achieving an oracle risk
Omer Cohen, Ron Meir, Nir Weinberger
Statistical Query Lower Bounds for Learning Truncated Gaussians
Ilias Diakonikolas, Daniel M. Kane, Thanasis Pittas et al.
Superconstant Inapproximability of Decision Tree Learning
Caleb Koch, Carmen Strassle, Li-Yang Tan
Testable Learning of General Halfspaces with Adversarial Label Noise
Ilias Diakonikolas, Daniel Kane, Sihan Liu et al.
Testable Learning with Distribution Shift
Adam Klivans, Konstantinos Stavropoulos, Arsen Vasilyan
The complexity of approximate (coarse) correlated equilibrium for incomplete information games
Binghui Peng, Aviad Rubinstein
The Limits and Potentials of Local SGD for Distributed Heterogeneous Learning with Intermittent Communication
Kumar Kshitij Patel, Margalit Glasgow, Ali Zindari et al.