| Optimal and instance-dependent guarantees for Markovian linear stochastic approximation. | 0 | 0.34 | 2022 |
| Learning from an Exploring Demonstrator: Optimal Reward Estimation for Bandits | 0 | 0.34 | 2022 |
| Is Temporal Difference Learning Optimal? An Instance-Dependent Analysis | 0 | 0.34 | 2021 |
| Instance-Dependent ℓ<sub>∞</sub>-Bounds for Policy Evaluation in Tabular Reinforcement Learning | 0 | 0.34 | 2021 |
| Single-Index Models in the High Signal Regime | 1 | 0.35 | 2021 |
| Max-affine regression with universal parameter estimation for small-ball designs | 0 | 0.34 | 2020 |
| Derivative-Free Methods for Policy Optimization: Guarantees for Linear Quadratic Systems. | 0 | 0.34 | 2020 |
| Preference learning along multiple criteria: A game-theoretic perspective | 0 | 0.34 | 2020 |
| A Family Of Bayesian Cramer-Rao Bounds, And Consequences For Log-Concave Priors | 0 | 0.34 | 2019 |
| Max-Affine Regression: Provable, Tractable, and Near-Optimal Statistical Estimation. | 0 | 0.34 | 2019 |
| The Effect of Local Decodability Constraints on Variable-Length Compression. | 1 | 0.36 | 2018 |
| Linear Regression With Shuffled Data: Statistical and Computational Limits of Permutation Recovery. | 2 | 0.46 | 2018 |
| Breaking the $1/\sqrtn$ Barrier: Faster Rates for Permutation-based Models in Polynomial Time. | 0 | 0.34 | 2018 |
| Quantitative Stability of the Entropy Power Inequality. | 2 | 0.40 | 2018 |
| Gradient Diversity Empowers Distributed Learning. | 1 | 0.36 | 2017 |
| Worst-case vs Average-case Design for Estimation from Fixed Pairwise Comparisons. | 5 | 0.43 | 2017 |
| Optimally Approximating the Coverage Lifetime of Wireless Sensor Networks | 5 | 0.42 | 2017 |
| Existence of Stein kernels under a spectral gap, and discrepancy bounds | 0 | 0.34 | 2017 |
| Denoising linear models with permuted data | 4 | 0.50 | 2017 |
| Linear regression with an unknown permutation: Statistical and computational limits | 8 | 0.61 | 2016 |
| Wasserstein Stability of the Entropy Power Inequality for Log-Concave Densities. | 5 | 0.58 | 2016 |
| The Online Disjoint Set Cover Problem And Its Applications | 1 | 0.35 | 2014 |
| Maximizing utility among selfish users in social groups | 3 | 0.40 | 2013 |
| Optimally Approximating the Lifetime of Wireless Sensor Networks. | 2 | 0.41 | 2013 |
| On the Complexity of Making a Distinguished Vertex Minimum or Maximum Degree by Vertex Deletion. | 0 | 0.34 | 2013 |
