| Publication | Date of Publication | Type |
|---|
Efficient reductions between some statistical models
(available as arXiv preprint) | N/A | Paper |
Just Wing It: Optimal Estimation of Missing Mass in a Markovian Sequence
(available as arXiv preprint) | N/A | Paper |
Accurate, provable, and fast polychromatic tomographic reconstruction: a variational inequality approach
SIAM Journal on Imaging Sciences | 2026-03-31 | Paper |
A dual accelerated method for online stochastic distributed averaging: from consensus to decentralized policy evaluation
IEEE Transactions on Automatic Control | 2026-03-17 | Paper |
Computationally efficient reductions between some statistical models
IEEE Transactions on Information Theory | 2025-10-06 | Paper |
Alternating minimization for generalized rank-1 matrix sensing: sharp predictions from a random initialization
Information and Inference: A Journal of the IMA | 2024-11-14 | Paper |
Do algorithms and barriers for sparse principal component analysis extend to other structured settings?
IEEE Transactions on Signal Processing | 2024-09-16 | Paper |
Optimal Oracle Inequalities for Projected Fixed-Point Equations, with Applications to Policy Evaluation
Mathematics of Operations Research | 2024-03-01 | Paper |
Sharp global convergence guarantees for iterative nonconvex optimization with random data
The Annals of Statistics | 2023-05-10 | Paper |
Accelerated and Instance-Optimal Policy Evaluation with Linear Function Approximation
SIAM Journal on Mathematics of Data Science | 2023-03-30 | Paper |
Max-Affine Regression: Parameter Estimation for Gaussian Designs
IEEE Transactions on Information Theory | 2022-05-30 | Paper |
Isotonic regression with unknown permutations: statistics, computation and adaptation
The Annals of Statistics | 2022-03-23 | Paper |
Accelerated and instance-optimal policy evaluation with linear function approximation
(available as arXiv preprint) | 2021-12-24 | Paper |
| Optimal and instance-dependent guarantees for Markovian linear stochastic approximation | 2021-12-23 | Paper |
Is Temporal Difference Learning Optimal? An Instance-Dependent Analysis
SIAM Journal on Mathematics of Data Science | 2021-11-03 | Paper |
Single-Index Models in the High Signal Regime
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
Towards optimal estimation of bivariate isotonic matrices with unknown permutations
The Annals of Statistics | 2021-02-26 | Paper |
Towards optimal estimation of bivariate isotonic matrices with unknown permutations
The Annals of Statistics | 2021-02-26 | Paper |
Instance-Dependent ℓ<sub>∞</sub>-Bounds for Policy Evaluation in Tabular Reinforcement Learning
IEEE Transactions on Information Theory | 2021-02-22 | Paper |
Derivative-free methods for policy optimization: guarantees for linear quadratic systems
(available as arXiv preprint) | 2020-10-05 | Paper |
| Derivative-free methods for policy optimization: guarantees for linear quadratic systems | 2020-10-05 | Paper |
Worst-case versus average-case design for estimation from partial pairwise comparisons
The Annals of Statistics | 2020-08-28 | Paper |
Worst-case versus average-case design for estimation from partial pairwise comparisons
The Annals of Statistics | 2020-08-28 | Paper |
Existence of Stein kernels under a spectral gap, and discrepancy bounds
Annales de l'Institut Henri Poincaré. Probabilités et Statistiques | 2019-08-22 | Paper |
Existence of Stein kernels under a spectral gap, and discrepancy bounds
Annales de l'Institut Henri Poincaré. Probabilités et Statistiques | 2019-08-22 | Paper |
Quantitative Stability of the Entropy Power Inequality
IEEE Transactions on Information Theory | 2018-09-19 | Paper |
Linear Regression With Shuffled Data: Statistical and Computational Limits of Permutation Recovery
IEEE Transactions on Information Theory | 2018-09-14 | Paper |
The Effect of Local Decodability Constraints on Variable-Length Compression
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
| Wasserstein Stability of the Entropy Power Inequality for Log-Concave Densities | 2016-10-25 | Paper |
On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion
Journal of Discrete Algorithms | 2015-08-18 | Paper |
