Papers
1,396 papers found
Contraction of Markovian Operators in Orlicz Spaces and Error Bounds for Markov Chain Monte Carlo (Extended Abstract)
Amedeo Roberto Esposito, Marco Mondelli
Convergence of Gradient Descent with Small Initialization for Unregularized Matrix Completion
Jianhao Ma, Salar Fattahi
Convergence of Kinetic Langevin Monte Carlo on Lie groups
Lingkai Kong, Molei Tao
Correlated Binomial Process
Moïse Blanchard, Doron Cohen, Aryeh Kontorovich
Counting Stars is Constant-Degree Optimal For Detecting Any Planted Subgraph: Extended Abstract
Xifan Yu, Ilias Zadik, Peiyuan Zhang
Depth Separation in Norm-Bounded Infinite-Width Neural Networks
Suzanna Parkinson, Greg Ongie, Rebecca Willett et al.
Detection of $L_∞$ Geometry in Random Geometric Graphs: Suboptimality of Triangles and Cluster Expansion
Kiril Bangachev, Guy Bresler
Dimension-free Structured Covariance Estimation
Nikita Puchkin, Maxim Rakhuba
Dual VC Dimension Obstructs Sample Compression by Embeddings
Zachary Chase, Bogdan Chornomaz, Steve Hanneke et al.
Efficient Algorithms for Attributed Graph Alignment with Vanishing Edge Correlation Extended Abstract
Ziao Wang, Weina Wang, Lele Wang
Efficient Algorithms for Learning Monophonic Halfspaces in Graphs
Marco Bressan, Emmanuel Esposito, Maximilian Thiessen
Efficiently Learning One-Hidden-Layer ReLU Networks via SchurPolynomials
Ilias Diakonikolas, Daniel M. Kane
Errors are Robustly Tamed in Cumulative Knowledge Processes
Anna Brandenberger, Cassandra Marcussen, Elchanan Mossel et al.
Exact Mean Square Linear Stability Analysis for SGD
Rotem Mulayoff, Tomer Michaeli
Fast, blind, and accurate: Tuning-free sparse regression with global linear convergence
Claudio Mayrink Verdun, Oleh Melnyk, Felix Krahmer et al.
Faster Sampling without Isoperimetry via Diffusion-based Monte Carlo
Xunpeng Huang, Difan Zou, Hanze Dong et al.
Faster Spectral Density Estimation and Sparsification in the Nuclear Norm (Extended Abstract)
Yujia Jin, Ishani Karmarkar, Christopher Musco et al.
Fast parallel sampling under isoperimetry
Nima Anari, Sinho Chewi, Thuy-Duong Vuong
Fast sampling from constrained spaces using the Metropolis-adjusted Mirror Langevin algorithm
Vishwak Srinivasan, Andre Wibisono, Ashia Wilson
Fast two-time-scale stochastic gradient method with applications in reinforcement learning
Sihan Zeng, Thinh Doan
Finding Super-spreaders in Network Cascades
Elchanan Mossel, Anirudh Sridhar
Fit Like You Sample: Sample-Efficient Generalized Score Matching from Fast Mixing Diffusions
Yilong Qin, Andrej Risteski
Follow-the-Perturbed-Leader with Fréchet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worlds
Jongyeong Lee, Junya Honda, Shinji Ito et al.
Fundamental Limits of Non-Linear Low-Rank Matrix Estimation
Pierre Mergny, Justin Ko, Florent Krzakala et al.
Gap-Free Clustering: Sensitivity and Robustness of SDP
Matthew Zurek, Yudong Chen