Papers
Online Defense Strategies for Reinforcement Learning Against Adaptive Reward Poisoning
Andi Nika, Adish Singla, Goran Radanovic
Online Learning for Non-monotone DR-Submodular Maximization: From Full Information to Bandit Feedback
Qixin Zhang, Zengde Deng, Zaiyi Chen et al.
Online Learning for Traffic Routing under Unknown Preferences
Devansh Jalota, Karthik Gopalakrishnan, Navid Azizan et al.
Online Linearized LASSO
Shuoguang Yang, Yuhao Yan, Xiuneng Zhu et al.
On Model Selection Consistency of Lasso for High-Dimensional Ising Models
Xiangming Meng, Tomoyuki Obuchi, Yoshiyuki Kabashima
On the Accelerated Noise-Tolerant Power Method
Zhiqiang Xu
On the bias of K-fold cross validation with stable learners
Anass Aghbalou, Anne Sabourin, François Portier
On the Calibration of Probabilistic Classifier Sets
Thomas Mortier, Viktor Bengs, Eyke Hüllermeier et al.
On the Capacity Limits of Privileged ERM
Michal Sharoni, Sivan Sabato
On the Complexity of Representation Learning in Contextual Linear Bandits
Andrea Tirinzoni, Matteo Pirotta, Alessandro Lazaric
On the Consistency Rate of Decision Tree Learning Algorithms
Qin-Cheng Zheng, Shen-Huan Lyu, Shao-Qun Zhang et al.
On the Convergence of Distributed Stochastic Bilevel Optimization Algorithms over a Network
Hongchang Gao, Bin Gu, My T. Thai
On The Convergence Of Policy Iteration-Based Reinforcement Learning With Monte Carlo Policy Evaluation
Anna Winnicki, R. Srikant
On the Implicit Geometry of Cross-Entropy Parameterizations for Label-Imbalanced Data
Tina Behnia, Ganesh Ramachandra Kini, Vala Vakilian et al.
On the Limitations of the Elo, Real-World Games are Transitive, not Additive
Quentin Bertrand, Wojciech Marian Czarnecki, Gauthier Gidel
On the Neural Tangent Kernel Analysis of Randomly Pruned Neural Networks
Hongru Yang, Zhangyang Wang
On the Privacy Risks of Algorithmic Recourse
Martin Pawelczyk, Himabindu Lakkaraju, Seth Neel
On the Strategyproofness of the Geometric Median
El-Mahdi El-Mhamdi, Sadegh Farhadkhani, Rachid Guerraoui et al.
On Universal Portfolios with Continuous Side Information
Alankrita Bhatt, J. Jon Ryu, Young-Han Kim
Optimal Algorithms for Latent Bandits with Cluster Structure
Soumyabrata Pal, Arun Sai Suggala, Karthikeyan Shanmugam et al.
Optimal and Private Learning from Human Response Data
Duc Nguyen, Anderson Ye Zhang
Optimal Contextual Bandits with Knapsacks under Realizability via Regression Oracles
Yuxuan Han, Jialin Zeng, Yang Wang et al.
Optimal robustness-consistency tradeoffs for learning-augmented metrical task systems
Nicolas Christianson, Junxuan Shen, Adam Wierman
Optimal Sample Complexity Bounds for Non-convex Optimization under Kurdyka-Lojasiewicz Condition
Qian Yu, Yining Wang, Baihe Huang et al.
Optimal Sketching Bounds for Sparse Linear Regression
Tung Mai, Alexander Munteanu, Cameron Musco et al.