| 251 |
Omnipredictors for Regression and the Approximate Rank of Convex Functions
Parikshit Gopalan, Princewill Okoroafor, ... (+3 more)
|
👻
Ghosted
|
cs.LG
|
13 |
2 years ago |
| 252 |
Detection-Recovery Gap for Planted Dense Cycles
Cheng Mao, Alexander S. Wein, Shenduo Zhang
|
👻
Ghosted
|
math.ST
|
13 |
3 years ago |
| 253 |
Dimension-Free Bounds on Chasing Convex Functions
C. J. Argue, Anupam Gupta, Guru Guruganesh
|
👻
Ghosted
|
cs.DS
|
13 |
6 years ago |
| 254 |
Sampling and Optimization on Convex Sets in Riemannian Manifolds of Non-Negative Curvature
Navin Goyal, Abhishek Shetty
|
👻
Ghosted
|
math.OC
|
13 |
6 years ago |
| 255 |
Is your function low-dimensional?
Anindya De, Elchanan Mossel, Joe Neeman
|
🔮
The Ethereal
|
cs.CC
|
13 |
7 years ago |
| 256 |
Fast rates for online learning in Linearly Solvable Markov Decision Processes
Gergely Neu, Vicenç Gómez
|
👻
Ghosted
|
cs.LG
|
13 |
9 years ago |
| 257 |
Open Problem: Approximate Planning of POMDPs in the class of Memoryless Policies
Kamyar Azizzadenesheli, Alessandro Lazaric, Animashree Anandkumar
|
👻
Ghosted
|
cs.AI
|
13 |
9 years ago |
| 258 |
Accelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penalties
David Martínez-Rubio, Sebastian Pokutta
|
👻
Ghosted
|
math.OC
|
13 |
3 years ago |
| 259 |
Some easy optimization problems have the overlap-gap property
Shuangping Li, Tselil Schramm
|
🔮
The Ethereal
|
cs.CC
|
12 |
1 year ago |
| 260 |
The sample complexity of multi-distribution learning
Binghui Peng
|
👻
Ghosted
|
cs.LG
|
12 |
2 years ago |
| 261 |
Algorithmically Effective Differentially Private Synthetic Data
Yiyun He, Roman Vershynin, Yizhe Zhu
|
👻
Ghosted
|
cs.DS
|
12 |
3 years ago |
| 262 |
The Bethe and Sinkhorn Permanents of Low Rank Matrices and Implications for Profile Maximum Likelihood
Nima Anari, Moses Charikar, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
12 |
6 years ago |
| 263 |
Adversarially Robust Low Dimensional Representations
Pranjal Awasthi, Vaggos Chatziafratis, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
12 |
6 years ago |
| 264 |
ZigZag: A new approach to adaptive online learning
Dylan J. Foster, Alexander Rakhlin, Karthik Sridharan
|
👻
Ghosted
|
cs.LG
|
12 |
9 years ago |
| 265 |
Width is Less Important than Depth in ReLU Neural Networks
Gal Vardi, Gilad Yehudai, Ohad Shamir
|
👻
Ghosted
|
cs.LG
|
12 |
4 years ago |
| 266 |
The Limits and Potentials of Local SGD for Distributed Heterogeneous Learning with Intermittent Communication
Kumar Kshitij Patel, Margalit Glasgow, ... (+6 more)
|
👻
Ghosted
|
cs.LG
|
11 |
2 years ago |
| 267 |
Metalearning with Very Few Samples Per Task
Maryam Aliakbarpour, Konstantina Bairaktari, ... (+4 more)
|
👻
Ghosted
|
cs.LG
|
11 |
2 years ago |
| 268 |
Fast sampling from constrained spaces using the Metropolis-adjusted Mirror Langevin algorithm
Vishwak Srinivasan, Andre Wibisono, Ashia Wilson
|
👻
Ghosted
|
stat.CO
|
11 |
2 years ago |
| 269 |
Non-Clashing Teaching Maps for Balls in Graphs
Jérémie Chalopin, Victor Chepoi, ... (+2 more)
|
🔮
The Ethereal
|
cs.CC
|
11 |
2 years ago |
| 270 |
Ticketed Learning-Unlearning Schemes
Badih Ghazi, Pritish Kamath, ... (+4 more)
|
👻
Ghosted
|
cs.LG
|
11 |
2 years ago |
| 271 |
Sharp thresholds in inference of planted subgraphs
Elchanan Mossel, Jonathan Niles-Weed, ... (+3 more)
|
👻
Ghosted
|
math.ST
|
11 |
3 years ago |
| 272 |
On Avoiding the Union Bound When Answering Multiple Differentially Private Queries
Badih Ghazi, Ravi Kumar, Pasin Manurangsi
|
👻
Ghosted
|
cs.DS
|
11 |
5 years ago |
| 273 |
Backward Feature Correction: How Deep Learning Performs Deep (Hierarchical) Learning
Zeyuan Allen-Zhu, Yuanzhi Li
|
👻
Ghosted
|
cs.LG
|
11 |
6 years ago |
| 274 |
Sorted Top-k in Rounds
Mark Braverman, Jieming Mao, Yuval Peres
|
👻
Ghosted
|
cs.DS
|
11 |
6 years ago |
| 275 |
Polynomial Time and Sample Complexity for Non-Gaussian Component Analysis: Spectral Methods
Yan Shuo Tan, Roman Vershynin
|
👻
Ghosted
|
cs.LG
|
11 |
9 years ago |
| 276 |
Learning Intersections of Halfspaces with Distribution Shift: Improved Algorithms and SQ Lower Bounds
Adam R. Klivans, Konstantinos Stavropoulos, Arsen Vasilyan
|
👻
Ghosted
|
cs.DS
|
10 |
2 years ago |
| 277 |
Mixing Time of the Proximal Sampler in Relative Fisher Information via Strong Data Processing Inequality
Andre Wibisono
|
👻
Ghosted
|
cs.IT
|
10 |
1 year ago |
| 278 |
Algorithmic Aspects of the Log-Laplace Transform and a Non-Euclidean Proximal Sampler
Sivakanth Gopi, Yin Tat Lee, ... (+3 more)
|
👻
Ghosted
|
cs.DS
|
10 |
3 years ago |
| 279 |
Hypothesis testing with low-degree polynomials in the Morris class of exponential families
Dmitriy Kunisky
|
👻
Ghosted
|
math.ST
|
10 |
5 years ago |
| 280 |
The Role of Interactivity in Structured Estimation
Jayadev Acharya, Clément L. Canonne, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
10 |
4 years ago |
| 281 |
Metric Clustering and MST with Strong and Weak Distance Oracles
MohammadHossein Bateni, Prathamesh Dharangutte, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
9 |
2 years ago |
| 282 |
A faster and simpler algorithm for learning shallow networks
Sitan Chen, Shyam Narayanan
|
👻
Ghosted
|
cs.LG
|
9 |
2 years ago |
| 283 |
On the sample complexity of parameter estimation in logistic regression with normal design
Daniel Hsu, Arya Mazumdar
|
👻
Ghosted
|
math.ST
|
9 |
2 years ago |
| 284 |
Near-Optimal Entrywise Sampling of Numerically Sparse Matrices
Vladimir Braverman, Robert Krauthgamer, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
9 |
5 years ago |
| 285 |
On Mean Estimation for General Norms with Statistical Queries
Jerry Li, Aleksandar Nikolov, ... (+2 more)
|
👻
Ghosted
|
cs.DS
|
9 |
7 years ago |
| 286 |
On the Regret Minimization of Nonconvex Online Gradient Ascent for Online PCA
Dan Garber
|
👻
Ghosted
|
cs.LG
|
9 |
7 years ago |
| 287 |
Multi-Observation Elicitation
Sebastian Casalaina-Martin, Rafael Frongillo, ... (+2 more)
|
👻
Ghosted
|
cs.LG
|
9 |
8 years ago |
| 288 |
Hierarchies of Relaxations for Online Prediction Problems with Evolving Constraints
Alexander Rakhlin, Karthik Sridharan
|
👻
Ghosted
|
cs.LG
|
9 |
11 years ago |
| 289 |
Differentially Private Algorithms for the Stochastic Saddle Point Problem with Optimal Rates for the Strong Gap
Raef Bassily, Cristóbal Guzmán, Michael Menart
|
👻
Ghosted
|
cs.LG
|
9 |
3 years ago |
| 290 |
The One-Inclusion Graph Algorithm is not Always Optimal
Ishaq Aden-Ali, Yeshwanth Cherapanamjeri, ... (+2 more)
|
👻
Ghosted
|
cs.LG
|
9 |
3 years ago |
| 291 |
Learning and Testing Latent-Tree Ising Models Efficiently
Davin Choo, Yuval Dagan, ... (+2 more)
|
👻
Ghosted
|
cs.LG
|
9 |
3 years ago |
| 292 |
Quasi-Newton Steps for Efficient Online Exp-Concave Optimization
Zakaria Mhammedi, Khashayar Gatmiry
|
👻
Ghosted
|
math.OC
|
9 |
3 years ago |
| 293 |
Fast algorithm for overcomplete order-3 tensor decomposition
Jingqiu Ding, Tommaso d'Orsi, ... (+3 more)
|
👻
Ghosted
|
cs.LG
|
9 |
4 years ago |
| 294 |
Smooth Lower Bounds for Differentially Private Algorithms via Padding-and-Permuting Fingerprinting Codes
Naty Peter, Eliad Tsfadia, Jonathan Ullman
|
👻
Ghosted
|
cs.CR
|
8 |
2 years ago |
| 295 |
Finite-Sample Symmetric Mean Estimation with Fisher Information Rate
Shivam Gupta, Jasper C. H. Lee, Eric Price
|
👻
Ghosted
|
math.ST
|
8 |
2 years ago |
| 296 |
Weak Recovery Threshold for the Hypergraph Stochastic Block Model
Yuzhou Gu, Yury Polyanskiy
|
👻
Ghosted
|
math.PR
|
8 |
3 years ago |
| 297 |
The Sample Complexity of Robust Covariance Testing
Ilias Diakonikolas, Daniel M. Kane
|
👻
Ghosted
|
cs.LG
|
8 |
5 years ago |
| 298 |
ODE-Inspired Analysis for the Biological Version of Oja's Rule in Solving Streaming PCA
Chi-Ning Chou, Mien Brabeeba Wang
|
👻
Ghosted
|
q-bio.NC
|
8 |
6 years ago |
| 299 |
Insufficient Statistics Perturbation: Stable Estimators for Private Least Squares
Gavin Brown, Jonathan Hayase, ... (+6 more)
|
👻
Ghosted
|
cs.LG
|
8 |
2 years ago |
| 300 |
Better Private Algorithms for Correlation Clustering
Daogao Liu
|
👻
Ghosted
|
cs.LG
|
8 |
4 years ago |