Papers
1,396 papers found
Random Coordinate Langevin Monte Carlo
Zhiyan Ding, Qin Li, Jianfeng Lu et al.
Random Graph Matching with Improved Noise Robustness
Cheng Mao, Mark Rudelson, Konstantin Tikhomirov
Rank-one matrix estimation: analytic time evolution of gradient descent dynamics
Antoine Bodin, Nicolas Macris
Reconstructing weighted voting schemes from partial information about their power indices
Huck Bennett, Anindya De, Rocco Servedio et al.
Reduced-Rank Regression with Operator Norm Error
Praneeth Kacham, David Woodruff
Regret Minimization in Heavy-Tailed Bandits
Shubhada Agrawal, Sandeep K. Juneja, Wouter M. Koolen
Robust learning under clean-label attack
Avrim Blum, Steve Hanneke, Jian Qian et al.
Robust Online Convex Optimization in the Presence of Outliers
Tim van Erven, Sarah Sachs, Wouter M Koolen et al.
Sequential prediction under log-loss and misspecification
Meir Feder, Yury Polyanskiy
SGD Generalizes Better Than GD (And Regularization Doesn’t Help)
Idan Amir, Tomer Koren, Roi Livni
SGD in the Large: Average-case Analysis, Asymptotics, and Stepsize Criticality
Courtney Paquette, Kiwon Lee, Fabian Pedregosa et al.
Shape Matters: Understanding the Implicit Bias of the Noise Covariance
Jeff Z. HaoChen, Colin Wei, Jason Lee et al.
Size and Depth Separation in Approximating Benign Functions with Neural Networks
Gal Vardi, Daniel Reichman, Toniann Pitassi et al.
Softmax Policy Gradient Methods Can Take Exponential Time to Converge
Gen Li, Yuting Wei, Yuejie Chi et al.
Source Identification for Mixtures of Product Distributions
Spencer Gordon, Bijan H Mazaheri, Yuval Rabani et al.
Sparse sketches with small inversion bias
Michal Derezinski, Zhenyu Liao, Edgar Dobriban et al.
Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs
Afonso S. Bandeira, Jess Banks, Dmitriy Kunisky et al.
Statistical Query Algorithms and Low Degree Tests Are Almost Equivalent
Matthew S Brennan, Guy Bresler, Sam Hopkins et al.
Stochastic Approximation for Online Tensorial Independent Component Analysis
Chris Junchi Li, Michael Jordan
Stochastic block model entropy and broadcasting on trees with survey
Emmanuel Abbe, Elisabetta Cornacchia, Yuzhou Gu et al.
Streaming k-PCA: Efficient guarantees for Oja’s algorithm, beyond rank-one updates
De Huang, Jonathan Niles-Weed, Rachel Ward
Structured Logconcave Sampling with a Restricted Gaussian Oracle
Yin Tat Lee, Ruoqi Shen, Kevin Tian
Survival of the strictest: Stable and unstable equilibria under regularized learning with partial information
Angeliki Giannou, Emmanouil Vasileios Vlatakis-Gkaragkounis, Panayotis Mertikopoulos
The Bethe and Sinkhorn Permanents of Low Rank Matrices and Implications for Profile Maximum Likelihood
Nima Anari, Moses Charikar, Kirankumar Shiragur et al.
The Connection Between Approximation, Depth Separation and Learnability in Neural Networks
Eran Malach, Gilad Yehudai, Shai Shalev-Schwartz et al.