Papers
1,396 papers found
Gaussian Cooling and Dikin Walks: The Interior-Point Method for Logconcave Sampling
Yunbum Kook, Santosh S. Vempala
Harmonics of Learning: Universal Fourier Features Emerge in Invariant Networks
Giovanni Luca Marchetti, Christopher J Hillar, Danica Kragic et al.
Identification of mixtures of discrete product distributions in near-optimal sample and time complexity
Spencer L. Gordon, Erik Jahn, Bijan Mazaheri et al.
Improved High-Probability Bounds for the Temporal Difference Learning Algorithm via Exponential Stability
Sergey Samsonov, Daniil Tiapkin, Alexey Naumov et al.
Information-theoretic generalization bounds for learning from quantum data
Matthias C. Caro, Tom Gur, Cambyse Rouzé et al.
Information-Theoretic Thresholds for the Alignments of Partially Correlated Graphs
Dong Huang, Xianwen Song, Pengkun Yang
Inherent limitations of dimensions for characterizing learnability of distribution classes
Tosca Lechner, Shai Ben-David
Insufficient Statistics Perturbation: Stable Estimators for Private Least Squares Extended Abstract
Gavin Brown, Jonathan Hayase, Samuel Hopkins et al.
Is Efficient PAC Learning Possible with an Oracle That Responds "Yes" or "No"?
Constantinos Daskalakis, Noah Golowich
Large Stepsize Gradient Descent for Logistic Loss: Non-Monotonicity of the Loss Improves Optimization Efficiency
Jingfeng Wu, Peter L. Bartlett, Matus Telgarsky et al.
Lasso with Latents: Efficient Estimation, Covariate Rescaling, and Computational-Statistical Gaps
Jonathan Kelner, Frederic Koehler, Raghu Meka et al.
Learnability Gaps of Strategic Classification
Lee Cohen, Yishay Mansour, Shay Moran et al.
Learning Intersections of Halfspaces with Distribution Shift: Improved Algorithms and SQ Lower Bounds
Adam Klivans, Konstantinos Stavropoulos, Arsen Vasilyan
Learning Neural Networks with Sparse Activations
Pranjal Awasthi, Nishanth Dikkala, Pritish Kamath et al.
Learning sum of diverse features: computational hardness and efficient gradient-based training for ridge combinations
Kazusato Oko, Yujin Song, Taiji Suzuki et al.
Limits of Approximating the Median Treatment Effect
Raghavendra Addanki, Siddharth Bhandari
Linear bandits with polylogarithmic minimax regret
Josep Lumbreras, Marco Tomamichel
Linear Bellman Completeness Suffices for Efficient Online Reinforcement Learning with Few Actions
Noah Golowich, Ankur Moitra
List Sample Compression and Uniform Convergence
Steve Hanneke, Shay Moran, Waknine Tom
Low-degree phase transitions for detecting a planted clique in sublinear time
Jay Mardia, Kabir Aladin Verchand, Alexander S. Wein
Lower Bounds for Differential Privacy Under Continual Observation and Online Threshold Queries
Edith Cohen, Xin Lyu, Jelani Nelson et al.
Majority-of-Three: The Simplest Optimal Learner?
Ishaq Aden-Ali, Mikael Møller Høandgsgaard, Kasper Green Larsen et al.
Metalearning with Very Few Samples Per Task
Maryam Aliakbarpour, Konstantina Bairaktari, Gavin Brown et al.
Metric Clustering and MST with Strong and Weak Distance Oracles
MohammadHossein Bateni, Prathamesh Dharangutte, Rajesh Jayaram et al.